Searched refs:nTree (Results 1 – 1 of 1) sorted by relevance
106627 int nTree; /* Used size of aTree/aReadr (power of 2) */ member107575 pNew->nTree = N;107589 for(i=0; i<pMerger->nTree; i++){108035 for(i=(pMerger->nTree+iPrev)/2; i>0; i=i/2){108442 assert( iOut<pMerger->nTree && iOut>0 );108444 if( iOut>=(pMerger->nTree/2) ){108445 i1 = (iOut - pMerger->nTree/2) * 2;108521 int nTree; /* Number of subtrees to merge */ local108534 nTree = pMerger->nTree;108535 for(i=0; i<nTree; i++){[all …]