Lines Matching refs:iLevel
241 u8 iLevel; /* 0=entries. 1=leaf node. 2+ for higher */ member
1211 if( pConstraint->op==RTREE_QUERY && pSearch->iLevel==1 ){ in rtreeCallbackConstraint()
1253 pInfo->iLevel = pSearch->iLevel - 1; in rtreeCallbackConstraint()
1406 if( pA->iLevel<pB->iLevel ) return -1; in rtreeSearchPointCompare()
1407 if( pA->iLevel>pB->iLevel ) return +1; in rtreeSearchPointCompare()
1461 u8 iLevel /* Level for the new search point */ in rtreeEnqueue() argument
1475 pNew->iLevel = iLevel; in rtreeEnqueue()
1476 assert( iLevel<=RTREE_MAX_DEPTH ); in rtreeEnqueue()
1496 u8 iLevel /* Level for the new search point */ in rtreeSearchPointNew() argument
1500 pCur->anQueue[iLevel]++; in rtreeSearchPointNew()
1503 || (pFirst->rScore==rScore && pFirst->iLevel>iLevel) in rtreeSearchPointNew()
1507 pNew = rtreeEnqueue(pCur, rScore, iLevel); in rtreeSearchPointNew()
1521 pCur->sPoint.iLevel = iLevel; in rtreeSearchPointNew()
1525 return rtreeEnqueue(pCur, rScore, iLevel); in rtreeSearchPointNew()
1534 p->iLevel, p->id, p->iCell, p->rScore, p->eWithin
1570 p->anQueue[p->sPoint.iLevel]--; in rtreeSearchPointPop()
1573 p->anQueue[p->aPoint[0].iLevel]--; in rtreeSearchPointPop()
1622 while( (p = rtreeSearchPointFirst(pCur))!=0 && p->iLevel>0 ){ in rtreeStepToLeaf()
1638 }else if( p->iLevel==1 ){ in rtreeStepToLeaf()
1651 x.iLevel = p->iLevel - 1; in rtreeStepToLeaf()
1652 if( x.iLevel ){ in rtreeStepToLeaf()
1670 p = rtreeSearchPointNew(pCur, rScore, x.iLevel); in rtreeStepToLeaf()