211   typedef sqlite3_int64 RtreeDValue;       /* High accuracy coordinate */  typedef
215   typedef double RtreeDValue;              /* High accuracy coordinate */  typedef
239   RtreeDValue rScore;    /* The score for this node.  Smallest goes first. */
317 # define DCOORD(coord) ((RtreeDValue)coord.i)
333     RtreeDValue rValue;             /* Constraint value. */
334     int (*xGeom)(sqlite3_rtree_geometry*,int,RtreeDValue*,int*);
395   int (*xGeom)(sqlite3_rtree_geometry*, int, RtreeDValue*, int*);
412   RtreeDValue aParam[1];      /* Values for parameters to the SQL function */
1333   RtreeDValue xN;      /* Coordinate value converted to a double */  in rtreeLeafConstraint()
1460   RtreeDValue rScore,   /* Score for the new search point */  in rtreeEnqueue()
1495   RtreeDValue rScore,   /* Score for the new search point */  in rtreeSearchPointNew()
2074 static RtreeDValue cellArea(Rtree *pRtree, RtreeCell *p){  in cellArea()
2075   RtreeDValue area = (RtreeDValue)1;  in cellArea()
2104 static RtreeDValue cellMargin(Rtree *pRtree, RtreeCell *p){  in cellMargin()
2105   RtreeDValue margin = 0;  in cellMargin()
2156 static RtreeDValue cellGrowth(Rtree *pRtree, RtreeCell *p, RtreeCell *pCell){  in cellGrowth()
2157   RtreeDValue area;  in cellGrowth()
2165 static RtreeDValue cellOverlap(  in cellOverlap()
2172   RtreeDValue overlap = RTREE_ZERO;  in cellOverlap()
2175     RtreeDValue o = (RtreeDValue)1;  in cellOverlap()
2177       RtreeDValue x1, x2;  in cellOverlap()
2181         o = (RtreeDValue)0;  in cellOverlap()
2212     RtreeDValue fMinGrowth = RTREE_ZERO;  in ChooseLeaf()
2213     RtreeDValue fMinArea = RTREE_ZERO;  in ChooseLeaf()
2227       RtreeDValue growth;  in ChooseLeaf()
2228       RtreeDValue area;  in ChooseLeaf()
2335   RtreeDValue *aDistance,   in SortByDistance()
2361         RtreeDValue fLeft = aDistance[aLeft[iLeft]];  in SortByDistance()
2362         RtreeDValue fRight = aDistance[aRight[iRight]];  in SortByDistance()
2378         RtreeDValue left = aDistance[aIdx[jj-1]];  in SortByDistance()
2379         RtreeDValue right = aDistance[aIdx[jj]];  in SortByDistance()
2422       RtreeDValue xleft1 = DCOORD(aCell[aLeft[iLeft]].aCoord[iDim*2]);  in SortByDimension()
2423       RtreeDValue xleft2 = DCOORD(aCell[aLeft[iLeft]].aCoord[iDim*2+1]);  in SortByDimension()
2424       RtreeDValue xright1 = DCOORD(aCell[aRight[iRight]].aCoord[iDim*2]);  in SortByDimension()
2425       RtreeDValue xright2 = DCOORD(aCell[aRight[iRight]].aCoord[iDim*2+1]);  in SortByDimension()
2443         RtreeDValue xleft1 = aCell[aIdx[jj-1]].aCoord[iDim*2];  in SortByDimension()
2444         RtreeDValue xleft2 = aCell[aIdx[jj-1]].aCoord[iDim*2+1];  in SortByDimension()
2445         RtreeDValue xright1 = aCell[aIdx[jj]].aCoord[iDim*2];  in SortByDimension()
2446         RtreeDValue xright2 = aCell[aIdx[jj]].aCoord[iDim*2+1];  in SortByDimension()
2472   RtreeDValue fBestMargin = RTREE_ZERO;  in splitNodeStartree()
2493     RtreeDValue margin = RTREE_ZERO;  in splitNodeStartree()
2494     RtreeDValue fBestOverlap = RTREE_ZERO;  in splitNodeStartree()
2495     RtreeDValue fBestArea = RTREE_ZERO;  in splitNodeStartree()
2507       RtreeDValue overlap;  in splitNodeStartree()
2508       RtreeDValue area;  in splitNodeStartree()
2879   RtreeDValue *aDistance;  in Reinsert()
2881   RtreeDValue aCenterCoord[RTREE_MAX_DIMENSIONS];  in Reinsert()
2887   memset(aCenterCoord, 0, sizeof(RtreeDValue)*RTREE_MAX_DIMENSIONS);  in Reinsert()
2899     sizeof(RtreeDValue)             /* aDistance array */  in Reinsert()
2906   aDistance = (RtreeDValue *)&aSpare[n];  in Reinsert()
2921     aCenterCoord[iDim] = (aCenterCoord[iDim]/(nCell*(RtreeDValue)2));  in Reinsert()
2927       RtreeDValue coord = (DCOORD(aCell[ii].aCoord[iDim*2+1]) -   in Reinsert()
4488   nBlob = sizeof(RtreeMatchArg) + (nArg-1)*sizeof(RtreeDValue)  in geomCallback()
4523   int (*xGeom)(sqlite3_rtree_geometry*,int,RtreeDValue*,int*), /* Callback */  in sqlite3_rtree_geometry_callback()  argument