PostgreSQL Source Code  git master
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros
geo_spgist.c
Go to the documentation of this file.
1 /*-------------------------------------------------------------------------
2  *
3  * geo_spgist.c
4  * SP-GiST implementation of 4-dimensional quad tree over boxes
5  *
6  * This module provides SP-GiST implementation for boxes using quad tree
7  * analogy in 4-dimensional space. SP-GiST doesn't allow indexing of
8  * overlapping objects. We are making 2D objects never-overlapping in
9  * 4D space. This technique has some benefits compared to traditional
10  * R-Tree which is implemented as GiST. The performance tests reveal
11  * that this technique especially beneficial with too much overlapping
12  * objects, so called "spaghetti data".
13  *
14  * Unlike the original quad tree, we are splitting the tree into 16
15  * quadrants in 4D space. It is easier to imagine it as splitting space
16  * two times into 4:
17  *
18  * | |
19  * | |
20  * | -----+-----
21  * | |
22  * | |
23  * -------------+-------------
24  * |
25  * |
26  * |
27  * |
28  * |
29  *
30  * We are using box datatype as the prefix, but we are treating them
31  * as points in 4-dimensional space, because 2D boxes are not enough
32  * to represent the quadrant boundaries in 4D space. They however are
33  * sufficient to point out the additional boundaries of the next
34  * quadrant.
35  *
36  * We are using traversal values provided by SP-GiST to calculate and
37  * to store the bounds of the quadrants, while traversing into the tree.
38  * Traversal value has all the boundaries in the 4D space, and is is
39  * capable of transferring the required boundaries to the following
40  * traversal values. In conclusion, three things are necessary
41  * to calculate the next traversal value:
42  *
43  * (1) the traversal value of the parent
44  * (2) the quadrant of the current node
45  * (3) the prefix of the current node
46  *
47  * If we visualize them on our simplified drawing (see the drawing above);
48  * transferred boundaries of (1) would be the outer axis, relevant part
49  * of (2) would be the up right part of the other axis, and (3) would be
50  * the inner axis.
51  *
52  * For example, consider the case of overlapping. When recursion
53  * descends deeper and deeper down the tree, all quadrants in
54  * the current node will be checked for overlapping. The boundaries
55  * will be re-calculated for all quadrants. Overlap check answers
56  * the question: can any box from this quadrant overlap with the given
57  * box? If yes, then this quadrant will be walked. If no, then this
58  * quadrant will be skipped.
59  *
60  * This method provides restrictions for minimum and maximum values of
61  * every dimension of every corner of the box on every level of the tree
62  * except the root. For the root node, we are setting the boundaries
63  * that we don't yet have as infinity.
64  *
65  * Portions Copyright (c) 1996-2017, PostgreSQL Global Development Group
66  * Portions Copyright (c) 1994, Regents of the University of California
67  *
68  * IDENTIFICATION
69  * src/backend/utils/adt/geo_spgist.c
70  *
71  *-------------------------------------------------------------------------
72  */
73 
74 #include "postgres.h"
75 
76 #include "access/spgist.h"
77 #include "access/stratnum.h"
78 #include "catalog/pg_type.h"
79 #include "utils/builtins.h"
80 #include "utils/geo_decls.h"
81 
82 /*
83  * Comparator for qsort
84  *
85  * We don't need to use the floating point macros in here, because this
86  * is going only going to be used in a place to effect the performance
87  * of the index, not the correctness.
88  */
89 static int
90 compareDoubles(const void *a, const void *b)
91 {
92  double x = *(double *) a;
93  double y = *(double *) b;
94 
95  if (x == y)
96  return 0;
97  return (x > y) ? 1 : -1;
98 }
99 
100 typedef struct
101 {
102  double low;
103  double high;
104 } Range;
105 
106 typedef struct
107 {
110 } RangeBox;
111 
112 typedef struct
113 {
116 } RectBox;
117 
118 /*
119  * Calculate the quadrant
120  *
121  * The quadrant is 8 bit unsigned integer with 4 least bits in use.
122  * This function accepts BOXes as input. They are not casted to
123  * RangeBoxes, yet. All 4 bits are set by comparing a corner of the box.
124  * This makes 16 quadrants in total.
125  */
126 static uint8
127 getQuadrant(BOX *centroid, BOX *inBox)
128 {
129  uint8 quadrant = 0;
130 
131  if (inBox->low.x > centroid->low.x)
132  quadrant |= 0x8;
133 
134  if (inBox->high.x > centroid->high.x)
135  quadrant |= 0x4;
136 
137  if (inBox->low.y > centroid->low.y)
138  quadrant |= 0x2;
139 
140  if (inBox->high.y > centroid->high.y)
141  quadrant |= 0x1;
142 
143  return quadrant;
144 }
145 
146 /*
147  * Get RangeBox using BOX
148  *
149  * We are turning the BOX to our structures to emphasize their function
150  * of representing points in 4D space. It also is more convenient to
151  * access the values with this structure.
152  */
153 static RangeBox *
155 {
156  RangeBox *range_box = (RangeBox *) palloc(sizeof(RangeBox));
157 
158  range_box->left.low = box->low.x;
159  range_box->left.high = box->high.x;
160 
161  range_box->right.low = box->low.y;
162  range_box->right.high = box->high.y;
163 
164  return range_box;
165 }
166 
167 /*
168  * Initialize the traversal value
169  *
170  * In the beginning, we don't have any restrictions. We have to
171  * initialize the struct to cover the whole 4D space.
172  */
173 static RectBox *
175 {
176  RectBox *rect_box = (RectBox *) palloc(sizeof(RectBox));
177  double infinity = get_float8_infinity();
178 
179  rect_box->range_box_x.left.low = -infinity;
180  rect_box->range_box_x.left.high = infinity;
181 
182  rect_box->range_box_x.right.low = -infinity;
183  rect_box->range_box_x.right.high = infinity;
184 
185  rect_box->range_box_y.left.low = -infinity;
186  rect_box->range_box_y.left.high = infinity;
187 
188  rect_box->range_box_y.right.low = -infinity;
189  rect_box->range_box_y.right.high = infinity;
190 
191  return rect_box;
192 }
193 
194 /*
195  * Calculate the next traversal value
196  *
197  * All centroids are bounded by RectBox, but SP-GiST only keeps
198  * boxes. When we are traversing the tree, we must calculate RectBox,
199  * using centroid and quadrant.
200  */
201 static RectBox *
202 nextRectBox(RectBox *rect_box, RangeBox *centroid, uint8 quadrant)
203 {
204  RectBox *next_rect_box = (RectBox *) palloc(sizeof(RectBox));
205 
206  memcpy(next_rect_box, rect_box, sizeof(RectBox));
207 
208  if (quadrant & 0x8)
209  next_rect_box->range_box_x.left.low = centroid->left.low;
210  else
211  next_rect_box->range_box_x.left.high = centroid->left.low;
212 
213  if (quadrant & 0x4)
214  next_rect_box->range_box_x.right.low = centroid->left.high;
215  else
216  next_rect_box->range_box_x.right.high = centroid->left.high;
217 
218  if (quadrant & 0x2)
219  next_rect_box->range_box_y.left.low = centroid->right.low;
220  else
221  next_rect_box->range_box_y.left.high = centroid->right.low;
222 
223  if (quadrant & 0x1)
224  next_rect_box->range_box_y.right.low = centroid->right.high;
225  else
226  next_rect_box->range_box_y.right.high = centroid->right.high;
227 
228  return next_rect_box;
229 }
230 
231 /* Can any range from range_box overlap with this argument? */
232 static bool
233 overlap2D(RangeBox *range_box, Range *query)
234 {
235  return FPge(range_box->right.high, query->low) &&
236  FPle(range_box->left.low, query->high);
237 }
238 
239 /* Can any rectangle from rect_box overlap with this argument? */
240 static bool
241 overlap4D(RectBox *rect_box, RangeBox *query)
242 {
243  return overlap2D(&rect_box->range_box_x, &query->left) &&
244  overlap2D(&rect_box->range_box_y, &query->right);
245 }
246 
247 /* Can any range from range_box contain this argument? */
248 static bool
249 contain2D(RangeBox *range_box, Range *query)
250 {
251  return FPge(range_box->right.high, query->high) &&
252  FPle(range_box->left.low, query->low);
253 }
254 
255 /* Can any rectangle from rect_box contain this argument? */
256 static bool
257 contain4D(RectBox *rect_box, RangeBox *query)
258 {
259  return contain2D(&rect_box->range_box_x, &query->left) &&
260  contain2D(&rect_box->range_box_y, &query->right);
261 }
262 
263 /* Can any range from range_box be contained by this argument? */
264 static bool
265 contained2D(RangeBox *range_box, Range *query)
266 {
267  return FPle(range_box->left.low, query->high) &&
268  FPge(range_box->left.high, query->low) &&
269  FPle(range_box->right.low, query->high) &&
270  FPge(range_box->right.high, query->low);
271 }
272 
273 /* Can any rectangle from rect_box be contained by this argument? */
274 static bool
275 contained4D(RectBox *rect_box, RangeBox *query)
276 {
277  return contained2D(&rect_box->range_box_x, &query->left) &&
278  contained2D(&rect_box->range_box_y, &query->right);
279 }
280 
281 /* Can any range from range_box to be lower than this argument? */
282 static bool
283 lower2D(RangeBox *range_box, Range *query)
284 {
285  return FPlt(range_box->left.low, query->low) &&
286  FPlt(range_box->right.low, query->low);
287 }
288 
289 /* Can any range from range_box to be higher than this argument? */
290 static bool
291 higher2D(RangeBox *range_box, Range *query)
292 {
293  return FPgt(range_box->left.high, query->high) &&
294  FPgt(range_box->right.high, query->high);
295 }
296 
297 /* Can any rectangle from rect_box be left of this argument? */
298 static bool
299 left4D(RectBox *rect_box, RangeBox *query)
300 {
301  return lower2D(&rect_box->range_box_x, &query->left);
302 }
303 
304 /* Can any rectangle from rect_box does not extend the right of this argument? */
305 static bool
306 overLeft4D(RectBox *rect_box, RangeBox *query)
307 {
308  return lower2D(&rect_box->range_box_x, &query->right);
309 }
310 
311 /* Can any rectangle from rect_box be right of this argument? */
312 static bool
313 right4D(RectBox *rect_box, RangeBox *query)
314 {
315  return higher2D(&rect_box->range_box_x, &query->left);
316 }
317 
318 /* Can any rectangle from rect_box does not extend the left of this argument? */
319 static bool
320 overRight4D(RectBox *rect_box, RangeBox *query)
321 {
322  return higher2D(&rect_box->range_box_x, &query->right);
323 }
324 
325 /* Can any rectangle from rect_box be below of this argument? */
326 static bool
327 below4D(RectBox *rect_box, RangeBox *query)
328 {
329  return lower2D(&rect_box->range_box_y, &query->right);
330 }
331 
332 /* Can any rectangle from rect_box does not extend above this argument? */
333 static bool
334 overBelow4D(RectBox *rect_box, RangeBox *query)
335 {
336  return lower2D(&rect_box->range_box_y, &query->left);
337 }
338 
339 /* Can any rectangle from rect_box be above of this argument? */
340 static bool
341 above4D(RectBox *rect_box, RangeBox *query)
342 {
343  return higher2D(&rect_box->range_box_y, &query->right);
344 }
345 
346 /* Can any rectangle from rect_box does not extend below of this argument? */
347 static bool
348 overAbove4D(RectBox *rect_box, RangeBox *query)
349 {
350  return higher2D(&rect_box->range_box_y, &query->right);
351 }
352 
353 /*
354  * SP-GiST config function
355  */
356 Datum
358 {
360 
361  cfg->prefixType = BOXOID;
362  cfg->labelType = VOIDOID; /* We don't need node labels. */
363  cfg->canReturnData = true;
364  cfg->longValuesOK = false;
365 
366  PG_RETURN_VOID();
367 }
368 
369 /*
370  * SP-GiST choose function
371  */
372 Datum
374 {
377  BOX *centroid = DatumGetBoxP(in->prefixDatum),
378  *box = DatumGetBoxP(in->datum);
379 
380  out->resultType = spgMatchNode;
381  out->result.matchNode.restDatum = BoxPGetDatum(box);
382 
383  /* nodeN will be set by core, when allTheSame. */
384  if (!in->allTheSame)
385  out->result.matchNode.nodeN = getQuadrant(centroid, box);
386 
387  PG_RETURN_VOID();
388 }
389 
390 /*
391  * SP-GiST pick-split function
392  *
393  * It splits a list of boxes into quadrants by choosing a central 4D
394  * point as the median of the coordinates of the boxes.
395  */
396 Datum
398 {
401  BOX *centroid;
402  int median,
403  i;
404  double *lowXs = palloc(sizeof(double) * in->nTuples);
405  double *highXs = palloc(sizeof(double) * in->nTuples);
406  double *lowYs = palloc(sizeof(double) * in->nTuples);
407  double *highYs = palloc(sizeof(double) * in->nTuples);
408 
409  /* Calculate median of all 4D coordinates */
410  for (i = 0; i < in->nTuples; i++)
411  {
412  BOX *box = DatumGetBoxP(in->datums[i]);
413 
414  lowXs[i] = box->low.x;
415  highXs[i] = box->high.x;
416  lowYs[i] = box->low.y;
417  highYs[i] = box->high.y;
418  }
419 
420  qsort(lowXs, in->nTuples, sizeof(double), compareDoubles);
421  qsort(highXs, in->nTuples, sizeof(double), compareDoubles);
422  qsort(lowYs, in->nTuples, sizeof(double), compareDoubles);
423  qsort(highYs, in->nTuples, sizeof(double), compareDoubles);
424 
425  median = in->nTuples / 2;
426 
427  centroid = palloc(sizeof(BOX));
428 
429  centroid->low.x = lowXs[median];
430  centroid->high.x = highXs[median];
431  centroid->low.y = lowYs[median];
432  centroid->high.y = highYs[median];
433 
434  /* Fill the output */
435  out->hasPrefix = true;
436  out->prefixDatum = BoxPGetDatum(centroid);
437 
438  out->nNodes = 16;
439  out->nodeLabels = NULL; /* We don't need node labels. */
440 
441  out->mapTuplesToNodes = palloc(sizeof(int) * in->nTuples);
442  out->leafTupleDatums = palloc(sizeof(Datum) * in->nTuples);
443 
444  /*
445  * Assign ranges to corresponding nodes according to quadrants relative to
446  * the "centroid" range
447  */
448  for (i = 0; i < in->nTuples; i++)
449  {
450  BOX *box = DatumGetBoxP(in->datums[i]);
451  uint8 quadrant = getQuadrant(centroid, box);
452 
453  out->leafTupleDatums[i] = BoxPGetDatum(box);
454  out->mapTuplesToNodes[i] = quadrant;
455  }
456 
457  PG_RETURN_VOID();
458 }
459 
460 /*
461  * SP-GiST inner consistent function
462  */
463 Datum
465 {
468  int i;
469  MemoryContext old_ctx;
470  RectBox *rect_box;
471  uint8 quadrant;
472  RangeBox *centroid,
473  **queries;
474 
475  if (in->allTheSame)
476  {
477  /* Report that all nodes should be visited */
478  out->nNodes = in->nNodes;
479  out->nodeNumbers = (int *) palloc(sizeof(int) * in->nNodes);
480  for (i = 0; i < in->nNodes; i++)
481  out->nodeNumbers[i] = i;
482 
483  PG_RETURN_VOID();
484  }
485 
486  /*
487  * We are saving the traversal value or initialize it an unbounded one, if
488  * we have just begun to walk the tree.
489  */
490  if (in->traversalValue)
491  rect_box = in->traversalValue;
492  else
493  rect_box = initRectBox();
494 
495  /*
496  * We are casting the prefix and queries to RangeBoxes for ease of the
497  * following operations.
498  */
499  centroid = getRangeBox(DatumGetBoxP(in->prefixDatum));
500  queries = (RangeBox **) palloc(in->nkeys * sizeof(RangeBox *));
501  for (i = 0; i < in->nkeys; i++)
502  queries[i] = getRangeBox(DatumGetBoxP(in->scankeys[i].sk_argument));
503 
504  /* Allocate enough memory for nodes */
505  out->nNodes = 0;
506  out->nodeNumbers = (int *) palloc(sizeof(int) * in->nNodes);
507  out->traversalValues = (void **) palloc(sizeof(void *) * in->nNodes);
508 
509  /*
510  * We switch memory context, because we want to allocate memory for new
511  * traversal values (next_rect_box) and pass these pieces of memory to
512  * further call of this function.
513  */
515 
516  for (quadrant = 0; quadrant < in->nNodes; quadrant++)
517  {
518  RectBox *next_rect_box = nextRectBox(rect_box, centroid, quadrant);
519  bool flag = true;
520 
521  for (i = 0; i < in->nkeys; i++)
522  {
523  StrategyNumber strategy = in->scankeys[i].sk_strategy;
524 
525  switch (strategy)
526  {
528  flag = overlap4D(next_rect_box, queries[i]);
529  break;
530 
532  flag = contain4D(next_rect_box, queries[i]);
533  break;
534 
537  flag = contained4D(next_rect_box, queries[i]);
538  break;
539 
541  flag = left4D(next_rect_box, queries[i]);
542  break;
543 
545  flag = overLeft4D(next_rect_box, queries[i]);
546  break;
547 
549  flag = right4D(next_rect_box, queries[i]);
550  break;
551 
553  flag = overRight4D(next_rect_box, queries[i]);
554  break;
555 
557  flag = above4D(next_rect_box, queries[i]);
558  break;
559 
561  flag = overAbove4D(next_rect_box, queries[i]);
562  break;
563 
565  flag = below4D(next_rect_box, queries[i]);
566  break;
567 
569  flag = overBelow4D(next_rect_box, queries[i]);
570  break;
571 
572  default:
573  elog(ERROR, "unrecognized strategy: %d", strategy);
574  }
575 
576  /* If any check is failed, we have found our answer. */
577  if (!flag)
578  break;
579  }
580 
581  if (flag)
582  {
583  out->traversalValues[out->nNodes] = next_rect_box;
584  out->nodeNumbers[out->nNodes] = quadrant;
585  out->nNodes++;
586  }
587  else
588  {
589  /*
590  * If this node is not selected, we don't need to keep the next
591  * traversal value in the memory context.
592  */
593  pfree(next_rect_box);
594  }
595  }
596 
597  /* Switch back */
598  MemoryContextSwitchTo(old_ctx);
599 
600  PG_RETURN_VOID();
601 }
602 
603 /*
604  * SP-GiST inner consistent function
605  */
606 Datum
608 {
611  Datum leaf = in->leafDatum;
612  bool flag = true;
613  int i;
614 
615  /* All tests are exact. */
616  out->recheck = false;
617 
618  /* leafDatum is what it is... */
619  out->leafValue = in->leafDatum;
620 
621  /* Perform the required comparison(s) */
622  for (i = 0; i < in->nkeys; i++)
623  {
624  StrategyNumber strategy = in->scankeys[i].sk_strategy;
625  Datum query = in->scankeys[i].sk_argument;
626 
627  switch (strategy)
628  {
631  query));
632  break;
633 
636  query));
637  break;
638 
641  query));
642  break;
643 
646  query));
647  break;
648 
651  query));
652  break;
653 
656  query));
657  break;
658 
661  query));
662  break;
663 
666  query));
667  break;
668 
671  query));
672  break;
673 
676  query));
677  break;
678 
681  query));
682  break;
683 
686  query));
687  break;
688 
689  default:
690  elog(ERROR, "unrecognized strategy: %d", strategy);
691  }
692 
693  /* If any check is failed, we have found our answer. */
694  if (!flag)
695  break;
696  }
697 
698  PG_RETURN_BOOL(flag);
699 }
Datum box_right(PG_FUNCTION_ARGS)
Definition: geo_ops.c:564
Datum box_contained(PG_FUNCTION_ARGS)
Definition: geo_ops.c:636
static bool contained2D(RangeBox *range_box, Range *query)
Definition: geo_spgist.c:265
static bool overAbove4D(RectBox *rect_box, RangeBox *query)
Definition: geo_spgist.c:348
Datum box_same(PG_FUNCTION_ARGS)
Definition: geo_ops.c:504
Definition: geo_decls.h:102
Datum datum
Definition: spgist.h:56
struct spgChooseOut::@41::@42 matchNode
Datum box_left(PG_FUNCTION_ARGS)
Definition: geo_ops.c:538
static bool overBelow4D(RectBox *rect_box, RangeBox *query)
Definition: geo_spgist.c:334
bool canReturnData
Definition: spgist.h:47
static bool contain4D(RectBox *rect_box, RangeBox *query)
Definition: geo_spgist.c:257
Datum * leafTupleDatums
Definition: spgist.h:127
#define RTLeftStrategyNumber
Definition: stratnum.h:44
Datum * datums
Definition: spgist.h:114
Datum box_overright(PG_FUNCTION_ARGS)
Definition: geo_ops.c:579
Datum spg_box_quad_picksplit(PG_FUNCTION_ARGS)
Definition: geo_spgist.c:397
Datum spg_box_quad_config(PG_FUNCTION_ARGS)
Definition: geo_spgist.c:357
double y
Definition: geo_decls.h:60
Datum box_overlap(PG_FUNCTION_ARGS)
Definition: geo_ops.c:518
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
unsigned char uint8
Definition: c.h:263
void * traversalValue
Definition: spgist.h:139
#define RTOverBelowStrategyNumber
Definition: stratnum.h:52
static bool overRight4D(RectBox *rect_box, RangeBox *query)
Definition: geo_spgist.c:320
Datum prefixDatum
Definition: spgist.h:63
static bool lower2D(RangeBox *range_box, Range *query)
Definition: geo_spgist.c:283
uint16 StrategyNumber
Definition: stratnum.h:22
#define RTContainedByStrategyNumber
Definition: stratnum.h:51
#define PG_GETARG_POINTER(n)
Definition: fmgr.h:232
static bool left4D(RectBox *rect_box, RangeBox *query)
Definition: geo_spgist.c:299
#define RTBelowStrategyNumber
Definition: stratnum.h:53
RangeBox range_box_y
Definition: geo_spgist.c:115
Range right
Definition: geo_spgist.c:109
double x
Definition: geo_decls.h:60
RangeBox range_box_x
Definition: geo_spgist.c:114
#define RTOverAboveStrategyNumber
Definition: stratnum.h:55
#define FPgt(A, B)
Definition: geo_decls.h:41
static bool below4D(RectBox *rect_box, RangeBox *query)
Definition: geo_spgist.c:327
void pfree(void *pointer)
Definition: mcxt.c:992
#define VOIDOID
Definition: pg_type.h:678
#define BOXOID
Definition: pg_type.h:394
static bool overlap4D(RectBox *rect_box, RangeBox *query)
Definition: geo_spgist.c:241
MemoryContext traversalMemoryContext
Definition: spgist.h:140
#define ERROR
Definition: elog.h:43
Datum spg_box_quad_inner_consistent(PG_FUNCTION_ARGS)
Definition: geo_spgist.c:464
Datum * nodeLabels
Definition: spgist.h:124
StrategyNumber sk_strategy
Definition: skey.h:68
ScanKey scankeys
Definition: spgist.h:167
Datum box_contain(PG_FUNCTION_ARGS)
Definition: geo_ops.c:650
Datum box_above(PG_FUNCTION_ARGS)
Definition: geo_ops.c:613
char * flag(int b)
Definition: test-ctype.c:33
static bool contain2D(RangeBox *range_box, Range *query)
Definition: geo_spgist.c:249
#define DatumGetBool(X)
Definition: postgres.h:401
#define RTSameStrategyNumber
Definition: stratnum.h:49
#define RTOverRightStrategyNumber
Definition: stratnum.h:47
void ** traversalValues
Definition: spgist.h:159
double low
Definition: geo_spgist.c:102
double get_float8_infinity(void)
Definition: float.c:121
static bool above4D(RectBox *rect_box, RangeBox *query)
Definition: geo_spgist.c:341
Point low
Definition: geo_decls.h:104
#define RTOverLeftStrategyNumber
Definition: stratnum.h:45
#define PG_RETURN_BOOL(x)
Definition: fmgr.h:303
bool longValuesOK
Definition: spgist.h:48
uintptr_t Datum
Definition: postgres.h:374
Datum spg_box_quad_leaf_consistent(PG_FUNCTION_ARGS)
Definition: geo_spgist.c:607
static RectBox * initRectBox(void)
Definition: geo_spgist.c:174
Datum spg_box_quad_choose(PG_FUNCTION_ARGS)
Definition: geo_spgist.c:373
Oid prefixType
Definition: spgist.h:45
Datum box_overbelow(PG_FUNCTION_ARGS)
Definition: geo_ops.c:602
spgChooseResultType resultType
Definition: spgist.h:77
#define BoxPGetDatum(X)
Definition: geo_decls.h:160
#define PG_RETURN_VOID()
Definition: fmgr.h:293
Datum box_below(PG_FUNCTION_ARGS)
Definition: geo_ops.c:590
#define RTAboveStrategyNumber
Definition: stratnum.h:54
#define FPlt(A, B)
Definition: geo_decls.h:39
#define NULL
Definition: c.h:226
double high
Definition: geo_spgist.c:103
#define RTRightStrategyNumber
Definition: stratnum.h:48
bool hasPrefix
Definition: spgist.h:120
Datum box_overleft(PG_FUNCTION_ARGS)
Definition: geo_ops.c:553
static bool contained4D(RectBox *rect_box, RangeBox *query)
Definition: geo_spgist.c:275
#define RTContainsStrategyNumber
Definition: stratnum.h:50
ScanKey scankeys
Definition: spgist.h:135
#define DatumGetBoxP(X)
Definition: geo_decls.h:159
Point high
Definition: geo_decls.h:104
static uint8 getQuadrant(BOX *centroid, BOX *inBox)
Definition: geo_spgist.c:127
static bool overlap2D(RangeBox *range_box, Range *query)
Definition: geo_spgist.c:233
void * palloc(Size size)
Definition: mcxt.c:891
#define FPge(A, B)
Definition: geo_decls.h:42
static bool overLeft4D(RectBox *rect_box, RangeBox *query)
Definition: geo_spgist.c:306
Oid labelType
Definition: spgist.h:46
int i
int * mapTuplesToNodes
Definition: spgist.h:126
union spgChooseOut::@41 result
static int compareDoubles(const void *a, const void *b)
Definition: geo_spgist.c:90
bool allTheSame
Definition: spgist.h:61
Datum prefixDatum
Definition: spgist.h:121
#define RTOverlapStrategyNumber
Definition: stratnum.h:46
#define PG_FUNCTION_ARGS
Definition: fmgr.h:150
Datum box_overabove(PG_FUNCTION_ARGS)
Definition: geo_ops.c:625
#define elog
Definition: elog.h:219
#define FPle(A, B)
Definition: geo_decls.h:40
#define qsort(a, b, c, d)
Definition: port.h:440
static bool right4D(RectBox *rect_box, RangeBox *query)
Definition: geo_spgist.c:313
static RangeBox * getRangeBox(BOX *box)
Definition: geo_spgist.c:154
Datum sk_argument
Definition: skey.h:72
Range left
Definition: geo_spgist.c:108
#define DirectFunctionCall2(func, arg1, arg2)
Definition: fmgr.h:557
static bool higher2D(RangeBox *range_box, Range *query)
Definition: geo_spgist.c:291
static RectBox * nextRectBox(RectBox *rect_box, RangeBox *centroid, uint8 quadrant)
Definition: geo_spgist.c:202