sqlite/dist/sqlite3.c

102467 ** The aTree[] array is also N elements in size. The value of N is stored in
102470 ** The final (N/2) elements of aTree[] contain the results of comparing
102473 ** aTree element is set to the index of it.
102479 ** The (N/4) elements of aTree[] that precede the final (N/2) described
102481 ** And so on. So that aTree[1] contains the index of the PmaReader that
102482 ** currently points to the smallest key value. aTree[0] is unused.
102495 **     aTree[] = { X, 5   0, 5    0, 3, 5, 6 }
102504 ** The contents of aTree[] are updated first by comparing the new PmaReader
102506 ** 5 value is still smaller, so aTree[6] is set to 5. And so on up the tree.
102508 ** 5, so aTree[3] is set to 6. Key 0 is smaller than key 6 (Banana<Durian),
102511 **     aTree[] = { X, 0   0, 6    0, 3, 5, 6 }
102518   int nTree;                 /* Used size of aTree/aReadr (power of 2) */
102520   int *aTree;                /* Current state of incremental merge */
103453     pNew->aTree = (int*)&pNew->aReadr[N];
103878   int iPrev = pMerger->aTree[1];/* Index of PmaReader to advance */
103884   /* Update contents of aTree[] */
103886     int i;                      /* Index of aTree[] to recalculate */
103909       /* If pReadr1 contained the smaller value, set aTree[i] to its index.
103915       ** set aTree[i] to its index and update pReadr1. If vdbeSorterCompare()
103925         pMerger->aTree[i] = (int)(pReadr1 - pMerger->aReadr);
103926         pReadr2 = &pMerger->aReadr[ pMerger->aTree[i ^ 0x0001] ];
103930         pMerger->aTree[i] = (int)(pReadr2 - pMerger->aReadr);
103931         pReadr1 = &pMerger->aReadr[ pMerger->aTree[i ^ 0x0001] ];
103934     *pbEof = (pMerger->aReadr[pMerger->aTree[1]].pFd==0);
104155     PmaReader *pReader = &pMerger->aReadr[ pMerger->aTree[1] ];
104289 ** Recompute pMerger->aTree[iOut] by comparing the next keys on the
104295   int iOut               /* Store the result in pMerger->aTree[iOut] */
104309     i1 = pMerger->aTree[iOut*2];
104310     i2 = pMerger->aTree[iOut*2+1];
104335   pMerger->aTree[iOut] = iRes;
104946       pReader = &pSorter->pMerger->aReadr[pSorter->pMerger->aTree[1]];