Lines Matching defs:aTree
71699 ** The aTree[] array is also N elements in size. The value of N is stored in
71702 ** The final (N/2) elements of aTree[] contain the results of comparing
71705 ** aTree element is set to the index of it.
71711 ** The (N/4) elements of aTree[] that preceed the final (N/2) described
71713 ** And so on. So that aTree[1] contains the index of the iterator that
71714 ** currently points to the smallest key value. aTree[0] is unused.
71727 ** aTree[] = { X, 5 0, 5 0, 3, 5, 6 }
71736 ** The contents of aTree[] are updated first by comparing the new iterator
71738 ** 5 value is still smaller, so aTree[6] is set to 5. And so on up the tree.
71740 ** 5, so aTree[3] is set to 6. Key 0 is smaller than key 6 (Banana<Durian),
71743 ** aTree[] = { X, 0 0, 6 0, 3, 5, 6 }
71753 int nTree; /* Used size of aTree/aIter (power of 2) */
71758 int *aTree; /* Current state of incremental merge */
71992 ** multiple b-tree segments. Parameter iOut is the index of the aTree[]
72009 i1 = pSorter->aTree[iOut*2];
72010 i2 = pSorter->aTree[iOut*2+1];
72033 pSorter->aTree[iOut] = iRes;
72328 /* Initialize the aTree[] array. */
72347 int nByte; /* Bytes of space required for aIter/aTree */
72357 assert( pSorter->aTree==0 );
72365 /* Allocate space for aIter[] and aTree[]. */
72373 pSorter->aTree = (int *)&pSorter->aIter[N];
72395 assert( rc!=SQLITE_OK || pSorter->aIter[ pSorter->aTree[1] ].pFile );
72414 VdbeSorterIter *pIter = &pSorter->aIter[ pSorter->aTree[1] ];
72442 *pbEof = (pSorter->aIter[pSorter->aTree[1]].pFile==0);
72453 if( pSorter->aTree ){
72454 int iPrev = pSorter->aTree[1];/* Index of iterator to advance */
72455 int i; /* Index of aTree[] to recalculate */
72462 *pbEof = (pSorter->aIter[pSorter->aTree[1]].pFile==0);
72483 if( pSorter->aTree ){
72485 pIter = &pSorter->aIter[ pSorter->aTree[1] ];
