Lines Matching refs:aTree
70322 ** The aTree[] array is also N elements in size. The value of N is stored in
70325 ** The final (N/2) elements of aTree[] contain the results of comparing
70328 ** aTree element is set to the index of it.
70334 ** The (N/4) elements of aTree[] that preceed the final (N/2) described
70336 ** And so on. So that aTree[1] contains the index of the iterator that
70337 ** currently points to the smallest key value. aTree[0] is unused.
70350 ** aTree[] = { X, 5 0, 5 0, 3, 5, 6 }
70359 ** The contents of aTree[] are updated first by comparing the new iterator
70361 ** 5 value is still smaller, so aTree[6] is set to 5. And so on up the tree.
70363 ** 5, so aTree[3] is set to 6. Key 0 is smaller than key 6 (Banana<Durian),
70366 ** aTree[] = { X, 0 0, 6 0, 3, 5, 6 }
70374 int nTree; /* Used size of aTree/aIter (power of 2) */
70376 int *aTree; /* Current state of incremental merge */
70615 ** multiple b-tree segments. Parameter iOut is the index of the aTree[]
70632 i1 = pSorter->aTree[iOut*2];
70633 i2 = pSorter->aTree[iOut*2+1];
70656 pSorter->aTree[iOut] = iRes;
70951 /* Initialize the aTree[] array. */
70970 int nByte; /* Bytes of space required for aIter/aTree */
70980 assert( pSorter->aTree==0 );
70988 /* Allocate space for aIter[] and aTree[]. */
70996 pSorter->aTree = (int *)&pSorter->aIter[N];
71018 assert( rc!=SQLITE_OK || pSorter->aIter[ pSorter->aTree[1] ].pFile );
71037 VdbeSorterIter *pIter = &pSorter->aIter[ pSorter->aTree[1] ];
71065 *pbEof = (pSorter->aIter[pSorter->aTree[1]].pFile==0);
71076 if( pSorter->aTree ){
71077 int iPrev = pSorter->aTree[1];/* Index of iterator to advance */
71078 int i; /* Index of aTree[] to recalculate */
71085 *pbEof = (pSorter->aIter[pSorter->aTree[1]].pFile==0);
71106 if( pSorter->aTree ){
71108 pIter = &pSorter->aIter[ pSorter->aTree[1] ];