rScore 8022 ext/sqlite3/libsqlite/sqlite3.c sqlite3_rtree_dbl rScore; /* OUT: Write the score here */ rScore 151152 ext/sqlite3/libsqlite/sqlite3.c RtreeDValue rScore; /* The score for this node. Smallest goes first. */ rScore 151950 ext/sqlite3/libsqlite/sqlite3.c pInfo->rScore = pInfo->rParentScore = pSearch->rScore; rScore 151954 ext/sqlite3/libsqlite/sqlite3.c if( pInfo->rScore<*prScore || *prScore<RTREE_ZERO ){ rScore 151955 ext/sqlite3/libsqlite/sqlite3.c *prScore = pInfo->rScore; rScore 152081 ext/sqlite3/libsqlite/sqlite3.c if( pA->rScore<pB->rScore ) return -1; rScore 152082 ext/sqlite3/libsqlite/sqlite3.c if( pA->rScore>pB->rScore ) return +1; rScore 152137 ext/sqlite3/libsqlite/sqlite3.c RtreeDValue rScore, /* Score for the new search point */ rScore 152151 ext/sqlite3/libsqlite/sqlite3.c pNew->rScore = rScore; rScore 152172 ext/sqlite3/libsqlite/sqlite3.c RtreeDValue rScore, /* Score for the new search point */ rScore 152179 ext/sqlite3/libsqlite/sqlite3.c || pFirst->rScore>rScore rScore 152180 ext/sqlite3/libsqlite/sqlite3.c || (pFirst->rScore==rScore && pFirst->iLevel>iLevel) rScore 152184 ext/sqlite3/libsqlite/sqlite3.c pNew = rtreeEnqueue(pCur, rScore, iLevel); rScore 152196 ext/sqlite3/libsqlite/sqlite3.c pCur->sPoint.rScore = rScore; rScore 152201 ext/sqlite3/libsqlite/sqlite3.c return rtreeEnqueue(pCur, rScore, iLevel); rScore 152210 ext/sqlite3/libsqlite/sqlite3.c p->iLevel, p->id, p->iCell, p->rScore, p->eWithin rScore 152304 ext/sqlite3/libsqlite/sqlite3.c sqlite3_rtree_dbl rScore = (sqlite3_rtree_dbl)-1; rScore 152311 ext/sqlite3/libsqlite/sqlite3.c &rScore, &eWithin); rScore 152334 ext/sqlite3/libsqlite/sqlite3.c if( rScore<RTREE_ZERO ) rScore = RTREE_ZERO; rScore 152335 ext/sqlite3/libsqlite/sqlite3.c p = rtreeSearchPointNew(pCur, rScore, x.iLevel); rScore 7815 ext/sqlite3/libsqlite/sqlite3.h sqlite3_rtree_dbl rScore; /* OUT: Write the score here */