Lines Matching defs:aTree
80302 ** The aTree[] array is also N elements in size. The value of N is stored in
80305 ** The final (N/2) elements of aTree[] contain the results of comparing
80308 ** aTree element is set to the index of it.
80314 ** The (N/4) elements of aTree[] that precede the final (N/2) described
80316 ** And so on. So that aTree[1] contains the index of the PmaReader that
80317 ** currently points to the smallest key value. aTree[0] is unused.
80330 ** aTree[] = { X, 5 0, 5 0, 3, 5, 6 }
80339 ** The contents of aTree[] are updated first by comparing the new PmaReader
80341 ** 5 value is still smaller, so aTree[6] is set to 5. And so on up the tree.
80343 ** 5, so aTree[3] is set to 6. Key 0 is smaller than key 6 (Banana<Durian),
80346 ** aTree[] = { X, 0 0, 6 0, 3, 5, 6 }
80353 int nTree; /* Used size of aTree/aReadr (power of 2) */
80355 int *aTree; /* Current state of incremental merge */
81275 pNew->aTree = (int*)&pNew->aReadr[N];
81700 int iPrev = pMerger->aTree[1];/* Index of PmaReader to advance */
81706 /* Update contents of aTree[] */
81708 int i; /* Index of aTree[] to recalculate */
81731 /* If pReadr1 contained the smaller value, set aTree[i] to its index.
81737 ** set aTree[i] to its index and update pReadr1. If vdbeSorterCompare()
81747 pMerger->aTree[i] = (int)(pReadr1 - pMerger->aReadr);
81748 pReadr2 = &pMerger->aReadr[ pMerger->aTree[i ^ 0x0001] ];
81752 pMerger->aTree[i] = (int)(pReadr2 - pMerger->aReadr);
81753 pReadr1 = &pMerger->aReadr[ pMerger->aTree[i ^ 0x0001] ];
81756 *pbEof = (pMerger->aReadr[pMerger->aTree[1]].pFd==0);
81968 PmaReader *pReader = &pMerger->aReadr[ pMerger->aTree[1] ];
82101 ** Recompute pMerger->aTree[iOut] by comparing the next keys on the
82107 int iOut /* Store the result in pMerger->aTree[iOut] */
82121 i1 = pMerger->aTree[iOut*2];
82122 i2 = pMerger->aTree[iOut*2+1];
82147 pMerger->aTree[iOut] = iRes;
82744 pReader = &pSorter->pMerger->aReadr[pSorter->pMerger->aTree[1]];
