Lines Matching defs:rScore

11262   sqlite3_rtree_dbl rScore;         /* OUT: Write the score here */
210557   RtreeDValue rScore;    /* The score for this node.  Smallest goes first. */
211577     pInfo->rScore = pInfo->rParentScore = pSearch->rScore;
211581     if( pInfo->rScore<*prScore || *prScore<RTREE_ZERO ){
211582       *prScore = pInfo->rScore;
211717 ** The rScore is the primary key.  Smaller rScore values come first.
211718 ** If the rScore is a tie, then use iLevel as the tie breaker with smaller
211719 ** iLevel values coming first.  In this way, if rScore is the same for all
211727   if( pA->rScore<pB->rScore ) return -1;
211728   if( pA->rScore>pB->rScore ) return +1;
211783   RtreeDValue rScore,   /* Score for the new search point */
211797   pNew->rScore = rScore;
211818   RtreeDValue rScore,   /* Score for the new search point */
211825    || pFirst->rScore>rScore
211826    || (pFirst->rScore==rScore && pFirst->iLevel>iLevel)
211830       pNew = rtreeEnqueue(pCur, rScore, iLevel);
211843     pCur->sPoint.rScore = rScore;
211848     return rtreeEnqueue(pCur, rScore, iLevel);
211857     p->iLevel, p->id, p->iCell, p->rScore, p->eWithin
211953       sqlite3_rtree_dbl rScore = (sqlite3_rtree_dbl)-1;
211959                                        &rScore, &eWithin);
211992       if( rScore<RTREE_ZERO ) rScore = RTREE_ZERO;
211993       p = rtreeSearchPointNew(pCur, rScore, x.iLevel);