aPoint           151202 ext/sqlite3/libsqlite/sqlite3.c   RtreeSearchPoint *aPoint;         /* Priority queue for search points */
aPoint           151858 ext/sqlite3/libsqlite/sqlite3.c   sqlite3_free(pCsr->aPoint);
aPoint           152092 ext/sqlite3/libsqlite/sqlite3.c   RtreeSearchPoint t = p->aPoint[i];
aPoint           152094 ext/sqlite3/libsqlite/sqlite3.c   p->aPoint[i] = p->aPoint[j];
aPoint           152095 ext/sqlite3/libsqlite/sqlite3.c   p->aPoint[j] = t;
aPoint           152113 ext/sqlite3/libsqlite/sqlite3.c   return pCur->bPoint ? &pCur->sPoint : pCur->nPoint ? pCur->aPoint : 0;
aPoint           152126 ext/sqlite3/libsqlite/sqlite3.c     id = ii ? pCur->aPoint[0].id : pCur->sPoint.id;
aPoint           152144 ext/sqlite3/libsqlite/sqlite3.c     pNew = sqlite3_realloc(pCur->aPoint, nNew*sizeof(pCur->aPoint[0]));
aPoint           152146 ext/sqlite3/libsqlite/sqlite3.c     pCur->aPoint = pNew;
aPoint           152150 ext/sqlite3/libsqlite/sqlite3.c   pNew = pCur->aPoint + i;
aPoint           152157 ext/sqlite3/libsqlite/sqlite3.c     pParent = pCur->aPoint + j;
aPoint           152186 ext/sqlite3/libsqlite/sqlite3.c       ii = (int)(pNew - pCur->aPoint) + 1;
aPoint           152227 ext/sqlite3/libsqlite/sqlite3.c     tracePoint(&pCur->aPoint[ii], ii, pCur);
aPoint           152249 ext/sqlite3/libsqlite/sqlite3.c     p->anQueue[p->aPoint[0].iLevel]--;
aPoint           152251 ext/sqlite3/libsqlite/sqlite3.c     p->aPoint[0] = p->aPoint[n];
aPoint           152259 ext/sqlite3/libsqlite/sqlite3.c       if( k<n && rtreeSearchPointCompare(&p->aPoint[k], &p->aPoint[j])<0 ){
aPoint           152260 ext/sqlite3/libsqlite/sqlite3.c         if( rtreeSearchPointCompare(&p->aPoint[k], &p->aPoint[i])<0 ){
aPoint           152267 ext/sqlite3/libsqlite/sqlite3.c         if( rtreeSearchPointCompare(&p->aPoint[j], &p->aPoint[i])<0 ){
aPoint           152506 ext/sqlite3/libsqlite/sqlite3.c   sqlite3_free(pCsr->aPoint);