Home | History | Annotate | Download | only in dist

Lines Matching refs:rScore

11789   sqlite3_rtree_dbl rScore;         /* OUT: Write the score here */
218343   RtreeDValue rScore;    /* The score for this node.  Smallest goes first. */
219383     pInfo->rScore = pInfo->rParentScore = pSearch->rScore;
219387     if( pInfo->rScore<*prScore || *prScore<RTREE_ZERO ){
219388       *prScore = pInfo->rScore;
219523 ** The rScore is the primary key.  Smaller rScore values come first.
219524 ** If the rScore is a tie, then use iLevel as the tie breaker with smaller
219525 ** iLevel values coming first.  In this way, if rScore is the same for all
219533   if( pA->rScore<pB->rScore ) return -1;
219534   if( pA->rScore>pB->rScore ) return +1;
219589   RtreeDValue rScore,   /* Score for the new search point */
219603   pNew->rScore = rScore;
219624   RtreeDValue rScore,   /* Score for the new search point */
219631    || pFirst->rScore>rScore
219632    || (pFirst->rScore==rScore && pFirst->iLevel>iLevel)
219636       pNew = rtreeEnqueue(pCur, rScore, iLevel);
219649     pCur->sPoint.rScore = rScore;
219654     return rtreeEnqueue(pCur, rScore, iLevel);
219663     p->iLevel, p->id, p->iCell, p->rScore, p->eWithin
219759       sqlite3_rtree_dbl rScore = (sqlite3_rtree_dbl)-1;
219765                                        &rScore, &eWithin);
219798       if( rScore<RTREE_ZERO ) rScore = RTREE_ZERO;
219799       p = rtreeSearchPointNew(pCur, rScore, x.iLevel);