Searched refs:nTree (Results 1 – 1 of 1) sorted by relevance
106785 int nTree; /* Used size of aTree/aReadr (power of 2) */ member107733 pNew->nTree = N;107747 for(i=0; i<pMerger->nTree; i++){108193 for(i=(pMerger->nTree+iPrev)/2; i>0; i=i/2){108600 assert( iOut<pMerger->nTree && iOut>0 );108602 if( iOut>=(pMerger->nTree/2) ){108603 i1 = (iOut - pMerger->nTree/2) * 2;108679 int nTree; /* Number of subtrees to merge */ local108692 nTree = pMerger->nTree;108693 for(i=0; i<nTree; i++){[all …]