Lines Matching refs:score
10950 sqlite3_rtree_dbl rScore; /* OUT: Write the score here */
114901 int iMin; /* Index in a[] of entry with minimum score */
123436 ** match score for any
123452 #define FUNC_PERFECT_MATCH 6 /* The score for a perfect match */
123467 /* Give a better score to a function with a specific number of arguments
123572 int score = matchQuality(p, nArg, enc);
123573 if( score>bestScore ){
123575 bestScore = score;
123597 int score = matchQuality(p, nArg, enc);
123598 if( score>bestScore ){
123600 bestScore = score;
171841 /* Hash score: 231 */
196081 ** score of 0.0).
196208 ** is the snippet with the highest score, where scores are calculated
196217 ** returning. The score of the selected snippet is stored in *piScore
196233 int iBestScore = -1; /* Best snippet score found so far */
196274 ** *pFragment. Store its associated 'score' in iBestScore.
197189 int iBestScore = -1; /* Best score of columns checked so far */
201185 RtreeDValue rScore; /* The score for this node. Smallest goes first. */
202145 sqlite3_rtree_dbl *prScore, /* OUT: score for the cell */
202379 ** Return the search point with the lowest current score.
202386 ** Get the RtreeNode for the search point with the lowest score.
202505 /* Remove the search point with the lowest current score.
224605 int iCol, /* Column to score */
224606 int iPos, /* Starting offset to score */
224926 double score = 0.0; /* SQL function return value */
224957 /* Determine and return the BM25 score for the current row. Or, if an
224961 score += pData->aIDF[i] * (
224966 sqlite3_result_double(pCtx, -1.0 * score);