Lines Matching refs:rScore
239 RtreeDValue rScore; /* The score for this node. Smallest goes first. */ member
1254 pInfo->rScore = pInfo->rParentScore = pSearch->rScore; in rtreeCallbackConstraint()
1258 if( pInfo->rScore<*prScore || *prScore<RTREE_ZERO ){ in rtreeCallbackConstraint()
1259 *prScore = pInfo->rScore; in rtreeCallbackConstraint()
1404 if( pA->rScore<pB->rScore ) return -1; in rtreeSearchPointCompare()
1405 if( pA->rScore>pB->rScore ) return +1; in rtreeSearchPointCompare()
1460 RtreeDValue rScore, /* Score for the new search point */ in rtreeEnqueue() argument
1474 pNew->rScore = rScore; in rtreeEnqueue()
1495 RtreeDValue rScore, /* Score for the new search point */ in rtreeSearchPointNew() argument
1502 || pFirst->rScore>rScore in rtreeSearchPointNew()
1503 || (pFirst->rScore==rScore && pFirst->iLevel>iLevel) in rtreeSearchPointNew()
1507 pNew = rtreeEnqueue(pCur, rScore, iLevel); in rtreeSearchPointNew()
1520 pCur->sPoint.rScore = rScore; in rtreeSearchPointNew()
1525 return rtreeEnqueue(pCur, rScore, iLevel); in rtreeSearchPointNew()
1534 p->iLevel, p->id, p->iCell, p->rScore, p->eWithin
1630 sqlite3_rtree_dbl rScore = (sqlite3_rtree_dbl)-1; in rtreeStepToLeaf() local
1636 &rScore, &eWithin); in rtreeStepToLeaf()
1669 if( rScore<RTREE_ZERO ) rScore = RTREE_ZERO; in rtreeStepToLeaf()
1670 p = rtreeSearchPointNew(pCur, rScore, x.iLevel); in rtreeStepToLeaf()