Lines Matching defs:aTree
99982 ** The aTree[] array is also N elements in size. The value of N is stored in
99985 ** The final (N/2) elements of aTree[] contain the results of comparing
99988 ** aTree element is set to the index of it.
99994 ** The (N/4) elements of aTree[] that precede the final (N/2) described
99996 ** And so on. So that aTree[1] contains the index of the PmaReader that
99997 ** currently points to the smallest key value. aTree[0] is unused.
100010 ** aTree[] = { X, 5 0, 5 0, 3, 5, 6 }
100019 ** The contents of aTree[] are updated first by comparing the new PmaReader
100021 ** 5 value is still smaller, so aTree[6] is set to 5. And so on up the tree.
100023 ** 5, so aTree[3] is set to 6. Key 0 is smaller than key 6 (Banana<Durian),
100026 ** aTree[] = { X, 0 0, 6 0, 3, 5, 6 }
100033 int nTree; /* Used size of aTree/aReadr (power of 2) */
100035 int *aTree; /* Current state of incremental merge */
100968 pNew->aTree = (int*)&pNew->aReadr[N];
101393 int iPrev = pMerger->aTree[1];/* Index of PmaReader to advance */
101399 /* Update contents of aTree[] */
101401 int i; /* Index of aTree[] to recalculate */
101424 /* If pReadr1 contained the smaller value, set aTree[i] to its index.
101430 ** set aTree[i] to its index and update pReadr1. If vdbeSorterCompare()
101440 pMerger->aTree[i] = (int)(pReadr1 - pMerger->aReadr);
101441 pReadr2 = &pMerger->aReadr[ pMerger->aTree[i ^ 0x0001] ];
101445 pMerger->aTree[i] = (int)(pReadr2 - pMerger->aReadr);
101446 pReadr1 = &pMerger->aReadr[ pMerger->aTree[i ^ 0x0001] ];
101449 *pbEof = (pMerger->aReadr[pMerger->aTree[1]].pFd==0);
101670 PmaReader *pReader = &pMerger->aReadr[ pMerger->aTree[1] ];
101804 ** Recompute pMerger->aTree[iOut] by comparing the next keys on the
101810 int iOut /* Store the result in pMerger->aTree[iOut] */
101824 i1 = pMerger->aTree[iOut*2];
101825 i2 = pMerger->aTree[iOut*2+1];
101850 pMerger->aTree[iOut] = iRes;
102461 pReader = &pSorter->pMerger->aReadr[pSorter->pMerger->aTree[1]];