652   return N<=10 ? 0 : sqlite3LogEst(N) - 33;  in estLog()
1631       nRet -= 20;        assert( 20==sqlite3LogEst(4) );  in whereRangeAdjust()
1742       int nAdjust = (sqlite3LogEst(p->nSample) - sqlite3LogEst(nDiff));  in whereRangeSkipScanEst()
1911           nNew = sqlite3LogEst(iUpper - iLower);  in whereRangeScanEst()
1916           if( iLwrIdx==iUprIdx ) nNew -= 20;  assert( 20==sqlite3LogEst(4) );  in whereRangeScanEst()
1918           nNew = 10;        assert( 10==sqlite3LogEst(2) );  in whereRangeScanEst()
2896         nIn = 46;  assert( 46==sqlite3LogEst(25) );  in whereLoopAddBtreeIndex()
2908         nIn = sqlite3LogEst(pExpr->x.pList->nExpr);  in whereLoopAddBtreeIndex()
3050             pNew->nOut = sqlite3LogEst(nOut);  in whereLoopAddBtreeIndex()
3145   assert( 42==sqlite3LogEst(18) );  in whereLoopAddBtreeIndex()
3479         pNew->nOut = 43;  assert( 43==sqlite3LogEst(20) );  in whereLoopAddBtree()
3828   pNew->nOut = sqlite3LogEst(pIdxInfo->estimatedRows);  in whereLoopAddVirtualOne()
4747   assert( nOrderBy>0 && 66==sqlite3LogEst(100) );  in whereSortingCost()
4748   rScale = sqlite3LogEst((nOrderBy-nSorted)*100/nOrderBy) - 66;  in whereSortingCost()
4761     if( nRow>10 ){ nRow -= 10;  assert( 10==sqlite3LogEst(2) ); }  in whereSortingCost()
4850   aFrom[0].nRow = MIN(pParse->nQueryLoop, 48);  assert( 48==sqlite3LogEst(28) );  in wherePathSolver()
4884           assert( 10==sqlite3LogEst(2) );  in wherePathSolver()