Lines Matching defs:aCoord
10941 sqlite3_rtree_dbl *aCoord; /* Coordinates of node or entry to check */
201322 RtreeCoord aCoord[RTREE_MAX_DIMENSIONS*2]; /* Bounding box coordinates */
201765 p += writeCoord(p, &pCell->aCoord[ii]);
201904 pCoord = pCell->aCoord;
202152 sqlite3_rtree_dbl aCoord[RTREE_MAX_DIMENSIONS*2]; /* Decoded coordinates */
202164 case 10: readCoord(pCellData+36, &c); aCoord[9] = c.f;
202165 readCoord(pCellData+32, &c); aCoord[8] = c.f;
202166 case 8: readCoord(pCellData+28, &c); aCoord[7] = c.f;
202167 readCoord(pCellData+24, &c); aCoord[6] = c.f;
202168 case 6: readCoord(pCellData+20, &c); aCoord[5] = c.f;
202169 readCoord(pCellData+16, &c); aCoord[4] = c.f;
202170 case 4: readCoord(pCellData+12, &c); aCoord[3] = c.f;
202171 readCoord(pCellData+8, &c); aCoord[2] = c.f;
202172 default: readCoord(pCellData+4, &c); aCoord[1] = c.f;
202173 readCoord(pCellData, &c); aCoord[0] = c.f;
202179 case 10: readCoord(pCellData+36, &c); aCoord[9] = c.i;
202180 readCoord(pCellData+32, &c); aCoord[8] = c.i;
202181 case 8: readCoord(pCellData+28, &c); aCoord[7] = c.i;
202182 readCoord(pCellData+24, &c); aCoord[6] = c.i;
202183 case 6: readCoord(pCellData+20, &c); aCoord[5] = c.i;
202184 readCoord(pCellData+16, &c); aCoord[4] = c.i;
202185 case 4: readCoord(pCellData+12, &c); aCoord[3] = c.i;
202186 readCoord(pCellData+8, &c); aCoord[2] = c.i;
202187 default: readCoord(pCellData+4, &c); aCoord[1] = c.i;
202188 readCoord(pCellData, &c); aCoord[0] = c.i;
202194 nCoord, aCoord, &eWithin);
202198 pInfo->aCoord = aCoord;
203026 case 5: area = p->aCoord[9].f - p->aCoord[8].f;
203027 case 4: area *= p->aCoord[7].f - p->aCoord[6].f;
203028 case 3: area *= p->aCoord[5].f - p->aCoord[4].f;
203029 case 2: area *= p->aCoord[3].f - p->aCoord[2].f;
203030 default: area *= p->aCoord[1].f - p->aCoord[0].f;
203036 case 5: area = (i64)p->aCoord[9].i - (i64)p->aCoord[8].i;
203037 case 4: area *= (i64)p->aCoord[7].i - (i64)p->aCoord[6].i;
203038 case 3: area *= (i64)p->aCoord[5].i - (i64)p->aCoord[4].i;
203039 case 2: area *= (i64)p->aCoord[3].i - (i64)p->aCoord[2].i;
203040 default: area *= (i64)p->aCoord[1].i - (i64)p->aCoord[0].i;
203054 margin += (DCOORD(p->aCoord[ii+1]) - DCOORD(p->aCoord[ii]));
203067 p1->aCoord[ii].f = MIN(p1->aCoord[ii].f, p2->aCoord[ii].f);
203068 p1->aCoord[ii+1].f = MAX(p1->aCoord[ii+1].f, p2->aCoord[ii+1].f);
203073 p1->aCoord[ii].i = MIN(p1->aCoord[ii].i, p2->aCoord[ii].i);
203074 p1->aCoord[ii+1].i = MAX(p1->aCoord[ii+1].i, p2->aCoord[ii+1].i);
203088 RtreeCoord *a1 = &p1->aCoord[ii];
203089 RtreeCoord *a2 = &p2->aCoord[ii];
203124 x1 = MAX(DCOORD(p->aCoord[jj]), DCOORD(aCell[ii].aCoord[jj]));
203125 x2 = MIN(DCOORD(p->aCoord[jj+1]), DCOORD(aCell[ii].aCoord[jj+1]));
203368 RtreeDValue xleft1 = DCOORD(aCell[aLeft[iLeft]].aCoord[iDim*2]);
203369 RtreeDValue xleft2 = DCOORD(aCell[aLeft[iLeft]].aCoord[iDim*2+1]);
203370 RtreeDValue xright1 = DCOORD(aCell[aRight[iRight]].aCoord[iDim*2]);
203371 RtreeDValue xright2 = DCOORD(aCell[aRight[iRight]].aCoord[iDim*2+1]);
203389 RtreeDValue xleft1 = aCell[aIdx[jj-1]].aCoord[iDim*2];
203390 RtreeDValue xleft2 = aCell[aIdx[jj-1]].aCoord[iDim*2+1];
203391 RtreeDValue xright1 = aCell[aIdx[jj]].aCoord[iDim*2];
203392 RtreeDValue xright2 = aCell[aIdx[jj]].aCoord[iDim*2+1];
203862 aCenterCoord[iDim] += DCOORD(aCell[ii].aCoord[iDim*2]);
203863 aCenterCoord[iDim] += DCOORD(aCell[ii].aCoord[iDim*2+1]);
203873 RtreeDValue coord = (DCOORD(aCell[ii].aCoord[iDim*2+1]) -
203874 DCOORD(aCell[ii].aCoord[iDim*2]));
204202 /* Populate the cell.aCoord[] array. The first coordinate is aData[3].
204214 cell.aCoord[ii].f = rtreeValueDown(aData[ii+3]);
204215 cell.aCoord[ii+1].f = rtreeValueUp(aData[ii+4]);
204216 if( cell.aCoord[ii].f>cell.aCoord[ii+1].f ){
204225 cell.aCoord[ii].i = sqlite3_value_int(aData[ii+3]);
204226 cell.aCoord[ii+1].i = sqlite3_value_int(aData[ii+4]);
204227 if( cell.aCoord[ii].i>cell.aCoord[ii+1].i ){
204841 sqlite3_str_appendf(pOut, " %g", (double)cell.aCoord[jj].f);
204843 sqlite3_str_appendf(pOut, " %d", cell.aCoord[jj].i);
205969 ** (1) if aCoord!=0 store the bounding box in aCoord, returning NULL
205973 ** If pPoly is NULL but aCoord is not NULL, then compute a new GeoPoly from
205974 ** the bounding box in aCoord and return a pointer to that GeoPoly.
205979 RtreeCoord *aCoord, /* Results here */
205985 if( pPoly==0 && aCoord!=0 ){
205987 mnX = aCoord[0].f;
205988 mxX = aCoord[1].f;
205989 mnY = aCoord[2].f;
205990 mxY = aCoord[3].f;
206008 if( aCoord==0 ){
206033 aCoord[0].f = mnX;
206034 aCoord[1].f = mxX;
206035 aCoord[2].f = mnY;
206036 aCoord[3].f = mxY;
206038 }else if( aCoord ){
206039 memset(aCoord, 0, sizeof(RtreeCoord)*4);
206966 geopolyBBox(0, aData[2], cell.aCoord, &rc);