290   RtreeSearchPoint *aPoint;         /* Priority queue for search points */  member
1110   sqlite3_free(pCsr->aPoint);  in resetCursor()
1415   RtreeSearchPoint t = p->aPoint[i];  in rtreeSearchPointSwap()
1417   p->aPoint[i] = p->aPoint[j];  in rtreeSearchPointSwap()
1418   p->aPoint[j] = t;  in rtreeSearchPointSwap()
1436   return pCur->bPoint ? &pCur->sPoint : pCur->nPoint ? pCur->aPoint : 0;  in rtreeSearchPointFirst()
1449     id = ii ? pCur->aPoint[0].id : pCur->sPoint.id;  in rtreeNodeOfFirstSearchPoint()
1467     pNew = sqlite3_realloc64(pCur->aPoint, nNew*sizeof(pCur->aPoint[0]));  in rtreeEnqueue()
1469     pCur->aPoint = pNew;  in rtreeEnqueue()
1473   pNew = pCur->aPoint + i;  in rtreeEnqueue()
1480     pParent = pCur->aPoint + j;  in rtreeEnqueue()
1509       ii = (int)(pNew - pCur->aPoint) + 1;  in rtreeSearchPointNew()
1551     tracePoint(&pCur->aPoint[ii], ii, pCur);
1573     p->anQueue[p->aPoint[0].iLevel]--;  in rtreeSearchPointPop()
1575     p->aPoint[0] = p->aPoint[n];  in rtreeSearchPointPop()
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()
1655           if( pCur->aPoint[ii].id==x.id ){  in rtreeStepToLeaf()