Home
last modified time | relevance | path

Searched refs:iBest (Results 1 – 5 of 5) sorted by relevance

/sqlite-3.40.0/ext/rtree/
H A Drtreedoc3.test118 set iBest 0
124 set iBest $ii
132 set ret [lindex $Q(pri_queue) $iBest]
133 set Q(pri_queue) [lreplace $Q(pri_queue) $iBest $iBest]
H A Drtree.c2210 sqlite3_int64 iBest = 0; in ChooseLeaf() local
2238 iBest = cell.iRowid; in ChooseLeaf()
2243 rc = nodeAcquire(pRtree, iBest, pNode, &pChild); in ChooseLeaf()
/sqlite-3.40.0/ext/misc/
H A Dfuzzer.c796 int iBest; in fuzzerLowestCostStem() local
800 iBest = -1; in fuzzerLowestCostStem()
807 iBest = i; in fuzzerLowestCostStem()
811 pCur->aQueue[iBest] = pBest->pNext; in fuzzerLowestCostStem()
/sqlite-3.40.0/ext/fts5/
H A Dfts5_main.c1941 int iBest = -1; in fts5CacheInstArray() local
1944 && (iBest<0 || aIter[i].iPos<aIter[iBest].iPos) in fts5CacheInstArray()
1946 iBest = i; in fts5CacheInstArray()
1949 if( iBest<0 ) break; in fts5CacheInstArray()
1968 aInst[0] = iBest; in fts5CacheInstArray()
1969 aInst[1] = FTS5_POS2COLUMN(aIter[iBest].iPos); in fts5CacheInstArray()
1970 aInst[2] = FTS5_POS2OFFSET(aIter[iBest].iPos); in fts5CacheInstArray()
1975 sqlite3Fts5PoslistReaderNext(&aIter[iBest]); in fts5CacheInstArray()
/sqlite-3.40.0/src/
H A Dfunc.c56 int iBest; in minmaxFunc() local
64 iBest = 0; in minmaxFunc()
68 if( (sqlite3MemCompare(argv[iBest], argv[i], pColl)^mask)>=0 ){ in minmaxFunc()
70 iBest = i; in minmaxFunc()
73 sqlite3_result_value(context, argv[iBest]); in minmaxFunc()