282   u8 bPoint;                        /* True if sPoint is valid */  member
1436   return pCur->bPoint ? &pCur->sPoint : pCur->nPoint ? pCur->aPoint : 0;  in rtreeSearchPointFirst()
1444   int ii = 1 - pCur->bPoint;  in rtreeNodeOfFirstSearchPoint()
1446   assert( pCur->bPoint || pCur->nPoint );  in rtreeNodeOfFirstSearchPoint()
1505     if( pCur->bPoint ){  in rtreeSearchPointNew()
1522     pCur->bPoint = 1;  in rtreeSearchPointNew()
1546   if( pCur->bPoint ){
1550     if( ii>0 || pCur->bPoint ) printf("              ");
1563   i = 1 - p->bPoint;  in rtreeSearchPointPop()
1569   if( p->bPoint ){  in rtreeSearchPointPop()
1571     p->bPoint = 0;  in rtreeSearchPointPop()
1930       assert( pCsr->bPoint==0 );  /* Due to the resetCursor() call above */  in rtreeFilter()
1938       assert( pCsr->bPoint==1 );  in rtreeFilter()