Lines Matching defs:rScore
10950 sqlite3_rtree_dbl rScore; /* OUT: Write the score here */
201185 RtreeDValue rScore; /* The score for this node. Smallest goes first. */
202200 pInfo->rScore = pInfo->rParentScore = pSearch->rScore;
202204 if( pInfo->rScore<*prScore || *prScore<RTREE_ZERO ){
202205 *prScore = pInfo->rScore;
202340 ** The rScore is the primary key. Smaller rScore values come first.
202341 ** If the rScore is a tie, then use iLevel as the tie breaker with smaller
202342 ** iLevel values coming first. In this way, if rScore is the same for all
202350 if( pA->rScore<pB->rScore ) return -1;
202351 if( pA->rScore>pB->rScore ) return +1;
202406 RtreeDValue rScore, /* Score for the new search point */
202420 pNew->rScore = rScore;
202441 RtreeDValue rScore, /* Score for the new search point */
202448 || pFirst->rScore>rScore
202449 || (pFirst->rScore==rScore && pFirst->iLevel>iLevel)
202453 pNew = rtreeEnqueue(pCur, rScore, iLevel);
202466 pCur->sPoint.rScore = rScore;
202471 return rtreeEnqueue(pCur, rScore, iLevel);
202480 p->iLevel, p->id, p->iCell, p->rScore, p->eWithin
202576 sqlite3_rtree_dbl rScore = (sqlite3_rtree_dbl)-1;
202582 &rScore, &eWithin);
202615 if( rScore<RTREE_ZERO ) rScore = RTREE_ZERO;
202616 p = rtreeSearchPointNew(pCur, rScore, x.iLevel);