2402   int iDim,   in SortByDimension()  argument
2416     SortByDimension(pRtree, aLeft, nLeft, iDim, aCell, aSpare);  in SortByDimension()
2417     SortByDimension(pRtree, aRight, nRight, iDim, aCell, aSpare);  in SortByDimension()
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()
2882   int iDim;  in Reinsert()  local
2915     for(iDim=0; iDim<pRtree->nDim; iDim++){  in Reinsert()
2916       aCenterCoord[iDim] += DCOORD(aCell[ii].aCoord[iDim*2]);  in Reinsert()
2917       aCenterCoord[iDim] += DCOORD(aCell[ii].aCoord[iDim*2+1]);  in Reinsert()
2920   for(iDim=0; iDim<pRtree->nDim; iDim++){  in Reinsert()
2921     aCenterCoord[iDim] = (aCenterCoord[iDim]/(nCell*(RtreeDValue)2));  in Reinsert()
2926     for(iDim=0; iDim<pRtree->nDim; iDim++){  in Reinsert()
2927       RtreeDValue coord = (DCOORD(aCell[ii].aCoord[iDim*2+1]) -   in Reinsert()
2928                                DCOORD(aCell[ii].aCoord[iDim*2]));  in Reinsert()
2929       aDistance[ii] += (coord-aCenterCoord[iDim])*(coord-aCenterCoord[iDim]);  in Reinsert()