| rev |
line source |
|
jbe@0
|
1
|
|
jbe@0
|
2 /*-------------*
|
|
jbe@0
|
3 * C prelude *
|
|
jbe@0
|
4 *-------------*/
|
|
jbe@0
|
5
|
|
jbe@0
|
6 #include "postgres.h"
|
|
jbe@0
|
7 #include "fmgr.h"
|
|
jbe@0
|
8 #include "libpq/pqformat.h"
|
|
jbe@0
|
9 #include "access/gist.h"
|
|
jbe@0
|
10 #include "access/stratnum.h"
|
|
jbe@0
|
11 #include "utils/array.h"
|
|
jbe@0
|
12 #include <math.h>
|
|
jbe@0
|
13
|
|
jbe@0
|
14 #ifdef PG_MODULE_MAGIC
|
|
jbe@0
|
15 PG_MODULE_MAGIC;
|
|
jbe@0
|
16 #endif
|
|
jbe@0
|
17
|
|
jbe@0
|
18 #if INT_MAX < 2147483647
|
|
jbe@0
|
19 #error Expected int type to be at least 32 bit wide
|
|
jbe@0
|
20 #endif
|
|
jbe@0
|
21
|
|
jbe@0
|
22
|
|
jbe@0
|
23 /*---------------------------------*
|
|
jbe@0
|
24 * distance calculation on earth *
|
|
jbe@0
|
25 * (using WGS-84 spheroid) *
|
|
jbe@0
|
26 *---------------------------------*/
|
|
jbe@0
|
27
|
|
jbe@0
|
28 /* WGS-84 spheroid with following parameters:
|
|
jbe@0
|
29 semi-major axis a = 6378137
|
|
jbe@0
|
30 semi-minor axis b = a * (1 - 1/298.257223563)
|
|
jbe@0
|
31 estimated diameter = 2 * (2*a+b)/3
|
|
jbe@0
|
32 */
|
|
jbe@0
|
33 #define PGL_SPHEROID_A 6378137.0 /* semi major axis */
|
|
jbe@0
|
34 #define PGL_SPHEROID_F (1.0/298.257223563) /* flattening */
|
|
jbe@0
|
35 #define PGL_SPHEROID_B (PGL_SPHEROID_A * (1.0-PGL_SPHEROID_F))
|
|
jbe@0
|
36 #define PGL_EPS2 ( ( PGL_SPHEROID_A * PGL_SPHEROID_A - \
|
|
jbe@0
|
37 PGL_SPHEROID_B * PGL_SPHEROID_B ) / \
|
|
jbe@0
|
38 ( PGL_SPHEROID_A * PGL_SPHEROID_A ) )
|
|
jbe@0
|
39 #define PGL_SUBEPS2 (1.0-PGL_EPS2)
|
|
jbe@0
|
40 #define PGL_DIAMETER ((4.0*PGL_SPHEROID_A + 2.0*PGL_SPHEROID_B) / 3.0)
|
|
jbe@0
|
41 #define PGL_SCALE (PGL_SPHEROID_A / PGL_DIAMETER) /* semi-major ref. */
|
|
jbe@0
|
42 #define PGL_FADELIMIT (PGL_DIAMETER * M_PI / 6.0) /* 1/6 circumference */
|
|
jbe@0
|
43 #define PGL_MAXDIST (PGL_DIAMETER * M_PI / 2.0) /* maximum distance */
|
|
jbe@0
|
44
|
|
jbe@0
|
45 /* calculate distance between two points on earth (given in degrees) */
|
|
jbe@0
|
46 static inline double pgl_distance(
|
|
jbe@0
|
47 double lat1, double lon1, double lat2, double lon2
|
|
jbe@0
|
48 ) {
|
|
jbe@0
|
49 float8 lat1cos, lat1sin, lat2cos, lat2sin, lon2cos, lon2sin;
|
|
jbe@0
|
50 float8 nphi1, nphi2, x1, z1, x2, y2, z2, g, s, t;
|
|
jbe@0
|
51 /* normalize delta longitude (lon2 > 0 && lon1 = 0) */
|
|
jbe@0
|
52 /* lon1 = 0 (not used anymore) */
|
|
jbe@0
|
53 lon2 = fabs(lon2-lon1);
|
|
jbe@0
|
54 /* convert to radians (first divide, then multiply) */
|
|
jbe@0
|
55 lat1 = (lat1 / 180.0) * M_PI;
|
|
jbe@0
|
56 lat2 = (lat2 / 180.0) * M_PI;
|
|
jbe@0
|
57 lon2 = (lon2 / 180.0) * M_PI;
|
|
jbe@0
|
58 /* make lat2 >= lat1 to ensure reversal-symmetry despite floating point
|
|
jbe@0
|
59 operations (lon2 >= lon1 is already ensured in a previous step) */
|
|
jbe@0
|
60 if (lat2 < lat1) { float8 swap = lat1; lat1 = lat2; lat2 = swap; }
|
|
jbe@0
|
61 /* calculate 3d coordinates on scaled ellipsoid which has an average diameter
|
|
jbe@0
|
62 of 1.0 */
|
|
jbe@0
|
63 lat1cos = cos(lat1); lat1sin = sin(lat1);
|
|
jbe@0
|
64 lat2cos = cos(lat2); lat2sin = sin(lat2);
|
|
jbe@0
|
65 lon2cos = cos(lon2); lon2sin = sin(lon2);
|
|
jbe@0
|
66 nphi1 = PGL_SCALE / sqrt(1 - PGL_EPS2 * lat1sin * lat1sin);
|
|
jbe@0
|
67 nphi2 = PGL_SCALE / sqrt(1 - PGL_EPS2 * lat2sin * lat2sin);
|
|
jbe@0
|
68 x1 = nphi1 * lat1cos;
|
|
jbe@0
|
69 z1 = nphi1 * PGL_SUBEPS2 * lat1sin;
|
|
jbe@0
|
70 x2 = nphi2 * lat2cos * lon2cos;
|
|
jbe@0
|
71 y2 = nphi2 * lat2cos * lon2sin;
|
|
jbe@0
|
72 z2 = nphi2 * PGL_SUBEPS2 * lat2sin;
|
|
jbe@0
|
73 /* calculate tunnel distance through scaled (diameter 1.0) ellipsoid */
|
|
jbe@0
|
74 g = sqrt((x2-x1)*(x2-x1) + y2*y2 + (z2-z1)*(z2-z1));
|
|
jbe@0
|
75 /* convert tunnel distance through scaled ellipsoid to approximated surface
|
|
jbe@0
|
76 distance on original ellipsoid */
|
|
jbe@0
|
77 if (g > 1.0) g = 1.0;
|
|
jbe@0
|
78 s = PGL_DIAMETER * asin(g);
|
|
jbe@0
|
79 /* return result only if small enough to be precise (less than 1/3 of
|
|
jbe@0
|
80 maximum possible distance) */
|
|
jbe@0
|
81 if (s <= PGL_FADELIMIT) return s;
|
|
jbe@0
|
82 /* calculate tunnel distance to antipodal point through scaled ellipsoid */
|
|
jbe@3
|
83 g = sqrt((x2+x1)*(x2+x1) + y2*y2 + (z2+z1)*(z2+z1));
|
|
jbe@0
|
84 /* convert tunnel distance to antipodal point through scaled ellipsoid to
|
|
jbe@0
|
85 approximated surface distance to antipodal point on original ellipsoid */
|
|
jbe@0
|
86 if (g > 1.0) g = 1.0;
|
|
jbe@0
|
87 t = PGL_DIAMETER * asin(g);
|
|
jbe@0
|
88 /* surface distance between original points can now be approximated by
|
|
jbe@0
|
89 substracting antipodal distance from maximum possible distance;
|
|
jbe@0
|
90 return result only if small enough (less than 1/3 of maximum possible
|
|
jbe@0
|
91 distance) */
|
|
jbe@0
|
92 if (t <= PGL_FADELIMIT) return PGL_MAXDIST-t;
|
|
jbe@0
|
93 /* otherwise crossfade direct and antipodal result to ensure monotonicity */
|
|
jbe@0
|
94 return (
|
|
jbe@0
|
95 (s * (t-PGL_FADELIMIT) + (PGL_MAXDIST-t) * (s-PGL_FADELIMIT)) /
|
|
jbe@0
|
96 (s + t - 2*PGL_FADELIMIT)
|
|
jbe@0
|
97 );
|
|
jbe@0
|
98 }
|
|
jbe@0
|
99
|
|
jbe@0
|
100 /* finite distance that can not be reached on earth */
|
|
jbe@0
|
101 #define PGL_ULTRA_DISTANCE (3 * PGL_MAXDIST)
|
|
jbe@0
|
102
|
|
jbe@0
|
103
|
|
jbe@0
|
104 /*--------------------------------*
|
|
jbe@0
|
105 * simple geographic data types *
|
|
jbe@0
|
106 *--------------------------------*/
|
|
jbe@0
|
107
|
|
jbe@0
|
108 /* point on earth given by latitude and longitude in degrees */
|
|
jbe@0
|
109 /* (type "epoint" in SQL) */
|
|
jbe@0
|
110 typedef struct {
|
|
jbe@0
|
111 double lat; /* between -90 and 90 (both inclusive) */
|
|
jbe@0
|
112 double lon; /* between -180 and 180 (both inclusive) */
|
|
jbe@0
|
113 } pgl_point;
|
|
jbe@0
|
114
|
|
jbe@0
|
115 /* box delimited by two parallels and two meridians (all in degrees) */
|
|
jbe@0
|
116 /* (type "ebox" in SQL) */
|
|
jbe@0
|
117 typedef struct {
|
|
jbe@0
|
118 double lat_min; /* between -90 and 90 (both inclusive) */
|
|
jbe@0
|
119 double lat_max; /* between -90 and 90 (both inclusive) */
|
|
jbe@0
|
120 double lon_min; /* between -180 and 180 (both inclusive) */
|
|
jbe@0
|
121 double lon_max; /* between -180 and 180 (both inclusive) */
|
|
jbe@0
|
122 /* if lat_min > lat_max, then box is empty */
|
|
jbe@0
|
123 /* if lon_min > lon_max, then 180th meridian is crossed */
|
|
jbe@0
|
124 } pgl_box;
|
|
jbe@0
|
125
|
|
jbe@0
|
126 /* circle on earth surface (for radial searches with fixed radius) */
|
|
jbe@0
|
127 /* (type "ecircle" in SQL) */
|
|
jbe@0
|
128 typedef struct {
|
|
jbe@0
|
129 pgl_point center;
|
|
jbe@0
|
130 double radius; /* positive (including +0 but excluding -0), or -INFINITY */
|
|
jbe@0
|
131 /* A negative radius (i.e. -INFINITY) denotes nothing (i.e. no point),
|
|
jbe@0
|
132 zero radius (0) denotes a single point,
|
|
jbe@0
|
133 a finite radius (0 < radius < INFINITY) denotes a filled circle, and
|
|
jbe@0
|
134 a radius of INFINITY is valid and means complete coverage of earth. */
|
|
jbe@0
|
135 } pgl_circle;
|
|
jbe@0
|
136
|
|
jbe@0
|
137
|
|
jbe@0
|
138 /*----------------------------------*
|
|
jbe@0
|
139 * geographic "cluster" data type *
|
|
jbe@0
|
140 *----------------------------------*/
|
|
jbe@0
|
141
|
|
jbe@0
|
142 /* A cluster is a collection of points, paths, outlines, and polygons. If two
|
|
jbe@0
|
143 polygons in a cluster overlap, the area covered by both polygons does not
|
|
jbe@0
|
144 belong to the cluster. This way, a cluster can be used to describe complex
|
|
jbe@0
|
145 shapes like polygons with holes. Outlines are non-filled polygons. Paths are
|
|
jbe@0
|
146 open by default (i.e. the last point in the list is not connected with the
|
|
jbe@0
|
147 first point in the list). Note that each outline or polygon in a cluster
|
|
jbe@0
|
148 must cover a longitude range of less than 180 degrees to avoid ambiguities.
|
|
jbe@0
|
149 Areas which are larger may be split into multiple polygons. */
|
|
jbe@0
|
150
|
|
jbe@0
|
151 /* maximum number of points in a cluster */
|
|
jbe@0
|
152 /* (limited to avoid integer overflows, e.g. when allocating memory) */
|
|
jbe@0
|
153 #define PGL_CLUSTER_MAXPOINTS 16777216
|
|
jbe@0
|
154
|
|
jbe@0
|
155 /* types of cluster entries */
|
|
jbe@0
|
156 #define PGL_ENTRY_POINT 1 /* a point */
|
|
jbe@0
|
157 #define PGL_ENTRY_PATH 2 /* a path from first point to last point */
|
|
jbe@0
|
158 #define PGL_ENTRY_OUTLINE 3 /* a non-filled polygon with given vertices */
|
|
jbe@0
|
159 #define PGL_ENTRY_POLYGON 4 /* a filled polygon with given vertices */
|
|
jbe@0
|
160
|
|
jbe@0
|
161 /* Entries of a cluster are described by two different structs: pgl_newentry
|
|
jbe@0
|
162 and pgl_entry. The first is used only during construction of a cluster, the
|
|
jbe@0
|
163 second is used in all other cases (e.g. when reading clusters from the
|
|
jbe@0
|
164 database, performing operations, etc). */
|
|
jbe@0
|
165
|
|
jbe@0
|
166 /* entry for new geographic cluster during construction of that cluster */
|
|
jbe@0
|
167 typedef struct {
|
|
jbe@0
|
168 int32_t entrytype;
|
|
jbe@0
|
169 int32_t npoints;
|
|
jbe@0
|
170 pgl_point *points; /* pointer to an array of points (pgl_point) */
|
|
jbe@0
|
171 } pgl_newentry;
|
|
jbe@0
|
172
|
|
jbe@0
|
173 /* entry of geographic cluster */
|
|
jbe@0
|
174 typedef struct {
|
|
jbe@0
|
175 int32_t entrytype; /* type of entry: point, path, outline, polygon */
|
|
jbe@0
|
176 int32_t npoints; /* number of stored points (set to 1 for point entry) */
|
|
jbe@0
|
177 int32_t offset; /* offset of pgl_point array from cluster base address */
|
|
jbe@0
|
178 /* use macro PGL_ENTRY_POINTS to obtain a pointer to the array of points */
|
|
jbe@0
|
179 } pgl_entry;
|
|
jbe@0
|
180
|
|
jbe@0
|
181 /* geographic cluster which is a collection of points, (open) paths, polygons,
|
|
jbe@0
|
182 and outlines (non-filled polygons) */
|
|
jbe@0
|
183 typedef struct {
|
|
jbe@0
|
184 char header[VARHDRSZ]; /* PostgreSQL header for variable size data types */
|
|
jbe@0
|
185 int32_t nentries; /* number of stored points */
|
|
jbe@0
|
186 pgl_circle bounding; /* bounding circle */
|
|
jbe@0
|
187 /* Note: bounding circle ensures alignment of pgl_cluster for points */
|
|
jbe@0
|
188 pgl_entry entries[FLEXIBLE_ARRAY_MEMBER]; /* var-length data */
|
|
jbe@0
|
189 } pgl_cluster;
|
|
jbe@0
|
190
|
|
jbe@0
|
191 /* macro to determine memory alignment of points */
|
|
jbe@0
|
192 /* (needed to store pgl_point array after entries in pgl_cluster) */
|
|
jbe@0
|
193 typedef struct { char dummy; pgl_point aligned; } pgl_point_alignment;
|
|
jbe@0
|
194 #define PGL_POINT_ALIGNMENT offsetof(pgl_point_alignment, aligned)
|
|
jbe@0
|
195
|
|
jbe@0
|
196 /* macro to extract a pointer to the array of points of a cluster entry */
|
|
jbe@0
|
197 #define PGL_ENTRY_POINTS(cluster, idx) \
|
|
jbe@0
|
198 ((pgl_point *)(((intptr_t)cluster)+(cluster)->entries[idx].offset))
|
|
jbe@0
|
199
|
|
jbe@0
|
200 /* convert pgl_newentry array to pgl_cluster */
|
|
jbe@0
|
201 static pgl_cluster *pgl_new_cluster(int nentries, pgl_newentry *entries) {
|
|
jbe@0
|
202 int i; /* index of current entry */
|
|
jbe@0
|
203 int npoints = 0; /* number of points in whole cluster */
|
|
jbe@0
|
204 int entry_npoints; /* number of points in current entry */
|
|
jbe@0
|
205 int points_offset = PGL_POINT_ALIGNMENT * (
|
|
jbe@0
|
206 ( offsetof(pgl_cluster, entries) +
|
|
jbe@0
|
207 nentries * sizeof(pgl_entry) +
|
|
jbe@0
|
208 PGL_POINT_ALIGNMENT - 1
|
|
jbe@0
|
209 ) / PGL_POINT_ALIGNMENT
|
|
jbe@0
|
210 ); /* offset of pgl_point array from base address (considering alignment) */
|
|
jbe@0
|
211 pgl_cluster *cluster; /* new cluster to be returned */
|
|
jbe@0
|
212 /* determine total number of points */
|
|
jbe@0
|
213 for (i=0; i<nentries; i++) npoints += entries[i].npoints;
|
|
jbe@0
|
214 /* allocate memory for cluster (including entries and points) */
|
|
jbe@0
|
215 cluster = palloc(points_offset + npoints * sizeof(pgl_point));
|
|
jbe@0
|
216 /* re-count total number of points to determine offset for each entry */
|
|
jbe@0
|
217 npoints = 0;
|
|
jbe@0
|
218 /* copy entries and points */
|
|
jbe@0
|
219 for (i=0; i<nentries; i++) {
|
|
jbe@0
|
220 /* determine number of points in entry */
|
|
jbe@0
|
221 entry_npoints = entries[i].npoints;
|
|
jbe@0
|
222 /* copy entry */
|
|
jbe@0
|
223 cluster->entries[i].entrytype = entries[i].entrytype;
|
|
jbe@0
|
224 cluster->entries[i].npoints = entry_npoints;
|
|
jbe@0
|
225 /* calculate offset (in bytes) of pgl_point array */
|
|
jbe@0
|
226 cluster->entries[i].offset = points_offset + npoints * sizeof(pgl_point);
|
|
jbe@0
|
227 /* copy points */
|
|
jbe@0
|
228 memcpy(
|
|
jbe@0
|
229 PGL_ENTRY_POINTS(cluster, i),
|
|
jbe@0
|
230 entries[i].points,
|
|
jbe@0
|
231 entry_npoints * sizeof(pgl_point)
|
|
jbe@0
|
232 );
|
|
jbe@0
|
233 /* update total number of points processed */
|
|
jbe@0
|
234 npoints += entry_npoints;
|
|
jbe@0
|
235 }
|
|
jbe@0
|
236 /* set number of entries in cluster */
|
|
jbe@0
|
237 cluster->nentries = nentries;
|
|
jbe@0
|
238 /* set PostgreSQL header for variable sized data */
|
|
jbe@0
|
239 SET_VARSIZE(cluster, points_offset + npoints * sizeof(pgl_point));
|
|
jbe@0
|
240 /* return newly created cluster */
|
|
jbe@0
|
241 return cluster;
|
|
jbe@0
|
242 }
|
|
jbe@0
|
243
|
|
jbe@0
|
244
|
|
jbe@0
|
245 /*----------------------------------------*
|
|
jbe@0
|
246 * C functions on geographic data types *
|
|
jbe@0
|
247 *----------------------------------------*/
|
|
jbe@0
|
248
|
|
jbe@0
|
249 /* round latitude or longitude to 12 digits after decimal point */
|
|
jbe@0
|
250 static inline double pgl_round(double val) {
|
|
jbe@0
|
251 return round(val * 1e12) / 1e12;
|
|
jbe@0
|
252 }
|
|
jbe@0
|
253
|
|
jbe@0
|
254 /* compare two points */
|
|
jbe@0
|
255 /* (equality when same point on earth is described, otherwise an arbitrary
|
|
jbe@0
|
256 linear order) */
|
|
jbe@0
|
257 static int pgl_point_cmp(pgl_point *point1, pgl_point *point2) {
|
|
jbe@0
|
258 double lon1, lon2; /* modified longitudes for special cases */
|
|
jbe@0
|
259 /* use latitude as first ordering criterion */
|
|
jbe@0
|
260 if (point1->lat < point2->lat) return -1;
|
|
jbe@0
|
261 if (point1->lat > point2->lat) return 1;
|
|
jbe@0
|
262 /* determine modified longitudes (considering special case of poles and
|
|
jbe@0
|
263 180th meridian which can be described as W180 or E180) */
|
|
jbe@0
|
264 if (point1->lat == -90 || point1->lat == 90) lon1 = 0;
|
|
jbe@0
|
265 else if (point1->lon == 180) lon1 = -180;
|
|
jbe@0
|
266 else lon1 = point1->lon;
|
|
jbe@0
|
267 if (point2->lat == -90 || point2->lat == 90) lon2 = 0;
|
|
jbe@0
|
268 else if (point2->lon == 180) lon2 = -180;
|
|
jbe@0
|
269 else lon2 = point2->lon;
|
|
jbe@0
|
270 /* use (modified) longitude as secondary ordering criterion */
|
|
jbe@0
|
271 if (lon1 < lon2) return -1;
|
|
jbe@0
|
272 if (lon1 > lon2) return 1;
|
|
jbe@0
|
273 /* no difference found, points are equal */
|
|
jbe@0
|
274 return 0;
|
|
jbe@0
|
275 }
|
|
jbe@0
|
276
|
|
jbe@0
|
277 /* compare two boxes */
|
|
jbe@0
|
278 /* (equality when same box on earth is described, otherwise an arbitrary linear
|
|
jbe@0
|
279 order) */
|
|
jbe@0
|
280 static int pgl_box_cmp(pgl_box *box1, pgl_box *box2) {
|
|
jbe@0
|
281 /* two empty boxes are equal, and an empty box is always considered "less
|
|
jbe@0
|
282 than" a non-empty box */
|
|
jbe@0
|
283 if (box1->lat_min> box1->lat_max && box2->lat_min<=box2->lat_max) return -1;
|
|
jbe@0
|
284 if (box1->lat_min> box1->lat_max && box2->lat_min> box2->lat_max) return 0;
|
|
jbe@0
|
285 if (box1->lat_min<=box1->lat_max && box2->lat_min> box2->lat_max) return 1;
|
|
jbe@0
|
286 /* use southern border as first ordering criterion */
|
|
jbe@0
|
287 if (box1->lat_min < box2->lat_min) return -1;
|
|
jbe@0
|
288 if (box1->lat_min > box2->lat_min) return 1;
|
|
jbe@0
|
289 /* use northern border as second ordering criterion */
|
|
jbe@0
|
290 if (box1->lat_max < box2->lat_max) return -1;
|
|
jbe@0
|
291 if (box1->lat_max > box2->lat_max) return 1;
|
|
jbe@0
|
292 /* use western border as third ordering criterion */
|
|
jbe@0
|
293 if (box1->lon_min < box2->lon_min) return -1;
|
|
jbe@0
|
294 if (box1->lon_min > box2->lon_min) return 1;
|
|
jbe@0
|
295 /* use eastern border as fourth ordering criterion */
|
|
jbe@0
|
296 if (box1->lon_max < box2->lon_max) return -1;
|
|
jbe@0
|
297 if (box1->lon_max > box2->lon_max) return 1;
|
|
jbe@0
|
298 /* no difference found, boxes are equal */
|
|
jbe@0
|
299 return 0;
|
|
jbe@0
|
300 }
|
|
jbe@0
|
301
|
|
jbe@0
|
302 /* compare two circles */
|
|
jbe@0
|
303 /* (equality when same circle on earth is described, otherwise an arbitrary
|
|
jbe@0
|
304 linear order) */
|
|
jbe@0
|
305 static int pgl_circle_cmp(pgl_circle *circle1, pgl_circle *circle2) {
|
|
jbe@0
|
306 /* two circles with same infinite radius (positive or negative infinity) are
|
|
jbe@0
|
307 considered equal independently of center point */
|
|
jbe@0
|
308 if (
|
|
jbe@0
|
309 !isfinite(circle1->radius) && !isfinite(circle2->radius) &&
|
|
jbe@0
|
310 circle1->radius == circle2->radius
|
|
jbe@0
|
311 ) return 0;
|
|
jbe@0
|
312 /* use radius as first ordering criterion */
|
|
jbe@0
|
313 if (circle1->radius < circle2->radius) return -1;
|
|
jbe@0
|
314 if (circle1->radius > circle2->radius) return 1;
|
|
jbe@0
|
315 /* use center point as secondary ordering criterion */
|
|
jbe@0
|
316 return pgl_point_cmp(&(circle1->center), &(circle2->center));
|
|
jbe@0
|
317 }
|
|
jbe@0
|
318
|
|
jbe@0
|
319 /* set box to empty box*/
|
|
jbe@0
|
320 static void pgl_box_set_empty(pgl_box *box) {
|
|
jbe@0
|
321 box->lat_min = INFINITY;
|
|
jbe@0
|
322 box->lat_max = -INFINITY;
|
|
jbe@0
|
323 box->lon_min = 0;
|
|
jbe@0
|
324 box->lon_max = 0;
|
|
jbe@0
|
325 }
|
|
jbe@0
|
326
|
|
jbe@0
|
327 /* check if point is inside a box */
|
|
jbe@0
|
328 static bool pgl_point_in_box(pgl_point *point, pgl_box *box) {
|
|
jbe@0
|
329 return (
|
|
jbe@0
|
330 point->lat >= box->lat_min && point->lat <= box->lat_max && (
|
|
jbe@0
|
331 (box->lon_min > box->lon_max) ? (
|
|
jbe@0
|
332 /* box crosses 180th meridian */
|
|
jbe@0
|
333 point->lon >= box->lon_min || point->lon <= box->lon_max
|
|
jbe@0
|
334 ) : (
|
|
jbe@0
|
335 /* box does not cross the 180th meridian */
|
|
jbe@0
|
336 point->lon >= box->lon_min && point->lon <= box->lon_max
|
|
jbe@0
|
337 )
|
|
jbe@0
|
338 )
|
|
jbe@0
|
339 );
|
|
jbe@0
|
340 }
|
|
jbe@0
|
341
|
|
jbe@0
|
342 /* check if two boxes overlap */
|
|
jbe@0
|
343 static bool pgl_boxes_overlap(pgl_box *box1, pgl_box *box2) {
|
|
jbe@0
|
344 return (
|
|
jbe@0
|
345 box2->lat_max >= box2->lat_min && /* ensure box2 is not empty */
|
|
jbe@0
|
346 ( box2->lat_min >= box1->lat_min || box2->lat_max >= box1->lat_min ) &&
|
|
jbe@0
|
347 ( box2->lat_min <= box1->lat_max || box2->lat_max <= box1->lat_max ) && (
|
|
jbe@0
|
348 (
|
|
jbe@0
|
349 /* check if one and only one box crosses the 180th meridian */
|
|
jbe@0
|
350 ((box1->lon_min > box1->lon_max) ? 1 : 0) ^
|
|
jbe@0
|
351 ((box2->lon_min > box2->lon_max) ? 1 : 0)
|
|
jbe@0
|
352 ) ? (
|
|
jbe@0
|
353 /* exactly one box crosses the 180th meridian */
|
|
jbe@0
|
354 box2->lon_min >= box1->lon_min || box2->lon_max >= box1->lon_min ||
|
|
jbe@0
|
355 box2->lon_min <= box1->lon_max || box2->lon_max <= box1->lon_max
|
|
jbe@0
|
356 ) : (
|
|
jbe@0
|
357 /* no box or both boxes cross the 180th meridian */
|
|
jbe@0
|
358 (
|
|
jbe@0
|
359 (box2->lon_min >= box1->lon_min || box2->lon_max >= box1->lon_min) &&
|
|
jbe@0
|
360 (box2->lon_min <= box1->lon_max || box2->lon_max <= box1->lon_max)
|
|
jbe@0
|
361 ) ||
|
|
jbe@0
|
362 /* handle W180 == E180 */
|
|
jbe@0
|
363 ( box1->lon_min == -180 && box2->lon_max == 180 ) ||
|
|
jbe@0
|
364 ( box2->lon_min == -180 && box1->lon_max == 180 )
|
|
jbe@0
|
365 )
|
|
jbe@0
|
366 )
|
|
jbe@0
|
367 );
|
|
jbe@0
|
368 }
|
|
jbe@0
|
369
|
|
jbe@0
|
370 /* check unambiguousness of east/west orientation of cluster entries and set
|
|
jbe@0
|
371 bounding circle of cluster */
|
|
jbe@0
|
372 static bool pgl_finalize_cluster(pgl_cluster *cluster) {
|
|
jbe@0
|
373 int i, j; /* i: index of entry, j: index of point in entry */
|
|
jbe@0
|
374 int npoints; /* number of points in entry */
|
|
jbe@0
|
375 int total_npoints = 0; /* total number of points in cluster */
|
|
jbe@0
|
376 pgl_point *points; /* points in entry */
|
|
jbe@0
|
377 int lon_dir; /* first point of entry west (-1) or east (+1) */
|
|
jbe@0
|
378 double lon_break = 0; /* antipodal longitude of first point in entry */
|
|
jbe@0
|
379 double lon_min, lon_max; /* covered longitude range of entry */
|
|
jbe@0
|
380 double value; /* temporary variable */
|
|
jbe@0
|
381 /* reset bounding circle center to empty circle at 0/0 coordinates */
|
|
jbe@0
|
382 cluster->bounding.center.lat = 0;
|
|
jbe@0
|
383 cluster->bounding.center.lon = 0;
|
|
jbe@0
|
384 cluster->bounding.radius = -INFINITY;
|
|
jbe@0
|
385 /* if cluster is not empty */
|
|
jbe@0
|
386 if (cluster->nentries != 0) {
|
|
jbe@0
|
387 /* iterate over all cluster entries and ensure they each cover a longitude
|
|
jbe@0
|
388 range less than 180 degrees */
|
|
jbe@0
|
389 for (i=0; i<cluster->nentries; i++) {
|
|
jbe@0
|
390 /* get properties of entry */
|
|
jbe@0
|
391 npoints = cluster->entries[i].npoints;
|
|
jbe@0
|
392 points = PGL_ENTRY_POINTS(cluster, i);
|
|
jbe@0
|
393 /* get longitude of first point of entry */
|
|
jbe@0
|
394 value = points[0].lon;
|
|
jbe@0
|
395 /* initialize lon_min and lon_max with longitude of first point */
|
|
jbe@0
|
396 lon_min = value;
|
|
jbe@0
|
397 lon_max = value;
|
|
jbe@0
|
398 /* determine east/west orientation of first point and calculate antipodal
|
|
jbe@0
|
399 longitude (Note: rounding required here) */
|
|
jbe@0
|
400 if (value < 0) { lon_dir = -1; lon_break = pgl_round(value + 180); }
|
|
jbe@0
|
401 else if (value > 0) { lon_dir = 1; lon_break = pgl_round(value - 180); }
|
|
jbe@0
|
402 else lon_dir = 0;
|
|
jbe@0
|
403 /* iterate over all other points in entry */
|
|
jbe@0
|
404 for (j=1; j<npoints; j++) {
|
|
jbe@0
|
405 /* consider longitude wrap-around */
|
|
jbe@0
|
406 value = points[j].lon;
|
|
jbe@0
|
407 if (lon_dir<0 && value>lon_break) value = pgl_round(value - 360);
|
|
jbe@0
|
408 else if (lon_dir>0 && value<lon_break) value = pgl_round(value + 360);
|
|
jbe@0
|
409 /* update lon_min and lon_max */
|
|
jbe@0
|
410 if (value < lon_min) lon_min = value;
|
|
jbe@0
|
411 else if (value > lon_max) lon_max = value;
|
|
jbe@0
|
412 /* return false if 180 degrees or more are covered */
|
|
jbe@0
|
413 if (lon_max - lon_min >= 180) return false;
|
|
jbe@0
|
414 }
|
|
jbe@0
|
415 }
|
|
jbe@0
|
416 /* iterate over all points of all entries and calculate arbitrary center
|
|
jbe@0
|
417 point for bounding circle (best if center point minimizes the radius,
|
|
jbe@0
|
418 but some error is allowed here) */
|
|
jbe@0
|
419 for (i=0; i<cluster->nentries; i++) {
|
|
jbe@0
|
420 /* get properties of entry */
|
|
jbe@0
|
421 npoints = cluster->entries[i].npoints;
|
|
jbe@0
|
422 points = PGL_ENTRY_POINTS(cluster, i);
|
|
jbe@0
|
423 /* check if first entry */
|
|
jbe@0
|
424 if (i==0) {
|
|
jbe@0
|
425 /* get longitude of first point of first entry in whole cluster */
|
|
jbe@0
|
426 value = points[0].lon;
|
|
jbe@0
|
427 /* initialize lon_min and lon_max with longitude of first point of
|
|
jbe@0
|
428 first entry in whole cluster (used to determine if whole cluster
|
|
jbe@0
|
429 covers a longitude range of 180 degrees or more) */
|
|
jbe@0
|
430 lon_min = value;
|
|
jbe@0
|
431 lon_max = value;
|
|
jbe@0
|
432 /* determine east/west orientation of first point and calculate
|
|
jbe@0
|
433 antipodal longitude (Note: rounding not necessary here) */
|
|
jbe@0
|
434 if (value < 0) { lon_dir = -1; lon_break = value + 180; }
|
|
jbe@0
|
435 else if (value > 0) { lon_dir = 1; lon_break = value - 180; }
|
|
jbe@0
|
436 else lon_dir = 0;
|
|
jbe@0
|
437 }
|
|
jbe@0
|
438 /* iterate over all points in entry */
|
|
jbe@0
|
439 for (j=0; j<npoints; j++) {
|
|
jbe@0
|
440 /* longitude wrap-around (Note: rounding not necessary here) */
|
|
jbe@0
|
441 value = points[j].lon;
|
|
jbe@0
|
442 if (lon_dir < 0 && value > lon_break) value -= 360;
|
|
jbe@0
|
443 else if (lon_dir > 0 && value < lon_break) value += 360;
|
|
jbe@0
|
444 if (value < lon_min) lon_min = value;
|
|
jbe@0
|
445 else if (value > lon_max) lon_max = value;
|
|
jbe@0
|
446 /* set bounding circle to cover whole earth if more than 180 degrees
|
|
jbe@0
|
447 are covered */
|
|
jbe@0
|
448 if (lon_max - lon_min >= 180) {
|
|
jbe@0
|
449 cluster->bounding.center.lat = 0;
|
|
jbe@0
|
450 cluster->bounding.center.lon = 0;
|
|
jbe@0
|
451 cluster->bounding.radius = INFINITY;
|
|
jbe@0
|
452 return true;
|
|
jbe@0
|
453 }
|
|
jbe@0
|
454 /* add point to bounding circle center (for average calculation) */
|
|
jbe@0
|
455 cluster->bounding.center.lat += points[j].lat;
|
|
jbe@0
|
456 cluster->bounding.center.lon += value;
|
|
jbe@0
|
457 }
|
|
jbe@0
|
458 /* count total number of points */
|
|
jbe@0
|
459 total_npoints += npoints;
|
|
jbe@0
|
460 }
|
|
jbe@0
|
461 /* determine average latitude and longitude of cluster */
|
|
jbe@0
|
462 cluster->bounding.center.lat /= total_npoints;
|
|
jbe@0
|
463 cluster->bounding.center.lon /= total_npoints;
|
|
jbe@0
|
464 /* normalize longitude of center of cluster bounding circle */
|
|
jbe@0
|
465 if (cluster->bounding.center.lon < -180) {
|
|
jbe@0
|
466 cluster->bounding.center.lon += 360;
|
|
jbe@0
|
467 }
|
|
jbe@0
|
468 else if (cluster->bounding.center.lon > 180) {
|
|
jbe@0
|
469 cluster->bounding.center.lon -= 360;
|
|
jbe@0
|
470 }
|
|
jbe@0
|
471 /* round bounding circle center (useful if it is used by other functions) */
|
|
jbe@0
|
472 cluster->bounding.center.lat = pgl_round(cluster->bounding.center.lat);
|
|
jbe@0
|
473 cluster->bounding.center.lon = pgl_round(cluster->bounding.center.lon);
|
|
jbe@0
|
474 /* calculate radius of bounding circle */
|
|
jbe@0
|
475 for (i=0; i<cluster->nentries; i++) {
|
|
jbe@0
|
476 npoints = cluster->entries[i].npoints;
|
|
jbe@0
|
477 points = PGL_ENTRY_POINTS(cluster, i);
|
|
jbe@0
|
478 for (j=0; j<npoints; j++) {
|
|
jbe@0
|
479 value = pgl_distance(
|
|
jbe@0
|
480 cluster->bounding.center.lat, cluster->bounding.center.lon,
|
|
jbe@0
|
481 points[j].lat, points[j].lon
|
|
jbe@0
|
482 );
|
|
jbe@0
|
483 if (value > cluster->bounding.radius) cluster->bounding.radius = value;
|
|
jbe@0
|
484 }
|
|
jbe@0
|
485 }
|
|
jbe@0
|
486 }
|
|
jbe@0
|
487 /* return true (east/west orientation is unambiguous) */
|
|
jbe@0
|
488 return true;
|
|
jbe@0
|
489 }
|
|
jbe@0
|
490
|
|
jbe@0
|
491 /* check if point is inside cluster */
|
|
jbe@20
|
492 /* (if point is on perimeter, then true is returned if and only if
|
|
jbe@20
|
493 strict == false) */
|
|
jbe@20
|
494 static bool pgl_point_in_cluster(
|
|
jbe@20
|
495 pgl_point *point,
|
|
jbe@20
|
496 pgl_cluster *cluster,
|
|
jbe@20
|
497 bool strict
|
|
jbe@20
|
498 ) {
|
|
jbe@0
|
499 int i, j, k; /* i: entry, j: point in entry, k: next point in entry */
|
|
jbe@0
|
500 int entrytype; /* type of entry */
|
|
jbe@0
|
501 int npoints; /* number of points in entry */
|
|
jbe@0
|
502 pgl_point *points; /* array of points in entry */
|
|
jbe@0
|
503 int lon_dir = 0; /* first vertex west (-1) or east (+1) */
|
|
jbe@0
|
504 double lon_break = 0; /* antipodal longitude of first vertex */
|
|
jbe@0
|
505 double lat0 = point->lat; /* latitude of point */
|
|
jbe@0
|
506 double lon0; /* (adjusted) longitude of point */
|
|
jbe@0
|
507 double lat1, lon1; /* latitude and (adjusted) longitude of vertex */
|
|
jbe@0
|
508 double lat2, lon2; /* latitude and (adjusted) longitude of next vertex */
|
|
jbe@0
|
509 double lon; /* longitude of intersection */
|
|
jbe@0
|
510 int counter = 0; /* counter for intersections east of point */
|
|
jbe@0
|
511 /* iterate over all entries */
|
|
jbe@0
|
512 for (i=0; i<cluster->nentries; i++) {
|
|
jbe@20
|
513 /* get type of entry */
|
|
jbe@0
|
514 entrytype = cluster->entries[i].entrytype;
|
|
jbe@20
|
515 /* skip all entries but polygons if perimeters are excluded */
|
|
jbe@20
|
516 if (strict && entrytype != PGL_ENTRY_POLYGON) continue;
|
|
jbe@20
|
517 /* get points of entry */
|
|
jbe@0
|
518 npoints = cluster->entries[i].npoints;
|
|
jbe@0
|
519 points = PGL_ENTRY_POINTS(cluster, i);
|
|
jbe@0
|
520 /* determine east/west orientation of first point of entry and calculate
|
|
jbe@0
|
521 antipodal longitude */
|
|
jbe@0
|
522 lon_break = points[0].lon;
|
|
jbe@0
|
523 if (lon_break < 0) { lon_dir = -1; lon_break += 180; }
|
|
jbe@0
|
524 else if (lon_break > 0) { lon_dir = 1; lon_break -= 180; }
|
|
jbe@0
|
525 else lon_dir = 0;
|
|
jbe@0
|
526 /* get longitude of point */
|
|
jbe@0
|
527 lon0 = point->lon;
|
|
jbe@0
|
528 /* consider longitude wrap-around for point */
|
|
jbe@0
|
529 if (lon_dir < 0 && lon0 > lon_break) lon0 = pgl_round(lon0 - 360);
|
|
jbe@0
|
530 else if (lon_dir > 0 && lon0 < lon_break) lon0 = pgl_round(lon0 + 360);
|
|
jbe@0
|
531 /* iterate over all edges and vertices */
|
|
jbe@0
|
532 for (j=0; j<npoints; j++) {
|
|
jbe@20
|
533 /* return if point is on vertex of polygon */
|
|
jbe@20
|
534 if (pgl_point_cmp(point, &(points[j])) == 0) return !strict;
|
|
jbe@0
|
535 /* calculate index of next vertex */
|
|
jbe@0
|
536 k = (j+1) % npoints;
|
|
jbe@0
|
537 /* skip last edge unless entry is (closed) outline or polygon */
|
|
jbe@0
|
538 if (
|
|
jbe@0
|
539 k == 0 &&
|
|
jbe@0
|
540 entrytype != PGL_ENTRY_OUTLINE &&
|
|
jbe@0
|
541 entrytype != PGL_ENTRY_POLYGON
|
|
jbe@0
|
542 ) continue;
|
|
jbe@16
|
543 /* use previously calculated values for lat1 and lon1 if possible */
|
|
jbe@16
|
544 if (j) {
|
|
jbe@16
|
545 lat1 = lat2;
|
|
jbe@16
|
546 lon1 = lon2;
|
|
jbe@16
|
547 } else {
|
|
jbe@16
|
548 /* otherwise get latitude and longitude values of first vertex */
|
|
jbe@16
|
549 lat1 = points[0].lat;
|
|
jbe@16
|
550 lon1 = points[0].lon;
|
|
jbe@16
|
551 /* and consider longitude wrap-around for first vertex */
|
|
jbe@16
|
552 if (lon_dir < 0 && lon1 > lon_break) lon1 = pgl_round(lon1 - 360);
|
|
jbe@16
|
553 else if (lon_dir > 0 && lon1 < lon_break) lon1 = pgl_round(lon1 + 360);
|
|
jbe@16
|
554 }
|
|
jbe@16
|
555 /* get latitude and longitude of next vertex */
|
|
jbe@0
|
556 lat2 = points[k].lat;
|
|
jbe@0
|
557 lon2 = points[k].lon;
|
|
jbe@16
|
558 /* consider longitude wrap-around for next vertex */
|
|
jbe@0
|
559 if (lon_dir < 0 && lon2 > lon_break) lon2 = pgl_round(lon2 - 360);
|
|
jbe@0
|
560 else if (lon_dir > 0 && lon2 < lon_break) lon2 = pgl_round(lon2 + 360);
|
|
jbe@20
|
561 /* return if point is on horizontal (west to east) edge of polygon */
|
|
jbe@0
|
562 if (
|
|
jbe@0
|
563 lat0 == lat1 && lat0 == lat2 &&
|
|
jbe@0
|
564 ( (lon0 >= lon1 && lon0 <= lon2) || (lon0 >= lon2 && lon0 <= lon1) )
|
|
jbe@20
|
565 ) return !strict;
|
|
jbe@0
|
566 /* check if edge crosses east/west line of point */
|
|
jbe@0
|
567 if ((lat1 < lat0 && lat2 >= lat0) || (lat2 < lat0 && lat1 >= lat0)) {
|
|
jbe@0
|
568 /* calculate longitude of intersection */
|
|
jbe@0
|
569 lon = (lon1 * (lat2-lat0) + lon2 * (lat0-lat1)) / (lat2-lat1);
|
|
jbe@20
|
570 /* return if intersection goes (approximately) through point */
|
|
jbe@20
|
571 if (pgl_round(lon) == lon0) return !strict;
|
|
jbe@0
|
572 /* count intersection if east of point and entry is polygon*/
|
|
jbe@0
|
573 if (entrytype == PGL_ENTRY_POLYGON && lon > lon0) counter++;
|
|
jbe@0
|
574 }
|
|
jbe@0
|
575 }
|
|
jbe@0
|
576 }
|
|
jbe@0
|
577 /* return true if number of intersections is odd */
|
|
jbe@0
|
578 return counter & 1;
|
|
jbe@0
|
579 }
|
|
jbe@0
|
580
|
|
jbe@20
|
581 /* check if all points of the second cluster are strictly inside the first
|
|
jbe@20
|
582 cluster */
|
|
jbe@20
|
583 static inline bool pgl_all_cluster_points_strictly_in_cluster(
|
|
jbe@16
|
584 pgl_cluster *outer, pgl_cluster *inner
|
|
jbe@16
|
585 ) {
|
|
jbe@16
|
586 int i, j; /* i: entry, j: point in entry */
|
|
jbe@16
|
587 int npoints; /* number of points in entry */
|
|
jbe@16
|
588 pgl_point *points; /* array of points in entry */
|
|
jbe@16
|
589 /* iterate over all entries of "inner" cluster */
|
|
jbe@16
|
590 for (i=0; i<inner->nentries; i++) {
|
|
jbe@16
|
591 /* get properties of entry */
|
|
jbe@16
|
592 npoints = inner->entries[i].npoints;
|
|
jbe@16
|
593 points = PGL_ENTRY_POINTS(inner, i);
|
|
jbe@16
|
594 /* iterate over all points in entry of "inner" cluster */
|
|
jbe@16
|
595 for (j=0; j<npoints; j++) {
|
|
jbe@16
|
596 /* return false if one point of inner cluster is not in outer cluster */
|
|
jbe@20
|
597 if (!pgl_point_in_cluster(points+j, outer, true)) return false;
|
|
jbe@16
|
598 }
|
|
jbe@16
|
599 }
|
|
jbe@16
|
600 /* otherwise return true */
|
|
jbe@16
|
601 return true;
|
|
jbe@16
|
602 }
|
|
jbe@16
|
603
|
|
jbe@16
|
604 /* check if any point the second cluster is inside the first cluster */
|
|
jbe@16
|
605 static inline bool pgl_any_cluster_points_in_cluster(
|
|
jbe@16
|
606 pgl_cluster *outer, pgl_cluster *inner
|
|
jbe@16
|
607 ) {
|
|
jbe@16
|
608 int i, j; /* i: entry, j: point in entry */
|
|
jbe@16
|
609 int npoints; /* number of points in entry */
|
|
jbe@16
|
610 pgl_point *points; /* array of points in entry */
|
|
jbe@16
|
611 /* iterate over all entries of "inner" cluster */
|
|
jbe@16
|
612 for (i=0; i<inner->nentries; i++) {
|
|
jbe@16
|
613 /* get properties of entry */
|
|
jbe@16
|
614 npoints = inner->entries[i].npoints;
|
|
jbe@16
|
615 points = PGL_ENTRY_POINTS(inner, i);
|
|
jbe@16
|
616 /* iterate over all points in entry of "inner" cluster */
|
|
jbe@16
|
617 for (j=0; j<npoints; j++) {
|
|
jbe@16
|
618 /* return true if one point of inner cluster is in outer cluster */
|
|
jbe@20
|
619 if (pgl_point_in_cluster(points+j, outer, false)) return true;
|
|
jbe@16
|
620 }
|
|
jbe@16
|
621 }
|
|
jbe@16
|
622 /* otherwise return false */
|
|
jbe@16
|
623 return false;
|
|
jbe@16
|
624 }
|
|
jbe@16
|
625
|
|
jbe@20
|
626 /* check if line segment strictly crosses line (not just touching) */
|
|
jbe@20
|
627 static inline bool pgl_lseg_crosses_line(
|
|
jbe@16
|
628 double seg_x1, double seg_y1, double seg_x2, double seg_y2,
|
|
jbe@20
|
629 double line_x1, double line_y1, double line_x2, double line_y2
|
|
jbe@16
|
630 ) {
|
|
jbe@20
|
631 return (
|
|
jbe@20
|
632 (
|
|
jbe@20
|
633 (seg_x1-line_x1) * (line_y2-line_y1) -
|
|
jbe@20
|
634 (seg_y1-line_y1) * (line_x2-line_x1)
|
|
jbe@20
|
635 ) * (
|
|
jbe@20
|
636 (seg_x2-line_x1) * (line_y2-line_y1) -
|
|
jbe@20
|
637 (seg_y2-line_y1) * (line_x2-line_x1)
|
|
jbe@20
|
638 )
|
|
jbe@20
|
639 ) < 0;
|
|
jbe@16
|
640 }
|
|
jbe@16
|
641
|
|
jbe@20
|
642 /* check if paths and outlines of two clusters strictly overlap (not just
|
|
jbe@20
|
643 touching) */
|
|
jbe@16
|
644 static bool pgl_outlines_overlap(
|
|
jbe@20
|
645 pgl_cluster *cluster1, pgl_cluster *cluster2
|
|
jbe@16
|
646 ) {
|
|
jbe@16
|
647 int i1, j1, k1; /* i: entry, j: point in entry, k: next point in entry */
|
|
jbe@16
|
648 int i2, j2, k2;
|
|
jbe@16
|
649 int entrytype1, entrytype2; /* type of entry */
|
|
jbe@16
|
650 int npoints1, npoints2; /* number of points in entry */
|
|
jbe@16
|
651 pgl_point *points1; /* array of points in entry of cluster1 */
|
|
jbe@16
|
652 pgl_point *points2; /* array of points in entry of cluster2 */
|
|
jbe@16
|
653 int lon_dir1, lon_dir2; /* first vertex west (-1) or east (+1) */
|
|
jbe@16
|
654 double lon_break1, lon_break2; /* antipodal longitude of first vertex */
|
|
jbe@16
|
655 double lat11, lon11; /* latitude and (adjusted) longitude of vertex */
|
|
jbe@16
|
656 double lat12, lon12; /* latitude and (adjusted) longitude of next vertex */
|
|
jbe@16
|
657 double lat21, lon21; /* latitude and (adjusted) longitudes for cluster2 */
|
|
jbe@16
|
658 double lat22, lon22;
|
|
jbe@16
|
659 double wrapvalue; /* temporary helper value to adjust wrap-around */
|
|
jbe@16
|
660 /* iterate over all entries of cluster1 */
|
|
jbe@16
|
661 for (i1=0; i1<cluster1->nentries; i1++) {
|
|
jbe@16
|
662 /* get properties of entry in cluster1 and skip points */
|
|
jbe@16
|
663 npoints1 = cluster1->entries[i1].npoints;
|
|
jbe@16
|
664 if (npoints1 < 2) continue;
|
|
jbe@16
|
665 entrytype1 = cluster1->entries[i1].entrytype;
|
|
jbe@16
|
666 points1 = PGL_ENTRY_POINTS(cluster1, i1);
|
|
jbe@16
|
667 /* determine east/west orientation of first point and calculate antipodal
|
|
jbe@16
|
668 longitude */
|
|
jbe@16
|
669 lon_break1 = points1[0].lon;
|
|
jbe@16
|
670 if (lon_break1 < 0) {
|
|
jbe@16
|
671 lon_dir1 = -1;
|
|
jbe@16
|
672 lon_break1 = pgl_round(lon_break1 + 180);
|
|
jbe@16
|
673 } else if (lon_break1 > 0) {
|
|
jbe@16
|
674 lon_dir1 = 1;
|
|
jbe@16
|
675 lon_break1 = pgl_round(lon_break1 - 180);
|
|
jbe@16
|
676 } else lon_dir1 = 0;
|
|
jbe@16
|
677 /* iterate over all edges and vertices in cluster1 */
|
|
jbe@16
|
678 for (j1=0; j1<npoints1; j1++) {
|
|
jbe@16
|
679 /* calculate index of next vertex */
|
|
jbe@16
|
680 k1 = (j1+1) % npoints1;
|
|
jbe@16
|
681 /* skip last edge unless entry is (closed) outline or polygon */
|
|
jbe@16
|
682 if (
|
|
jbe@16
|
683 k1 == 0 &&
|
|
jbe@16
|
684 entrytype1 != PGL_ENTRY_OUTLINE &&
|
|
jbe@16
|
685 entrytype1 != PGL_ENTRY_POLYGON
|
|
jbe@16
|
686 ) continue;
|
|
jbe@16
|
687 /* use previously calculated values for lat1 and lon1 if possible */
|
|
jbe@16
|
688 if (j1) {
|
|
jbe@16
|
689 lat11 = lat12;
|
|
jbe@16
|
690 lon11 = lon12;
|
|
jbe@16
|
691 } else {
|
|
jbe@16
|
692 /* otherwise get latitude and longitude values of first vertex */
|
|
jbe@16
|
693 lat11 = points1[0].lat;
|
|
jbe@16
|
694 lon11 = points1[0].lon;
|
|
jbe@16
|
695 /* and consider longitude wrap-around for first vertex */
|
|
jbe@16
|
696 if (lon_dir1<0 && lon11>lon_break1) lon11 = pgl_round(lon11-360);
|
|
jbe@16
|
697 else if (lon_dir1>0 && lon11<lon_break1) lon11 = pgl_round(lon11+360);
|
|
jbe@16
|
698 }
|
|
jbe@16
|
699 /* get latitude and longitude of next vertex */
|
|
jbe@16
|
700 lat12 = points1[k1].lat;
|
|
jbe@16
|
701 lon12 = points1[k1].lon;
|
|
jbe@16
|
702 /* consider longitude wrap-around for next vertex */
|
|
jbe@16
|
703 if (lon_dir1<0 && lon12>lon_break1) lon12 = pgl_round(lon12-360);
|
|
jbe@16
|
704 else if (lon_dir1>0 && lon12<lon_break1) lon12 = pgl_round(lon12+360);
|
|
jbe@16
|
705 /* skip degenerated edges */
|
|
jbe@16
|
706 if (lat11 == lat12 && lon11 == lon12) continue;
|
|
jbe@16
|
707 /* iterate over all entries of cluster2 */
|
|
jbe@16
|
708 for (i2=0; i2<cluster2->nentries; i2++) {
|
|
jbe@16
|
709 /* get points and number of points of entry in cluster2 */
|
|
jbe@16
|
710 npoints2 = cluster2->entries[i2].npoints;
|
|
jbe@16
|
711 if (npoints2 < 2) continue;
|
|
jbe@16
|
712 entrytype2 = cluster2->entries[i2].entrytype;
|
|
jbe@16
|
713 points2 = PGL_ENTRY_POINTS(cluster2, i2);
|
|
jbe@16
|
714 /* determine east/west orientation of first point and calculate antipodal
|
|
jbe@16
|
715 longitude */
|
|
jbe@16
|
716 lon_break2 = points2[0].lon;
|
|
jbe@16
|
717 if (lon_break2 < 0) {
|
|
jbe@16
|
718 lon_dir2 = -1;
|
|
jbe@16
|
719 lon_break2 = pgl_round(lon_break2 + 180);
|
|
jbe@16
|
720 } else if (lon_break2 > 0) {
|
|
jbe@16
|
721 lon_dir2 = 1;
|
|
jbe@16
|
722 lon_break2 = pgl_round(lon_break2 - 180);
|
|
jbe@16
|
723 } else lon_dir2 = 0;
|
|
jbe@16
|
724 /* iterate over all edges and vertices in cluster2 */
|
|
jbe@16
|
725 for (j2=0; j2<npoints2; j2++) {
|
|
jbe@16
|
726 /* calculate index of next vertex */
|
|
jbe@16
|
727 k2 = (j2+1) % npoints2;
|
|
jbe@16
|
728 /* skip last edge unless entry is (closed) outline or polygon */
|
|
jbe@16
|
729 if (
|
|
jbe@16
|
730 k2 == 0 &&
|
|
jbe@16
|
731 entrytype2 != PGL_ENTRY_OUTLINE &&
|
|
jbe@16
|
732 entrytype2 != PGL_ENTRY_POLYGON
|
|
jbe@16
|
733 ) continue;
|
|
jbe@16
|
734 /* use previously calculated values for lat1 and lon1 if possible */
|
|
jbe@16
|
735 if (j2) {
|
|
jbe@16
|
736 lat21 = lat22;
|
|
jbe@16
|
737 lon21 = lon22;
|
|
jbe@16
|
738 } else {
|
|
jbe@16
|
739 /* otherwise get latitude and longitude values of first vertex */
|
|
jbe@16
|
740 lat21 = points2[0].lat;
|
|
jbe@16
|
741 lon21 = points2[0].lon;
|
|
jbe@16
|
742 /* and consider longitude wrap-around for first vertex */
|
|
jbe@16
|
743 if (lon_dir2<0 && lon21>lon_break2) lon21 = pgl_round(lon21-360);
|
|
jbe@16
|
744 else if (lon_dir2>0 && lon21<lon_break2) lon21 = pgl_round(lon21+360);
|
|
jbe@16
|
745 }
|
|
jbe@16
|
746 /* get latitude and longitude of next vertex */
|
|
jbe@16
|
747 lat22 = points2[k2].lat;
|
|
jbe@16
|
748 lon22 = points2[k2].lon;
|
|
jbe@16
|
749 /* consider longitude wrap-around for next vertex */
|
|
jbe@16
|
750 if (lon_dir2<0 && lon22>lon_break2) lon22 = pgl_round(lon22-360);
|
|
jbe@16
|
751 else if (lon_dir2>0 && lon22<lon_break2) lon22 = pgl_round(lon22+360);
|
|
jbe@16
|
752 /* skip degenerated edges */
|
|
jbe@16
|
753 if (lat21 == lat22 && lon21 == lon22) continue;
|
|
jbe@16
|
754 /* perform another wrap-around where necessary */
|
|
jbe@16
|
755 /* TODO: improve performance of whole wrap-around mechanism */
|
|
jbe@16
|
756 wrapvalue = (lon21 + lon22) - (lon11 + lon12);
|
|
jbe@16
|
757 if (wrapvalue > 360) {
|
|
jbe@16
|
758 lon21 = pgl_round(lon21 - 360);
|
|
jbe@16
|
759 lon22 = pgl_round(lon22 - 360);
|
|
jbe@16
|
760 } else if (wrapvalue < -360) {
|
|
jbe@16
|
761 lon21 = pgl_round(lon21 + 360);
|
|
jbe@16
|
762 lon22 = pgl_round(lon22 + 360);
|
|
jbe@16
|
763 }
|
|
jbe@16
|
764 /* return true if segments overlap */
|
|
jbe@16
|
765 if (
|
|
jbe@16
|
766 pgl_lseg_crosses_line(
|
|
jbe@16
|
767 lat11, lon11, lat12, lon12,
|
|
jbe@20
|
768 lat21, lon21, lat22, lon22
|
|
jbe@16
|
769 ) && pgl_lseg_crosses_line(
|
|
jbe@16
|
770 lat21, lon21, lat22, lon22,
|
|
jbe@20
|
771 lat11, lon11, lat12, lon12
|
|
jbe@16
|
772 )
|
|
jbe@16
|
773 ) {
|
|
jbe@16
|
774 return true;
|
|
jbe@16
|
775 }
|
|
jbe@16
|
776 }
|
|
jbe@16
|
777 }
|
|
jbe@16
|
778 }
|
|
jbe@16
|
779 }
|
|
jbe@16
|
780 /* otherwise return false */
|
|
jbe@16
|
781 return false;
|
|
jbe@16
|
782 }
|
|
jbe@16
|
783
|
|
jbe@16
|
784 /* check if second cluster is completely contained in first cluster */
|
|
jbe@16
|
785 static bool pgl_cluster_in_cluster(pgl_cluster *outer, pgl_cluster *inner) {
|
|
jbe@20
|
786 if (!pgl_all_cluster_points_strictly_in_cluster(outer, inner)) return false;
|
|
jbe@20
|
787 if (pgl_any_cluster_points_in_cluster(inner, outer)) return false;
|
|
jbe@20
|
788 if (pgl_outlines_overlap(outer, inner)) return false;
|
|
jbe@16
|
789 return true;
|
|
jbe@16
|
790 }
|
|
jbe@16
|
791
|
|
jbe@16
|
792 /* check if two clusters overlap */
|
|
jbe@16
|
793 static bool pgl_clusters_overlap(
|
|
jbe@16
|
794 pgl_cluster *cluster1, pgl_cluster *cluster2
|
|
jbe@16
|
795 ) {
|
|
jbe@16
|
796 if (pgl_any_cluster_points_in_cluster(cluster1, cluster2)) return true;
|
|
jbe@16
|
797 if (pgl_any_cluster_points_in_cluster(cluster2, cluster1)) return true;
|
|
jbe@20
|
798 if (pgl_outlines_overlap(cluster1, cluster2)) return true;
|
|
jbe@16
|
799 return false;
|
|
jbe@16
|
800 }
|
|
jbe@16
|
801
|
|
jbe@16
|
802
|
|
jbe@0
|
803 /* calculate (approximate) distance between point and cluster */
|
|
jbe@0
|
804 static double pgl_point_cluster_distance(pgl_point *point, pgl_cluster *cluster) {
|
|
jbe@24
|
805 double comp; /* square of compression of meridians */
|
|
jbe@0
|
806 int i, j, k; /* i: entry, j: point in entry, k: next point in entry */
|
|
jbe@0
|
807 int entrytype; /* type of entry */
|
|
jbe@0
|
808 int npoints; /* number of points in entry */
|
|
jbe@0
|
809 pgl_point *points; /* array of points in entry */
|
|
jbe@0
|
810 int lon_dir = 0; /* first vertex west (-1) or east (+1) */
|
|
jbe@0
|
811 double lon_break = 0; /* antipodal longitude of first vertex */
|
|
jbe@0
|
812 double lon_min = 0; /* minimum (adjusted) longitude of entry vertices */
|
|
jbe@0
|
813 double lon_max = 0; /* maximum (adjusted) longitude of entry vertices */
|
|
jbe@0
|
814 double lat0 = point->lat; /* latitude of point */
|
|
jbe@0
|
815 double lon0; /* (adjusted) longitude of point */
|
|
jbe@0
|
816 double lat1, lon1; /* latitude and (adjusted) longitude of vertex */
|
|
jbe@0
|
817 double lat2, lon2; /* latitude and (adjusted) longitude of next vertex */
|
|
jbe@0
|
818 double s; /* scalar for vector calculations */
|
|
jbe@0
|
819 double dist; /* distance calculated in one step */
|
|
jbe@0
|
820 double min_dist = INFINITY; /* minimum distance */
|
|
jbe@0
|
821 /* distance is zero if point is contained in cluster */
|
|
jbe@20
|
822 if (pgl_point_in_cluster(point, cluster, false)) return 0;
|
|
jbe@24
|
823 /* calculate (approximate) square compression of meridians */
|
|
jbe@24
|
824 /* TODO: use more exact formula based on WGS-84 */
|
|
jbe@24
|
825 comp = cos((lat0 / 180.0) * M_PI);
|
|
jbe@24
|
826 comp *= comp;
|
|
jbe@0
|
827 /* iterate over all entries */
|
|
jbe@0
|
828 for (i=0; i<cluster->nentries; i++) {
|
|
jbe@0
|
829 /* get properties of entry */
|
|
jbe@0
|
830 entrytype = cluster->entries[i].entrytype;
|
|
jbe@0
|
831 npoints = cluster->entries[i].npoints;
|
|
jbe@0
|
832 points = PGL_ENTRY_POINTS(cluster, i);
|
|
jbe@0
|
833 /* determine east/west orientation of first point of entry and calculate
|
|
jbe@0
|
834 antipodal longitude */
|
|
jbe@0
|
835 lon_break = points[0].lon;
|
|
jbe@0
|
836 if (lon_break < 0) { lon_dir = -1; lon_break += 180; }
|
|
jbe@0
|
837 else if (lon_break > 0) { lon_dir = 1; lon_break -= 180; }
|
|
jbe@0
|
838 else lon_dir = 0;
|
|
jbe@0
|
839 /* determine covered longitude range */
|
|
jbe@0
|
840 for (j=0; j<npoints; j++) {
|
|
jbe@0
|
841 /* get longitude of vertex */
|
|
jbe@0
|
842 lon1 = points[j].lon;
|
|
jbe@0
|
843 /* adjust longitude to fix potential wrap-around */
|
|
jbe@0
|
844 if (lon_dir < 0 && lon1 > lon_break) lon1 -= 360;
|
|
jbe@0
|
845 else if (lon_dir > 0 && lon1 < lon_break) lon1 += 360;
|
|
jbe@0
|
846 /* update minimum and maximum longitude of polygon */
|
|
jbe@0
|
847 if (j == 0 || lon1 < lon_min) lon_min = lon1;
|
|
jbe@0
|
848 if (j == 0 || lon1 > lon_max) lon_max = lon1;
|
|
jbe@0
|
849 }
|
|
jbe@0
|
850 /* adjust longitude wrap-around according to full longitude range */
|
|
jbe@0
|
851 lon_break = (lon_max + lon_min) / 2;
|
|
jbe@0
|
852 if (lon_break < 0) { lon_dir = -1; lon_break += 180; }
|
|
jbe@0
|
853 else if (lon_break > 0) { lon_dir = 1; lon_break -= 180; }
|
|
jbe@0
|
854 /* get longitude of point */
|
|
jbe@0
|
855 lon0 = point->lon;
|
|
jbe@0
|
856 /* consider longitude wrap-around for point */
|
|
jbe@0
|
857 if (lon_dir < 0 && lon0 > lon_break) lon0 -= 360;
|
|
jbe@0
|
858 else if (lon_dir > 0 && lon0 < lon_break) lon0 += 360;
|
|
jbe@0
|
859 /* iterate over all edges and vertices */
|
|
jbe@0
|
860 for (j=0; j<npoints; j++) {
|
|
jbe@16
|
861 /* use previously calculated values for lat1 and lon1 if possible */
|
|
jbe@16
|
862 if (j) {
|
|
jbe@16
|
863 lat1 = lat2;
|
|
jbe@16
|
864 lon1 = lon2;
|
|
jbe@16
|
865 } else {
|
|
jbe@16
|
866 /* otherwise get latitude and longitude values of first vertex */
|
|
jbe@16
|
867 lat1 = points[0].lat;
|
|
jbe@16
|
868 lon1 = points[0].lon;
|
|
jbe@16
|
869 /* and consider longitude wrap-around for first vertex */
|
|
jbe@16
|
870 if (lon_dir < 0 && lon1 > lon_break) lon1 -= 360;
|
|
jbe@16
|
871 else if (lon_dir > 0 && lon1 < lon_break) lon1 += 360;
|
|
jbe@16
|
872 }
|
|
jbe@0
|
873 /* calculate distance to vertex */
|
|
jbe@0
|
874 dist = pgl_distance(lat0, lon0, lat1, lon1);
|
|
jbe@0
|
875 /* store calculated distance if smallest */
|
|
jbe@0
|
876 if (dist < min_dist) min_dist = dist;
|
|
jbe@0
|
877 /* calculate index of next vertex */
|
|
jbe@0
|
878 k = (j+1) % npoints;
|
|
jbe@0
|
879 /* skip last edge unless entry is (closed) outline or polygon */
|
|
jbe@0
|
880 if (
|
|
jbe@0
|
881 k == 0 &&
|
|
jbe@0
|
882 entrytype != PGL_ENTRY_OUTLINE &&
|
|
jbe@0
|
883 entrytype != PGL_ENTRY_POLYGON
|
|
jbe@0
|
884 ) continue;
|
|
jbe@16
|
885 /* get latitude and longitude of next vertex */
|
|
jbe@0
|
886 lat2 = points[k].lat;
|
|
jbe@0
|
887 lon2 = points[k].lon;
|
|
jbe@16
|
888 /* consider longitude wrap-around for next vertex */
|
|
jbe@0
|
889 if (lon_dir < 0 && lon2 > lon_break) lon2 -= 360;
|
|
jbe@0
|
890 else if (lon_dir > 0 && lon2 < lon_break) lon2 += 360;
|
|
jbe@0
|
891 /* go to next vertex and edge if edge is degenerated */
|
|
jbe@0
|
892 if (lat1 == lat2 && lon1 == lon2) continue;
|
|
jbe@0
|
893 /* otherwise test if point can be projected onto edge of polygon */
|
|
jbe@0
|
894 s = (
|
|
jbe@24
|
895 ((lat0-lat1) * (lat2-lat1) + comp * (lon0-lon1) * (lon2-lon1)) /
|
|
jbe@24
|
896 ((lat2-lat1) * (lat2-lat1) + comp * (lon2-lon1) * (lon2-lon1))
|
|
jbe@0
|
897 );
|
|
jbe@0
|
898 /* go to next vertex and edge if point cannot be projected */
|
|
jbe@0
|
899 if (!(s > 0 && s < 1)) continue;
|
|
jbe@0
|
900 /* calculate distance from original point to projected point */
|
|
jbe@0
|
901 dist = pgl_distance(
|
|
jbe@0
|
902 lat0, lon0,
|
|
jbe@0
|
903 lat1 + s * (lat2-lat1),
|
|
jbe@0
|
904 lon1 + s * (lon2-lon1)
|
|
jbe@0
|
905 );
|
|
jbe@0
|
906 /* store calculated distance if smallest */
|
|
jbe@0
|
907 if (dist < min_dist) min_dist = dist;
|
|
jbe@0
|
908 }
|
|
jbe@0
|
909 }
|
|
jbe@0
|
910 /* return minimum distance */
|
|
jbe@0
|
911 return min_dist;
|
|
jbe@0
|
912 }
|
|
jbe@0
|
913
|
|
jbe@16
|
914 /* calculate (approximate) distance between two clusters */
|
|
jbe@16
|
915 static double pgl_cluster_distance(pgl_cluster *cluster1, pgl_cluster *cluster2) {
|
|
jbe@16
|
916 int i, j; /* i: entry, j: point in entry */
|
|
jbe@16
|
917 int npoints; /* number of points in entry */
|
|
jbe@16
|
918 pgl_point *points; /* array of points in entry */
|
|
jbe@16
|
919 double dist; /* distance calculated in one step */
|
|
jbe@16
|
920 double min_dist = INFINITY; /* minimum distance */
|
|
jbe@16
|
921 /* consider distance from each point in one cluster to the whole other */
|
|
jbe@16
|
922 for (i=0; i<cluster1->nentries; i++) {
|
|
jbe@16
|
923 npoints = cluster1->entries[i].npoints;
|
|
jbe@16
|
924 points = PGL_ENTRY_POINTS(cluster1, i);
|
|
jbe@16
|
925 for (j=0; j<npoints; j++) {
|
|
jbe@16
|
926 dist = pgl_point_cluster_distance(points+j, cluster2);
|
|
jbe@16
|
927 if (dist == 0) return dist;
|
|
jbe@16
|
928 if (dist < min_dist) min_dist = dist;
|
|
jbe@16
|
929 }
|
|
jbe@16
|
930 }
|
|
jbe@16
|
931 /* consider distance from each point in other cluster to the first cluster */
|
|
jbe@16
|
932 for (i=0; i<cluster2->nentries; i++) {
|
|
jbe@16
|
933 npoints = cluster2->entries[i].npoints;
|
|
jbe@16
|
934 points = PGL_ENTRY_POINTS(cluster2, i);
|
|
jbe@16
|
935 for (j=0; j<npoints; j++) {
|
|
jbe@16
|
936 dist = pgl_point_cluster_distance(points+j, cluster1);
|
|
jbe@16
|
937 if (dist == 0) return dist;
|
|
jbe@16
|
938 if (dist < min_dist) min_dist = dist;
|
|
jbe@16
|
939 }
|
|
jbe@16
|
940 }
|
|
jbe@16
|
941 return min_dist;
|
|
jbe@16
|
942 }
|
|
jbe@16
|
943
|
|
jbe@0
|
944 /* estimator function for distance between box and point */
|
|
jbe@16
|
945 /* always returns a smaller value than actually correct or zero */
|
|
jbe@0
|
946 static double pgl_estimate_point_box_distance(pgl_point *point, pgl_box *box) {
|
|
jbe@16
|
947 double dlon; /* longitude range of box (delta longitude) */
|
|
jbe@16
|
948 double distance; /* return value */
|
|
jbe@16
|
949 /* return infinity if box is empty */
|
|
jbe@0
|
950 if (box->lat_min > box->lat_max) return INFINITY;
|
|
jbe@16
|
951 /* return zero if point is inside box */
|
|
jbe@0
|
952 if (pgl_point_in_box(point, box)) return 0;
|
|
jbe@0
|
953 /* calculate delta longitude */
|
|
jbe@0
|
954 dlon = box->lon_max - box->lon_min;
|
|
jbe@0
|
955 if (dlon < 0) dlon += 360; /* 180th meridian crossed */
|
|
jbe@16
|
956 /* if delta longitude is greater than 150 degrees, perform safe fall-back */
|
|
jbe@16
|
957 if (dlon > 150) return 0;
|
|
jbe@16
|
958 /* calculate lower limit for distance (formula below requires dlon <= 150) */
|
|
jbe@16
|
959 /* TODO: provide better estimation function to improve performance */
|
|
jbe@16
|
960 distance = (
|
|
jbe@16
|
961 (1.0-1e-14) * pgl_distance(
|
|
jbe@16
|
962 point->lat,
|
|
jbe@16
|
963 point->lon,
|
|
jbe@16
|
964 (box->lat_min + box->lat_max) / 2,
|
|
jbe@16
|
965 box->lon_min + dlon/2
|
|
jbe@16
|
966 ) - pgl_distance(
|
|
jbe@16
|
967 box->lat_min, box->lon_min,
|
|
jbe@16
|
968 box->lat_max, box->lon_max
|
|
jbe@16
|
969 )
|
|
jbe@16
|
970 );
|
|
jbe@16
|
971 /* truncate negative results to zero */
|
|
jbe@16
|
972 if (distance <= 0) distance = 0;
|
|
jbe@16
|
973 /* return result */
|
|
jbe@16
|
974 return distance;
|
|
jbe@0
|
975 }
|
|
jbe@0
|
976
|
|
jbe@0
|
977
|
|
jbe@16
|
978 /*-------------------------------------------------*
|
|
jbe@16
|
979 * geographic index based on space-filling curve *
|
|
jbe@16
|
980 *-------------------------------------------------*/
|
|
jbe@0
|
981
|
|
jbe@0
|
982 /* number of bytes used for geographic (center) position in keys */
|
|
jbe@0
|
983 #define PGL_KEY_LATLON_BYTELEN 7
|
|
jbe@0
|
984
|
|
jbe@0
|
985 /* maximum reference value for logarithmic size of geographic objects */
|
|
jbe@0
|
986 #define PGL_AREAKEY_REFOBJSIZE (PGL_DIAMETER/3.0) /* can be tweaked */
|
|
jbe@0
|
987
|
|
jbe@0
|
988 /* pointer to index key (either pgl_pointkey or pgl_areakey) */
|
|
jbe@0
|
989 typedef unsigned char *pgl_keyptr;
|
|
jbe@0
|
990
|
|
jbe@0
|
991 /* index key for points (objects with zero area) on the spheroid */
|
|
jbe@0
|
992 /* bit 0..55: interspersed bits of latitude and longitude,
|
|
jbe@0
|
993 bit 56..57: always zero,
|
|
jbe@0
|
994 bit 58..63: node depth in hypothetic (full) tree from 0 to 56 (incl.) */
|
|
jbe@0
|
995 typedef unsigned char pgl_pointkey[PGL_KEY_LATLON_BYTELEN+1];
|
|
jbe@0
|
996
|
|
jbe@0
|
997 /* index key for geographic objects on spheroid with area greater than zero */
|
|
jbe@0
|
998 /* bit 0..55: interspersed bits of latitude and longitude of center point,
|
|
jbe@0
|
999 bit 56: always set to 1,
|
|
jbe@0
|
1000 bit 57..63: node depth in hypothetic (full) tree from 0 to (2*56)+1 (incl.),
|
|
jbe@0
|
1001 bit 64..71: logarithmic object size from 0 to 56+1 = 57 (incl.), but set to
|
|
jbe@0
|
1002 PGL_KEY_OBJSIZE_EMPTY (with interspersed bits = 0 and node depth
|
|
jbe@0
|
1003 = 113) for empty objects, and set to PGL_KEY_OBJSIZE_UNIVERSAL
|
|
jbe@0
|
1004 (with interspersed bits = 0 and node depth = 0) for keys which
|
|
jbe@0
|
1005 cover both empty and non-empty objects */
|
|
jbe@0
|
1006
|
|
jbe@0
|
1007 typedef unsigned char pgl_areakey[PGL_KEY_LATLON_BYTELEN+2];
|
|
jbe@0
|
1008
|
|
jbe@0
|
1009 /* helper macros for reading/writing index keys */
|
|
jbe@0
|
1010 #define PGL_KEY_NODEDEPTH_OFFSET PGL_KEY_LATLON_BYTELEN
|
|
jbe@0
|
1011 #define PGL_KEY_OBJSIZE_OFFSET (PGL_KEY_NODEDEPTH_OFFSET+1)
|
|
jbe@0
|
1012 #define PGL_POINTKEY_MAXDEPTH (PGL_KEY_LATLON_BYTELEN*8)
|
|
jbe@0
|
1013 #define PGL_AREAKEY_MAXDEPTH (2*PGL_POINTKEY_MAXDEPTH+1)
|
|
jbe@0
|
1014 #define PGL_AREAKEY_MAXOBJSIZE (PGL_POINTKEY_MAXDEPTH+1)
|
|
jbe@0
|
1015 #define PGL_AREAKEY_TYPEMASK 0x80
|
|
jbe@0
|
1016 #define PGL_KEY_LATLONBIT(key, n) ((key)[(n)/8] & (0x80 >> ((n)%8)))
|
|
jbe@0
|
1017 #define PGL_KEY_LATLONBIT_DIFF(key1, key2, n) \
|
|
jbe@0
|
1018 ( PGL_KEY_LATLONBIT(key1, n) ^ \
|
|
jbe@0
|
1019 PGL_KEY_LATLONBIT(key2, n) )
|
|
jbe@0
|
1020 #define PGL_KEY_IS_AREAKEY(key) ((key)[PGL_KEY_NODEDEPTH_OFFSET] & \
|
|
jbe@0
|
1021 PGL_AREAKEY_TYPEMASK)
|
|
jbe@0
|
1022 #define PGL_KEY_NODEDEPTH(key) ((key)[PGL_KEY_NODEDEPTH_OFFSET] & \
|
|
jbe@0
|
1023 (PGL_AREAKEY_TYPEMASK-1))
|
|
jbe@0
|
1024 #define PGL_KEY_OBJSIZE(key) ((key)[PGL_KEY_OBJSIZE_OFFSET])
|
|
jbe@0
|
1025 #define PGL_KEY_OBJSIZE_EMPTY 126
|
|
jbe@0
|
1026 #define PGL_KEY_OBJSIZE_UNIVERSAL 127
|
|
jbe@0
|
1027 #define PGL_KEY_IS_EMPTY(key) ( PGL_KEY_IS_AREAKEY(key) && \
|
|
jbe@0
|
1028 (key)[PGL_KEY_OBJSIZE_OFFSET] == \
|
|
jbe@0
|
1029 PGL_KEY_OBJSIZE_EMPTY )
|
|
jbe@0
|
1030 #define PGL_KEY_IS_UNIVERSAL(key) ( PGL_KEY_IS_AREAKEY(key) && \
|
|
jbe@0
|
1031 (key)[PGL_KEY_OBJSIZE_OFFSET] == \
|
|
jbe@0
|
1032 PGL_KEY_OBJSIZE_UNIVERSAL )
|
|
jbe@0
|
1033
|
|
jbe@0
|
1034 /* set area key to match empty objects only */
|
|
jbe@0
|
1035 static void pgl_key_set_empty(pgl_keyptr key) {
|
|
jbe@0
|
1036 memset(key, 0, sizeof(pgl_areakey));
|
|
jbe@0
|
1037 /* Note: setting node depth to maximum is required for picksplit function */
|
|
jbe@0
|
1038 key[PGL_KEY_NODEDEPTH_OFFSET] = PGL_AREAKEY_TYPEMASK | PGL_AREAKEY_MAXDEPTH;
|
|
jbe@0
|
1039 key[PGL_KEY_OBJSIZE_OFFSET] = PGL_KEY_OBJSIZE_EMPTY;
|
|
jbe@0
|
1040 }
|
|
jbe@0
|
1041
|
|
jbe@0
|
1042 /* set area key to match any object (including empty objects) */
|
|
jbe@0
|
1043 static void pgl_key_set_universal(pgl_keyptr key) {
|
|
jbe@0
|
1044 memset(key, 0, sizeof(pgl_areakey));
|
|
jbe@0
|
1045 key[PGL_KEY_NODEDEPTH_OFFSET] = PGL_AREAKEY_TYPEMASK;
|
|
jbe@0
|
1046 key[PGL_KEY_OBJSIZE_OFFSET] = PGL_KEY_OBJSIZE_UNIVERSAL;
|
|
jbe@0
|
1047 }
|
|
jbe@0
|
1048
|
|
jbe@0
|
1049 /* convert a point on earth into a max-depth key to be used in index */
|
|
jbe@0
|
1050 static void pgl_point_to_key(pgl_point *point, pgl_keyptr key) {
|
|
jbe@0
|
1051 double lat = point->lat;
|
|
jbe@0
|
1052 double lon = point->lon;
|
|
jbe@0
|
1053 int i;
|
|
jbe@0
|
1054 /* clear latitude and longitude bits */
|
|
jbe@0
|
1055 memset(key, 0, PGL_KEY_LATLON_BYTELEN);
|
|
jbe@0
|
1056 /* set node depth to maximum and type bit to zero */
|
|
jbe@0
|
1057 key[PGL_KEY_NODEDEPTH_OFFSET] = PGL_POINTKEY_MAXDEPTH;
|
|
jbe@0
|
1058 /* iterate over all latitude/longitude bit pairs */
|
|
jbe@0
|
1059 for (i=0; i<PGL_POINTKEY_MAXDEPTH/2; i++) {
|
|
jbe@0
|
1060 /* determine latitude bit */
|
|
jbe@0
|
1061 if (lat >= 0) {
|
|
jbe@0
|
1062 key[i/4] |= 0x80 >> (2*(i%4));
|
|
jbe@0
|
1063 lat *= 2; lat -= 90;
|
|
jbe@0
|
1064 } else {
|
|
jbe@0
|
1065 lat *= 2; lat += 90;
|
|
jbe@0
|
1066 }
|
|
jbe@0
|
1067 /* determine longitude bit */
|
|
jbe@0
|
1068 if (lon >= 0) {
|
|
jbe@0
|
1069 key[i/4] |= 0x80 >> (2*(i%4)+1);
|
|
jbe@0
|
1070 lon *= 2; lon -= 180;
|
|
jbe@0
|
1071 } else {
|
|
jbe@0
|
1072 lon *= 2; lon += 180;
|
|
jbe@0
|
1073 }
|
|
jbe@0
|
1074 }
|
|
jbe@0
|
1075 }
|
|
jbe@0
|
1076
|
|
jbe@0
|
1077 /* convert a circle on earth into a max-depth key to be used in an index */
|
|
jbe@0
|
1078 static void pgl_circle_to_key(pgl_circle *circle, pgl_keyptr key) {
|
|
jbe@0
|
1079 /* handle special case of empty circle */
|
|
jbe@0
|
1080 if (circle->radius < 0) {
|
|
jbe@0
|
1081 pgl_key_set_empty(key);
|
|
jbe@0
|
1082 return;
|
|
jbe@0
|
1083 }
|
|
jbe@0
|
1084 /* perform same action as for point keys */
|
|
jbe@0
|
1085 pgl_point_to_key(&(circle->center), key);
|
|
jbe@0
|
1086 /* but overwrite type and node depth to fit area index key */
|
|
jbe@0
|
1087 key[PGL_KEY_NODEDEPTH_OFFSET] = PGL_AREAKEY_TYPEMASK | PGL_AREAKEY_MAXDEPTH;
|
|
jbe@0
|
1088 /* check if radius is greater than (or equal to) reference size */
|
|
jbe@0
|
1089 /* (treat equal values as greater values for numerical safety) */
|
|
jbe@0
|
1090 if (circle->radius >= PGL_AREAKEY_REFOBJSIZE) {
|
|
jbe@0
|
1091 /* if yes, set logarithmic size to zero */
|
|
jbe@0
|
1092 key[PGL_KEY_OBJSIZE_OFFSET] = 0;
|
|
jbe@0
|
1093 } else {
|
|
jbe@0
|
1094 /* otherwise, determine logarithmic size iteratively */
|
|
jbe@0
|
1095 /* (one step is equivalent to a factor of sqrt(2)) */
|
|
jbe@0
|
1096 double reference = PGL_AREAKEY_REFOBJSIZE / M_SQRT2;
|
|
jbe@0
|
1097 int objsize = 1;
|
|
jbe@0
|
1098 while (objsize < PGL_AREAKEY_MAXOBJSIZE) {
|
|
jbe@0
|
1099 /* stop when radius is greater than (or equal to) adjusted reference */
|
|
jbe@0
|
1100 /* (treat equal values as greater values for numerical safety) */
|
|
jbe@0
|
1101 if (circle->radius >= reference) break;
|
|
jbe@0
|
1102 reference /= M_SQRT2;
|
|
jbe@0
|
1103 objsize++;
|
|
jbe@0
|
1104 }
|
|
jbe@0
|
1105 /* set logarithmic size to determined value */
|
|
jbe@0
|
1106 key[PGL_KEY_OBJSIZE_OFFSET] = objsize;
|
|
jbe@0
|
1107 }
|
|
jbe@0
|
1108 }
|
|
jbe@0
|
1109
|
|
jbe@0
|
1110 /* check if one key is subkey of another key or vice versa */
|
|
jbe@0
|
1111 static bool pgl_keys_overlap(pgl_keyptr key1, pgl_keyptr key2) {
|
|
jbe@0
|
1112 int i; /* key bit offset (includes both lat/lon and log. obj. size bits) */
|
|
jbe@0
|
1113 /* determine smallest depth */
|
|
jbe@0
|
1114 int depth1 = PGL_KEY_NODEDEPTH(key1);
|
|
jbe@0
|
1115 int depth2 = PGL_KEY_NODEDEPTH(key2);
|
|
jbe@0
|
1116 int depth = (depth1 < depth2) ? depth1 : depth2;
|
|
jbe@0
|
1117 /* check if keys are area keys (assuming that both keys have same type) */
|
|
jbe@0
|
1118 if (PGL_KEY_IS_AREAKEY(key1)) {
|
|
jbe@0
|
1119 int j = 0; /* bit offset for logarithmic object size bits */
|
|
jbe@0
|
1120 int k = 0; /* bit offset for latitude and longitude */
|
|
jbe@0
|
1121 /* fetch logarithmic object size information */
|
|
jbe@0
|
1122 int objsize1 = PGL_KEY_OBJSIZE(key1);
|
|
jbe@0
|
1123 int objsize2 = PGL_KEY_OBJSIZE(key2);
|
|
jbe@0
|
1124 /* handle special cases for empty objects (universal and empty keys) */
|
|
jbe@0
|
1125 if (
|
|
jbe@0
|
1126 objsize1 == PGL_KEY_OBJSIZE_UNIVERSAL ||
|
|
jbe@0
|
1127 objsize2 == PGL_KEY_OBJSIZE_UNIVERSAL
|
|
jbe@0
|
1128 ) return true;
|
|
jbe@0
|
1129 if (
|
|
jbe@0
|
1130 objsize1 == PGL_KEY_OBJSIZE_EMPTY ||
|
|
jbe@0
|
1131 objsize2 == PGL_KEY_OBJSIZE_EMPTY
|
|
jbe@0
|
1132 ) return objsize1 == objsize2;
|
|
jbe@0
|
1133 /* iterate through key bits */
|
|
jbe@0
|
1134 for (i=0; i<depth; i++) {
|
|
jbe@0
|
1135 /* every second bit is a bit describing the object size */
|
|
jbe@0
|
1136 if (i%2 == 0) {
|
|
jbe@0
|
1137 /* check if object size bit is different in both keys (objsize1 and
|
|
jbe@0
|
1138 objsize2 describe the minimum index when object size bit is set) */
|
|
jbe@0
|
1139 if (
|
|
jbe@0
|
1140 (objsize1 <= j && objsize2 > j) ||
|
|
jbe@0
|
1141 (objsize2 <= j && objsize1 > j)
|
|
jbe@0
|
1142 ) {
|
|
jbe@0
|
1143 /* bit differs, therefore keys are in separate branches */
|
|
jbe@0
|
1144 return false;
|
|
jbe@0
|
1145 }
|
|
jbe@0
|
1146 /* increase bit counter for object size bits */
|
|
jbe@0
|
1147 j++;
|
|
jbe@0
|
1148 }
|
|
jbe@0
|
1149 /* all other bits describe latitude and longitude */
|
|
jbe@0
|
1150 else {
|
|
jbe@0
|
1151 /* check if bit differs in both keys */
|
|
jbe@0
|
1152 if (PGL_KEY_LATLONBIT_DIFF(key1, key2, k)) {
|
|
jbe@0
|
1153 /* bit differs, therefore keys are in separate branches */
|
|
jbe@0
|
1154 return false;
|
|
jbe@0
|
1155 }
|
|
jbe@0
|
1156 /* increase bit counter for latitude/longitude bits */
|
|
jbe@0
|
1157 k++;
|
|
jbe@0
|
1158 }
|
|
jbe@0
|
1159 }
|
|
jbe@0
|
1160 }
|
|
jbe@0
|
1161 /* if not, keys are point keys */
|
|
jbe@0
|
1162 else {
|
|
jbe@0
|
1163 /* iterate through key bits */
|
|
jbe@0
|
1164 for (i=0; i<depth; i++) {
|
|
jbe@0
|
1165 /* check if bit differs in both keys */
|
|
jbe@0
|
1166 if (PGL_KEY_LATLONBIT_DIFF(key1, key2, i)) {
|
|
jbe@0
|
1167 /* bit differs, therefore keys are in separate branches */
|
|
jbe@0
|
1168 return false;
|
|
jbe@0
|
1169 }
|
|
jbe@0
|
1170 }
|
|
jbe@0
|
1171 }
|
|
jbe@0
|
1172 /* return true because keys are in the same branch */
|
|
jbe@0
|
1173 return true;
|
|
jbe@0
|
1174 }
|
|
jbe@0
|
1175
|
|
jbe@0
|
1176 /* combine two keys into new key which covers both original keys */
|
|
jbe@0
|
1177 /* (result stored in first argument) */
|
|
jbe@0
|
1178 static void pgl_unite_keys(pgl_keyptr dst, pgl_keyptr src) {
|
|
jbe@0
|
1179 int i; /* key bit offset (includes both lat/lon and log. obj. size bits) */
|
|
jbe@0
|
1180 /* determine smallest depth */
|
|
jbe@0
|
1181 int depth1 = PGL_KEY_NODEDEPTH(dst);
|
|
jbe@0
|
1182 int depth2 = PGL_KEY_NODEDEPTH(src);
|
|
jbe@0
|
1183 int depth = (depth1 < depth2) ? depth1 : depth2;
|
|
jbe@0
|
1184 /* check if keys are area keys (assuming that both keys have same type) */
|
|
jbe@0
|
1185 if (PGL_KEY_IS_AREAKEY(dst)) {
|
|
jbe@0
|
1186 pgl_areakey dstbuf = { 0, }; /* destination buffer (cleared) */
|
|
jbe@0
|
1187 int j = 0; /* bit offset for logarithmic object size bits */
|
|
jbe@0
|
1188 int k = 0; /* bit offset for latitude and longitude */
|
|
jbe@0
|
1189 /* fetch logarithmic object size information */
|
|
jbe@0
|
1190 int objsize1 = PGL_KEY_OBJSIZE(dst);
|
|
jbe@0
|
1191 int objsize2 = PGL_KEY_OBJSIZE(src);
|
|
jbe@0
|
1192 /* handle special cases for empty objects (universal and empty keys) */
|
|
jbe@0
|
1193 if (
|
|
jbe@0
|
1194 objsize1 > PGL_AREAKEY_MAXOBJSIZE ||
|
|
jbe@0
|
1195 objsize2 > PGL_AREAKEY_MAXOBJSIZE
|
|
jbe@0
|
1196 ) {
|
|
jbe@0
|
1197 if (
|
|
jbe@0
|
1198 objsize1 == PGL_KEY_OBJSIZE_EMPTY &&
|
|
jbe@0
|
1199 objsize2 == PGL_KEY_OBJSIZE_EMPTY
|
|
jbe@0
|
1200 ) pgl_key_set_empty(dst);
|
|
jbe@0
|
1201 else pgl_key_set_universal(dst);
|
|
jbe@0
|
1202 return;
|
|
jbe@0
|
1203 }
|
|
jbe@0
|
1204 /* iterate through key bits */
|
|
jbe@0
|
1205 for (i=0; i<depth; i++) {
|
|
jbe@0
|
1206 /* every second bit is a bit describing the object size */
|
|
jbe@0
|
1207 if (i%2 == 0) {
|
|
jbe@0
|
1208 /* increase bit counter for object size bits first */
|
|
jbe@0
|
1209 /* (handy when setting objsize variable) */
|
|
jbe@0
|
1210 j++;
|
|
jbe@0
|
1211 /* check if object size bit is set in neither key */
|
|
jbe@0
|
1212 if (objsize1 >= j && objsize2 >= j) {
|
|
jbe@0
|
1213 /* set objsize in destination buffer to indicate that size bit is
|
|
jbe@0
|
1214 unset in destination buffer at the current bit position */
|
|
jbe@0
|
1215 dstbuf[PGL_KEY_OBJSIZE_OFFSET] = j;
|
|
jbe@0
|
1216 }
|
|
jbe@0
|
1217 /* break if object size bit is set in one key only */
|
|
jbe@0
|
1218 else if (objsize1 >= j || objsize2 >= j) break;
|
|
jbe@0
|
1219 }
|
|
jbe@0
|
1220 /* all other bits describe latitude and longitude */
|
|
jbe@0
|
1221 else {
|
|
jbe@0
|
1222 /* break if bit differs in both keys */
|
|
jbe@0
|
1223 if (PGL_KEY_LATLONBIT(dst, k)) {
|
|
jbe@0
|
1224 if (!PGL_KEY_LATLONBIT(src, k)) break;
|
|
jbe@0
|
1225 /* but set bit in destination buffer if bit is set in both keys */
|
|
jbe@0
|
1226 dstbuf[k/8] |= 0x80 >> (k%8);
|
|
jbe@0
|
1227 } else if (PGL_KEY_LATLONBIT(src, k)) break;
|
|
jbe@0
|
1228 /* increase bit counter for latitude/longitude bits */
|
|
jbe@0
|
1229 k++;
|
|
jbe@0
|
1230 }
|
|
jbe@0
|
1231 }
|
|
jbe@0
|
1232 /* set common node depth and type bit (type bit = 1) */
|
|
jbe@0
|
1233 dstbuf[PGL_KEY_NODEDEPTH_OFFSET] = PGL_AREAKEY_TYPEMASK | i;
|
|
jbe@0
|
1234 /* copy contents of destination buffer to first key */
|
|
jbe@0
|
1235 memcpy(dst, dstbuf, sizeof(pgl_areakey));
|
|
jbe@0
|
1236 }
|
|
jbe@0
|
1237 /* if not, keys are point keys */
|
|
jbe@0
|
1238 else {
|
|
jbe@0
|
1239 pgl_pointkey dstbuf = { 0, }; /* destination buffer (cleared) */
|
|
jbe@0
|
1240 /* iterate through key bits */
|
|
jbe@0
|
1241 for (i=0; i<depth; i++) {
|
|
jbe@0
|
1242 /* break if bit differs in both keys */
|
|
jbe@0
|
1243 if (PGL_KEY_LATLONBIT(dst, i)) {
|
|
jbe@0
|
1244 if (!PGL_KEY_LATLONBIT(src, i)) break;
|
|
jbe@0
|
1245 /* but set bit in destination buffer if bit is set in both keys */
|
|
jbe@0
|
1246 dstbuf[i/8] |= 0x80 >> (i%8);
|
|
jbe@0
|
1247 } else if (PGL_KEY_LATLONBIT(src, i)) break;
|
|
jbe@0
|
1248 }
|
|
jbe@0
|
1249 /* set common node depth (type bit = 0) */
|
|
jbe@0
|
1250 dstbuf[PGL_KEY_NODEDEPTH_OFFSET] = i;
|
|
jbe@0
|
1251 /* copy contents of destination buffer to first key */
|
|
jbe@0
|
1252 memcpy(dst, dstbuf, sizeof(pgl_pointkey));
|
|
jbe@0
|
1253 }
|
|
jbe@0
|
1254 }
|
|
jbe@0
|
1255
|
|
jbe@0
|
1256 /* determine center(!) boundaries and radius estimation of index key */
|
|
jbe@0
|
1257 static double pgl_key_to_box(pgl_keyptr key, pgl_box *box) {
|
|
jbe@0
|
1258 int i;
|
|
jbe@0
|
1259 /* determine node depth */
|
|
jbe@0
|
1260 int depth = PGL_KEY_NODEDEPTH(key);
|
|
jbe@0
|
1261 /* center point of possible result */
|
|
jbe@0
|
1262 double lat = 0;
|
|
jbe@0
|
1263 double lon = 0;
|
|
jbe@0
|
1264 /* maximum distance of real center point from key center */
|
|
jbe@0
|
1265 double dlat = 90;
|
|
jbe@0
|
1266 double dlon = 180;
|
|
jbe@0
|
1267 /* maximum radius of contained objects */
|
|
jbe@0
|
1268 double radius = 0; /* always return zero for point index keys */
|
|
jbe@0
|
1269 /* check if key is area key */
|
|
jbe@0
|
1270 if (PGL_KEY_IS_AREAKEY(key)) {
|
|
jbe@0
|
1271 /* get logarithmic object size */
|
|
jbe@0
|
1272 int objsize = PGL_KEY_OBJSIZE(key);
|
|
jbe@0
|
1273 /* handle special cases for empty objects (universal and empty keys) */
|
|
jbe@0
|
1274 if (objsize == PGL_KEY_OBJSIZE_EMPTY) {
|
|
jbe@0
|
1275 pgl_box_set_empty(box);
|
|
jbe@0
|
1276 return 0;
|
|
jbe@0
|
1277 } else if (objsize == PGL_KEY_OBJSIZE_UNIVERSAL) {
|
|
jbe@0
|
1278 box->lat_min = -90;
|
|
jbe@0
|
1279 box->lat_max = 90;
|
|
jbe@0
|
1280 box->lon_min = -180;
|
|
jbe@0
|
1281 box->lon_max = 180;
|
|
jbe@0
|
1282 return 0; /* any value >= 0 would do */
|
|
jbe@0
|
1283 }
|
|
jbe@0
|
1284 /* calculate maximum possible radius of objects covered by the given key */
|
|
jbe@0
|
1285 if (objsize == 0) radius = INFINITY;
|
|
jbe@0
|
1286 else {
|
|
jbe@0
|
1287 radius = PGL_AREAKEY_REFOBJSIZE;
|
|
jbe@0
|
1288 while (--objsize) radius /= M_SQRT2;
|
|
jbe@0
|
1289 }
|
|
jbe@0
|
1290 /* iterate over latitude and longitude bits in key */
|
|
jbe@0
|
1291 /* (every second bit is a latitude or longitude bit) */
|
|
jbe@0
|
1292 for (i=0; i<depth/2; i++) {
|
|
jbe@0
|
1293 /* check if latitude bit */
|
|
jbe@0
|
1294 if (i%2 == 0) {
|
|
jbe@0
|
1295 /* cut latitude dimension in half */
|
|
jbe@0
|
1296 dlat /= 2;
|
|
jbe@0
|
1297 /* increase center latitude if bit is 1, otherwise decrease */
|
|
jbe@0
|
1298 if (PGL_KEY_LATLONBIT(key, i)) lat += dlat;
|
|
jbe@0
|
1299 else lat -= dlat;
|
|
jbe@0
|
1300 }
|
|
jbe@0
|
1301 /* otherwise longitude bit */
|
|
jbe@0
|
1302 else {
|
|
jbe@0
|
1303 /* cut longitude dimension in half */
|
|
jbe@0
|
1304 dlon /= 2;
|
|
jbe@0
|
1305 /* increase center longitude if bit is 1, otherwise decrease */
|
|
jbe@0
|
1306 if (PGL_KEY_LATLONBIT(key, i)) lon += dlon;
|
|
jbe@0
|
1307 else lon -= dlon;
|
|
jbe@0
|
1308 }
|
|
jbe@0
|
1309 }
|
|
jbe@0
|
1310 }
|
|
jbe@0
|
1311 /* if not, keys are point keys */
|
|
jbe@0
|
1312 else {
|
|
jbe@0
|
1313 /* iterate over all bits in key */
|
|
jbe@0
|
1314 for (i=0; i<depth; i++) {
|
|
jbe@0
|
1315 /* check if latitude bit */
|
|
jbe@0
|
1316 if (i%2 == 0) {
|
|
jbe@0
|
1317 /* cut latitude dimension in half */
|
|
jbe@0
|
1318 dlat /= 2;
|
|
jbe@0
|
1319 /* increase center latitude if bit is 1, otherwise decrease */
|
|
jbe@0
|
1320 if (PGL_KEY_LATLONBIT(key, i)) lat += dlat;
|
|
jbe@0
|
1321 else lat -= dlat;
|
|
jbe@0
|
1322 }
|
|
jbe@0
|
1323 /* otherwise longitude bit */
|
|
jbe@0
|
1324 else {
|
|
jbe@0
|
1325 /* cut longitude dimension in half */
|
|
jbe@0
|
1326 dlon /= 2;
|
|
jbe@0
|
1327 /* increase center longitude if bit is 1, otherwise decrease */
|
|
jbe@0
|
1328 if (PGL_KEY_LATLONBIT(key, i)) lon += dlon;
|
|
jbe@0
|
1329 else lon -= dlon;
|
|
jbe@0
|
1330 }
|
|
jbe@0
|
1331 }
|
|
jbe@0
|
1332 }
|
|
jbe@0
|
1333 /* calculate boundaries from center point and remaining dlat and dlon */
|
|
jbe@0
|
1334 /* (return values through pointer to box) */
|
|
jbe@0
|
1335 box->lat_min = lat - dlat;
|
|
jbe@0
|
1336 box->lat_max = lat + dlat;
|
|
jbe@0
|
1337 box->lon_min = lon - dlon;
|
|
jbe@0
|
1338 box->lon_max = lon + dlon;
|
|
jbe@0
|
1339 /* return radius (as a function return value) */
|
|
jbe@0
|
1340 return radius;
|
|
jbe@0
|
1341 }
|
|
jbe@0
|
1342
|
|
jbe@0
|
1343 /* estimator function for distance between point and index key */
|
|
jbe@16
|
1344 /* always returns a smaller value than actually correct or zero */
|
|
jbe@0
|
1345 static double pgl_estimate_key_distance(pgl_keyptr key, pgl_point *point) {
|
|
jbe@0
|
1346 pgl_box box; /* center(!) bounding box of area index key */
|
|
jbe@0
|
1347 /* calculate center(!) bounding box and maximum radius of objects covered
|
|
jbe@0
|
1348 by area index key (radius is zero for point index keys) */
|
|
jbe@0
|
1349 double distance = pgl_key_to_box(key, &box);
|
|
jbe@0
|
1350 /* calculate estimated distance between bounding box of center point of
|
|
jbe@0
|
1351 indexed object and point passed as second argument, then substract maximum
|
|
jbe@0
|
1352 radius of objects covered by index key */
|
|
jbe@16
|
1353 distance = pgl_estimate_point_box_distance(point, &box) - distance;
|
|
jbe@0
|
1354 /* truncate negative results to zero */
|
|
jbe@0
|
1355 if (distance <= 0) distance = 0;
|
|
jbe@0
|
1356 /* return result */
|
|
jbe@0
|
1357 return distance;
|
|
jbe@0
|
1358 }
|
|
jbe@0
|
1359
|
|
jbe@0
|
1360
|
|
jbe@0
|
1361 /*---------------------------------*
|
|
jbe@0
|
1362 * helper functions for text I/O *
|
|
jbe@0
|
1363 *---------------------------------*/
|
|
jbe@0
|
1364
|
|
jbe@0
|
1365 #define PGL_NUMBUFLEN 64 /* buffer size for number to string conversion */
|
|
jbe@0
|
1366
|
|
jbe@0
|
1367 /* convert floating point number to string (round-trip safe) */
|
|
jbe@0
|
1368 static void pgl_print_float(char *buf, double flt) {
|
|
jbe@0
|
1369 /* check if number is integral */
|
|
jbe@0
|
1370 if (trunc(flt) == flt) {
|
|
jbe@0
|
1371 /* for integral floats use maximum precision */
|
|
jbe@0
|
1372 snprintf(buf, PGL_NUMBUFLEN, "%.17g", flt);
|
|
jbe@0
|
1373 } else {
|
|
jbe@0
|
1374 /* otherwise check if 15, 16, or 17 digits needed (round-trip safety) */
|
|
jbe@0
|
1375 snprintf(buf, PGL_NUMBUFLEN, "%.15g", flt);
|
|
jbe@0
|
1376 if (strtod(buf, NULL) != flt) snprintf(buf, PGL_NUMBUFLEN, "%.16g", flt);
|
|
jbe@0
|
1377 if (strtod(buf, NULL) != flt) snprintf(buf, PGL_NUMBUFLEN, "%.17g", flt);
|
|
jbe@0
|
1378 }
|
|
jbe@0
|
1379 }
|
|
jbe@0
|
1380
|
|
jbe@0
|
1381 /* convert latitude floating point number (in degrees) to string */
|
|
jbe@0
|
1382 static void pgl_print_lat(char *buf, double lat) {
|
|
jbe@0
|
1383 if (signbit(lat)) {
|
|
jbe@0
|
1384 /* treat negative latitudes (including -0) as south */
|
|
jbe@0
|
1385 snprintf(buf, PGL_NUMBUFLEN, "S%015.12f", -lat);
|
|
jbe@0
|
1386 } else {
|
|
jbe@0
|
1387 /* treat positive latitudes (including +0) as north */
|
|
jbe@0
|
1388 snprintf(buf, PGL_NUMBUFLEN, "N%015.12f", lat);
|
|
jbe@0
|
1389 }
|
|
jbe@0
|
1390 }
|
|
jbe@0
|
1391
|
|
jbe@0
|
1392 /* convert longitude floating point number (in degrees) to string */
|
|
jbe@0
|
1393 static void pgl_print_lon(char *buf, double lon) {
|
|
jbe@0
|
1394 if (signbit(lon)) {
|
|
jbe@0
|
1395 /* treat negative longitudes (including -0) as west */
|
|
jbe@0
|
1396 snprintf(buf, PGL_NUMBUFLEN, "W%016.12f", -lon);
|
|
jbe@0
|
1397 } else {
|
|
jbe@0
|
1398 /* treat positive longitudes (including +0) as east */
|
|
jbe@0
|
1399 snprintf(buf, PGL_NUMBUFLEN, "E%016.12f", lon);
|
|
jbe@0
|
1400 }
|
|
jbe@0
|
1401 }
|
|
jbe@0
|
1402
|
|
jbe@0
|
1403 /* bit masks used as return value of pgl_scan() function */
|
|
jbe@0
|
1404 #define PGL_SCAN_NONE 0 /* no value has been parsed */
|
|
jbe@0
|
1405 #define PGL_SCAN_LAT (1<<0) /* latitude has been parsed */
|
|
jbe@0
|
1406 #define PGL_SCAN_LON (1<<1) /* longitude has been parsed */
|
|
jbe@0
|
1407 #define PGL_SCAN_LATLON (PGL_SCAN_LAT | PGL_SCAN_LON) /* bitwise OR of both */
|
|
jbe@0
|
1408
|
|
jbe@0
|
1409 /* parse a coordinate (can be latitude or longitude) */
|
|
jbe@0
|
1410 static int pgl_scan(char **str, double *lat, double *lon) {
|
|
jbe@0
|
1411 double val;
|
|
jbe@0
|
1412 int len;
|
|
jbe@0
|
1413 if (
|
|
jbe@0
|
1414 sscanf(*str, " N %lf %n", &val, &len) ||
|
|
jbe@0
|
1415 sscanf(*str, " n %lf %n", &val, &len)
|
|
jbe@0
|
1416 ) {
|
|
jbe@0
|
1417 *str += len; *lat = val; return PGL_SCAN_LAT;
|
|
jbe@0
|
1418 }
|
|
jbe@0
|
1419 if (
|
|
jbe@0
|
1420 sscanf(*str, " S %lf %n", &val, &len) ||
|
|
jbe@0
|
1421 sscanf(*str, " s %lf %n", &val, &len)
|
|
jbe@0
|
1422 ) {
|
|
jbe@0
|
1423 *str += len; *lat = -val; return PGL_SCAN_LAT;
|
|
jbe@0
|
1424 }
|
|
jbe@0
|
1425 if (
|
|
jbe@0
|
1426 sscanf(*str, " E %lf %n", &val, &len) ||
|
|
jbe@0
|
1427 sscanf(*str, " e %lf %n", &val, &len)
|
|
jbe@0
|
1428 ) {
|
|
jbe@0
|
1429 *str += len; *lon = val; return PGL_SCAN_LON;
|
|
jbe@0
|
1430 }
|
|
jbe@0
|
1431 if (
|
|
jbe@0
|
1432 sscanf(*str, " W %lf %n", &val, &len) ||
|
|
jbe@0
|
1433 sscanf(*str, " w %lf %n", &val, &len)
|
|
jbe@0
|
1434 ) {
|
|
jbe@0
|
1435 *str += len; *lon = -val; return PGL_SCAN_LON;
|
|
jbe@0
|
1436 }
|
|
jbe@0
|
1437 return PGL_SCAN_NONE;
|
|
jbe@0
|
1438 }
|
|
jbe@0
|
1439
|
|
jbe@0
|
1440
|
|
jbe@0
|
1441 /*-----------------*
|
|
jbe@0
|
1442 * SQL functions *
|
|
jbe@0
|
1443 *-----------------*/
|
|
jbe@0
|
1444
|
|
jbe@0
|
1445 /* Note: These function names use "epoint", "ebox", etc. notation here instead
|
|
jbe@0
|
1446 of "point", "box", etc. in order to distinguish them from any previously
|
|
jbe@0
|
1447 defined functions. */
|
|
jbe@0
|
1448
|
|
jbe@0
|
1449 /* function needed for dummy types and/or not implemented features */
|
|
jbe@0
|
1450 PG_FUNCTION_INFO_V1(pgl_notimpl);
|
|
jbe@0
|
1451 Datum pgl_notimpl(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
1452 ereport(ERROR, (errmsg("not implemented by pgLatLon")));
|
|
jbe@0
|
1453 }
|
|
jbe@0
|
1454
|
|
jbe@0
|
1455 /* set point to latitude and longitude (including checks) */
|
|
jbe@0
|
1456 static void pgl_epoint_set_latlon(pgl_point *point, double lat, double lon) {
|
|
jbe@0
|
1457 /* reject infinite or NaN values */
|
|
jbe@0
|
1458 if (!isfinite(lat) || !isfinite(lon)) {
|
|
jbe@0
|
1459 ereport(ERROR, (
|
|
jbe@0
|
1460 errcode(ERRCODE_DATA_EXCEPTION),
|
|
jbe@0
|
1461 errmsg("epoint requires finite coordinates")
|
|
jbe@0
|
1462 ));
|
|
jbe@0
|
1463 }
|
|
jbe@0
|
1464 /* check latitude bounds */
|
|
jbe@0
|
1465 if (lat < -90) {
|
|
jbe@0
|
1466 ereport(WARNING, (errmsg("latitude exceeds south pole")));
|
|
jbe@0
|
1467 lat = -90;
|
|
jbe@0
|
1468 } else if (lat > 90) {
|
|
jbe@0
|
1469 ereport(WARNING, (errmsg("latitude exceeds north pole")));
|
|
jbe@0
|
1470 lat = 90;
|
|
jbe@0
|
1471 }
|
|
jbe@0
|
1472 /* check longitude bounds */
|
|
jbe@0
|
1473 if (lon < -180) {
|
|
jbe@0
|
1474 ereport(NOTICE, (errmsg("longitude west of 180th meridian normalized")));
|
|
jbe@0
|
1475 lon += 360 - trunc(lon / 360) * 360;
|
|
jbe@0
|
1476 } else if (lon > 180) {
|
|
jbe@0
|
1477 ereport(NOTICE, (errmsg("longitude east of 180th meridian normalized")));
|
|
jbe@0
|
1478 lon -= 360 + trunc(lon / 360) * 360;
|
|
jbe@0
|
1479 }
|
|
jbe@0
|
1480 /* store rounded latitude/longitude values for round-trip safety */
|
|
jbe@0
|
1481 point->lat = pgl_round(lat);
|
|
jbe@0
|
1482 point->lon = pgl_round(lon);
|
|
jbe@0
|
1483 }
|
|
jbe@0
|
1484
|
|
jbe@0
|
1485 /* create point ("epoint" in SQL) from latitude and longitude */
|
|
jbe@0
|
1486 PG_FUNCTION_INFO_V1(pgl_create_epoint);
|
|
jbe@0
|
1487 Datum pgl_create_epoint(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
1488 pgl_point *point = (pgl_point *)palloc(sizeof(pgl_point));
|
|
jbe@0
|
1489 pgl_epoint_set_latlon(point, PG_GETARG_FLOAT8(0), PG_GETARG_FLOAT8(1));
|
|
jbe@0
|
1490 PG_RETURN_POINTER(point);
|
|
jbe@0
|
1491 }
|
|
jbe@0
|
1492
|
|
jbe@0
|
1493 /* parse point ("epoint" in SQL) */
|
|
jbe@0
|
1494 /* format: '[NS]<float> [EW]<float>' */
|
|
jbe@0
|
1495 PG_FUNCTION_INFO_V1(pgl_epoint_in);
|
|
jbe@0
|
1496 Datum pgl_epoint_in(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
1497 char *str = PG_GETARG_CSTRING(0); /* input string */
|
|
jbe@0
|
1498 char *strptr = str; /* current position within string */
|
|
jbe@0
|
1499 int done = 0; /* bit mask storing if latitude or longitude was read */
|
|
jbe@0
|
1500 double lat, lon; /* parsed values as double precision floats */
|
|
jbe@0
|
1501 pgl_point *point; /* return value (to be palloc'ed) */
|
|
jbe@0
|
1502 /* parse two floats (each latitude or longitude) separated by white-space */
|
|
jbe@0
|
1503 done |= pgl_scan(&strptr, &lat, &lon);
|
|
jbe@0
|
1504 if (strptr != str && isspace(strptr[-1])) {
|
|
jbe@0
|
1505 done |= pgl_scan(&strptr, &lat, &lon);
|
|
jbe@0
|
1506 }
|
|
jbe@0
|
1507 /* require end of string, and latitude and longitude parsed successfully */
|
|
jbe@0
|
1508 if (strptr[0] || done != PGL_SCAN_LATLON) {
|
|
jbe@0
|
1509 ereport(ERROR, (
|
|
jbe@0
|
1510 errcode(ERRCODE_INVALID_TEXT_REPRESENTATION),
|
|
jbe@0
|
1511 errmsg("invalid input syntax for type epoint: \"%s\"", str)
|
|
jbe@0
|
1512 ));
|
|
jbe@0
|
1513 }
|
|
jbe@0
|
1514 /* allocate memory for result */
|
|
jbe@0
|
1515 point = (pgl_point *)palloc(sizeof(pgl_point));
|
|
jbe@0
|
1516 /* set latitude and longitude (and perform checks) */
|
|
jbe@0
|
1517 pgl_epoint_set_latlon(point, lat, lon);
|
|
jbe@0
|
1518 /* return result */
|
|
jbe@0
|
1519 PG_RETURN_POINTER(point);
|
|
jbe@0
|
1520 }
|
|
jbe@0
|
1521
|
|
jbe@0
|
1522 /* create box ("ebox" in SQL) that is empty */
|
|
jbe@0
|
1523 PG_FUNCTION_INFO_V1(pgl_create_empty_ebox);
|
|
jbe@0
|
1524 Datum pgl_create_empty_ebox(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
1525 pgl_box *box = (pgl_box *)palloc(sizeof(pgl_box));
|
|
jbe@0
|
1526 pgl_box_set_empty(box);
|
|
jbe@0
|
1527 PG_RETURN_POINTER(box);
|
|
jbe@0
|
1528 }
|
|
jbe@0
|
1529
|
|
jbe@0
|
1530 /* set box to given boundaries (including checks) */
|
|
jbe@0
|
1531 static void pgl_ebox_set_boundaries(
|
|
jbe@0
|
1532 pgl_box *box,
|
|
jbe@0
|
1533 double lat_min, double lat_max, double lon_min, double lon_max
|
|
jbe@0
|
1534 ) {
|
|
jbe@0
|
1535 /* if minimum latitude is greater than maximum latitude, return empty box */
|
|
jbe@0
|
1536 if (lat_min > lat_max) {
|
|
jbe@0
|
1537 pgl_box_set_empty(box);
|
|
jbe@0
|
1538 return;
|
|
jbe@0
|
1539 }
|
|
jbe@0
|
1540 /* otherwise reject infinite or NaN values */
|
|
jbe@0
|
1541 if (
|
|
jbe@0
|
1542 !isfinite(lat_min) || !isfinite(lat_max) ||
|
|
jbe@0
|
1543 !isfinite(lon_min) || !isfinite(lon_max)
|
|
jbe@0
|
1544 ) {
|
|
jbe@0
|
1545 ereport(ERROR, (
|
|
jbe@0
|
1546 errcode(ERRCODE_DATA_EXCEPTION),
|
|
jbe@0
|
1547 errmsg("ebox requires finite coordinates")
|
|
jbe@0
|
1548 ));
|
|
jbe@0
|
1549 }
|
|
jbe@0
|
1550 /* check latitude bounds */
|
|
jbe@0
|
1551 if (lat_max < -90) {
|
|
jbe@0
|
1552 ereport(WARNING, (errmsg("northern latitude exceeds south pole")));
|
|
jbe@0
|
1553 lat_max = -90;
|
|
jbe@0
|
1554 } else if (lat_max > 90) {
|
|
jbe@0
|
1555 ereport(WARNING, (errmsg("northern latitude exceeds north pole")));
|
|
jbe@0
|
1556 lat_max = 90;
|
|
jbe@0
|
1557 }
|
|
jbe@0
|
1558 if (lat_min < -90) {
|
|
jbe@0
|
1559 ereport(WARNING, (errmsg("southern latitude exceeds south pole")));
|
|
jbe@0
|
1560 lat_min = -90;
|
|
jbe@0
|
1561 } else if (lat_min > 90) {
|
|
jbe@0
|
1562 ereport(WARNING, (errmsg("southern latitude exceeds north pole")));
|
|
jbe@0
|
1563 lat_min = 90;
|
|
jbe@0
|
1564 }
|
|
jbe@0
|
1565 /* check if all longitudes are included */
|
|
jbe@0
|
1566 if (lon_max - lon_min >= 360) {
|
|
jbe@0
|
1567 if (lon_max - lon_min > 360) ereport(WARNING, (
|
|
jbe@0
|
1568 errmsg("longitude coverage greater than 360 degrees")
|
|
jbe@0
|
1569 ));
|
|
jbe@0
|
1570 lon_min = -180;
|
|
jbe@0
|
1571 lon_max = 180;
|
|
jbe@0
|
1572 } else {
|
|
jbe@0
|
1573 /* normalize longitude bounds */
|
|
jbe@0
|
1574 if (lon_min < -180) lon_min += 360 - trunc(lon_min / 360) * 360;
|
|
jbe@0
|
1575 else if (lon_min > 180) lon_min -= 360 + trunc(lon_min / 360) * 360;
|
|
jbe@0
|
1576 if (lon_max < -180) lon_max += 360 - trunc(lon_max / 360) * 360;
|
|
jbe@0
|
1577 else if (lon_max > 180) lon_max -= 360 + trunc(lon_max / 360) * 360;
|
|
jbe@0
|
1578 }
|
|
jbe@0
|
1579 /* store rounded latitude/longitude values for round-trip safety */
|
|
jbe@0
|
1580 box->lat_min = pgl_round(lat_min);
|
|
jbe@0
|
1581 box->lat_max = pgl_round(lat_max);
|
|
jbe@0
|
1582 box->lon_min = pgl_round(lon_min);
|
|
jbe@0
|
1583 box->lon_max = pgl_round(lon_max);
|
|
jbe@0
|
1584 /* ensure that rounding does not change orientation */
|
|
jbe@0
|
1585 if (lon_min > lon_max && box->lon_min == box->lon_max) {
|
|
jbe@0
|
1586 box->lon_min = -180;
|
|
jbe@0
|
1587 box->lon_max = 180;
|
|
jbe@0
|
1588 }
|
|
jbe@0
|
1589 }
|
|
jbe@0
|
1590
|
|
jbe@0
|
1591 /* create box ("ebox" in SQL) from min/max latitude and min/max longitude */
|
|
jbe@0
|
1592 PG_FUNCTION_INFO_V1(pgl_create_ebox);
|
|
jbe@0
|
1593 Datum pgl_create_ebox(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
1594 pgl_box *box = (pgl_box *)palloc(sizeof(pgl_box));
|
|
jbe@0
|
1595 pgl_ebox_set_boundaries(
|
|
jbe@0
|
1596 box,
|
|
jbe@0
|
1597 PG_GETARG_FLOAT8(0), PG_GETARG_FLOAT8(1),
|
|
jbe@0
|
1598 PG_GETARG_FLOAT8(2), PG_GETARG_FLOAT8(3)
|
|
jbe@0
|
1599 );
|
|
jbe@0
|
1600 PG_RETURN_POINTER(box);
|
|
jbe@0
|
1601 }
|
|
jbe@0
|
1602
|
|
jbe@0
|
1603 /* create box ("ebox" in SQL) from two points ("epoint"s) */
|
|
jbe@0
|
1604 /* (can not be used to cover a longitude range of more than 120 degrees) */
|
|
jbe@0
|
1605 PG_FUNCTION_INFO_V1(pgl_create_ebox_from_epoints);
|
|
jbe@0
|
1606 Datum pgl_create_ebox_from_epoints(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
1607 pgl_point *point1 = (pgl_point *)PG_GETARG_POINTER(0);
|
|
jbe@0
|
1608 pgl_point *point2 = (pgl_point *)PG_GETARG_POINTER(1);
|
|
jbe@0
|
1609 pgl_box *box = (pgl_box *)palloc(sizeof(pgl_box));
|
|
jbe@0
|
1610 double lat_min, lat_max, lon_min, lon_max;
|
|
jbe@0
|
1611 double dlon; /* longitude range (delta longitude) */
|
|
jbe@0
|
1612 /* order latitude and longitude boundaries */
|
|
jbe@0
|
1613 if (point2->lat < point1->lat) {
|
|
jbe@0
|
1614 lat_min = point2->lat;
|
|
jbe@0
|
1615 lat_max = point1->lat;
|
|
jbe@0
|
1616 } else {
|
|
jbe@0
|
1617 lat_min = point1->lat;
|
|
jbe@0
|
1618 lat_max = point2->lat;
|
|
jbe@0
|
1619 }
|
|
jbe@0
|
1620 if (point2->lon < point1->lon) {
|
|
jbe@0
|
1621 lon_min = point2->lon;
|
|
jbe@0
|
1622 lon_max = point1->lon;
|
|
jbe@0
|
1623 } else {
|
|
jbe@0
|
1624 lon_min = point1->lon;
|
|
jbe@0
|
1625 lon_max = point2->lon;
|
|
jbe@0
|
1626 }
|
|
jbe@0
|
1627 /* calculate longitude range (round to avoid floating point errors) */
|
|
jbe@0
|
1628 dlon = pgl_round(lon_max - lon_min);
|
|
jbe@0
|
1629 /* determine east-west direction */
|
|
jbe@0
|
1630 if (dlon >= 240) {
|
|
jbe@0
|
1631 /* assume that 180th meridian is crossed and swap min/max longitude */
|
|
jbe@0
|
1632 double swap = lon_min; lon_min = lon_max; lon_max = swap;
|
|
jbe@0
|
1633 } else if (dlon > 120) {
|
|
jbe@0
|
1634 /* unclear orientation since delta longitude > 120 */
|
|
jbe@0
|
1635 ereport(ERROR, (
|
|
jbe@0
|
1636 errcode(ERRCODE_DATA_EXCEPTION),
|
|
jbe@0
|
1637 errmsg("can not determine east/west orientation for ebox")
|
|
jbe@0
|
1638 ));
|
|
jbe@0
|
1639 }
|
|
jbe@0
|
1640 /* use boundaries to setup box (and perform checks) */
|
|
jbe@0
|
1641 pgl_ebox_set_boundaries(box, lat_min, lat_max, lon_min, lon_max);
|
|
jbe@0
|
1642 /* return result */
|
|
jbe@0
|
1643 PG_RETURN_POINTER(box);
|
|
jbe@0
|
1644 }
|
|
jbe@0
|
1645
|
|
jbe@0
|
1646 /* parse box ("ebox" in SQL) */
|
|
jbe@0
|
1647 /* format: '[NS]<float> [EW]<float> [NS]<float> [EW]<float>'
|
|
jbe@0
|
1648 or: '[NS]<float> [NS]<float> [EW]<float> [EW]<float>' */
|
|
jbe@0
|
1649 PG_FUNCTION_INFO_V1(pgl_ebox_in);
|
|
jbe@0
|
1650 Datum pgl_ebox_in(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
1651 char *str = PG_GETARG_CSTRING(0); /* input string */
|
|
jbe@0
|
1652 char *str_lower; /* lower case version of input string */
|
|
jbe@0
|
1653 char *strptr; /* current position within string */
|
|
jbe@0
|
1654 int valid; /* number of valid chars */
|
|
jbe@0
|
1655 int done; /* specifies if latitude or longitude was read */
|
|
jbe@0
|
1656 double val; /* temporary variable */
|
|
jbe@0
|
1657 int lat_count = 0; /* count of latitude values parsed */
|
|
jbe@0
|
1658 int lon_count = 0; /* count of longitufde values parsed */
|
|
jbe@0
|
1659 double lat_min, lat_max, lon_min, lon_max; /* see pgl_box struct */
|
|
jbe@0
|
1660 pgl_box *box; /* return value (to be palloc'ed) */
|
|
jbe@0
|
1661 /* lowercase input */
|
|
jbe@0
|
1662 str_lower = psprintf("%s", str);
|
|
jbe@0
|
1663 for (strptr=str_lower; *strptr; strptr++) {
|
|
jbe@0
|
1664 if (*strptr >= 'A' && *strptr <= 'Z') *strptr += 'a' - 'A';
|
|
jbe@0
|
1665 }
|
|
jbe@0
|
1666 /* reset reading position to start of (lowercase) string */
|
|
jbe@0
|
1667 strptr = str_lower;
|
|
jbe@0
|
1668 /* check if empty box */
|
|
jbe@0
|
1669 valid = 0;
|
|
jbe@0
|
1670 sscanf(strptr, " empty %n", &valid);
|
|
jbe@0
|
1671 if (valid && strptr[valid] == 0) {
|
|
jbe@0
|
1672 /* allocate and return empty box */
|
|
jbe@0
|
1673 box = (pgl_box *)palloc(sizeof(pgl_box));
|
|
jbe@0
|
1674 pgl_box_set_empty(box);
|
|
jbe@0
|
1675 PG_RETURN_POINTER(box);
|
|
jbe@0
|
1676 }
|
|
jbe@0
|
1677 /* demand four blocks separated by whitespace */
|
|
jbe@0
|
1678 valid = 0;
|
|
jbe@0
|
1679 sscanf(strptr, " %*s %*s %*s %*s %n", &valid);
|
|
jbe@0
|
1680 /* if four blocks separated by whitespace exist, parse those blocks */
|
|
jbe@0
|
1681 if (strptr[valid] == 0) while (strptr[0]) {
|
|
jbe@0
|
1682 /* parse either latitude or longitude (whichever found in input string) */
|
|
jbe@0
|
1683 done = pgl_scan(&strptr, &val, &val);
|
|
jbe@0
|
1684 /* store latitude or longitude in lat_min, lat_max, lon_min, or lon_max */
|
|
jbe@0
|
1685 if (done == PGL_SCAN_LAT) {
|
|
jbe@0
|
1686 if (!lat_count) lat_min = val; else lat_max = val;
|
|
jbe@0
|
1687 lat_count++;
|
|
jbe@0
|
1688 } else if (done == PGL_SCAN_LON) {
|
|
jbe@0
|
1689 if (!lon_count) lon_min = val; else lon_max = val;
|
|
jbe@0
|
1690 lon_count++;
|
|
jbe@0
|
1691 } else {
|
|
jbe@0
|
1692 break;
|
|
jbe@0
|
1693 }
|
|
jbe@0
|
1694 }
|
|
jbe@0
|
1695 /* require end of string, and two latitude and two longitude values */
|
|
jbe@0
|
1696 if (strptr[0] || lat_count != 2 || lon_count != 2) {
|
|
jbe@0
|
1697 ereport(ERROR, (
|
|
jbe@0
|
1698 errcode(ERRCODE_INVALID_TEXT_REPRESENTATION),
|
|
jbe@0
|
1699 errmsg("invalid input syntax for type ebox: \"%s\"", str)
|
|
jbe@0
|
1700 ));
|
|
jbe@0
|
1701 }
|
|
jbe@0
|
1702 /* free lower case string */
|
|
jbe@0
|
1703 pfree(str_lower);
|
|
jbe@0
|
1704 /* order boundaries (maximum greater than minimum) */
|
|
jbe@0
|
1705 if (lat_min > lat_max) { val = lat_min; lat_min = lat_max; lat_max = val; }
|
|
jbe@0
|
1706 if (lon_min > lon_max) { val = lon_min; lon_min = lon_max; lon_max = val; }
|
|
jbe@0
|
1707 /* allocate memory for result */
|
|
jbe@0
|
1708 box = (pgl_box *)palloc(sizeof(pgl_box));
|
|
jbe@0
|
1709 /* set boundaries (and perform checks) */
|
|
jbe@0
|
1710 pgl_ebox_set_boundaries(box, lat_min, lat_max, lon_min, lon_max);
|
|
jbe@0
|
1711 /* return result */
|
|
jbe@0
|
1712 PG_RETURN_POINTER(box);
|
|
jbe@0
|
1713 }
|
|
jbe@0
|
1714
|
|
jbe@0
|
1715 /* set circle to given latitude, longitude, and radius (including checks) */
|
|
jbe@0
|
1716 static void pgl_ecircle_set_latlon_radius(
|
|
jbe@0
|
1717 pgl_circle *circle, double lat, double lon, double radius
|
|
jbe@0
|
1718 ) {
|
|
jbe@0
|
1719 /* set center point (including checks) */
|
|
jbe@0
|
1720 pgl_epoint_set_latlon(&(circle->center), lat, lon);
|
|
jbe@0
|
1721 /* handle non-positive radius */
|
|
jbe@0
|
1722 if (isnan(radius)) {
|
|
jbe@0
|
1723 ereport(ERROR, (
|
|
jbe@0
|
1724 errcode(ERRCODE_DATA_EXCEPTION),
|
|
jbe@0
|
1725 errmsg("invalid radius for ecircle")
|
|
jbe@0
|
1726 ));
|
|
jbe@0
|
1727 }
|
|
jbe@0
|
1728 if (radius == 0) radius = 0; /* avoids -0 */
|
|
jbe@0
|
1729 else if (radius < 0) {
|
|
jbe@0
|
1730 if (isfinite(radius)) {
|
|
jbe@0
|
1731 ereport(NOTICE, (errmsg("negative radius converted to minus infinity")));
|
|
jbe@0
|
1732 }
|
|
jbe@0
|
1733 radius = -INFINITY;
|
|
jbe@0
|
1734 }
|
|
jbe@0
|
1735 /* store radius (round-trip safety is ensured by pgl_print_float) */
|
|
jbe@0
|
1736 circle->radius = radius;
|
|
jbe@0
|
1737 }
|
|
jbe@0
|
1738
|
|
jbe@0
|
1739 /* create circle ("ecircle" in SQL) from latitude, longitude, and radius */
|
|
jbe@0
|
1740 PG_FUNCTION_INFO_V1(pgl_create_ecircle);
|
|
jbe@0
|
1741 Datum pgl_create_ecircle(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
1742 pgl_circle *circle = (pgl_circle *)palloc(sizeof(pgl_circle));
|
|
jbe@0
|
1743 pgl_ecircle_set_latlon_radius(
|
|
jbe@0
|
1744 circle, PG_GETARG_FLOAT8(0), PG_GETARG_FLOAT8(1), PG_GETARG_FLOAT8(2)
|
|
jbe@0
|
1745 );
|
|
jbe@0
|
1746 PG_RETURN_POINTER(circle);
|
|
jbe@0
|
1747 }
|
|
jbe@0
|
1748
|
|
jbe@0
|
1749 /* create circle ("ecircle" in SQL) from point ("epoint"), and radius */
|
|
jbe@0
|
1750 PG_FUNCTION_INFO_V1(pgl_create_ecircle_from_epoint);
|
|
jbe@0
|
1751 Datum pgl_create_ecircle_from_epoint(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
1752 pgl_point *point = (pgl_point *)PG_GETARG_POINTER(0);
|
|
jbe@0
|
1753 double radius = PG_GETARG_FLOAT8(1);
|
|
jbe@0
|
1754 pgl_circle *circle = (pgl_circle *)palloc(sizeof(pgl_circle));
|
|
jbe@0
|
1755 /* set latitude, longitude, radius (and perform checks) */
|
|
jbe@0
|
1756 pgl_ecircle_set_latlon_radius(circle, point->lat, point->lon, radius);
|
|
jbe@0
|
1757 /* return result */
|
|
jbe@0
|
1758 PG_RETURN_POINTER(circle);
|
|
jbe@0
|
1759 }
|
|
jbe@0
|
1760
|
|
jbe@0
|
1761 /* parse circle ("ecircle" in SQL) */
|
|
jbe@0
|
1762 /* format: '[NS]<float> [EW]<float> <float>' */
|
|
jbe@0
|
1763 PG_FUNCTION_INFO_V1(pgl_ecircle_in);
|
|
jbe@0
|
1764 Datum pgl_ecircle_in(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
1765 char *str = PG_GETARG_CSTRING(0); /* input string */
|
|
jbe@0
|
1766 char *strptr = str; /* current position within string */
|
|
jbe@0
|
1767 double lat, lon, radius; /* parsed values as double precision flaots */
|
|
jbe@0
|
1768 int valid = 0; /* number of valid chars */
|
|
jbe@0
|
1769 int done = 0; /* stores if latitude and/or longitude was read */
|
|
jbe@0
|
1770 pgl_circle *circle; /* return value (to be palloc'ed) */
|
|
jbe@0
|
1771 /* demand three blocks separated by whitespace */
|
|
jbe@0
|
1772 sscanf(strptr, " %*s %*s %*s %n", &valid);
|
|
jbe@0
|
1773 /* if three blocks separated by whitespace exist, parse those blocks */
|
|
jbe@0
|
1774 if (strptr[valid] == 0) {
|
|
jbe@0
|
1775 /* parse latitude and longitude */
|
|
jbe@0
|
1776 done |= pgl_scan(&strptr, &lat, &lon);
|
|
jbe@0
|
1777 done |= pgl_scan(&strptr, &lat, &lon);
|
|
jbe@0
|
1778 /* parse radius (while incrementing strptr by number of bytes parsed) */
|
|
jbe@0
|
1779 valid = 0;
|
|
jbe@0
|
1780 if (sscanf(strptr, " %lf %n", &radius, &valid) == 1) strptr += valid;
|
|
jbe@0
|
1781 }
|
|
jbe@0
|
1782 /* require end of string and both latitude and longitude being parsed */
|
|
jbe@0
|
1783 if (strptr[0] || done != PGL_SCAN_LATLON) {
|
|
jbe@0
|
1784 ereport(ERROR, (
|
|
jbe@0
|
1785 errcode(ERRCODE_INVALID_TEXT_REPRESENTATION),
|
|
jbe@0
|
1786 errmsg("invalid input syntax for type ecircle: \"%s\"", str)
|
|
jbe@0
|
1787 ));
|
|
jbe@0
|
1788 }
|
|
jbe@0
|
1789 /* allocate memory for result */
|
|
jbe@0
|
1790 circle = (pgl_circle *)palloc(sizeof(pgl_circle));
|
|
jbe@0
|
1791 /* set latitude, longitude, radius (and perform checks) */
|
|
jbe@0
|
1792 pgl_ecircle_set_latlon_radius(circle, lat, lon, radius);
|
|
jbe@0
|
1793 /* return result */
|
|
jbe@0
|
1794 PG_RETURN_POINTER(circle);
|
|
jbe@0
|
1795 }
|
|
jbe@0
|
1796
|
|
jbe@0
|
1797 /* parse cluster ("ecluster" in SQL) */
|
|
jbe@0
|
1798 PG_FUNCTION_INFO_V1(pgl_ecluster_in);
|
|
jbe@0
|
1799 Datum pgl_ecluster_in(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
1800 int i;
|
|
jbe@0
|
1801 char *str = PG_GETARG_CSTRING(0); /* input string */
|
|
jbe@0
|
1802 char *str_lower; /* lower case version of input string */
|
|
jbe@0
|
1803 char *strptr; /* pointer to current reading position of input */
|
|
jbe@0
|
1804 int npoints_total = 0; /* total number of points in cluster */
|
|
jbe@0
|
1805 int nentries = 0; /* total number of entries */
|
|
jbe@0
|
1806 pgl_newentry *entries; /* array of pgl_newentry to create pgl_cluster */
|
|
jbe@0
|
1807 int entries_buflen = 4; /* maximum number of elements in entries array */
|
|
jbe@0
|
1808 int valid; /* number of valid chars processed */
|
|
jbe@0
|
1809 double lat, lon; /* latitude and longitude of parsed point */
|
|
jbe@0
|
1810 int entrytype; /* current entry type */
|
|
jbe@0
|
1811 int npoints; /* number of points in current entry */
|
|
jbe@0
|
1812 pgl_point *points; /* array of pgl_point for pgl_newentry */
|
|
jbe@0
|
1813 int points_buflen; /* maximum number of elements in points array */
|
|
jbe@0
|
1814 int done; /* return value of pgl_scan function */
|
|
jbe@0
|
1815 pgl_cluster *cluster; /* created cluster */
|
|
jbe@0
|
1816 /* lowercase input */
|
|
jbe@0
|
1817 str_lower = psprintf("%s", str);
|
|
jbe@0
|
1818 for (strptr=str_lower; *strptr; strptr++) {
|
|
jbe@0
|
1819 if (*strptr >= 'A' && *strptr <= 'Z') *strptr += 'a' - 'A';
|
|
jbe@0
|
1820 }
|
|
jbe@0
|
1821 /* reset reading position to start of (lowercase) string */
|
|
jbe@0
|
1822 strptr = str_lower;
|
|
jbe@0
|
1823 /* allocate initial buffer for entries */
|
|
jbe@0
|
1824 entries = palloc(entries_buflen * sizeof(pgl_newentry));
|
|
jbe@0
|
1825 /* parse until end of string */
|
|
jbe@0
|
1826 while (strptr[0]) {
|
|
jbe@0
|
1827 /* require previous white-space or closing parenthesis before next token */
|
|
jbe@0
|
1828 if (strptr != str_lower && !isspace(strptr[-1]) && strptr[-1] != ')') {
|
|
jbe@0
|
1829 goto pgl_ecluster_in_error;
|
|
jbe@0
|
1830 }
|
|
jbe@0
|
1831 /* ignore token "empty" */
|
|
jbe@0
|
1832 valid = 0; sscanf(strptr, " empty %n", &valid);
|
|
jbe@0
|
1833 if (valid) { strptr += valid; continue; }
|
|
jbe@0
|
1834 /* test for "point" token */
|
|
jbe@0
|
1835 valid = 0; sscanf(strptr, " point ( %n", &valid);
|
|
jbe@0
|
1836 if (valid) {
|
|
jbe@0
|
1837 strptr += valid;
|
|
jbe@0
|
1838 entrytype = PGL_ENTRY_POINT;
|
|
jbe@0
|
1839 goto pgl_ecluster_in_type_ok;
|
|
jbe@0
|
1840 }
|
|
jbe@0
|
1841 /* test for "path" token */
|
|
jbe@0
|
1842 valid = 0; sscanf(strptr, " path ( %n", &valid);
|
|
jbe@0
|
1843 if (valid) {
|
|
jbe@0
|
1844 strptr += valid;
|
|
jbe@0
|
1845 entrytype = PGL_ENTRY_PATH;
|
|
jbe@0
|
1846 goto pgl_ecluster_in_type_ok;
|
|
jbe@0
|
1847 }
|
|
jbe@0
|
1848 /* test for "outline" token */
|
|
jbe@0
|
1849 valid = 0; sscanf(strptr, " outline ( %n", &valid);
|
|
jbe@0
|
1850 if (valid) {
|
|
jbe@0
|
1851 strptr += valid;
|
|
jbe@0
|
1852 entrytype = PGL_ENTRY_OUTLINE;
|
|
jbe@0
|
1853 goto pgl_ecluster_in_type_ok;
|
|
jbe@0
|
1854 }
|
|
jbe@0
|
1855 /* test for "polygon" token */
|
|
jbe@0
|
1856 valid = 0; sscanf(strptr, " polygon ( %n", &valid);
|
|
jbe@0
|
1857 if (valid) {
|
|
jbe@0
|
1858 strptr += valid;
|
|
jbe@0
|
1859 entrytype = PGL_ENTRY_POLYGON;
|
|
jbe@0
|
1860 goto pgl_ecluster_in_type_ok;
|
|
jbe@0
|
1861 }
|
|
jbe@0
|
1862 /* error if no valid token found */
|
|
jbe@0
|
1863 goto pgl_ecluster_in_error;
|
|
jbe@0
|
1864 pgl_ecluster_in_type_ok:
|
|
jbe@0
|
1865 /* check if pgl_newentry array needs to grow */
|
|
jbe@0
|
1866 if (nentries == entries_buflen) {
|
|
jbe@0
|
1867 pgl_newentry *newbuf;
|
|
jbe@0
|
1868 entries_buflen *= 2;
|
|
jbe@0
|
1869 newbuf = palloc(entries_buflen * sizeof(pgl_newentry));
|
|
jbe@0
|
1870 memcpy(newbuf, entries, nentries * sizeof(pgl_newentry));
|
|
jbe@0
|
1871 pfree(entries);
|
|
jbe@0
|
1872 entries = newbuf;
|
|
jbe@0
|
1873 }
|
|
jbe@0
|
1874 /* reset number of points for current entry */
|
|
jbe@0
|
1875 npoints = 0;
|
|
jbe@0
|
1876 /* allocate array for points */
|
|
jbe@0
|
1877 points_buflen = 4;
|
|
jbe@0
|
1878 points = palloc(points_buflen * sizeof(pgl_point));
|
|
jbe@0
|
1879 /* parse until closing parenthesis */
|
|
jbe@0
|
1880 while (strptr[0] != ')') {
|
|
jbe@0
|
1881 /* error on unexpected end of string */
|
|
jbe@0
|
1882 if (strptr[0] == 0) goto pgl_ecluster_in_error;
|
|
jbe@0
|
1883 /* mark neither latitude nor longitude as read */
|
|
jbe@0
|
1884 done = PGL_SCAN_NONE;
|
|
jbe@0
|
1885 /* require white-space before second, third, etc. point */
|
|
jbe@0
|
1886 if (npoints != 0 && !isspace(strptr[-1])) goto pgl_ecluster_in_error;
|
|
jbe@0
|
1887 /* scan latitude (or longitude) */
|
|
jbe@0
|
1888 done |= pgl_scan(&strptr, &lat, &lon);
|
|
jbe@0
|
1889 /* require white-space before second coordinate */
|
|
jbe@0
|
1890 if (strptr != str && !isspace(strptr[-1])) goto pgl_ecluster_in_error;
|
|
jbe@0
|
1891 /* scan longitude (or latitude) */
|
|
jbe@0
|
1892 done |= pgl_scan(&strptr, &lat, &lon);
|
|
jbe@0
|
1893 /* error unless both latitude and longitude were parsed */
|
|
jbe@0
|
1894 if (done != PGL_SCAN_LATLON) goto pgl_ecluster_in_error;
|
|
jbe@0
|
1895 /* throw error if number of points is too high */
|
|
jbe@0
|
1896 if (npoints_total == PGL_CLUSTER_MAXPOINTS) {
|
|
jbe@0
|
1897 ereport(ERROR, (
|
|
jbe@0
|
1898 errcode(ERRCODE_INVALID_TEXT_REPRESENTATION),
|
|
jbe@0
|
1899 errmsg(
|
|
jbe@0
|
1900 "too many points for ecluster entry (maximum %i)",
|
|
jbe@0
|
1901 PGL_CLUSTER_MAXPOINTS
|
|
jbe@0
|
1902 )
|
|
jbe@0
|
1903 ));
|
|
jbe@0
|
1904 }
|
|
jbe@0
|
1905 /* check if pgl_point array needs to grow */
|
|
jbe@0
|
1906 if (npoints == points_buflen) {
|
|
jbe@0
|
1907 pgl_point *newbuf;
|
|
jbe@0
|
1908 points_buflen *= 2;
|
|
jbe@0
|
1909 newbuf = palloc(points_buflen * sizeof(pgl_point));
|
|
jbe@0
|
1910 memcpy(newbuf, points, npoints * sizeof(pgl_point));
|
|
jbe@0
|
1911 pfree(points);
|
|
jbe@0
|
1912 points = newbuf;
|
|
jbe@0
|
1913 }
|
|
jbe@0
|
1914 /* append point to pgl_point array (includes checks) */
|
|
jbe@0
|
1915 pgl_epoint_set_latlon(&(points[npoints++]), lat, lon);
|
|
jbe@0
|
1916 /* increase total number of points */
|
|
jbe@0
|
1917 npoints_total++;
|
|
jbe@0
|
1918 }
|
|
jbe@0
|
1919 /* error if entry has no points */
|
|
jbe@0
|
1920 if (!npoints) goto pgl_ecluster_in_error;
|
|
jbe@0
|
1921 /* entries with one point are automatically of type "point" */
|
|
jbe@0
|
1922 if (npoints == 1) entrytype = PGL_ENTRY_POINT;
|
|
jbe@0
|
1923 /* if entries have more than one point */
|
|
jbe@0
|
1924 else {
|
|
jbe@0
|
1925 /* throw error if entry type is "point" */
|
|
jbe@0
|
1926 if (entrytype == PGL_ENTRY_POINT) {
|
|
jbe@0
|
1927 ereport(ERROR, (
|
|
jbe@0
|
1928 errcode(ERRCODE_INVALID_TEXT_REPRESENTATION),
|
|
jbe@0
|
1929 errmsg("invalid input syntax for type ecluster (point entry with more than one point)")
|
|
jbe@0
|
1930 ));
|
|
jbe@0
|
1931 }
|
|
jbe@0
|
1932 /* coerce outlines and polygons with more than 2 points to be a path */
|
|
jbe@0
|
1933 if (npoints == 2) entrytype = PGL_ENTRY_PATH;
|
|
jbe@0
|
1934 }
|
|
jbe@0
|
1935 /* append entry to pgl_newentry array */
|
|
jbe@0
|
1936 entries[nentries].entrytype = entrytype;
|
|
jbe@0
|
1937 entries[nentries].npoints = npoints;
|
|
jbe@0
|
1938 entries[nentries].points = points;
|
|
jbe@0
|
1939 nentries++;
|
|
jbe@0
|
1940 /* consume closing parenthesis */
|
|
jbe@0
|
1941 strptr++;
|
|
jbe@0
|
1942 /* consume white-space */
|
|
jbe@0
|
1943 while (isspace(strptr[0])) strptr++;
|
|
jbe@0
|
1944 }
|
|
jbe@0
|
1945 /* free lower case string */
|
|
jbe@0
|
1946 pfree(str_lower);
|
|
jbe@0
|
1947 /* create cluster from pgl_newentry array */
|
|
jbe@0
|
1948 cluster = pgl_new_cluster(nentries, entries);
|
|
jbe@0
|
1949 /* free pgl_newentry array */
|
|
jbe@0
|
1950 for (i=0; i<nentries; i++) pfree(entries[i].points);
|
|
jbe@0
|
1951 pfree(entries);
|
|
jbe@0
|
1952 /* set bounding circle of cluster and check east/west orientation */
|
|
jbe@0
|
1953 if (!pgl_finalize_cluster(cluster)) {
|
|
jbe@0
|
1954 ereport(ERROR, (
|
|
jbe@0
|
1955 errcode(ERRCODE_DATA_EXCEPTION),
|
|
jbe@0
|
1956 errmsg("can not determine east/west orientation for ecluster"),
|
|
jbe@0
|
1957 errhint("Ensure that each entry has a longitude span of less than 180 degrees.")
|
|
jbe@0
|
1958 ));
|
|
jbe@0
|
1959 }
|
|
jbe@0
|
1960 /* return cluster */
|
|
jbe@0
|
1961 PG_RETURN_POINTER(cluster);
|
|
jbe@0
|
1962 /* code to throw error */
|
|
jbe@0
|
1963 pgl_ecluster_in_error:
|
|
jbe@0
|
1964 ereport(ERROR, (
|
|
jbe@0
|
1965 errcode(ERRCODE_INVALID_TEXT_REPRESENTATION),
|
|
jbe@0
|
1966 errmsg("invalid input syntax for type ecluster: \"%s\"", str)
|
|
jbe@0
|
1967 ));
|
|
jbe@0
|
1968 }
|
|
jbe@0
|
1969
|
|
jbe@0
|
1970 /* convert point ("epoint") to string representation */
|
|
jbe@0
|
1971 PG_FUNCTION_INFO_V1(pgl_epoint_out);
|
|
jbe@0
|
1972 Datum pgl_epoint_out(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
1973 pgl_point *point = (pgl_point *)PG_GETARG_POINTER(0);
|
|
jbe@0
|
1974 char latstr[PGL_NUMBUFLEN];
|
|
jbe@0
|
1975 char lonstr[PGL_NUMBUFLEN];
|
|
jbe@0
|
1976 pgl_print_lat(latstr, point->lat);
|
|
jbe@0
|
1977 pgl_print_lon(lonstr, point->lon);
|
|
jbe@0
|
1978 PG_RETURN_CSTRING(psprintf("%s %s", latstr, lonstr));
|
|
jbe@0
|
1979 }
|
|
jbe@0
|
1980
|
|
jbe@0
|
1981 /* convert box ("ebox") to string representation */
|
|
jbe@0
|
1982 PG_FUNCTION_INFO_V1(pgl_ebox_out);
|
|
jbe@0
|
1983 Datum pgl_ebox_out(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
1984 pgl_box *box = (pgl_box *)PG_GETARG_POINTER(0);
|
|
jbe@0
|
1985 double lon_min = box->lon_min;
|
|
jbe@0
|
1986 double lon_max = box->lon_max;
|
|
jbe@0
|
1987 char lat_min_str[PGL_NUMBUFLEN];
|
|
jbe@0
|
1988 char lat_max_str[PGL_NUMBUFLEN];
|
|
jbe@0
|
1989 char lon_min_str[PGL_NUMBUFLEN];
|
|
jbe@0
|
1990 char lon_max_str[PGL_NUMBUFLEN];
|
|
jbe@0
|
1991 /* return string "empty" if box is set to be empty */
|
|
jbe@0
|
1992 if (box->lat_min > box->lat_max) PG_RETURN_CSTRING("empty");
|
|
jbe@0
|
1993 /* use boundaries exceeding W180 or E180 if 180th meridian is enclosed */
|
|
jbe@0
|
1994 /* (required since pgl_box_in orders the longitude boundaries) */
|
|
jbe@0
|
1995 if (lon_min > lon_max) {
|
|
jbe@0
|
1996 if (lon_min + lon_max >= 0) lon_min -= 360;
|
|
jbe@0
|
1997 else lon_max += 360;
|
|
jbe@0
|
1998 }
|
|
jbe@0
|
1999 /* format and return result */
|
|
jbe@0
|
2000 pgl_print_lat(lat_min_str, box->lat_min);
|
|
jbe@0
|
2001 pgl_print_lat(lat_max_str, box->lat_max);
|
|
jbe@0
|
2002 pgl_print_lon(lon_min_str, lon_min);
|
|
jbe@0
|
2003 pgl_print_lon(lon_max_str, lon_max);
|
|
jbe@0
|
2004 PG_RETURN_CSTRING(psprintf(
|
|
jbe@0
|
2005 "%s %s %s %s",
|
|
jbe@0
|
2006 lat_min_str, lon_min_str, lat_max_str, lon_max_str
|
|
jbe@0
|
2007 ));
|
|
jbe@0
|
2008 }
|
|
jbe@0
|
2009
|
|
jbe@0
|
2010 /* convert circle ("ecircle") to string representation */
|
|
jbe@0
|
2011 PG_FUNCTION_INFO_V1(pgl_ecircle_out);
|
|
jbe@0
|
2012 Datum pgl_ecircle_out(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2013 pgl_circle *circle = (pgl_circle *)PG_GETARG_POINTER(0);
|
|
jbe@0
|
2014 char latstr[PGL_NUMBUFLEN];
|
|
jbe@0
|
2015 char lonstr[PGL_NUMBUFLEN];
|
|
jbe@0
|
2016 char radstr[PGL_NUMBUFLEN];
|
|
jbe@0
|
2017 pgl_print_lat(latstr, circle->center.lat);
|
|
jbe@0
|
2018 pgl_print_lon(lonstr, circle->center.lon);
|
|
jbe@0
|
2019 pgl_print_float(radstr, circle->radius);
|
|
jbe@0
|
2020 PG_RETURN_CSTRING(psprintf("%s %s %s", latstr, lonstr, radstr));
|
|
jbe@0
|
2021 }
|
|
jbe@0
|
2022
|
|
jbe@0
|
2023 /* convert cluster ("ecluster") to string representation */
|
|
jbe@0
|
2024 PG_FUNCTION_INFO_V1(pgl_ecluster_out);
|
|
jbe@0
|
2025 Datum pgl_ecluster_out(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2026 pgl_cluster *cluster = (pgl_cluster *)PG_DETOAST_DATUM(PG_GETARG_DATUM(0));
|
|
jbe@0
|
2027 char latstr[PGL_NUMBUFLEN]; /* string buffer for latitude */
|
|
jbe@0
|
2028 char lonstr[PGL_NUMBUFLEN]; /* string buffer for longitude */
|
|
jbe@0
|
2029 char ***strings; /* array of array of strings */
|
|
jbe@0
|
2030 char *string; /* string of current token */
|
|
jbe@0
|
2031 char *res, *resptr; /* result and pointer to current write position */
|
|
jbe@0
|
2032 size_t reslen = 1; /* length of result (init with 1 for terminator) */
|
|
jbe@0
|
2033 int npoints; /* number of points of current entry */
|
|
jbe@0
|
2034 int i, j; /* i: entry, j: point in entry */
|
|
jbe@0
|
2035 /* handle empty clusters */
|
|
jbe@0
|
2036 if (cluster->nentries == 0) {
|
|
jbe@0
|
2037 /* free detoasted cluster (if copy) */
|
|
jbe@0
|
2038 PG_FREE_IF_COPY(cluster, 0);
|
|
jbe@0
|
2039 /* return static result */
|
|
jbe@0
|
2040 PG_RETURN_CSTRING("empty");
|
|
jbe@0
|
2041 }
|
|
jbe@0
|
2042 /* allocate array of array of strings */
|
|
jbe@0
|
2043 strings = palloc(cluster->nentries * sizeof(char **));
|
|
jbe@0
|
2044 /* iterate over all entries in cluster */
|
|
jbe@0
|
2045 for (i=0; i<cluster->nentries; i++) {
|
|
jbe@0
|
2046 /* get number of points in entry */
|
|
jbe@0
|
2047 npoints = cluster->entries[i].npoints;
|
|
jbe@0
|
2048 /* allocate array of strings (one string for each point plus two extra) */
|
|
jbe@0
|
2049 strings[i] = palloc((2 + npoints) * sizeof(char *));
|
|
jbe@0
|
2050 /* determine opening string */
|
|
jbe@0
|
2051 switch (cluster->entries[i].entrytype) {
|
|
jbe@0
|
2052 case PGL_ENTRY_POINT: string = (i==0)?"point (" :" point ("; break;
|
|
jbe@0
|
2053 case PGL_ENTRY_PATH: string = (i==0)?"path (" :" path ("; break;
|
|
jbe@0
|
2054 case PGL_ENTRY_OUTLINE: string = (i==0)?"outline (":" outline ("; break;
|
|
jbe@0
|
2055 case PGL_ENTRY_POLYGON: string = (i==0)?"polygon (":" polygon ("; break;
|
|
jbe@0
|
2056 default: string = (i==0)?"unknown" :" unknown";
|
|
jbe@0
|
2057 }
|
|
jbe@0
|
2058 /* use opening string as first string in array */
|
|
jbe@0
|
2059 strings[i][0] = string;
|
|
jbe@0
|
2060 /* update result length (for allocating result string later) */
|
|
jbe@0
|
2061 reslen += strlen(string);
|
|
jbe@0
|
2062 /* iterate over all points */
|
|
jbe@0
|
2063 for (j=0; j<npoints; j++) {
|
|
jbe@0
|
2064 /* create string representation of point */
|
|
jbe@0
|
2065 pgl_print_lat(latstr, PGL_ENTRY_POINTS(cluster, i)[j].lat);
|
|
jbe@0
|
2066 pgl_print_lon(lonstr, PGL_ENTRY_POINTS(cluster, i)[j].lon);
|
|
jbe@0
|
2067 string = psprintf((j == 0) ? "%s %s" : " %s %s", latstr, lonstr);
|
|
jbe@0
|
2068 /* copy string pointer to string array */
|
|
jbe@0
|
2069 strings[i][j+1] = string;
|
|
jbe@0
|
2070 /* update result length (for allocating result string later) */
|
|
jbe@0
|
2071 reslen += strlen(string);
|
|
jbe@0
|
2072 }
|
|
jbe@0
|
2073 /* use closing parenthesis as last string in array */
|
|
jbe@0
|
2074 strings[i][npoints+1] = ")";
|
|
jbe@0
|
2075 /* update result length (for allocating result string later) */
|
|
jbe@0
|
2076 reslen++;
|
|
jbe@0
|
2077 }
|
|
jbe@0
|
2078 /* allocate result string */
|
|
jbe@0
|
2079 res = palloc(reslen);
|
|
jbe@0
|
2080 /* set write pointer to begin of result string */
|
|
jbe@0
|
2081 resptr = res;
|
|
jbe@0
|
2082 /* copy strings into result string */
|
|
jbe@0
|
2083 for (i=0; i<cluster->nentries; i++) {
|
|
jbe@0
|
2084 npoints = cluster->entries[i].npoints;
|
|
jbe@0
|
2085 for (j=0; j<npoints+2; j++) {
|
|
jbe@0
|
2086 string = strings[i][j];
|
|
jbe@0
|
2087 strcpy(resptr, string);
|
|
jbe@0
|
2088 resptr += strlen(string);
|
|
jbe@0
|
2089 /* free strings allocated by psprintf */
|
|
jbe@0
|
2090 if (j != 0 && j != npoints+1) pfree(string);
|
|
jbe@0
|
2091 }
|
|
jbe@0
|
2092 /* free array of strings */
|
|
jbe@0
|
2093 pfree(strings[i]);
|
|
jbe@0
|
2094 }
|
|
jbe@0
|
2095 /* free array of array of strings */
|
|
jbe@0
|
2096 pfree(strings);
|
|
jbe@0
|
2097 /* free detoasted cluster (if copy) */
|
|
jbe@0
|
2098 PG_FREE_IF_COPY(cluster, 0);
|
|
jbe@0
|
2099 /* return result */
|
|
jbe@0
|
2100 PG_RETURN_CSTRING(res);
|
|
jbe@0
|
2101 }
|
|
jbe@0
|
2102
|
|
jbe@0
|
2103 /* binary input function for point ("epoint") */
|
|
jbe@0
|
2104 PG_FUNCTION_INFO_V1(pgl_epoint_recv);
|
|
jbe@0
|
2105 Datum pgl_epoint_recv(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2106 StringInfo buf = (StringInfo)PG_GETARG_POINTER(0);
|
|
jbe@0
|
2107 pgl_point *point = (pgl_point *)palloc(sizeof(pgl_point));
|
|
jbe@0
|
2108 point->lat = pq_getmsgfloat8(buf);
|
|
jbe@0
|
2109 point->lon = pq_getmsgfloat8(buf);
|
|
jbe@0
|
2110 PG_RETURN_POINTER(point);
|
|
jbe@0
|
2111 }
|
|
jbe@0
|
2112
|
|
jbe@0
|
2113 /* binary input function for box ("ebox") */
|
|
jbe@0
|
2114 PG_FUNCTION_INFO_V1(pgl_ebox_recv);
|
|
jbe@0
|
2115 Datum pgl_ebox_recv(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2116 StringInfo buf = (StringInfo)PG_GETARG_POINTER(0);
|
|
jbe@0
|
2117 pgl_box *box = (pgl_box *)palloc(sizeof(pgl_box));
|
|
jbe@0
|
2118 box->lat_min = pq_getmsgfloat8(buf);
|
|
jbe@0
|
2119 box->lat_max = pq_getmsgfloat8(buf);
|
|
jbe@0
|
2120 box->lon_min = pq_getmsgfloat8(buf);
|
|
jbe@0
|
2121 box->lon_max = pq_getmsgfloat8(buf);
|
|
jbe@0
|
2122 PG_RETURN_POINTER(box);
|
|
jbe@0
|
2123 }
|
|
jbe@0
|
2124
|
|
jbe@0
|
2125 /* binary input function for circle ("ecircle") */
|
|
jbe@0
|
2126 PG_FUNCTION_INFO_V1(pgl_ecircle_recv);
|
|
jbe@0
|
2127 Datum pgl_ecircle_recv(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2128 StringInfo buf = (StringInfo)PG_GETARG_POINTER(0);
|
|
jbe@0
|
2129 pgl_circle *circle = (pgl_circle *)palloc(sizeof(pgl_circle));
|
|
jbe@0
|
2130 circle->center.lat = pq_getmsgfloat8(buf);
|
|
jbe@0
|
2131 circle->center.lon = pq_getmsgfloat8(buf);
|
|
jbe@0
|
2132 circle->radius = pq_getmsgfloat8(buf);
|
|
jbe@0
|
2133 PG_RETURN_POINTER(circle);
|
|
jbe@0
|
2134 }
|
|
jbe@0
|
2135
|
|
jbe@0
|
2136 /* TODO: binary receive function for cluster */
|
|
jbe@0
|
2137
|
|
jbe@0
|
2138 /* binary output function for point ("epoint") */
|
|
jbe@0
|
2139 PG_FUNCTION_INFO_V1(pgl_epoint_send);
|
|
jbe@0
|
2140 Datum pgl_epoint_send(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2141 pgl_point *point = (pgl_point *)PG_GETARG_POINTER(0);
|
|
jbe@0
|
2142 StringInfoData buf;
|
|
jbe@0
|
2143 pq_begintypsend(&buf);
|
|
jbe@0
|
2144 pq_sendfloat8(&buf, point->lat);
|
|
jbe@0
|
2145 pq_sendfloat8(&buf, point->lon);
|
|
jbe@0
|
2146 PG_RETURN_BYTEA_P(pq_endtypsend(&buf));
|
|
jbe@0
|
2147 }
|
|
jbe@0
|
2148
|
|
jbe@0
|
2149 /* binary output function for box ("ebox") */
|
|
jbe@0
|
2150 PG_FUNCTION_INFO_V1(pgl_ebox_send);
|
|
jbe@0
|
2151 Datum pgl_ebox_send(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2152 pgl_box *box = (pgl_box *)PG_GETARG_POINTER(0);
|
|
jbe@0
|
2153 StringInfoData buf;
|
|
jbe@0
|
2154 pq_begintypsend(&buf);
|
|
jbe@0
|
2155 pq_sendfloat8(&buf, box->lat_min);
|
|
jbe@0
|
2156 pq_sendfloat8(&buf, box->lat_max);
|
|
jbe@0
|
2157 pq_sendfloat8(&buf, box->lon_min);
|
|
jbe@0
|
2158 pq_sendfloat8(&buf, box->lon_max);
|
|
jbe@0
|
2159 PG_RETURN_BYTEA_P(pq_endtypsend(&buf));
|
|
jbe@0
|
2160 }
|
|
jbe@0
|
2161
|
|
jbe@0
|
2162 /* binary output function for circle ("ecircle") */
|
|
jbe@0
|
2163 PG_FUNCTION_INFO_V1(pgl_ecircle_send);
|
|
jbe@0
|
2164 Datum pgl_ecircle_send(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2165 pgl_circle *circle = (pgl_circle *)PG_GETARG_POINTER(0);
|
|
jbe@0
|
2166 StringInfoData buf;
|
|
jbe@0
|
2167 pq_begintypsend(&buf);
|
|
jbe@0
|
2168 pq_sendfloat8(&buf, circle->center.lat);
|
|
jbe@0
|
2169 pq_sendfloat8(&buf, circle->center.lon);
|
|
jbe@0
|
2170 pq_sendfloat8(&buf, circle->radius);
|
|
jbe@0
|
2171 PG_RETURN_BYTEA_P(pq_endtypsend(&buf));
|
|
jbe@0
|
2172 }
|
|
jbe@0
|
2173
|
|
jbe@0
|
2174 /* TODO: binary send functions for cluster */
|
|
jbe@0
|
2175
|
|
jbe@0
|
2176 /* cast point ("epoint") to box ("ebox") */
|
|
jbe@0
|
2177 PG_FUNCTION_INFO_V1(pgl_epoint_to_ebox);
|
|
jbe@0
|
2178 Datum pgl_epoint_to_ebox(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2179 pgl_point *point = (pgl_point *)PG_GETARG_POINTER(0);
|
|
jbe@0
|
2180 pgl_box *box = palloc(sizeof(pgl_box));
|
|
jbe@0
|
2181 box->lat_min = point->lat;
|
|
jbe@0
|
2182 box->lat_max = point->lat;
|
|
jbe@0
|
2183 box->lon_min = point->lon;
|
|
jbe@0
|
2184 box->lon_max = point->lon;
|
|
jbe@0
|
2185 PG_RETURN_POINTER(box);
|
|
jbe@0
|
2186 }
|
|
jbe@0
|
2187
|
|
jbe@0
|
2188 /* cast point ("epoint") to circle ("ecircle") */
|
|
jbe@0
|
2189 PG_FUNCTION_INFO_V1(pgl_epoint_to_ecircle);
|
|
jbe@0
|
2190 Datum pgl_epoint_to_ecircle(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2191 pgl_point *point = (pgl_point *)PG_GETARG_POINTER(0);
|
|
jbe@0
|
2192 pgl_circle *circle = palloc(sizeof(pgl_box));
|
|
jbe@0
|
2193 circle->center = *point;
|
|
jbe@0
|
2194 circle->radius = 0;
|
|
jbe@0
|
2195 PG_RETURN_POINTER(circle);
|
|
jbe@0
|
2196 }
|
|
jbe@0
|
2197
|
|
jbe@0
|
2198 /* cast point ("epoint") to cluster ("ecluster") */
|
|
jbe@0
|
2199 PG_FUNCTION_INFO_V1(pgl_epoint_to_ecluster);
|
|
jbe@0
|
2200 Datum pgl_epoint_to_ecluster(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2201 pgl_point *point = (pgl_point *)PG_GETARG_POINTER(0);
|
|
jbe@0
|
2202 pgl_newentry entry;
|
|
jbe@0
|
2203 entry.entrytype = PGL_ENTRY_POINT;
|
|
jbe@0
|
2204 entry.npoints = 1;
|
|
jbe@0
|
2205 entry.points = point;
|
|
jbe@0
|
2206 PG_RETURN_POINTER(pgl_new_cluster(1, &entry));
|
|
jbe@0
|
2207 }
|
|
jbe@0
|
2208
|
|
jbe@0
|
2209 /* cast box ("ebox") to cluster ("ecluster") */
|
|
jbe@0
|
2210 #define pgl_ebox_to_ecluster_macro(i, a, b) \
|
|
jbe@0
|
2211 entries[i].entrytype = PGL_ENTRY_POLYGON; \
|
|
jbe@0
|
2212 entries[i].npoints = 4; \
|
|
jbe@0
|
2213 entries[i].points = points[i]; \
|
|
jbe@0
|
2214 points[i][0].lat = box->lat_min; \
|
|
jbe@0
|
2215 points[i][0].lon = (a); \
|
|
jbe@0
|
2216 points[i][1].lat = box->lat_min; \
|
|
jbe@0
|
2217 points[i][1].lon = (b); \
|
|
jbe@0
|
2218 points[i][2].lat = box->lat_max; \
|
|
jbe@0
|
2219 points[i][2].lon = (b); \
|
|
jbe@0
|
2220 points[i][3].lat = box->lat_max; \
|
|
jbe@0
|
2221 points[i][3].lon = (a);
|
|
jbe@0
|
2222 PG_FUNCTION_INFO_V1(pgl_ebox_to_ecluster);
|
|
jbe@0
|
2223 Datum pgl_ebox_to_ecluster(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2224 pgl_box *box = (pgl_box *)PG_GETARG_POINTER(0);
|
|
jbe@0
|
2225 double lon, dlon;
|
|
jbe@0
|
2226 int nentries;
|
|
jbe@0
|
2227 pgl_newentry entries[3];
|
|
jbe@0
|
2228 pgl_point points[3][4];
|
|
jbe@0
|
2229 if (box->lat_min > box->lat_max) {
|
|
jbe@0
|
2230 nentries = 0;
|
|
jbe@0
|
2231 } else if (box->lon_min > box->lon_max) {
|
|
jbe@0
|
2232 if (box->lon_min < 0) {
|
|
jbe@0
|
2233 lon = pgl_round((box->lon_min + 180) / 2.0);
|
|
jbe@0
|
2234 nentries = 3;
|
|
jbe@0
|
2235 pgl_ebox_to_ecluster_macro(0, box->lon_min, lon);
|
|
jbe@0
|
2236 pgl_ebox_to_ecluster_macro(1, lon, 180);
|
|
jbe@0
|
2237 pgl_ebox_to_ecluster_macro(2, -180, box->lon_max);
|
|
jbe@0
|
2238 } else if (box->lon_max > 0) {
|
|
jbe@0
|
2239 lon = pgl_round((box->lon_max - 180) / 2.0);
|
|
jbe@0
|
2240 nentries = 3;
|
|
jbe@0
|
2241 pgl_ebox_to_ecluster_macro(0, box->lon_min, 180);
|
|
jbe@0
|
2242 pgl_ebox_to_ecluster_macro(1, -180, lon);
|
|
jbe@0
|
2243 pgl_ebox_to_ecluster_macro(2, lon, box->lon_max);
|
|
jbe@0
|
2244 } else {
|
|
jbe@0
|
2245 nentries = 2;
|
|
jbe@0
|
2246 pgl_ebox_to_ecluster_macro(0, box->lon_min, 180);
|
|
jbe@0
|
2247 pgl_ebox_to_ecluster_macro(1, -180, box->lon_max);
|
|
jbe@0
|
2248 }
|
|
jbe@0
|
2249 } else {
|
|
jbe@0
|
2250 dlon = pgl_round(box->lon_max - box->lon_min);
|
|
jbe@0
|
2251 if (dlon < 180) {
|
|
jbe@0
|
2252 nentries = 1;
|
|
jbe@0
|
2253 pgl_ebox_to_ecluster_macro(0, box->lon_min, box->lon_max);
|
|
jbe@0
|
2254 } else {
|
|
jbe@0
|
2255 lon = pgl_round((box->lon_min + box->lon_max) / 2.0);
|
|
jbe@0
|
2256 if (
|
|
jbe@0
|
2257 pgl_round(lon - box->lon_min) < 180 &&
|
|
jbe@0
|
2258 pgl_round(box->lon_max - lon) < 180
|
|
jbe@0
|
2259 ) {
|
|
jbe@0
|
2260 nentries = 2;
|
|
jbe@0
|
2261 pgl_ebox_to_ecluster_macro(0, box->lon_min, lon);
|
|
jbe@0
|
2262 pgl_ebox_to_ecluster_macro(1, lon, box->lon_max);
|
|
jbe@0
|
2263 } else {
|
|
jbe@0
|
2264 nentries = 3;
|
|
jbe@0
|
2265 pgl_ebox_to_ecluster_macro(0, box->lon_min, -60);
|
|
jbe@0
|
2266 pgl_ebox_to_ecluster_macro(1, -60, 60);
|
|
jbe@0
|
2267 pgl_ebox_to_ecluster_macro(2, 60, box->lon_max);
|
|
jbe@0
|
2268 }
|
|
jbe@0
|
2269 }
|
|
jbe@0
|
2270 }
|
|
jbe@0
|
2271 PG_RETURN_POINTER(pgl_new_cluster(nentries, entries));
|
|
jbe@0
|
2272 }
|
|
jbe@0
|
2273
|
|
jbe@0
|
2274 /* extract latitude from point ("epoint") */
|
|
jbe@0
|
2275 PG_FUNCTION_INFO_V1(pgl_epoint_lat);
|
|
jbe@0
|
2276 Datum pgl_epoint_lat(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2277 PG_RETURN_FLOAT8(((pgl_point *)PG_GETARG_POINTER(0))->lat);
|
|
jbe@0
|
2278 }
|
|
jbe@0
|
2279
|
|
jbe@0
|
2280 /* extract longitude from point ("epoint") */
|
|
jbe@0
|
2281 PG_FUNCTION_INFO_V1(pgl_epoint_lon);
|
|
jbe@0
|
2282 Datum pgl_epoint_lon(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2283 PG_RETURN_FLOAT8(((pgl_point *)PG_GETARG_POINTER(0))->lon);
|
|
jbe@0
|
2284 }
|
|
jbe@0
|
2285
|
|
jbe@0
|
2286 /* extract minimum latitude from box ("ebox") */
|
|
jbe@0
|
2287 PG_FUNCTION_INFO_V1(pgl_ebox_lat_min);
|
|
jbe@0
|
2288 Datum pgl_ebox_lat_min(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2289 PG_RETURN_FLOAT8(((pgl_box *)PG_GETARG_POINTER(0))->lat_min);
|
|
jbe@0
|
2290 }
|
|
jbe@0
|
2291
|
|
jbe@0
|
2292 /* extract maximum latitude from box ("ebox") */
|
|
jbe@0
|
2293 PG_FUNCTION_INFO_V1(pgl_ebox_lat_max);
|
|
jbe@0
|
2294 Datum pgl_ebox_lat_max(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2295 PG_RETURN_FLOAT8(((pgl_box *)PG_GETARG_POINTER(0))->lat_max);
|
|
jbe@0
|
2296 }
|
|
jbe@0
|
2297
|
|
jbe@0
|
2298 /* extract minimum longitude from box ("ebox") */
|
|
jbe@0
|
2299 PG_FUNCTION_INFO_V1(pgl_ebox_lon_min);
|
|
jbe@0
|
2300 Datum pgl_ebox_lon_min(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2301 PG_RETURN_FLOAT8(((pgl_box *)PG_GETARG_POINTER(0))->lon_min);
|
|
jbe@0
|
2302 }
|
|
jbe@0
|
2303
|
|
jbe@0
|
2304 /* extract maximum longitude from box ("ebox") */
|
|
jbe@0
|
2305 PG_FUNCTION_INFO_V1(pgl_ebox_lon_max);
|
|
jbe@0
|
2306 Datum pgl_ebox_lon_max(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2307 PG_RETURN_FLOAT8(((pgl_box *)PG_GETARG_POINTER(0))->lon_max);
|
|
jbe@0
|
2308 }
|
|
jbe@0
|
2309
|
|
jbe@0
|
2310 /* extract center point from circle ("ecircle") */
|
|
jbe@0
|
2311 PG_FUNCTION_INFO_V1(pgl_ecircle_center);
|
|
jbe@0
|
2312 Datum pgl_ecircle_center(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2313 PG_RETURN_POINTER(&(((pgl_circle *)PG_GETARG_POINTER(0))->center));
|
|
jbe@0
|
2314 }
|
|
jbe@0
|
2315
|
|
jbe@0
|
2316 /* extract radius from circle ("ecircle") */
|
|
jbe@0
|
2317 PG_FUNCTION_INFO_V1(pgl_ecircle_radius);
|
|
jbe@0
|
2318 Datum pgl_ecircle_radius(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2319 PG_RETURN_FLOAT8(((pgl_circle *)PG_GETARG_POINTER(0))->radius);
|
|
jbe@0
|
2320 }
|
|
jbe@0
|
2321
|
|
jbe@0
|
2322 /* check if point is inside box (overlap operator "&&") in SQL */
|
|
jbe@0
|
2323 PG_FUNCTION_INFO_V1(pgl_epoint_ebox_overlap);
|
|
jbe@0
|
2324 Datum pgl_epoint_ebox_overlap(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2325 pgl_point *point = (pgl_point *)PG_GETARG_POINTER(0);
|
|
jbe@0
|
2326 pgl_box *box = (pgl_box *)PG_GETARG_POINTER(1);
|
|
jbe@0
|
2327 PG_RETURN_BOOL(pgl_point_in_box(point, box));
|
|
jbe@0
|
2328 }
|
|
jbe@0
|
2329
|
|
jbe@0
|
2330 /* check if point is inside circle (overlap operator "&&") in SQL */
|
|
jbe@0
|
2331 PG_FUNCTION_INFO_V1(pgl_epoint_ecircle_overlap);
|
|
jbe@0
|
2332 Datum pgl_epoint_ecircle_overlap(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2333 pgl_point *point = (pgl_point *)PG_GETARG_POINTER(0);
|
|
jbe@0
|
2334 pgl_circle *circle = (pgl_circle *)PG_GETARG_POINTER(1);
|
|
jbe@0
|
2335 PG_RETURN_BOOL(
|
|
jbe@0
|
2336 pgl_distance(
|
|
jbe@0
|
2337 point->lat, point->lon,
|
|
jbe@0
|
2338 circle->center.lat, circle->center.lon
|
|
jbe@0
|
2339 ) <= circle->radius
|
|
jbe@0
|
2340 );
|
|
jbe@0
|
2341 }
|
|
jbe@0
|
2342
|
|
jbe@0
|
2343 /* check if point is inside cluster (overlap operator "&&") in SQL */
|
|
jbe@0
|
2344 PG_FUNCTION_INFO_V1(pgl_epoint_ecluster_overlap);
|
|
jbe@0
|
2345 Datum pgl_epoint_ecluster_overlap(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2346 pgl_point *point = (pgl_point *)PG_GETARG_POINTER(0);
|
|
jbe@0
|
2347 pgl_cluster *cluster = (pgl_cluster *)PG_DETOAST_DATUM(PG_GETARG_DATUM(1));
|
|
jbe@16
|
2348 bool retval;
|
|
jbe@16
|
2349 /* points outside bounding circle are always assumed to be non-overlapping
|
|
jbe@16
|
2350 (necessary for consistent table and index scans) */
|
|
jbe@16
|
2351 if (
|
|
jbe@16
|
2352 pgl_distance(
|
|
jbe@16
|
2353 point->lat, point->lon,
|
|
jbe@16
|
2354 cluster->bounding.center.lat, cluster->bounding.center.lon
|
|
jbe@16
|
2355 ) > cluster->bounding.radius
|
|
jbe@16
|
2356 ) retval = false;
|
|
jbe@20
|
2357 else retval = pgl_point_in_cluster(point, cluster, false);
|
|
jbe@0
|
2358 PG_FREE_IF_COPY(cluster, 1);
|
|
jbe@0
|
2359 PG_RETURN_BOOL(retval);
|
|
jbe@0
|
2360 }
|
|
jbe@0
|
2361
|
|
jbe@10
|
2362 /* check if point may be inside cluster (lossy overl. operator "&&+") in SQL */
|
|
jbe@10
|
2363 PG_FUNCTION_INFO_V1(pgl_epoint_ecluster_may_overlap);
|
|
jbe@10
|
2364 Datum pgl_epoint_ecluster_may_overlap(PG_FUNCTION_ARGS) {
|
|
jbe@10
|
2365 pgl_point *point = (pgl_point *)PG_GETARG_POINTER(0);
|
|
jbe@10
|
2366 pgl_cluster *cluster = (pgl_cluster *)PG_DETOAST_DATUM(PG_GETARG_DATUM(1));
|
|
jbe@10
|
2367 bool retval = pgl_distance(
|
|
jbe@10
|
2368 point->lat, point->lon,
|
|
jbe@10
|
2369 cluster->bounding.center.lat, cluster->bounding.center.lon
|
|
jbe@10
|
2370 ) <= cluster->bounding.radius;
|
|
jbe@10
|
2371 PG_FREE_IF_COPY(cluster, 1);
|
|
jbe@10
|
2372 PG_RETURN_BOOL(retval);
|
|
jbe@10
|
2373 }
|
|
jbe@10
|
2374
|
|
jbe@0
|
2375 /* check if two boxes overlap (overlap operator "&&") in SQL */
|
|
jbe@0
|
2376 PG_FUNCTION_INFO_V1(pgl_ebox_overlap);
|
|
jbe@0
|
2377 Datum pgl_ebox_overlap(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2378 pgl_box *box1 = (pgl_box *)PG_GETARG_POINTER(0);
|
|
jbe@0
|
2379 pgl_box *box2 = (pgl_box *)PG_GETARG_POINTER(1);
|
|
jbe@0
|
2380 PG_RETURN_BOOL(pgl_boxes_overlap(box1, box2));
|
|
jbe@0
|
2381 }
|
|
jbe@0
|
2382
|
|
jbe@10
|
2383 /* check if box and circle may overlap (lossy overl. operator "&&+") in SQL */
|
|
jbe@10
|
2384 PG_FUNCTION_INFO_V1(pgl_ebox_ecircle_may_overlap);
|
|
jbe@10
|
2385 Datum pgl_ebox_ecircle_may_overlap(PG_FUNCTION_ARGS) {
|
|
jbe@10
|
2386 pgl_box *box = (pgl_box *)PG_GETARG_POINTER(0);
|
|
jbe@10
|
2387 pgl_circle *circle = (pgl_circle *)PG_GETARG_POINTER(1);
|
|
jbe@10
|
2388 PG_RETURN_BOOL(
|
|
jbe@10
|
2389 pgl_estimate_point_box_distance(&circle->center, box) <= circle->radius
|
|
jbe@10
|
2390 );
|
|
jbe@10
|
2391 }
|
|
jbe@10
|
2392
|
|
jbe@10
|
2393 /* check if box and cluster may overlap (lossy overl. operator "&&+") in SQL */
|
|
jbe@10
|
2394 PG_FUNCTION_INFO_V1(pgl_ebox_ecluster_may_overlap);
|
|
jbe@10
|
2395 Datum pgl_ebox_ecluster_may_overlap(PG_FUNCTION_ARGS) {
|
|
jbe@10
|
2396 pgl_box *box = (pgl_box *)PG_GETARG_POINTER(0);
|
|
jbe@10
|
2397 pgl_cluster *cluster = (pgl_cluster *)PG_DETOAST_DATUM(PG_GETARG_DATUM(1));
|
|
jbe@10
|
2398 bool retval = pgl_estimate_point_box_distance(
|
|
jbe@10
|
2399 &cluster->bounding.center,
|
|
jbe@10
|
2400 box
|
|
jbe@10
|
2401 ) <= cluster->bounding.radius;
|
|
jbe@10
|
2402 PG_FREE_IF_COPY(cluster, 1);
|
|
jbe@10
|
2403 PG_RETURN_BOOL(retval);
|
|
jbe@10
|
2404 }
|
|
jbe@10
|
2405
|
|
jbe@0
|
2406 /* check if two circles overlap (overlap operator "&&") in SQL */
|
|
jbe@0
|
2407 PG_FUNCTION_INFO_V1(pgl_ecircle_overlap);
|
|
jbe@0
|
2408 Datum pgl_ecircle_overlap(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2409 pgl_circle *circle1 = (pgl_circle *)PG_GETARG_POINTER(0);
|
|
jbe@0
|
2410 pgl_circle *circle2 = (pgl_circle *)PG_GETARG_POINTER(1);
|
|
jbe@0
|
2411 PG_RETURN_BOOL(
|
|
jbe@0
|
2412 pgl_distance(
|
|
jbe@0
|
2413 circle1->center.lat, circle1->center.lon,
|
|
jbe@0
|
2414 circle2->center.lat, circle2->center.lon
|
|
jbe@0
|
2415 ) <= circle1->radius + circle2->radius
|
|
jbe@0
|
2416 );
|
|
jbe@0
|
2417 }
|
|
jbe@0
|
2418
|
|
jbe@0
|
2419 /* check if circle and cluster overlap (overlap operator "&&") in SQL */
|
|
jbe@0
|
2420 PG_FUNCTION_INFO_V1(pgl_ecircle_ecluster_overlap);
|
|
jbe@0
|
2421 Datum pgl_ecircle_ecluster_overlap(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2422 pgl_circle *circle = (pgl_circle *)PG_GETARG_POINTER(0);
|
|
jbe@0
|
2423 pgl_cluster *cluster = (pgl_cluster *)PG_DETOAST_DATUM(PG_GETARG_DATUM(1));
|
|
jbe@0
|
2424 bool retval = (
|
|
jbe@0
|
2425 pgl_point_cluster_distance(&(circle->center), cluster) <= circle->radius
|
|
jbe@0
|
2426 );
|
|
jbe@0
|
2427 PG_FREE_IF_COPY(cluster, 1);
|
|
jbe@0
|
2428 PG_RETURN_BOOL(retval);
|
|
jbe@0
|
2429 }
|
|
jbe@0
|
2430
|
|
jbe@17
|
2431 /* check if circle and cluster may overlap (l. ov. operator "&&+") in SQL */
|
|
jbe@10
|
2432 PG_FUNCTION_INFO_V1(pgl_ecircle_ecluster_may_overlap);
|
|
jbe@10
|
2433 Datum pgl_ecircle_ecluster_may_overlap(PG_FUNCTION_ARGS) {
|
|
jbe@10
|
2434 pgl_circle *circle = (pgl_circle *)PG_GETARG_POINTER(0);
|
|
jbe@10
|
2435 pgl_cluster *cluster = (pgl_cluster *)PG_DETOAST_DATUM(PG_GETARG_DATUM(1));
|
|
jbe@10
|
2436 bool retval = pgl_distance(
|
|
jbe@10
|
2437 circle->center.lat, circle->center.lon,
|
|
jbe@10
|
2438 cluster->bounding.center.lat, cluster->bounding.center.lon
|
|
jbe@10
|
2439 ) <= circle->radius + cluster->bounding.radius;
|
|
jbe@10
|
2440 PG_FREE_IF_COPY(cluster, 1);
|
|
jbe@10
|
2441 PG_RETURN_BOOL(retval);
|
|
jbe@10
|
2442 }
|
|
jbe@10
|
2443
|
|
jbe@16
|
2444 /* check if two clusters overlap (overlap operator "&&") in SQL */
|
|
jbe@16
|
2445 PG_FUNCTION_INFO_V1(pgl_ecluster_overlap);
|
|
jbe@16
|
2446 Datum pgl_ecluster_overlap(PG_FUNCTION_ARGS) {
|
|
jbe@16
|
2447 pgl_cluster *cluster1 = (pgl_cluster *)PG_DETOAST_DATUM(PG_GETARG_DATUM(0));
|
|
jbe@16
|
2448 pgl_cluster *cluster2 = (pgl_cluster *)PG_DETOAST_DATUM(PG_GETARG_DATUM(1));
|
|
jbe@16
|
2449 bool retval;
|
|
jbe@16
|
2450 /* clusters with non-touching bounding circles are always assumed to be
|
|
jbe@16
|
2451 non-overlapping (improves performance and is necessary for consistent
|
|
jbe@16
|
2452 table and index scans) */
|
|
jbe@16
|
2453 if (
|
|
jbe@16
|
2454 pgl_distance(
|
|
jbe@16
|
2455 cluster1->bounding.center.lat, cluster1->bounding.center.lon,
|
|
jbe@16
|
2456 cluster2->bounding.center.lat, cluster2->bounding.center.lon
|
|
jbe@16
|
2457 ) > cluster1->bounding.radius + cluster2->bounding.radius
|
|
jbe@16
|
2458 ) retval = false;
|
|
jbe@16
|
2459 else retval = pgl_clusters_overlap(cluster1, cluster2);
|
|
jbe@16
|
2460 PG_FREE_IF_COPY(cluster1, 0);
|
|
jbe@16
|
2461 PG_FREE_IF_COPY(cluster2, 1);
|
|
jbe@16
|
2462 PG_RETURN_BOOL(retval);
|
|
jbe@16
|
2463 }
|
|
jbe@16
|
2464
|
|
jbe@10
|
2465 /* check if two clusters may overlap (lossy overlap operator "&&+") in SQL */
|
|
jbe@10
|
2466 PG_FUNCTION_INFO_V1(pgl_ecluster_may_overlap);
|
|
jbe@10
|
2467 Datum pgl_ecluster_may_overlap(PG_FUNCTION_ARGS) {
|
|
jbe@10
|
2468 pgl_cluster *cluster1 = (pgl_cluster *)PG_DETOAST_DATUM(PG_GETARG_DATUM(0));
|
|
jbe@10
|
2469 pgl_cluster *cluster2 = (pgl_cluster *)PG_DETOAST_DATUM(PG_GETARG_DATUM(1));
|
|
jbe@10
|
2470 bool retval = pgl_distance(
|
|
jbe@10
|
2471 cluster1->bounding.center.lat, cluster1->bounding.center.lon,
|
|
jbe@10
|
2472 cluster2->bounding.center.lat, cluster2->bounding.center.lon
|
|
jbe@10
|
2473 ) <= cluster1->bounding.radius + cluster2->bounding.radius;
|
|
jbe@10
|
2474 PG_FREE_IF_COPY(cluster1, 0);
|
|
jbe@10
|
2475 PG_FREE_IF_COPY(cluster2, 1);
|
|
jbe@10
|
2476 PG_RETURN_BOOL(retval);
|
|
jbe@10
|
2477 }
|
|
jbe@10
|
2478
|
|
jbe@16
|
2479 /* check if second cluster is in first cluster (cont. operator "@>) in SQL */
|
|
jbe@16
|
2480 PG_FUNCTION_INFO_V1(pgl_ecluster_contains);
|
|
jbe@16
|
2481 Datum pgl_ecluster_contains(PG_FUNCTION_ARGS) {
|
|
jbe@16
|
2482 pgl_cluster *outer = (pgl_cluster *)PG_DETOAST_DATUM(PG_GETARG_DATUM(0));
|
|
jbe@16
|
2483 pgl_cluster *inner = (pgl_cluster *)PG_DETOAST_DATUM(PG_GETARG_DATUM(1));
|
|
jbe@16
|
2484 bool retval;
|
|
jbe@16
|
2485 /* clusters with non-touching bounding circles are always assumed to be
|
|
jbe@16
|
2486 non-overlapping (improves performance and is necessary for consistent
|
|
jbe@16
|
2487 table and index scans) */
|
|
jbe@16
|
2488 if (
|
|
jbe@16
|
2489 pgl_distance(
|
|
jbe@16
|
2490 outer->bounding.center.lat, outer->bounding.center.lon,
|
|
jbe@16
|
2491 inner->bounding.center.lat, inner->bounding.center.lon
|
|
jbe@16
|
2492 ) > outer->bounding.radius + inner->bounding.radius
|
|
jbe@16
|
2493 ) retval = false;
|
|
jbe@16
|
2494 else retval = pgl_cluster_in_cluster(outer, inner);
|
|
jbe@16
|
2495 PG_FREE_IF_COPY(outer, 0);
|
|
jbe@16
|
2496 PG_FREE_IF_COPY(inner, 1);
|
|
jbe@16
|
2497 PG_RETURN_BOOL(retval);
|
|
jbe@16
|
2498 }
|
|
jbe@16
|
2499
|
|
jbe@0
|
2500 /* calculate distance between two points ("<->" operator) in SQL */
|
|
jbe@0
|
2501 PG_FUNCTION_INFO_V1(pgl_epoint_distance);
|
|
jbe@0
|
2502 Datum pgl_epoint_distance(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2503 pgl_point *point1 = (pgl_point *)PG_GETARG_POINTER(0);
|
|
jbe@0
|
2504 pgl_point *point2 = (pgl_point *)PG_GETARG_POINTER(1);
|
|
jbe@0
|
2505 PG_RETURN_FLOAT8(pgl_distance(
|
|
jbe@0
|
2506 point1->lat, point1->lon, point2->lat, point2->lon
|
|
jbe@0
|
2507 ));
|
|
jbe@0
|
2508 }
|
|
jbe@0
|
2509
|
|
jbe@0
|
2510 /* calculate point to circle distance ("<->" operator) in SQL */
|
|
jbe@0
|
2511 PG_FUNCTION_INFO_V1(pgl_epoint_ecircle_distance);
|
|
jbe@0
|
2512 Datum pgl_epoint_ecircle_distance(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2513 pgl_point *point = (pgl_point *)PG_GETARG_POINTER(0);
|
|
jbe@0
|
2514 pgl_circle *circle = (pgl_circle *)PG_GETARG_POINTER(1);
|
|
jbe@0
|
2515 double distance = pgl_distance(
|
|
jbe@0
|
2516 point->lat, point->lon, circle->center.lat, circle->center.lon
|
|
jbe@0
|
2517 ) - circle->radius;
|
|
jbe@0
|
2518 PG_RETURN_FLOAT8((distance <= 0) ? 0 : distance);
|
|
jbe@0
|
2519 }
|
|
jbe@0
|
2520
|
|
jbe@0
|
2521 /* calculate point to cluster distance ("<->" operator) in SQL */
|
|
jbe@0
|
2522 PG_FUNCTION_INFO_V1(pgl_epoint_ecluster_distance);
|
|
jbe@0
|
2523 Datum pgl_epoint_ecluster_distance(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2524 pgl_point *point = (pgl_point *)PG_GETARG_POINTER(0);
|
|
jbe@0
|
2525 pgl_cluster *cluster = (pgl_cluster *)PG_DETOAST_DATUM(PG_GETARG_DATUM(1));
|
|
jbe@0
|
2526 double distance = pgl_point_cluster_distance(point, cluster);
|
|
jbe@0
|
2527 PG_FREE_IF_COPY(cluster, 1);
|
|
jbe@0
|
2528 PG_RETURN_FLOAT8(distance);
|
|
jbe@0
|
2529 }
|
|
jbe@0
|
2530
|
|
jbe@0
|
2531 /* calculate distance between two circles ("<->" operator) in SQL */
|
|
jbe@0
|
2532 PG_FUNCTION_INFO_V1(pgl_ecircle_distance);
|
|
jbe@0
|
2533 Datum pgl_ecircle_distance(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2534 pgl_circle *circle1 = (pgl_circle *)PG_GETARG_POINTER(0);
|
|
jbe@0
|
2535 pgl_circle *circle2 = (pgl_circle *)PG_GETARG_POINTER(1);
|
|
jbe@0
|
2536 double distance = pgl_distance(
|
|
jbe@0
|
2537 circle1->center.lat, circle1->center.lon,
|
|
jbe@0
|
2538 circle2->center.lat, circle2->center.lon
|
|
jbe@0
|
2539 ) - (circle1->radius + circle2->radius);
|
|
jbe@0
|
2540 PG_RETURN_FLOAT8((distance <= 0) ? 0 : distance);
|
|
jbe@0
|
2541 }
|
|
jbe@0
|
2542
|
|
jbe@0
|
2543 /* calculate circle to cluster distance ("<->" operator) in SQL */
|
|
jbe@0
|
2544 PG_FUNCTION_INFO_V1(pgl_ecircle_ecluster_distance);
|
|
jbe@0
|
2545 Datum pgl_ecircle_ecluster_distance(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2546 pgl_circle *circle = (pgl_circle *)PG_GETARG_POINTER(0);
|
|
jbe@0
|
2547 pgl_cluster *cluster = (pgl_cluster *)PG_DETOAST_DATUM(PG_GETARG_DATUM(1));
|
|
jbe@0
|
2548 double distance = (
|
|
jbe@0
|
2549 pgl_point_cluster_distance(&(circle->center), cluster) - circle->radius
|
|
jbe@0
|
2550 );
|
|
jbe@0
|
2551 PG_FREE_IF_COPY(cluster, 1);
|
|
jbe@0
|
2552 PG_RETURN_FLOAT8((distance <= 0) ? 0 : distance);
|
|
jbe@0
|
2553 }
|
|
jbe@0
|
2554
|
|
jbe@16
|
2555 /* calculate distance between two clusters ("<->" operator) in SQL */
|
|
jbe@16
|
2556 PG_FUNCTION_INFO_V1(pgl_ecluster_distance);
|
|
jbe@16
|
2557 Datum pgl_ecluster_distance(PG_FUNCTION_ARGS) {
|
|
jbe@16
|
2558 pgl_cluster *cluster1 = (pgl_cluster *)PG_DETOAST_DATUM(PG_GETARG_DATUM(0));
|
|
jbe@16
|
2559 pgl_cluster *cluster2 = (pgl_cluster *)PG_DETOAST_DATUM(PG_GETARG_DATUM(1));
|
|
jbe@16
|
2560 double retval = pgl_cluster_distance(cluster1, cluster2);
|
|
jbe@16
|
2561 PG_FREE_IF_COPY(cluster1, 0);
|
|
jbe@16
|
2562 PG_FREE_IF_COPY(cluster2, 1);
|
|
jbe@16
|
2563 PG_RETURN_FLOAT8(retval);
|
|
jbe@16
|
2564 }
|
|
jbe@16
|
2565
|
|
jbe@0
|
2566
|
|
jbe@0
|
2567 /*-----------------------------------------------------------*
|
|
jbe@0
|
2568 * B-tree comparison operators and index support functions *
|
|
jbe@0
|
2569 *-----------------------------------------------------------*/
|
|
jbe@0
|
2570
|
|
jbe@0
|
2571 /* macro for a B-tree operator (without detoasting) */
|
|
jbe@0
|
2572 #define PGL_BTREE_OPER(func, type, cmpfunc, oper) \
|
|
jbe@0
|
2573 PG_FUNCTION_INFO_V1(func); \
|
|
jbe@0
|
2574 Datum func(PG_FUNCTION_ARGS) { \
|
|
jbe@0
|
2575 type *a = (type *)PG_GETARG_POINTER(0); \
|
|
jbe@0
|
2576 type *b = (type *)PG_GETARG_POINTER(1); \
|
|
jbe@0
|
2577 PG_RETURN_BOOL(cmpfunc(a, b) oper 0); \
|
|
jbe@0
|
2578 }
|
|
jbe@0
|
2579
|
|
jbe@0
|
2580 /* macro for a B-tree comparison function (without detoasting) */
|
|
jbe@0
|
2581 #define PGL_BTREE_CMP(func, type, cmpfunc) \
|
|
jbe@0
|
2582 PG_FUNCTION_INFO_V1(func); \
|
|
jbe@0
|
2583 Datum func(PG_FUNCTION_ARGS) { \
|
|
jbe@0
|
2584 type *a = (type *)PG_GETARG_POINTER(0); \
|
|
jbe@0
|
2585 type *b = (type *)PG_GETARG_POINTER(1); \
|
|
jbe@0
|
2586 PG_RETURN_INT32(cmpfunc(a, b)); \
|
|
jbe@0
|
2587 }
|
|
jbe@0
|
2588
|
|
jbe@0
|
2589 /* macro for a B-tree operator (with detoasting) */
|
|
jbe@0
|
2590 #define PGL_BTREE_OPER_DETOAST(func, type, cmpfunc, oper) \
|
|
jbe@0
|
2591 PG_FUNCTION_INFO_V1(func); \
|
|
jbe@0
|
2592 Datum func(PG_FUNCTION_ARGS) { \
|
|
jbe@0
|
2593 bool res; \
|
|
jbe@0
|
2594 type *a = (type *)PG_DETOAST_DATUM(PG_GETARG_DATUM(0)); \
|
|
jbe@0
|
2595 type *b = (type *)PG_DETOAST_DATUM(PG_GETARG_DATUM(1)); \
|
|
jbe@0
|
2596 res = cmpfunc(a, b) oper 0; \
|
|
jbe@0
|
2597 PG_FREE_IF_COPY(a, 0); \
|
|
jbe@0
|
2598 PG_FREE_IF_COPY(b, 1); \
|
|
jbe@0
|
2599 PG_RETURN_BOOL(res); \
|
|
jbe@0
|
2600 }
|
|
jbe@0
|
2601
|
|
jbe@0
|
2602 /* macro for a B-tree comparison function (with detoasting) */
|
|
jbe@0
|
2603 #define PGL_BTREE_CMP_DETOAST(func, type, cmpfunc) \
|
|
jbe@0
|
2604 PG_FUNCTION_INFO_V1(func); \
|
|
jbe@0
|
2605 Datum func(PG_FUNCTION_ARGS) { \
|
|
jbe@0
|
2606 int32_t res; \
|
|
jbe@0
|
2607 type *a = (type *)PG_DETOAST_DATUM(PG_GETARG_DATUM(0)); \
|
|
jbe@0
|
2608 type *b = (type *)PG_DETOAST_DATUM(PG_GETARG_DATUM(1)); \
|
|
jbe@0
|
2609 res = cmpfunc(a, b); \
|
|
jbe@0
|
2610 PG_FREE_IF_COPY(a, 0); \
|
|
jbe@0
|
2611 PG_FREE_IF_COPY(b, 1); \
|
|
jbe@0
|
2612 PG_RETURN_INT32(res); \
|
|
jbe@0
|
2613 }
|
|
jbe@0
|
2614
|
|
jbe@0
|
2615 /* B-tree operators and comparison function for point */
|
|
jbe@0
|
2616 PGL_BTREE_OPER(pgl_btree_epoint_lt, pgl_point, pgl_point_cmp, <)
|
|
jbe@0
|
2617 PGL_BTREE_OPER(pgl_btree_epoint_le, pgl_point, pgl_point_cmp, <=)
|
|
jbe@0
|
2618 PGL_BTREE_OPER(pgl_btree_epoint_eq, pgl_point, pgl_point_cmp, ==)
|
|
jbe@0
|
2619 PGL_BTREE_OPER(pgl_btree_epoint_ne, pgl_point, pgl_point_cmp, !=)
|
|
jbe@0
|
2620 PGL_BTREE_OPER(pgl_btree_epoint_ge, pgl_point, pgl_point_cmp, >=)
|
|
jbe@0
|
2621 PGL_BTREE_OPER(pgl_btree_epoint_gt, pgl_point, pgl_point_cmp, >)
|
|
jbe@0
|
2622 PGL_BTREE_CMP(pgl_btree_epoint_cmp, pgl_point, pgl_point_cmp)
|
|
jbe@0
|
2623
|
|
jbe@0
|
2624 /* B-tree operators and comparison function for box */
|
|
jbe@0
|
2625 PGL_BTREE_OPER(pgl_btree_ebox_lt, pgl_box, pgl_box_cmp, <)
|
|
jbe@0
|
2626 PGL_BTREE_OPER(pgl_btree_ebox_le, pgl_box, pgl_box_cmp, <=)
|
|
jbe@0
|
2627 PGL_BTREE_OPER(pgl_btree_ebox_eq, pgl_box, pgl_box_cmp, ==)
|
|
jbe@0
|
2628 PGL_BTREE_OPER(pgl_btree_ebox_ne, pgl_box, pgl_box_cmp, !=)
|
|
jbe@0
|
2629 PGL_BTREE_OPER(pgl_btree_ebox_ge, pgl_box, pgl_box_cmp, >=)
|
|
jbe@0
|
2630 PGL_BTREE_OPER(pgl_btree_ebox_gt, pgl_box, pgl_box_cmp, >)
|
|
jbe@0
|
2631 PGL_BTREE_CMP(pgl_btree_ebox_cmp, pgl_box, pgl_box_cmp)
|
|
jbe@0
|
2632
|
|
jbe@0
|
2633 /* B-tree operators and comparison function for circle */
|
|
jbe@0
|
2634 PGL_BTREE_OPER(pgl_btree_ecircle_lt, pgl_circle, pgl_circle_cmp, <)
|
|
jbe@0
|
2635 PGL_BTREE_OPER(pgl_btree_ecircle_le, pgl_circle, pgl_circle_cmp, <=)
|
|
jbe@0
|
2636 PGL_BTREE_OPER(pgl_btree_ecircle_eq, pgl_circle, pgl_circle_cmp, ==)
|
|
jbe@0
|
2637 PGL_BTREE_OPER(pgl_btree_ecircle_ne, pgl_circle, pgl_circle_cmp, !=)
|
|
jbe@0
|
2638 PGL_BTREE_OPER(pgl_btree_ecircle_ge, pgl_circle, pgl_circle_cmp, >=)
|
|
jbe@0
|
2639 PGL_BTREE_OPER(pgl_btree_ecircle_gt, pgl_circle, pgl_circle_cmp, >)
|
|
jbe@0
|
2640 PGL_BTREE_CMP(pgl_btree_ecircle_cmp, pgl_circle, pgl_circle_cmp)
|
|
jbe@0
|
2641
|
|
jbe@0
|
2642
|
|
jbe@0
|
2643 /*--------------------------------*
|
|
jbe@0
|
2644 * GiST index support functions *
|
|
jbe@0
|
2645 *--------------------------------*/
|
|
jbe@0
|
2646
|
|
jbe@0
|
2647 /* GiST "consistent" support function */
|
|
jbe@0
|
2648 PG_FUNCTION_INFO_V1(pgl_gist_consistent);
|
|
jbe@0
|
2649 Datum pgl_gist_consistent(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2650 GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
|
|
jbe@0
|
2651 pgl_keyptr key = (pgl_keyptr)DatumGetPointer(entry->key);
|
|
jbe@0
|
2652 StrategyNumber strategy = (StrategyNumber)PG_GETARG_UINT16(2);
|
|
jbe@0
|
2653 bool *recheck = (bool *)PG_GETARG_POINTER(4);
|
|
jbe@0
|
2654 /* demand recheck because index and query methods are lossy */
|
|
jbe@0
|
2655 *recheck = true;
|
|
jbe@10
|
2656 /* strategy number aliases for different operators using the same strategy */
|
|
jbe@10
|
2657 strategy %= 100;
|
|
jbe@0
|
2658 /* strategy number 11: equality of two points */
|
|
jbe@0
|
2659 if (strategy == 11) {
|
|
jbe@0
|
2660 /* query datum is another point */
|
|
jbe@0
|
2661 pgl_point *query = (pgl_point *)PG_GETARG_POINTER(1);
|
|
jbe@0
|
2662 /* convert other point to key */
|
|
jbe@0
|
2663 pgl_pointkey querykey;
|
|
jbe@0
|
2664 pgl_point_to_key(query, querykey);
|
|
jbe@0
|
2665 /* return true if both keys overlap */
|
|
jbe@0
|
2666 PG_RETURN_BOOL(pgl_keys_overlap(key, querykey));
|
|
jbe@0
|
2667 }
|
|
jbe@0
|
2668 /* strategy number 13: equality of two circles */
|
|
jbe@0
|
2669 if (strategy == 13) {
|
|
jbe@0
|
2670 /* query datum is another circle */
|
|
jbe@0
|
2671 pgl_circle *query = (pgl_circle *)PG_GETARG_POINTER(1);
|
|
jbe@0
|
2672 /* convert other circle to key */
|
|
jbe@0
|
2673 pgl_areakey querykey;
|
|
jbe@0
|
2674 pgl_circle_to_key(query, querykey);
|
|
jbe@0
|
2675 /* return true if both keys overlap */
|
|
jbe@0
|
2676 PG_RETURN_BOOL(pgl_keys_overlap(key, querykey));
|
|
jbe@0
|
2677 }
|
|
jbe@0
|
2678 /* for all remaining strategies, keys on empty objects produce no match */
|
|
jbe@0
|
2679 /* (check necessary because query radius may be infinite) */
|
|
jbe@0
|
2680 if (PGL_KEY_IS_EMPTY(key)) PG_RETURN_BOOL(false);
|
|
jbe@0
|
2681 /* strategy number 21: overlapping with point */
|
|
jbe@0
|
2682 if (strategy == 21) {
|
|
jbe@0
|
2683 /* query datum is a point */
|
|
jbe@0
|
2684 pgl_point *query = (pgl_point *)PG_GETARG_POINTER(1);
|
|
jbe@0
|
2685 /* return true if estimated distance (allowed to be smaller than real
|
|
jbe@0
|
2686 distance) between index key and point is zero */
|
|
jbe@0
|
2687 PG_RETURN_BOOL(pgl_estimate_key_distance(key, query) == 0);
|
|
jbe@0
|
2688 }
|
|
jbe@0
|
2689 /* strategy number 22: (point) overlapping with box */
|
|
jbe@0
|
2690 if (strategy == 22) {
|
|
jbe@0
|
2691 /* query datum is a box */
|
|
jbe@0
|
2692 pgl_box *query = (pgl_box *)PG_GETARG_POINTER(1);
|
|
jbe@0
|
2693 /* determine bounding box of indexed key */
|
|
jbe@0
|
2694 pgl_box keybox;
|
|
jbe@0
|
2695 pgl_key_to_box(key, &keybox);
|
|
jbe@0
|
2696 /* return true if query box overlaps with bounding box of indexed key */
|
|
jbe@0
|
2697 PG_RETURN_BOOL(pgl_boxes_overlap(query, &keybox));
|
|
jbe@0
|
2698 }
|
|
jbe@0
|
2699 /* strategy number 23: overlapping with circle */
|
|
jbe@0
|
2700 if (strategy == 23) {
|
|
jbe@0
|
2701 /* query datum is a circle */
|
|
jbe@0
|
2702 pgl_circle *query = (pgl_circle *)PG_GETARG_POINTER(1);
|
|
jbe@0
|
2703 /* return true if estimated distance (allowed to be smaller than real
|
|
jbe@0
|
2704 distance) between index key and circle center is smaller than radius */
|
|
jbe@0
|
2705 PG_RETURN_BOOL(
|
|
jbe@0
|
2706 pgl_estimate_key_distance(key, &(query->center)) <= query->radius
|
|
jbe@0
|
2707 );
|
|
jbe@0
|
2708 }
|
|
jbe@0
|
2709 /* strategy number 24: overlapping with cluster */
|
|
jbe@0
|
2710 if (strategy == 24) {
|
|
jbe@0
|
2711 bool retval; /* return value */
|
|
jbe@0
|
2712 /* query datum is a cluster */
|
|
jbe@0
|
2713 pgl_cluster *query = (pgl_cluster *)PG_DETOAST_DATUM(PG_GETARG_DATUM(1));
|
|
jbe@0
|
2714 /* return true if estimated distance (allowed to be smaller than real
|
|
jbe@0
|
2715 distance) between index key and circle center is smaller than radius */
|
|
jbe@0
|
2716 retval = (
|
|
jbe@0
|
2717 pgl_estimate_key_distance(key, &(query->bounding.center)) <=
|
|
jbe@0
|
2718 query->bounding.radius
|
|
jbe@0
|
2719 );
|
|
jbe@0
|
2720 PG_FREE_IF_COPY(query, 1); /* free detoasted cluster (if copy) */
|
|
jbe@0
|
2721 PG_RETURN_BOOL(retval);
|
|
jbe@0
|
2722 }
|
|
jbe@0
|
2723 /* throw error for any unknown strategy number */
|
|
jbe@0
|
2724 elog(ERROR, "unrecognized strategy number: %d", strategy);
|
|
jbe@0
|
2725 }
|
|
jbe@0
|
2726
|
|
jbe@0
|
2727 /* GiST "union" support function */
|
|
jbe@0
|
2728 PG_FUNCTION_INFO_V1(pgl_gist_union);
|
|
jbe@0
|
2729 Datum pgl_gist_union(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2730 GistEntryVector *entryvec = (GistEntryVector *)PG_GETARG_POINTER(0);
|
|
jbe@0
|
2731 pgl_keyptr out; /* return value (to be palloc'ed) */
|
|
jbe@0
|
2732 int i;
|
|
jbe@0
|
2733 /* determine key size */
|
|
jbe@0
|
2734 size_t keysize = PGL_KEY_IS_AREAKEY(
|
|
jbe@0
|
2735 (pgl_keyptr)DatumGetPointer(entryvec->vector[0].key)
|
|
jbe@0
|
2736 ) ? sizeof (pgl_areakey) : sizeof(pgl_pointkey);
|
|
jbe@0
|
2737 /* begin with first key as result */
|
|
jbe@0
|
2738 out = palloc(keysize);
|
|
jbe@0
|
2739 memcpy(out, (pgl_keyptr)DatumGetPointer(entryvec->vector[0].key), keysize);
|
|
jbe@0
|
2740 /* unite current result with second, third, etc. key */
|
|
jbe@0
|
2741 for (i=1; i<entryvec->n; i++) {
|
|
jbe@0
|
2742 pgl_unite_keys(out, (pgl_keyptr)DatumGetPointer(entryvec->vector[i].key));
|
|
jbe@0
|
2743 }
|
|
jbe@0
|
2744 /* return result */
|
|
jbe@0
|
2745 PG_RETURN_POINTER(out);
|
|
jbe@0
|
2746 }
|
|
jbe@0
|
2747
|
|
jbe@0
|
2748 /* GiST "compress" support function for indicis on points */
|
|
jbe@0
|
2749 PG_FUNCTION_INFO_V1(pgl_gist_compress_epoint);
|
|
jbe@0
|
2750 Datum pgl_gist_compress_epoint(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2751 GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
|
|
jbe@0
|
2752 GISTENTRY *retval; /* return value (to be palloc'ed unless set to entry) */
|
|
jbe@0
|
2753 /* only transform new leaves */
|
|
jbe@0
|
2754 if (entry->leafkey) {
|
|
jbe@0
|
2755 /* get point to be transformed */
|
|
jbe@0
|
2756 pgl_point *point = (pgl_point *)DatumGetPointer(entry->key);
|
|
jbe@0
|
2757 /* allocate memory for key */
|
|
jbe@0
|
2758 pgl_keyptr key = palloc(sizeof(pgl_pointkey));
|
|
jbe@0
|
2759 /* transform point to key */
|
|
jbe@0
|
2760 pgl_point_to_key(point, key);
|
|
jbe@0
|
2761 /* create new GISTENTRY structure as return value */
|
|
jbe@0
|
2762 retval = palloc(sizeof(GISTENTRY));
|
|
jbe@0
|
2763 gistentryinit(
|
|
jbe@0
|
2764 *retval, PointerGetDatum(key),
|
|
jbe@0
|
2765 entry->rel, entry->page, entry->offset, FALSE
|
|
jbe@0
|
2766 );
|
|
jbe@0
|
2767 } else {
|
|
jbe@0
|
2768 /* inner nodes have already been transformed */
|
|
jbe@0
|
2769 retval = entry;
|
|
jbe@0
|
2770 }
|
|
jbe@0
|
2771 /* return pointer to old or new GISTENTRY structure */
|
|
jbe@0
|
2772 PG_RETURN_POINTER(retval);
|
|
jbe@0
|
2773 }
|
|
jbe@0
|
2774
|
|
jbe@0
|
2775 /* GiST "compress" support function for indicis on circles */
|
|
jbe@0
|
2776 PG_FUNCTION_INFO_V1(pgl_gist_compress_ecircle);
|
|
jbe@0
|
2777 Datum pgl_gist_compress_ecircle(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2778 GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
|
|
jbe@0
|
2779 GISTENTRY *retval; /* return value (to be palloc'ed unless set to entry) */
|
|
jbe@0
|
2780 /* only transform new leaves */
|
|
jbe@0
|
2781 if (entry->leafkey) {
|
|
jbe@0
|
2782 /* get circle to be transformed */
|
|
jbe@0
|
2783 pgl_circle *circle = (pgl_circle *)DatumGetPointer(entry->key);
|
|
jbe@0
|
2784 /* allocate memory for key */
|
|
jbe@0
|
2785 pgl_keyptr key = palloc(sizeof(pgl_areakey));
|
|
jbe@0
|
2786 /* transform circle to key */
|
|
jbe@0
|
2787 pgl_circle_to_key(circle, key);
|
|
jbe@0
|
2788 /* create new GISTENTRY structure as return value */
|
|
jbe@0
|
2789 retval = palloc(sizeof(GISTENTRY));
|
|
jbe@0
|
2790 gistentryinit(
|
|
jbe@0
|
2791 *retval, PointerGetDatum(key),
|
|
jbe@0
|
2792 entry->rel, entry->page, entry->offset, FALSE
|
|
jbe@0
|
2793 );
|
|
jbe@0
|
2794 } else {
|
|
jbe@0
|
2795 /* inner nodes have already been transformed */
|
|
jbe@0
|
2796 retval = entry;
|
|
jbe@0
|
2797 }
|
|
jbe@0
|
2798 /* return pointer to old or new GISTENTRY structure */
|
|
jbe@0
|
2799 PG_RETURN_POINTER(retval);
|
|
jbe@0
|
2800 }
|
|
jbe@0
|
2801
|
|
jbe@0
|
2802 /* GiST "compress" support function for indices on clusters */
|
|
jbe@0
|
2803 PG_FUNCTION_INFO_V1(pgl_gist_compress_ecluster);
|
|
jbe@0
|
2804 Datum pgl_gist_compress_ecluster(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2805 GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
|
|
jbe@0
|
2806 GISTENTRY *retval; /* return value (to be palloc'ed unless set to entry) */
|
|
jbe@0
|
2807 /* only transform new leaves */
|
|
jbe@0
|
2808 if (entry->leafkey) {
|
|
jbe@0
|
2809 /* get cluster to be transformed (detoasting necessary!) */
|
|
jbe@0
|
2810 pgl_cluster *cluster = (pgl_cluster *)PG_DETOAST_DATUM(entry->key);
|
|
jbe@0
|
2811 /* allocate memory for key */
|
|
jbe@0
|
2812 pgl_keyptr key = palloc(sizeof(pgl_areakey));
|
|
jbe@0
|
2813 /* transform cluster to key */
|
|
jbe@0
|
2814 pgl_circle_to_key(&(cluster->bounding), key);
|
|
jbe@0
|
2815 /* create new GISTENTRY structure as return value */
|
|
jbe@0
|
2816 retval = palloc(sizeof(GISTENTRY));
|
|
jbe@0
|
2817 gistentryinit(
|
|
jbe@0
|
2818 *retval, PointerGetDatum(key),
|
|
jbe@0
|
2819 entry->rel, entry->page, entry->offset, FALSE
|
|
jbe@0
|
2820 );
|
|
jbe@0
|
2821 /* free detoasted datum */
|
|
jbe@0
|
2822 if ((void *)cluster != (void *)DatumGetPointer(entry->key)) pfree(cluster);
|
|
jbe@0
|
2823 } else {
|
|
jbe@0
|
2824 /* inner nodes have already been transformed */
|
|
jbe@0
|
2825 retval = entry;
|
|
jbe@0
|
2826 }
|
|
jbe@0
|
2827 /* return pointer to old or new GISTENTRY structure */
|
|
jbe@0
|
2828 PG_RETURN_POINTER(retval);
|
|
jbe@0
|
2829 }
|
|
jbe@0
|
2830
|
|
jbe@0
|
2831 /* GiST "decompress" support function for indices */
|
|
jbe@0
|
2832 PG_FUNCTION_INFO_V1(pgl_gist_decompress);
|
|
jbe@0
|
2833 Datum pgl_gist_decompress(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2834 /* return passed pointer without transformation */
|
|
jbe@0
|
2835 PG_RETURN_POINTER(PG_GETARG_POINTER(0));
|
|
jbe@0
|
2836 }
|
|
jbe@0
|
2837
|
|
jbe@0
|
2838 /* GiST "penalty" support function */
|
|
jbe@0
|
2839 PG_FUNCTION_INFO_V1(pgl_gist_penalty);
|
|
jbe@0
|
2840 Datum pgl_gist_penalty(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2841 GISTENTRY *origentry = (GISTENTRY *)PG_GETARG_POINTER(0);
|
|
jbe@0
|
2842 GISTENTRY *newentry = (GISTENTRY *)PG_GETARG_POINTER(1);
|
|
jbe@0
|
2843 float *penalty = (float *)PG_GETARG_POINTER(2);
|
|
jbe@0
|
2844 /* get original key and key to insert */
|
|
jbe@0
|
2845 pgl_keyptr orig = (pgl_keyptr)DatumGetPointer(origentry->key);
|
|
jbe@0
|
2846 pgl_keyptr new = (pgl_keyptr)DatumGetPointer(newentry->key);
|
|
jbe@0
|
2847 /* copy original key */
|
|
jbe@0
|
2848 union { pgl_pointkey pointkey; pgl_areakey areakey; } union_key;
|
|
jbe@0
|
2849 if (PGL_KEY_IS_AREAKEY(orig)) {
|
|
jbe@0
|
2850 memcpy(union_key.areakey, orig, sizeof(union_key.areakey));
|
|
jbe@0
|
2851 } else {
|
|
jbe@0
|
2852 memcpy(union_key.pointkey, orig, sizeof(union_key.pointkey));
|
|
jbe@0
|
2853 }
|
|
jbe@0
|
2854 /* calculate union of both keys */
|
|
jbe@0
|
2855 pgl_unite_keys((pgl_keyptr)&union_key, new);
|
|
jbe@0
|
2856 /* penalty equal to reduction of key length (logarithm of added area) */
|
|
jbe@0
|
2857 /* (return value by setting referenced value and returning pointer) */
|
|
jbe@0
|
2858 *penalty = (
|
|
jbe@0
|
2859 PGL_KEY_NODEDEPTH(orig) - PGL_KEY_NODEDEPTH((pgl_keyptr)&union_key)
|
|
jbe@0
|
2860 );
|
|
jbe@0
|
2861 PG_RETURN_POINTER(penalty);
|
|
jbe@0
|
2862 }
|
|
jbe@0
|
2863
|
|
jbe@0
|
2864 /* GiST "picksplit" support function */
|
|
jbe@0
|
2865 PG_FUNCTION_INFO_V1(pgl_gist_picksplit);
|
|
jbe@0
|
2866 Datum pgl_gist_picksplit(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
2867 GistEntryVector *entryvec = (GistEntryVector *)PG_GETARG_POINTER(0);
|
|
jbe@0
|
2868 GIST_SPLITVEC *v = (GIST_SPLITVEC *)PG_GETARG_POINTER(1);
|
|
jbe@0
|
2869 OffsetNumber i; /* between FirstOffsetNumber and entryvec->n (inclusive) */
|
|
jbe@0
|
2870 union {
|
|
jbe@0
|
2871 pgl_pointkey pointkey;
|
|
jbe@0
|
2872 pgl_areakey areakey;
|
|
jbe@0
|
2873 } union_all; /* union of all keys (to be calculated from scratch)
|
|
jbe@0
|
2874 (later cut in half) */
|
|
jbe@0
|
2875 int is_areakey = PGL_KEY_IS_AREAKEY(
|
|
jbe@0
|
2876 (pgl_keyptr)DatumGetPointer(entryvec->vector[FirstOffsetNumber].key)
|
|
jbe@0
|
2877 );
|
|
jbe@0
|
2878 int keysize = is_areakey ? sizeof(pgl_areakey) : sizeof(pgl_pointkey);
|
|
jbe@0
|
2879 pgl_keyptr unionL = palloc(keysize); /* union of keys that go left */
|
|
jbe@0
|
2880 pgl_keyptr unionR = palloc(keysize); /* union of keys that go right */
|
|
jbe@0
|
2881 pgl_keyptr key; /* current key to be processed */
|
|
jbe@0
|
2882 /* allocate memory for array of left and right keys, set counts to zero */
|
|
jbe@0
|
2883 v->spl_left = (OffsetNumber *)palloc(entryvec->n * sizeof(OffsetNumber));
|
|
jbe@0
|
2884 v->spl_nleft = 0;
|
|
jbe@0
|
2885 v->spl_right = (OffsetNumber *)palloc(entryvec->n * sizeof(OffsetNumber));
|
|
jbe@0
|
2886 v->spl_nright = 0;
|
|
jbe@0
|
2887 /* calculate union of all keys from scratch */
|
|
jbe@0
|
2888 memcpy(
|
|
jbe@0
|
2889 (pgl_keyptr)&union_all,
|
|
jbe@0
|
2890 (pgl_keyptr)DatumGetPointer(entryvec->vector[FirstOffsetNumber].key),
|
|
jbe@0
|
2891 keysize
|
|
jbe@0
|
2892 );
|
|
jbe@0
|
2893 for (i=FirstOffsetNumber+1; i<entryvec->n; i=OffsetNumberNext(i)) {
|
|
jbe@0
|
2894 pgl_unite_keys(
|
|
jbe@0
|
2895 (pgl_keyptr)&union_all,
|
|
jbe@0
|
2896 (pgl_keyptr)DatumGetPointer(entryvec->vector[i].key)
|
|
jbe@0
|
2897 );
|
|
jbe@0
|
2898 }
|
|
jbe@0
|
2899 /* check if trivial split is necessary due to exhausted key length */
|
|
jbe@0
|
2900 /* (Note: keys for empty objects must have node depth set to maximum) */
|
|
jbe@0
|
2901 if (PGL_KEY_NODEDEPTH((pgl_keyptr)&union_all) == (
|
|
jbe@0
|
2902 is_areakey ? PGL_AREAKEY_MAXDEPTH : PGL_POINTKEY_MAXDEPTH
|
|
jbe@0
|
2903 )) {
|
|
jbe@0
|
2904 /* half of all keys go left */
|
|
jbe@0
|
2905 for (
|
|
jbe@0
|
2906 i=FirstOffsetNumber;
|
|
jbe@0
|
2907 i<FirstOffsetNumber+(entryvec->n - FirstOffsetNumber)/2;
|
|
jbe@0
|
2908 i=OffsetNumberNext(i)
|
|
jbe@0
|
2909 ) {
|
|
jbe@0
|
2910 /* pointer to current key */
|
|
jbe@0
|
2911 key = (pgl_keyptr)DatumGetPointer(entryvec->vector[i].key);
|
|
jbe@0
|
2912 /* update unionL */
|
|
jbe@0
|
2913 /* check if key is first key that goes left */
|
|
jbe@0
|
2914 if (!v->spl_nleft) {
|
|
jbe@0
|
2915 /* first key that goes left is just copied to unionL */
|
|
jbe@0
|
2916 memcpy(unionL, key, keysize);
|
|
jbe@0
|
2917 } else {
|
|
jbe@0
|
2918 /* unite current value and next key */
|
|
jbe@0
|
2919 pgl_unite_keys(unionL, key);
|
|
jbe@0
|
2920 }
|
|
jbe@0
|
2921 /* append offset number to list of keys that go left */
|
|
jbe@0
|
2922 v->spl_left[v->spl_nleft++] = i;
|
|
jbe@0
|
2923 }
|
|
jbe@0
|
2924 /* other half goes right */
|
|
jbe@0
|
2925 for (
|
|
jbe@0
|
2926 i=FirstOffsetNumber+(entryvec->n - FirstOffsetNumber)/2;
|
|
jbe@0
|
2927 i<entryvec->n;
|
|
jbe@0
|
2928 i=OffsetNumberNext(i)
|
|
jbe@0
|
2929 ) {
|
|
jbe@0
|
2930 /* pointer to current key */
|
|
jbe@0
|
2931 key = (pgl_keyptr)DatumGetPointer(entryvec->vector[i].key);
|
|
jbe@0
|
2932 /* update unionR */
|
|
jbe@0
|
2933 /* check if key is first key that goes right */
|
|
jbe@0
|
2934 if (!v->spl_nright) {
|
|
jbe@0
|
2935 /* first key that goes right is just copied to unionR */
|
|
jbe@0
|
2936 memcpy(unionR, key, keysize);
|
|
jbe@0
|
2937 } else {
|
|
jbe@0
|
2938 /* unite current value and next key */
|
|
jbe@0
|
2939 pgl_unite_keys(unionR, key);
|
|
jbe@0
|
2940 }
|
|
jbe@0
|
2941 /* append offset number to list of keys that go right */
|
|
jbe@0
|
2942 v->spl_right[v->spl_nright++] = i;
|
|
jbe@0
|
2943 }
|
|
jbe@0
|
2944 }
|
|
jbe@0
|
2945 /* otherwise, a non-trivial split is possible */
|
|
jbe@0
|
2946 else {
|
|
jbe@0
|
2947 /* cut covered area in half */
|
|
jbe@0
|
2948 /* (union_all then refers to area of keys that go left) */
|
|
jbe@0
|
2949 /* check if union of all keys covers empty and non-empty objects */
|
|
jbe@0
|
2950 if (PGL_KEY_IS_UNIVERSAL((pgl_keyptr)&union_all)) {
|
|
jbe@0
|
2951 /* if yes, split into empty and non-empty objects */
|
|
jbe@0
|
2952 pgl_key_set_empty((pgl_keyptr)&union_all);
|
|
jbe@0
|
2953 } else {
|
|
jbe@0
|
2954 /* otherwise split by next bit */
|
|
jbe@0
|
2955 ((pgl_keyptr)&union_all)[PGL_KEY_NODEDEPTH_OFFSET]++;
|
|
jbe@0
|
2956 /* NOTE: type bit conserved */
|
|
jbe@0
|
2957 }
|
|
jbe@0
|
2958 /* determine for each key if it goes left or right */
|
|
jbe@0
|
2959 for (i=FirstOffsetNumber; i<entryvec->n; i=OffsetNumberNext(i)) {
|
|
jbe@0
|
2960 /* pointer to current key */
|
|
jbe@0
|
2961 key = (pgl_keyptr)DatumGetPointer(entryvec->vector[i].key);
|
|
jbe@0
|
2962 /* keys within one half of the area go left */
|
|
jbe@0
|
2963 if (pgl_keys_overlap((pgl_keyptr)&union_all, key)) {
|
|
jbe@0
|
2964 /* update unionL */
|
|
jbe@0
|
2965 /* check if key is first key that goes left */
|
|
jbe@0
|
2966 if (!v->spl_nleft) {
|
|
jbe@0
|
2967 /* first key that goes left is just copied to unionL */
|
|
jbe@0
|
2968 memcpy(unionL, key, keysize);
|
|
jbe@0
|
2969 } else {
|
|
jbe@0
|
2970 /* unite current value of unionL and processed key */
|
|
jbe@0
|
2971 pgl_unite_keys(unionL, key);
|
|
jbe@0
|
2972 }
|
|
jbe@0
|
2973 /* append offset number to list of keys that go left */
|
|
jbe@0
|
2974 v->spl_left[v->spl_nleft++] = i;
|
|
jbe@0
|
2975 }
|
|
jbe@0
|
2976 /* the other keys go right */
|
|
jbe@0
|
2977 else {
|
|
jbe@0
|
2978 /* update unionR */
|
|
jbe@0
|
2979 /* check if key is first key that goes right */
|
|
jbe@0
|
2980 if (!v->spl_nright) {
|
|
jbe@0
|
2981 /* first key that goes right is just copied to unionR */
|
|
jbe@0
|
2982 memcpy(unionR, key, keysize);
|
|
jbe@0
|
2983 } else {
|
|
jbe@0
|
2984 /* unite current value of unionR and processed key */
|
|
jbe@0
|
2985 pgl_unite_keys(unionR, key);
|
|
jbe@0
|
2986 }
|
|
jbe@0
|
2987 /* append offset number to list of keys that go right */
|
|
jbe@0
|
2988 v->spl_right[v->spl_nright++] = i;
|
|
jbe@0
|
2989 }
|
|
jbe@0
|
2990 }
|
|
jbe@0
|
2991 }
|
|
jbe@0
|
2992 /* store unions in return value */
|
|
jbe@0
|
2993 v->spl_ldatum = PointerGetDatum(unionL);
|
|
jbe@0
|
2994 v->spl_rdatum = PointerGetDatum(unionR);
|
|
jbe@0
|
2995 /* return all results */
|
|
jbe@0
|
2996 PG_RETURN_POINTER(v);
|
|
jbe@0
|
2997 }
|
|
jbe@0
|
2998
|
|
jbe@0
|
2999 /* GiST "same"/"equal" support function */
|
|
jbe@0
|
3000 PG_FUNCTION_INFO_V1(pgl_gist_same);
|
|
jbe@0
|
3001 Datum pgl_gist_same(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
3002 pgl_keyptr key1 = (pgl_keyptr)PG_GETARG_POINTER(0);
|
|
jbe@0
|
3003 pgl_keyptr key2 = (pgl_keyptr)PG_GETARG_POINTER(1);
|
|
jbe@0
|
3004 bool *boolptr = (bool *)PG_GETARG_POINTER(2);
|
|
jbe@0
|
3005 /* two keys are equal if they are binary equal */
|
|
jbe@0
|
3006 /* (return result by setting referenced boolean and returning pointer) */
|
|
jbe@0
|
3007 *boolptr = !memcmp(
|
|
jbe@0
|
3008 key1,
|
|
jbe@0
|
3009 key2,
|
|
jbe@0
|
3010 PGL_KEY_IS_AREAKEY(key1) ? sizeof(pgl_areakey) : sizeof(pgl_pointkey)
|
|
jbe@0
|
3011 );
|
|
jbe@0
|
3012 PG_RETURN_POINTER(boolptr);
|
|
jbe@0
|
3013 }
|
|
jbe@0
|
3014
|
|
jbe@0
|
3015 /* GiST "distance" support function */
|
|
jbe@0
|
3016 PG_FUNCTION_INFO_V1(pgl_gist_distance);
|
|
jbe@0
|
3017 Datum pgl_gist_distance(PG_FUNCTION_ARGS) {
|
|
jbe@0
|
3018 GISTENTRY *entry = (GISTENTRY *)PG_GETARG_POINTER(0);
|
|
jbe@0
|
3019 pgl_keyptr key = (pgl_keyptr)DatumGetPointer(entry->key);
|
|
jbe@0
|
3020 StrategyNumber strategy = (StrategyNumber)PG_GETARG_UINT16(2);
|
|
jbe@0
|
3021 bool *recheck = (bool *)PG_GETARG_POINTER(4);
|
|
jbe@0
|
3022 double distance; /* return value */
|
|
jbe@0
|
3023 /* demand recheck because distance is just an estimation */
|
|
jbe@0
|
3024 /* (real distance may be bigger) */
|
|
jbe@0
|
3025 *recheck = true;
|
|
jbe@10
|
3026 /* strategy number aliases for different operators using the same strategy */
|
|
jbe@10
|
3027 strategy %= 100;
|
|
jbe@0
|
3028 /* strategy number 31: distance to point */
|
|
jbe@0
|
3029 if (strategy == 31) {
|
|
jbe@0
|
3030 /* query datum is a point */
|
|
jbe@0
|
3031 pgl_point *query = (pgl_point *)PG_GETARG_POINTER(1);
|
|
jbe@0
|
3032 /* use pgl_estimate_pointkey_distance() function to compute result */
|
|
jbe@0
|
3033 distance = pgl_estimate_key_distance(key, query);
|
|
jbe@0
|
3034 /* avoid infinity (reserved!) */
|
|
jbe@0
|
3035 if (!isfinite(distance)) distance = PGL_ULTRA_DISTANCE;
|
|
jbe@0
|
3036 /* return result */
|
|
jbe@0
|
3037 PG_RETURN_FLOAT8(distance);
|
|
jbe@0
|
3038 }
|
|
jbe@0
|
3039 /* strategy number 33: distance to circle */
|
|
jbe@0
|
3040 if (strategy == 33) {
|
|
jbe@0
|
3041 /* query datum is a circle */
|
|
jbe@0
|
3042 pgl_circle *query = (pgl_circle *)PG_GETARG_POINTER(1);
|
|
jbe@0
|
3043 /* estimate distance to circle center and substract circle radius */
|
|
jbe@0
|
3044 distance = (
|
|
jbe@0
|
3045 pgl_estimate_key_distance(key, &(query->center)) - query->radius
|
|
jbe@0
|
3046 );
|
|
jbe@0
|
3047 /* convert non-positive values to zero and avoid infinity (reserved!) */
|
|
jbe@0
|
3048 if (distance <= 0) distance = 0;
|
|
jbe@0
|
3049 else if (!isfinite(distance)) distance = PGL_ULTRA_DISTANCE;
|
|
jbe@0
|
3050 /* return result */
|
|
jbe@0
|
3051 PG_RETURN_FLOAT8(distance);
|
|
jbe@0
|
3052 }
|
|
jbe@0
|
3053 /* strategy number 34: distance to cluster */
|
|
jbe@0
|
3054 if (strategy == 34) {
|
|
jbe@0
|
3055 /* query datum is a cluster */
|
|
jbe@0
|
3056 pgl_cluster *query = (pgl_cluster *)PG_DETOAST_DATUM(PG_GETARG_DATUM(1));
|
|
jbe@0
|
3057 /* estimate distance to bounding center and substract bounding radius */
|
|
jbe@0
|
3058 distance = (
|
|
jbe@0
|
3059 pgl_estimate_key_distance(key, &(query->bounding.center)) -
|
|
jbe@0
|
3060 query->bounding.radius
|
|
jbe@0
|
3061 );
|
|
jbe@0
|
3062 /* convert non-positive values to zero and avoid infinity (reserved!) */
|
|
jbe@0
|
3063 if (distance <= 0) distance = 0;
|
|
jbe@0
|
3064 else if (!isfinite(distance)) distance = PGL_ULTRA_DISTANCE;
|
|
jbe@0
|
3065 /* free detoasted cluster (if copy) */
|
|
jbe@0
|
3066 PG_FREE_IF_COPY(query, 1);
|
|
jbe@0
|
3067 /* return result */
|
|
jbe@0
|
3068 PG_RETURN_FLOAT8(distance);
|
|
jbe@0
|
3069 }
|
|
jbe@0
|
3070 /* throw error for any unknown strategy number */
|
|
jbe@0
|
3071 elog(ERROR, "unrecognized strategy number: %d", strategy);
|
|
jbe@0
|
3072 }
|
|
jbe@0
|
3073
|