Lines Matching defs:aTree
71688 ** The aTree[] array is also N elements in size. The value of N is stored in
71691 ** The final (N/2) elements of aTree[] contain the results of comparing
71694 ** aTree element is set to the index of it.
71700 ** The (N/4) elements of aTree[] that preceed the final (N/2) described
71702 ** And so on. So that aTree[1] contains the index of the iterator that
71703 ** currently points to the smallest key value. aTree[0] is unused.
71716 ** aTree[] = { X, 5 0, 5 0, 3, 5, 6 }
71725 ** The contents of aTree[] are updated first by comparing the new iterator
71727 ** 5 value is still smaller, so aTree[6] is set to 5. And so on up the tree.
71729 ** 5, so aTree[3] is set to 6. Key 0 is smaller than key 6 (Banana<Durian),
71732 ** aTree[] = { X, 0 0, 6 0, 3, 5, 6 }
71742 int nTree; /* Used size of aTree/aIter (power of 2) */
71747 int *aTree; /* Current state of incremental merge */
71981 ** multiple b-tree segments. Parameter iOut is the index of the aTree[]
71998 i1 = pSorter->aTree[iOut*2];
71999 i2 = pSorter->aTree[iOut*2+1];
72022 pSorter->aTree[iOut] = iRes;
72317 /* Initialize the aTree[] array. */
72336 int nByte; /* Bytes of space required for aIter/aTree */
72346 assert( pSorter->aTree==0 );
72354 /* Allocate space for aIter[] and aTree[]. */
72362 pSorter->aTree = (int *)&pSorter->aIter[N];
72384 assert( rc!=SQLITE_OK || pSorter->aIter[ pSorter->aTree[1] ].pFile );
72403 VdbeSorterIter *pIter = &pSorter->aIter[ pSorter->aTree[1] ];
72431 *pbEof = (pSorter->aIter[pSorter->aTree[1]].pFile==0);
72442 if( pSorter->aTree ){
72443 int iPrev = pSorter->aTree[1];/* Index of iterator to advance */
72444 int i; /* Index of aTree[] to recalculate */
72451 *pbEof = (pSorter->aIter[pSorter->aTree[1]].pFile==0);
72472 if( pSorter->aTree ){
72474 pIter = &pSorter->aIter[ pSorter->aTree[1] ];
