Lines Matching refs:rScore
7593 sqlite3_rtree_dbl rScore; /* OUT: Write the score here */
144827 RtreeDValue rScore; /* The score for this node. Smallest goes first. */
145627 pInfo->rScore = pInfo->rParentScore = pSearch->rScore;
145631 if( pInfo->rScore<*prScore || *prScore<RTREE_ZERO ){
145632 *prScore = pInfo->rScore;
145748 ** The rScore is the primary key. Smaller rScore values come first.
145749 ** If the rScore is a tie, then use iLevel as the tie breaker with smaller
145750 ** iLevel values coming first. In this way, if rScore is the same for all
145758 if( pA->rScore<pB->rScore ) return -1;
145759 if( pA->rScore>pB->rScore ) return +1;
145814 RtreeDValue rScore, /* Score for the new search point */
145828 pNew->rScore = rScore;
145849 RtreeDValue rScore, /* Score for the new search point */
145856 || pFirst->rScore>rScore
145857 || (pFirst->rScore==rScore && pFirst->iLevel>iLevel)
145861 pNew = rtreeEnqueue(pCur, rScore, iLevel);
145873 pCur->sPoint.rScore = rScore;
145878 return rtreeEnqueue(pCur, rScore, iLevel);
145887 p->iLevel, p->id, p->iCell, p->rScore, p->eWithin
145981 sqlite3_rtree_dbl rScore = (sqlite3_rtree_dbl)-1;
145988 &rScore, &eWithin);
146011 if( rScore<RTREE_ZERO ) rScore = RTREE_ZERO;
146012 p = rtreeSearchPointNew(pCur, rScore, x.iLevel);