Lines Matching refs:iMin
64956 u32 iMin; /* Result pgno must be greater than iMin */
64960 iMin = p->iPrior;
64961 assert( iMin<0xffffffff );
64966 if( iPg>iMin ){
114901 int iMin; /* Index in a[] of entry with minimum score */
115203 /* If necessary, remove sample iMin to make room for the new sample. */
115205 StatSample *pMin = &p->a[p->iMin];
115210 memmove(pMin, &pMin[1], sizeof(p->a[0])*(p->nSample-p->iMin-1));
115235 int iMin = -1;
115238 if( iMin<0 || sampleIsBetter(p, &p->a[iMin], &p->a[i]) ){
115239 iMin = i;
115242 assert( iMin>=0 );
115243 p->iMin = iMin;
115263 if( p->nSample<p->mxSample || sampleIsBetter(p, pBest, &p->a[p->iMin]) ){
157994 int iMin = 0; /* Smallest sample not yet tested */
158058 iTest = (iMin+iSample)/2;
158075 iMin = iTest+1;
158078 iMin = iTest+1;
158084 }while( res && iMin<iSample );
222656 static int sqlite3Fts5ExprFirst(Fts5Expr*, Fts5Index *pIdx, i64 iMin, int bDesc);
226874 i64 iMin = FTS5_LARGEST_INT64;
226880 if( aIter[i].iPos<iMin ){
226881 iMin = aIter[i].iPos;
226885 if( iMin==FTS5_LARGEST_INT64 || rc!=SQLITE_OK ) break;
226886 rc = sqlite3Fts5PoslistWriterAppend(pBuf, &writer, iMin);
226887 iPrev = iMin;
227091 i64 iMin;
227101 iMin = iMax - pNear->apPhrase[i]->nTerm - pNear->nNear;
227102 if( pPos->iPos<iMin || pPos->iPos>iMax ){
227104 while( pPos->iPos<iMin ){
227122 iMin = a[0].reader.iLookahead;
227124 if( a[i].reader.iLookahead < iMin ){
227125 iMin = a[i].reader.iLookahead;