Searched refs:rtreeSearchPointCompare (Results 1 – 1 of 1) sorted by relevance
1400 static int rtreeSearchPointCompare( in rtreeSearchPointCompare() function1481 if( rtreeSearchPointCompare(pNew, pParent)>=0 ) break; in rtreeEnqueue()1583 if( k<n && rtreeSearchPointCompare(&p->aPoint[k], &p->aPoint[j])<0 ){ in rtreeSearchPointPop()1584 if( rtreeSearchPointCompare(&p->aPoint[k], &p->aPoint[i])<0 ){ in rtreeSearchPointPop()1591 if( rtreeSearchPointCompare(&p->aPoint[j], &p->aPoint[i])<0 ){ in rtreeSearchPointPop()