Searched refs:nBest (Results 1 – 2 of 2) sorted by relevance
4683 int nBest; /* Number of segments merged at pBest */ in sortedSelectLevel() local4688 nBest = LSM_MAX(1, nMerge-1); in sortedSelectLevel()4697 if( nThis>nBest ){ in sortedSelectLevel()4702 nBest = nThis; in sortedSelectLevel()4706 if( pLevel->nRight>nBest ){ in sortedSelectLevel()4707 nBest = pLevel->nRight; in sortedSelectLevel()4718 if( nThis>nBest ){ in sortedSelectLevel()4721 nBest = nThis; in sortedSelectLevel()4737 nBest = nFree + nUsr; in sortedSelectLevel()4743 rc = sortedMergeSetup(pDb, pBest, nBest, ppOut); in sortedSelectLevel()
4449 int nBest = 0; /* Number of input segments on best level */ in fts5IndexMerge() local4456 if( pLvl->nMerge>nBest ){ in fts5IndexMerge()4458 nBest = pLvl->nMerge; in fts5IndexMerge()4462 if( pLvl->nSeg>nBest ){ in fts5IndexMerge()4463 nBest = pLvl->nSeg; in fts5IndexMerge()4470 for(iLvl=0; nBest==0 && iLvl<pStruct->nLevel; iLvl++){ in fts5IndexMerge()4475 if( nBest<nMin && pStruct->aLevel[iBestLvl].nMerge==0 ){ in fts5IndexMerge()