Home
last modified time | relevance | path

Searched refs:nTop (Results 1 – 4 of 4) sorted by relevance

/sqlite-3.40.0/ext/fts3/tool/
H A Dfts3view.c190 int nTop; in showVocabulary() local
260 nTop = atoi(findOption("top", 1, "25")); in showVocabulary()
261 printf("The %d most common tokens:\n", nTop); in showVocabulary()
266 " LIMIT %d", zAux, nTop); in showVocabulary()
778 int nTop, i; in listBigSegments() local
783 nTop = atoi(findOption("top", 1, "25")); in listBigSegments()
784 printf("The %d largest segments:\n", nTop); in listBigSegments()
788 " LIMIT %d", zTab, nTop); in listBigSegments()
/sqlite-3.40.0/src/
H A Dwherecode.c107 explainAppendTerm(pStr, pIndex, pLoop->u.btree.nTop, j, i, "<"); in explainIndexRange()
1719 u16 nTop = pLoop->u.btree.nTop; /* Length of TOP vector */ in sqlite3WhereCodeOneLoopStart() local
1755 nExtraReg = MAX(nExtraReg, pLoop->u.btree.nTop); in sqlite3WhereCodeOneLoopStart()
1792 assert( bSeekPastNull==0 && nExtraReg==0 && nBtm==0 && nTop==0 ); in sqlite3WhereCodeOneLoopStart()
1811 SWAP(u8, nBtm, nTop); in sqlite3WhereCodeOneLoopStart()
1827 if( zStartAff && nTop ){ in sqlite3WhereCodeOneLoopStart()
1955 codeExprOrVector(pParse, pRight, regBase+nEq, nTop); in sqlite3WhereCodeOneLoopStart()
1964 updateRangeAffinityStr(pRight, nTop, zEndAff); in sqlite3WhereCodeOneLoopStart()
1965 codeApplyAffinity(pParse, regBase+nEq, nTop, zEndAff); in sqlite3WhereCodeOneLoopStart()
1969 nConstraint += nTop; in sqlite3WhereCodeOneLoopStart()
H A DwhereInt.h143 u16 nTop; /* Size of TOP vector */ member
H A Dwhere.c1823 int nTop = pLoop->u.btree.nTop; in whereRangeScanEst() local
1871 SWAP(int, nBtm, nTop); in whereRangeScanEst()
1895 rc = sqlite3Stat4ProbeSetValue(pParse, p, &pRec, pExpr, nTop, nEq, &n); in whereRangeScanEst()
2832 saved_nTop = pNew->u.btree.nTop; in whereLoopAddBtreeIndex()
2875 pNew->u.btree.nTop = saved_nTop; in whereLoopAddBtreeIndex()
2995 pNew->u.btree.nTop = 1; in whereLoopAddBtreeIndex()
3002 pNew->u.btree.nTop = nVecLen; in whereLoopAddBtreeIndex()
3129 pNew->u.btree.nTop = saved_nTop; in whereLoopAddBtreeIndex()
3505 pNew->u.btree.nTop = 0; in whereLoopAddBtree()