Searched refs:nPoint (Results 1 – 1 of 1) sorted by relevance
288 int nPoint; /* Number of slots used in aPoint[] */ member1436 return pCur->bPoint ? &pCur->sPoint : pCur->nPoint ? pCur->aPoint : 0; in rtreeSearchPointFirst()1446 assert( pCur->bPoint || pCur->nPoint ); in rtreeNodeOfFirstSearchPoint()1465 if( pCur->nPoint>=pCur->nPointAlloc ){ in rtreeEnqueue()1472 i = pCur->nPoint++; in rtreeEnqueue()1549 for(ii=0; ii<pCur->nPoint; ii++){1572 }else if( ALWAYS(p->nPoint) ){ in rtreeSearchPointPop()1574 n = --p->nPoint; in rtreeSearchPointPop()1654 for(ii=0; ii<pCur->nPoint; ii++){ in rtreeStepToLeaf()