Lines Matching defs:aPoint
201233 int nPointAlloc; /* Number of slots allocated for aPoint[] */
201234 int nPoint; /* Number of slots used in aPoint[] */
201236 RtreeSearchPoint *aPoint; /* Priority queue for search points */
202056 sqlite3_free(pCsr->aPoint);
202361 RtreeSearchPoint t = p->aPoint[i];
202363 p->aPoint[i] = p->aPoint[j];
202364 p->aPoint[j] = t;
202382 return pCur->bPoint ? &pCur->sPoint : pCur->nPoint ? pCur->aPoint : 0;
202395 id = ii ? pCur->aPoint[0].id : pCur->sPoint.id;
202413 pNew = sqlite3_realloc64(pCur->aPoint, nNew*sizeof(pCur->aPoint[0]));
202415 pCur->aPoint = pNew;
202419 pNew = pCur->aPoint + i;
202426 pParent = pCur->aPoint + j;
202455 ii = (int)(pNew - pCur->aPoint) + 1;
202497 tracePoint(&pCur->aPoint[ii], ii, pCur);
202519 p->anQueue[p->aPoint[0].iLevel]--;
202521 p->aPoint[0] = p->aPoint[n];
202529 if( k<n && rtreeSearchPointCompare(&p->aPoint[k], &p->aPoint[j])<0 ){
202530 if( rtreeSearchPointCompare(&p->aPoint[k], &p->aPoint[i])<0 ){
202537 if( rtreeSearchPointCompare(&p->aPoint[j], &p->aPoint[i])<0 ){
202601 if( pCur->aPoint[ii].id==x.id ){