contrib/sqlite3/sqlite3.c

94953 ** The aTree[] array is also N elements in size. The value of N is stored in
94956 ** The final (N/2) elements of aTree[] contain the results of comparing
94959 ** aTree element is set to the index of it.
94965 ** The (N/4) elements of aTree[] that precede the final (N/2) described
94967 ** And so on. So that aTree[1] contains the index of the PmaReader that
94968 ** currently points to the smallest key value. aTree[0] is unused.
94981 **     aTree[] = { X, 5   0, 5    0, 3, 5, 6 }
94990 ** The contents of aTree[] are updated first by comparing the new PmaReader
94992 ** 5 value is still smaller, so aTree[6] is set to 5. And so on up the tree.
94994 ** 5, so aTree[3] is set to 6. Key 0 is smaller than key 6 (Banana<Durian),
94997 **     aTree[] = { X, 0   0, 6    0, 3, 5, 6 }
95004   int nTree;                 /* Used size of aTree/aReadr (power of 2) */
95006   int *aTree;                /* Current state of incremental merge */
95937     pNew->aTree = (int*)&pNew->aReadr[N];
96362   int iPrev = pMerger->aTree[1];/* Index of PmaReader to advance */
96368   /* Update contents of aTree[] */
96370     int i;                      /* Index of aTree[] to recalculate */
96393       /* If pReadr1 contained the smaller value, set aTree[i] to its index.
96399       ** set aTree[i] to its index and update pReadr1. If vdbeSorterCompare()
96409         pMerger->aTree[i] = (int)(pReadr1 - pMerger->aReadr);
96410         pReadr2 = &pMerger->aReadr[ pMerger->aTree[i ^ 0x0001] ];
96414         pMerger->aTree[i] = (int)(pReadr2 - pMerger->aReadr);
96415         pReadr1 = &pMerger->aReadr[ pMerger->aTree[i ^ 0x0001] ];
96418     *pbEof = (pMerger->aReadr[pMerger->aTree[1]].pFd==0);
96639     PmaReader *pReader = &pMerger->aReadr[ pMerger->aTree[1] ];
96772 ** Recompute pMerger->aTree[iOut] by comparing the next keys on the
96778   int iOut               /* Store the result in pMerger->aTree[iOut] */
96792     i1 = pMerger->aTree[iOut*2];
96793     i2 = pMerger->aTree[iOut*2+1];
96818   pMerger->aTree[iOut] = iRes;
97429       pReader = &pSorter->pMerger->aReadr[pSorter->pMerger->aTree[1]];