*
**********************************************************************/
-
/*
** R-Tree Bibliography
**
*/
#include "postgres.h"
-#include "access/gist.h" /* For GiST */
+#include "access/gist.h" /* For GiST */
#include "access/itup.h"
#include "access/skey.h"
#include "../postgis_config.h"
-/*#define POSTGIS_DEBUG_LEVEL 4*/
-
-#include "liblwgeom.h" /* For standard geometry types. */
-#include "lwgeom_pg.h" /* For debugging macros. */
-#include "gserialized_gist.h" /* For utility functions. */
+#include "liblwgeom.h" /* For standard geometry types. */
+#include "lwgeom_pg.h" /* For debugging macros. */
+#include "gserialized_gist.h" /* For utility functions. */
#include "geography.h"
#include <assert.h>
-
/* Fall back to older finite() if necessary */
#ifndef HAVE_ISFINITE
-# ifdef HAVE_GNU_ISFINITE
-# define _GNU_SOURCE
-# else
-# define isfinite finite
-# endif
+#ifdef HAVE_GNU_ISFINITE
+#define _GNU_SOURCE
+#else
+#define isfinite finite
+#endif
#endif
/*
** ND Operator prototypes
*/
Datum gserialized_overlaps(PG_FUNCTION_ARGS);
+Datum gserialized_gidx_geom_overlaps(PG_FUNCTION_ARGS);
+Datum gserialized_gidx_gidx_overlaps(PG_FUNCTION_ARGS);
Datum gserialized_contains(PG_FUNCTION_ARGS);
-#if POSTGIS_PGSQL_VERSION > 94
Datum gserialized_gidx_geom_contains(PG_FUNCTION_ARGS);
Datum gserialized_gidx_gidx_contains(PG_FUNCTION_ARGS);
-#endif
Datum gserialized_within(PG_FUNCTION_ARGS);
-#if POSTGIS_PGSQL_VERSION > 94
Datum gserialized_gidx_geom_within(PG_FUNCTION_ARGS);
Datum gserialized_gidx_gidx_within(PG_FUNCTION_ARGS);
-#endif
-Datum gserialized_distance_nd(PG_FUNCTION_ARGS);
-#if POSTGIS_PGSQL_VERSION > 94
+Datum gserialized_same(PG_FUNCTION_ARGS);
Datum gserialized_gidx_geom_same(PG_FUNCTION_ARGS);
Datum gserialized_gidx_gidx_same(PG_FUNCTION_ARGS);
-#endif
+Datum gserialized_distance_nd(PG_FUNCTION_ARGS);
/*
** GIDX true/false test function type
*/
typedef bool (*gidx_predicate)(GIDX *a, GIDX *b);
-
/* Allocate a new copy of GIDX */
-GIDX* gidx_copy(GIDX *b)
+GIDX *
+gidx_copy(GIDX *b)
{
- GIDX *c = (GIDX*)palloc(VARSIZE(b));
+ GIDX *c = (GIDX *)palloc(VARSIZE(b));
POSTGIS_DEBUGF(5, "copied gidx (%p) to gidx (%p)", b, c);
- memcpy((void*)c, (void*)b, VARSIZE(b));
+ memcpy((void *)c, (void *)b, VARSIZE(b));
return c;
}
-
/* Ensure all minimums are below maximums. */
-static inline void gidx_validate(GIDX *b)
+void
+gidx_validate(GIDX *b)
{
uint32_t i;
Assert(b);
- POSTGIS_DEBUGF(5,"validating gidx (%s)", gidx_to_string(b));
- for ( i = 0; i < GIDX_NDIMS(b); i++ )
+ POSTGIS_DEBUGF(5, "validating gidx (%s)", gidx_to_string(b));
+ for (i = 0; i < GIDX_NDIMS(b); i++)
{
- if ( GIDX_GET_MIN(b,i) > GIDX_GET_MAX(b,i) )
+ if (GIDX_GET_MIN(b, i) > GIDX_GET_MAX(b, i))
{
float tmp;
- tmp = GIDX_GET_MIN(b,i);
- GIDX_SET_MIN(b,i,GIDX_GET_MAX(b,i));
- GIDX_SET_MAX(b,i,tmp);
+ tmp = GIDX_GET_MIN(b, i);
+ GIDX_SET_MIN(b, i, GIDX_GET_MAX(b, i));
+ GIDX_SET_MAX(b, i, tmp);
}
}
return;
/* An "unknown" GIDX is used to represent the bounds of an EMPTY
geometry or other-wise unindexable geometry (like one with NaN
or Inf bounds) */
-inline bool gidx_is_unknown(const GIDX *a)
+inline bool
+gidx_is_unknown(const GIDX *a)
{
size_t size = VARSIZE(a) - VARHDRSZ;
/* "unknown" gidx objects have a too-small size of one float */
- if ( size <= 0.0 )
+ if (size <= 0.0)
return true;
return false;
}
-static inline void gidx_set_unknown(GIDX *a)
+void
+gidx_set_unknown(GIDX *a)
{
SET_VARSIZE(a, VARHDRSZ);
}
/* Enlarge b_union to contain b_new. If b_new contains more
dimensions than b_union, expand b_union to contain those dimensions. */
-void gidx_merge(GIDX **b_union, GIDX *b_new)
+void
+gidx_merge(GIDX **b_union, GIDX *b_new)
{
int i, dims_union, dims_new;
Assert(b_union);
Assert(b_new);
/* Can't merge an unknown into any thing */
- if( gidx_is_unknown(b_new) )
+ if (gidx_is_unknown(b_new))
return;
/* Merge of unknown and known is known */
- if( gidx_is_unknown(*b_union) )
+ if (gidx_is_unknown(*b_union))
{
*b_union = b_new;
return;
POSTGIS_DEBUGF(4, "merging gidx (%s) into gidx (%s)", gidx_to_string(b_new), gidx_to_string(*b_union));
- if ( dims_new > dims_union )
+ if (dims_new > dims_union)
{
POSTGIS_DEBUGF(5, "reallocating b_union from %d dims to %d dims", dims_union, dims_new);
- *b_union = (GIDX*)repalloc(*b_union, GIDX_SIZE(dims_new));
+ *b_union = (GIDX *)repalloc(*b_union, GIDX_SIZE(dims_new));
SET_VARSIZE(*b_union, VARSIZE(b_new));
dims_union = dims_new;
}
- for ( i = 0; i < dims_new; i++ )
+ for (i = 0; i < dims_new; i++)
{
/* Adjust minimums */
- GIDX_SET_MIN(*b_union, i, Min(GIDX_GET_MIN(*b_union,i),GIDX_GET_MIN(b_new,i)));
+ GIDX_SET_MIN(*b_union, i, Min(GIDX_GET_MIN(*b_union, i), GIDX_GET_MIN(b_new, i)));
/* Adjust maximums */
- GIDX_SET_MAX(*b_union, i, Max(GIDX_GET_MAX(*b_union,i),GIDX_GET_MAX(b_new,i)));
+ GIDX_SET_MAX(*b_union, i, Max(GIDX_GET_MAX(*b_union, i), GIDX_GET_MAX(b_new, i)));
}
POSTGIS_DEBUGF(5, "merge complete (%s)", gidx_to_string(*b_union));
}
/* Calculate the volume (in n-d units) of the GIDX */
-static float gidx_volume(GIDX *a)
+static float
+gidx_volume(GIDX *a)
{
float result;
uint32_t i;
- if ( a == NULL || gidx_is_unknown(a) )
- {
- /* elog(ERROR, "gidx_volume received a null argument"); */
+ if (!a || gidx_is_unknown(a))
return 0.0;
- }
- result = GIDX_GET_MAX(a,0) - GIDX_GET_MIN(a,0);
- for ( i = 1; i < GIDX_NDIMS(a); i++ )
- result *= (GIDX_GET_MAX(a,i) - GIDX_GET_MIN(a,i));
+ result = GIDX_GET_MAX(a, 0) - GIDX_GET_MIN(a, 0);
+ for (i = 1; i < GIDX_NDIMS(a); i++)
+ result *= (GIDX_GET_MAX(a, i) - GIDX_GET_MIN(a, i));
POSTGIS_DEBUGF(5, "calculated volume of %s as %.8g", gidx_to_string(a), result);
return result;
}
/* Calculate the edge of the GIDX */
-static float gidx_edge(GIDX *a)
+static float
+gidx_edge(GIDX *a)
{
float result;
uint32_t i;
- if ( a == NULL || gidx_is_unknown(a) )
- {
+ if (!a || gidx_is_unknown(a))
return 0.0;
- }
- result = GIDX_GET_MAX(a,0) - GIDX_GET_MIN(a,0);
- for ( i = 1; i < GIDX_NDIMS(a); i++ )
- result += (GIDX_GET_MAX(a,i) - GIDX_GET_MIN(a,i));
+ result = GIDX_GET_MAX(a, 0) - GIDX_GET_MIN(a, 0);
+ for (i = 1; i < GIDX_NDIMS(a); i++)
+ result += (GIDX_GET_MAX(a, i) - GIDX_GET_MIN(a, i));
POSTGIS_DEBUGF(5, "calculated edge of %s as %.8g", gidx_to_string(a), result);
return result;
}
/* Ensure the first argument has the higher dimensionality. */
-static void gidx_dimensionality_check(GIDX **a, GIDX **b)
+static void
+gidx_dimensionality_check(GIDX **a, GIDX **b)
{
- if ( GIDX_NDIMS(*a) < GIDX_NDIMS(*b) )
+ if (GIDX_NDIMS(*a) < GIDX_NDIMS(*b))
{
GIDX *tmp = *b;
*b = *a;
}
/* Calculate the volume of the union of the boxes. Avoids creating an intermediate box. */
-static float gidx_union_volume(GIDX *a, GIDX *b)
+static float
+gidx_union_volume(GIDX *a, GIDX *b)
{
float result;
int i;
int ndims_a, ndims_b;
- POSTGIS_DEBUG(5,"entered function");
+ POSTGIS_DEBUG(5, "entered function");
- if ( a == NULL && b == NULL )
+ if (!a && !b)
{
elog(ERROR, "gidx_union_volume received two null arguments");
return 0.0;
}
- if ( a == NULL || gidx_is_unknown(a) )
+ if (!a || gidx_is_unknown(a))
return gidx_volume(b);
- if ( b == NULL || gidx_is_unknown(b) )
+ if (!b || gidx_is_unknown(b))
return gidx_volume(a);
- if ( gidx_is_unknown(a) && gidx_is_unknown(b) )
- {
+ if (gidx_is_unknown(a) && gidx_is_unknown(b))
return 0.0;
- }
/* Ensure 'a' has the most dimensions. */
gidx_dimensionality_check(&a, &b);
ndims_b = GIDX_NDIMS(b);
/* Initialize with maximal length of first dimension. */
- result = Max(GIDX_GET_MAX(a,0),GIDX_GET_MAX(b,0)) - Min(GIDX_GET_MIN(a,0),GIDX_GET_MIN(b,0));
+ result = Max(GIDX_GET_MAX(a, 0), GIDX_GET_MAX(b, 0)) - Min(GIDX_GET_MIN(a, 0), GIDX_GET_MIN(b, 0));
/* Multiply by maximal length of remaining dimensions. */
- for ( i = 1; i < ndims_b; i++ )
- {
- result *= (Max(GIDX_GET_MAX(a,i),GIDX_GET_MAX(b,i)) - Min(GIDX_GET_MIN(a,i),GIDX_GET_MIN(b,i)));
- }
+ for (i = 1; i < ndims_b; i++)
+ result *= (Max(GIDX_GET_MAX(a, i), GIDX_GET_MAX(b, i)) - Min(GIDX_GET_MIN(a, i), GIDX_GET_MIN(b, i)));
/* Add in dimensions of higher dimensional box. */
- for ( i = ndims_b; i < ndims_a; i++ )
- {
- result *= (GIDX_GET_MAX(a,i) - GIDX_GET_MIN(a,i));
- }
+ for (i = ndims_b; i < ndims_a; i++)
+ result *= (GIDX_GET_MAX(a, i) - GIDX_GET_MIN(a, i));
POSTGIS_DEBUGF(5, "volume( %s union %s ) = %.12g", gidx_to_string(a), gidx_to_string(b), result);
}
/* Calculate the edge of the union of the boxes. Avoids creating an intermediate box. */
-static float gidx_union_edge(GIDX *a, GIDX *b)
+static float
+gidx_union_edge(GIDX *a, GIDX *b)
{
float result;
int i;
int ndims_a, ndims_b;
- POSTGIS_DEBUG(5,"entered function");
+ POSTGIS_DEBUG(5, "entered function");
- if ( a == NULL && b == NULL )
+ if (!a && !b)
{
elog(ERROR, "gidx_union_edge received two null arguments");
return 0.0;
}
- if ( a == NULL || gidx_is_unknown(a) )
+ if (!a || gidx_is_unknown(a))
return gidx_volume(b);
- if ( b == NULL || gidx_is_unknown(b) )
+ if (!b || gidx_is_unknown(b))
return gidx_volume(a);
- if ( gidx_is_unknown(a) && gidx_is_unknown(b) )
- {
+ if (gidx_is_unknown(a) && gidx_is_unknown(b))
return 0.0;
- }
/* Ensure 'a' has the most dimensions. */
gidx_dimensionality_check(&a, &b);
ndims_b = GIDX_NDIMS(b);
/* Initialize with maximal length of first dimension. */
- result = Max(GIDX_GET_MAX(a,0),GIDX_GET_MAX(b,0)) - Min(GIDX_GET_MIN(a,0),GIDX_GET_MIN(b,0));
+ result = Max(GIDX_GET_MAX(a, 0), GIDX_GET_MAX(b, 0)) - Min(GIDX_GET_MIN(a, 0), GIDX_GET_MIN(b, 0));
/* Add maximal length of remaining dimensions. */
- for ( i = 1; i < ndims_b; i++ )
- {
- result += (Max(GIDX_GET_MAX(a,i),GIDX_GET_MAX(b,i)) - Min(GIDX_GET_MIN(a,i),GIDX_GET_MIN(b,i)));
- }
+ for (i = 1; i < ndims_b; i++)
+ result += (Max(GIDX_GET_MAX(a, i), GIDX_GET_MAX(b, i)) - Min(GIDX_GET_MIN(a, i), GIDX_GET_MIN(b, i)));
/* Add in dimensions of higher dimensional box. */
- for ( i = ndims_b; i < ndims_a; i++ )
- {
- result += (GIDX_GET_MAX(a,i) - GIDX_GET_MIN(a,i));
- }
+ for (i = ndims_b; i < ndims_a; i++)
+ result += (GIDX_GET_MAX(a, i) - GIDX_GET_MIN(a, i));
POSTGIS_DEBUGF(5, "edge( %s union %s ) = %.12g", gidx_to_string(a), gidx_to_string(b), result);
}
/* Calculate the volume of the intersection of the boxes. */
-static float gidx_inter_volume(GIDX *a, GIDX *b)
+static float
+gidx_inter_volume(GIDX *a, GIDX *b)
{
uint32_t i;
float result;
- POSTGIS_DEBUG(5,"entered function");
+ POSTGIS_DEBUG(5, "entered function");
- if ( a == NULL || b == NULL )
+ if (!a || !b)
{
elog(ERROR, "gidx_inter_volume received a null argument");
return 0.0;
}
- if ( gidx_is_unknown(a) || gidx_is_unknown(b) )
- {
+ if (gidx_is_unknown(a) || gidx_is_unknown(b))
return 0.0;
- }
/* Ensure 'a' has the most dimensions. */
gidx_dimensionality_check(&a, &b);
/* Initialize with minimal length of first dimension. */
- result = Min(GIDX_GET_MAX(a,0),GIDX_GET_MAX(b,0)) - Max(GIDX_GET_MIN(a,0),GIDX_GET_MIN(b,0));
+ result = Min(GIDX_GET_MAX(a, 0), GIDX_GET_MAX(b, 0)) - Max(GIDX_GET_MIN(a, 0), GIDX_GET_MIN(b, 0));
/* If they are disjoint (max < min) then return zero. */
- if ( result < 0.0 ) return 0.0;
+ if (result < 0.0)
+ return 0.0;
/* Continue for remaining dimensions. */
- for ( i = 1; i < GIDX_NDIMS(b); i++ )
+ for (i = 1; i < GIDX_NDIMS(b); i++)
{
- float width = Min(GIDX_GET_MAX(a,i),GIDX_GET_MAX(b,i)) - Max(GIDX_GET_MIN(a,i),GIDX_GET_MIN(b,i));
- if ( width < 0.0 ) return 0.0;
+ float width = Min(GIDX_GET_MAX(a, i), GIDX_GET_MAX(b, i)) - Max(GIDX_GET_MIN(a, i), GIDX_GET_MIN(b, i));
+ if (width < 0.0)
+ return 0.0;
/* Multiply by minimal length of remaining dimensions. */
result *= width;
}
**
** Empty boxes never overlap.
*/
-static bool gidx_overlaps(GIDX *a, GIDX *b)
+bool
+gidx_overlaps(GIDX *a, GIDX *b)
{
- int i;
- int ndims_b;
- POSTGIS_DEBUG(5, "entered function");
+ int i, dims_a, dims_b;
- if ( (a == NULL) || (b == NULL) ) return false;
+ POSTGIS_DEBUG(5, "entered function");
- if ( gidx_is_unknown(a) || gidx_is_unknown(b) )
+ if (!a || !b)
return false;
- /* Ensure 'a' has the most dimensions. */
- gidx_dimensionality_check(&a, &b);
+ if (gidx_is_unknown(a) || gidx_is_unknown(b))
+ return false;
- ndims_b = GIDX_NDIMS(b);
+ dims_a = GIDX_NDIMS(a);
+ dims_b = GIDX_NDIMS(b);
- /* compare only up to dimensions of (b), missing dimensions always overlap */
- for ( i = 0; i < ndims_b; i++ )
+ /* For all shared dimensions min(a) > max(b) and min(b) > max(a)
+ Unshared dimensions do not matter */
+ for (i = 0; i < Min(dims_a, dims_b); i++)
{
- if ( GIDX_GET_MIN(a,i) > GIDX_GET_MAX(b,i) )
- return false;
- if ( GIDX_GET_MIN(b,i) > GIDX_GET_MAX(a,i) )
- return false;
+ /* If the missing dimension was not padded with -+FLT_MAX */
+ if (GIDX_GET_MAX(a, i) != FLT_MAX && GIDX_GET_MAX(b, i) != FLT_MAX)
+ {
+ if (GIDX_GET_MIN(a, i) > GIDX_GET_MAX(b, i))
+ return false;
+ if (GIDX_GET_MIN(b, i) > GIDX_GET_MAX(a, i))
+ return false;
+ }
}
return true;
**
** Box(A) CONTAINS Box(B) IFF (pt(A)LL < pt(B)LL) && (pt(A)UR > pt(B)UR)
*/
-bool gidx_contains(GIDX *a, GIDX *b)
+bool
+gidx_contains(GIDX *a, GIDX *b)
{
- int i, dims_a, dims_b;
+ uint32_t i, dims_a, dims_b;
- POSTGIS_DEBUG(5, "entered function");
-
- if ( (a == NULL) || (b == NULL) ) return false;
+ if (!a || !b)
+ return false;
- if ( gidx_is_unknown(a) || gidx_is_unknown(b) )
+ if (gidx_is_unknown(a) || gidx_is_unknown(b))
return false;
dims_a = GIDX_NDIMS(a);
dims_b = GIDX_NDIMS(b);
- if ( dims_a < dims_b )
+ /* For all shared dimensions min(a) > min(b) and max(a) < max(b)
+ Unshared dimensions do not matter */
+ for (i = 0; i < Min(dims_a, dims_b); i++)
{
- /*
- ** If (b) is of higher dimensionality than (a) it can only be contained
- ** if those higher dimensions are zeroes.
- */
- for (i = dims_a; i < dims_b; i++)
+ /* If the missing dimension was not padded with -+FLT_MAX */
+ if (GIDX_GET_MAX(a, i) != FLT_MAX && GIDX_GET_MAX(b, i) != FLT_MAX)
{
- if ( GIDX_GET_MIN(b,i) != 0 )
+ if (GIDX_GET_MIN(a, i) > GIDX_GET_MIN(b, i))
return false;
- if ( GIDX_GET_MAX(b,i) != 0 )
+ if (GIDX_GET_MAX(a, i) < GIDX_GET_MAX(b, i))
return false;
}
}
- /* Excess dimensions of (a), don't matter, it just has to contain (b) in (b)'s dimensions */
- for (i = 0; i < Min(dims_a, dims_b); i++)
- {
- if ( GIDX_GET_MIN(a,i) > GIDX_GET_MIN(b,i) )
- return false;
- if ( GIDX_GET_MAX(a,i) < GIDX_GET_MAX(b,i) )
- return false;
- }
-
return true;
}
**
** Box(A) EQUALS Box(B) IFF (pt(A)LL == pt(B)LL) && (pt(A)UR == pt(B)UR)
*/
-static bool gidx_equals(GIDX *a, GIDX *b)
+bool
+gidx_equals(GIDX *a, GIDX *b)
{
- uint32_t i;
+ uint32_t i, dims_a, dims_b;
- POSTGIS_DEBUG(5, "entered function");
-
- if ( (a == NULL) && (b == NULL) ) return true;
- if ( (a == NULL) || (b == NULL) ) return false;
+ if (!a && !b)
+ return true;
+ if (!a || !b)
+ return false;
- if ( gidx_is_unknown(a) && gidx_is_unknown(b) )
+ if (gidx_is_unknown(a) && gidx_is_unknown(b))
return true;
- if ( gidx_is_unknown(a) || gidx_is_unknown(b) )
+ if (gidx_is_unknown(a) || gidx_is_unknown(b))
return false;
- /* Ensure 'a' has the most dimensions. */
- gidx_dimensionality_check(&a, &b);
+ dims_a = GIDX_NDIMS(a);
+ dims_b = GIDX_NDIMS(b);
- /* For all shared dimensions min(a) == min(b), max(a) == max(b) */
- for (i = 0; i < GIDX_NDIMS(b); i++)
- {
- if ( GIDX_GET_MIN(a,i) != GIDX_GET_MIN(b,i) )
- return false;
- if ( GIDX_GET_MAX(a,i) != GIDX_GET_MAX(b,i) )
- return false;
- }
- /* For all unshared dimensions min(a) == 0.0, max(a) == 0.0 */
- for (i = GIDX_NDIMS(b); i < GIDX_NDIMS(a); i++)
+ /* For all shared dimensions min(a) == min(b), max(a) == max(b)
+ Unshared dimensions do not matter */
+ for (i = 0; i < Min(dims_a, dims_b); i++)
{
- if ( GIDX_GET_MIN(a,i) != 0.0 )
- return false;
- if ( GIDX_GET_MAX(a,i) != 0.0 )
- return false;
+ /* If the missing dimension was not padded with -+FLT_MAX */
+ if (GIDX_GET_MAX(a, i) != FLT_MAX && GIDX_GET_MAX(b, i) != FLT_MAX)
+ {
+ if (GIDX_GET_MIN(a, i) != GIDX_GET_MIN(b, i))
+ return false;
+ if (GIDX_GET_MAX(a, i) != GIDX_GET_MAX(b, i))
+ return false;
+ }
}
return true;
}
/**
-* Support function. Based on two datums return true if
-* they satisfy the predicate and false otherwise.
-*/
+ * Support function. Based on two datums return true if
+ * they satisfy the predicate and false otherwise.
+ */
static int
gserialized_datum_predicate(Datum gs1, Datum gs2, gidx_predicate predicate)
{
/* Put aside some stack memory and use it for GIDX pointers. */
char boxmem1[GIDX_MAX_SIZE];
char boxmem2[GIDX_MAX_SIZE];
- GIDX *gidx1 = (GIDX*)boxmem1;
- GIDX *gidx2 = (GIDX*)boxmem2;
+ GIDX *gidx1 = (GIDX *)boxmem1;
+ GIDX *gidx2 = (GIDX *)boxmem2;
POSTGIS_DEBUG(3, "entered function");
/* Must be able to build box for each arguement (ie, not empty geometry)
and predicate function to return true. */
- if ( (gserialized_datum_get_gidx_p(gs1, gidx1) == LW_SUCCESS) &&
- (gserialized_datum_get_gidx_p(gs2, gidx2) == LW_SUCCESS) &&
- predicate(gidx1, gidx2) )
+ if ((gserialized_datum_get_gidx_p(gs1, gidx1) == LW_SUCCESS) &&
+ (gserialized_datum_get_gidx_p(gs2, gidx2) == LW_SUCCESS) && predicate(gidx1, gidx2))
{
POSTGIS_DEBUGF(3, "got boxes %s and %s", gidx_to_string(gidx1), gidx_to_string(gidx2));
return LW_TRUE;
return LW_FALSE;
}
-#if POSTGIS_PGSQL_VERSION > 94
static int
gserialized_datum_predicate_gidx_geom(GIDX *gidx1, Datum gs2, gidx_predicate predicate)
{
- /* Put aside some stack memory and use it for GIDX pointers. */
- char boxmem2[GIDX_MAX_SIZE];
- GIDX *gidx2 = (GIDX*)boxmem2;
-
- POSTGIS_DEBUG(3, "entered function");
-
- /* Must be able to build box for gs2 arguement (ie, not empty geometry)
- and predicate function to return true. */
- if ( (gserialized_datum_get_gidx_p(gs2, gidx2) == LW_SUCCESS) &&
- predicate(gidx1, gidx2) )
- {
- POSTGIS_DEBUGF(3, "got boxes %s and %s", gidx_to_string(gidx1), gidx_to_string(gidx2));
- return LW_TRUE;
- }
- return LW_FALSE;
+ /* Put aside some stack memory and use it for GIDX pointers. */
+ char boxmem2[GIDX_MAX_SIZE];
+ GIDX *gidx2 = (GIDX *)boxmem2;
+
+ POSTGIS_DEBUG(3, "entered function");
+
+ /* Must be able to build box for gs2 arguement (ie, not empty geometry)
+ and predicate function to return true. */
+ if ((gserialized_datum_get_gidx_p(gs2, gidx2) == LW_SUCCESS) && predicate(gidx1, gidx2))
+ {
+ POSTGIS_DEBUGF(3, "got boxes %s and %s", gidx_to_string(gidx1), gidx_to_string(gidx2));
+ return LW_TRUE;
+ }
+ return LW_FALSE;
}
static int
gserialized_datum_predicate_geom_gidx(Datum gs1, GIDX *gidx2, gidx_predicate predicate)
{
- /* Put aside some stack memory and use it for GIDX pointers. */
- char boxmem2[GIDX_MAX_SIZE];
- GIDX *gidx1 = (GIDX*)boxmem2;
-
- POSTGIS_DEBUG(3, "entered function");
-
- /* Must be able to build box for gs2 arguement (ie, not empty geometry)
- and predicate function to return true. */
- if ( (gserialized_datum_get_gidx_p(gs1, gidx1) == LW_SUCCESS) &&
- predicate(gidx1, gidx2) )
- {
- POSTGIS_DEBUGF(3, "got boxes %s and %s", gidx_to_string(gidx1), gidx_to_string(gidx2));
- return LW_TRUE;
- }
- return LW_FALSE;
-}
-#endif
+ /* Put aside some stack memory and use it for GIDX pointers. */
+ char boxmem2[GIDX_MAX_SIZE];
+ GIDX *gidx1 = (GIDX *)boxmem2;
+ POSTGIS_DEBUG(3, "entered function");
-/**
-* Calculate the centroid->centroid distance between the boxes.
-*/
-#if POSTGIS_PGSQL_VERSION < 95
-static double gidx_distance_leaf_centroid(const GIDX *a, const GIDX *b)
-{
- int ndims, i;
- double sum = 0;
-
- /* Base computation on least available dimensions */
- ndims = Min(GIDX_NDIMS(b), GIDX_NDIMS(a));
- for ( i = 0; i < ndims; ++i )
- {
- double ca, cb, d;
- double amin = GIDX_GET_MIN(a,i);
- double amax = GIDX_GET_MAX(a,i);
- double bmin = GIDX_GET_MIN(b,i);
- double bmax = GIDX_GET_MAX(b,i);
- ca = amin + ( ( amax - amin ) / 2.0 );
- cb = bmin + ( ( bmax - bmin ) / 2.0 );
- d = ca - cb;
- if ( ! isfinite(d) )
- {
- /* Can happen if a dimension was padded with FLT_MAX,
- * effectively meaning "infinite range". In that case
- * we take that dimension as adding 0 to the total
- * distance.
- */
- continue;
- }
- sum += d * d;
-/*
- POSTGIS_DEBUGF(3, " centroid of A for dimension %d is %g", i, ca);
- POSTGIS_DEBUGF(3, " centroid of B for dimension %d is %g", i, cb);
- POSTGIS_DEBUGF(3, " distance on dimension %d is %g, squared as %g, grows sum to %g", i, d, d*d, sum);
-*/
- }
- return sqrt(sum);
+ /* Must be able to build box for gs2 arguement (ie, not empty geometry)
+ and predicate function to return true. */
+ if ((gserialized_datum_get_gidx_p(gs1, gidx1) == LW_SUCCESS) && predicate(gidx1, gidx2))
+ {
+ POSTGIS_DEBUGF(3, "got boxes %s and %s", gidx_to_string(gidx1), gidx_to_string(gidx2));
+ return LW_TRUE;
+ }
+ return LW_FALSE;
}
-#endif
/**
-* Calculate the box->box distance.
-*/
-static double gidx_distance(const GIDX *a, const GIDX *b, int m_is_time)
-{
- int ndims, i;
- double sum = 0;
-
- /* Base computation on least available dimensions */
- ndims = Min(GIDX_NDIMS(b), GIDX_NDIMS(a));
- for ( i = 0; i < ndims; ++i )
- {
- double d;
- double amin = GIDX_GET_MIN(a,i);
- double amax = GIDX_GET_MAX(a,i);
- double bmin = GIDX_GET_MIN(b,i);
- double bmax = GIDX_GET_MAX(b,i);
- POSTGIS_DEBUGF(3, "A %g - %g", amin, amax);
- POSTGIS_DEBUGF(3, "B %g - %g", bmin, bmax);
-
- if ( ( amin <= bmax && amax >= bmin ) )
- {
- /* overlaps */
- d = 0;
- }
- else if ( i == 4 && m_is_time )
- {
- return FLT_MAX;
- }
- else if ( bmax < amin )
- {
- /* is "left" */
- d = amin - bmax;
- }
- else
- {
- /* is "right" */
- assert( bmin > amax );
- d = bmin - amax;
- }
- if ( ! isfinite(d) )
- {
- /* Can happen if coordinates are corrupted/NaN */
- continue;
- }
- sum += d * d;
- POSTGIS_DEBUGF(3, "dist %g, squared %g, grows sum to %g", d, d*d, sum);
- }
- return sqrt(sum);
-}
-
-#if POSTGIS_PGSQL_VERSION < 95
-static double gidx_distance_node_centroid(const GIDX *node, const GIDX *query)
+ * Calculate the box->box distance.
+ */
+static double
+gidx_distance(const GIDX *a, const GIDX *b, int m_is_time)
{
- int i;
+ int ndims, i;
double sum = 0;
/* Base computation on least available dimensions */
- int ndims = Min(GIDX_NDIMS(node), GIDX_NDIMS(query));
-
- for ( i = 0; i < ndims; ++i )
+ ndims = Min(GIDX_NDIMS(b), GIDX_NDIMS(a));
+ for (i = 0; i < ndims; ++i)
{
double d;
- double amin = GIDX_GET_MIN(query,i);
- double amax = GIDX_GET_MAX(query,i);
- double bmin = GIDX_GET_MIN(node,i);
- double bmax = GIDX_GET_MAX(node,i);
- double ca = amin + ( ( amax - amin ) / 2.0 );
-
- if ( ( ca <= bmax && ca >= bmin ) )
+ double amin = GIDX_GET_MIN(a, i);
+ double amax = GIDX_GET_MAX(a, i);
+ double bmin = GIDX_GET_MIN(b, i);
+ double bmax = GIDX_GET_MAX(b, i);
+ POSTGIS_DEBUGF(3, "A %g - %g", amin, amax);
+ POSTGIS_DEBUGF(3, "B %g - %g", bmin, bmax);
+
+ if ((amin <= bmax && amax >= bmin))
{
/* overlaps */
d = 0;
}
- else if ( bmax < ca )
+ else if (i == 4 && m_is_time)
+ {
+ return FLT_MAX;
+ }
+ else if (bmax < amin)
{
/* is "left" */
- d = ca - bmax;
+ d = amin - bmax;
}
else
{
/* is "right" */
- assert( bmin > ca );
- d = bmin - ca;
+ assert(bmin > amax);
+ d = bmin - amax;
}
- if ( ! isfinite(d) )
+ if (!isfinite(d))
{
/* Can happen if coordinates are corrupted/NaN */
continue;
}
sum += d * d;
- POSTGIS_DEBUGF(3, "dist %g, squared %g, grows sum to %g", d, d*d, sum);
+ POSTGIS_DEBUGF(3, "dist %g, squared %g, grows sum to %g", d, d * d, sum);
}
return sqrt(sum);
}
-#else /* POSTGIS_PGSQL_VERSION >= 95 */
-static double gidx_distance_m(const GIDX *a, const GIDX *b)
+
+static double
+gidx_distance_m(const GIDX *a, const GIDX *b)
{
int mdim_a, mdim_b;
double d, amin, amax, bmin, bmax;
mdim_a = GIDX_NDIMS(a) - 1;
mdim_b = GIDX_NDIMS(b) - 1;
- amin = GIDX_GET_MIN(a,mdim_a);
- amax = GIDX_GET_MAX(a,mdim_a);
- bmin = GIDX_GET_MIN(b,mdim_b);
- bmax = GIDX_GET_MAX(b,mdim_b);
-
- if ( ( amin <= bmax && amax >= bmin ) )
- {
- /* overlaps */
- d = 0;
- }
- else if ( bmax < amin )
- {
- /* is "left" */
- d = amin - bmax;
- }
- else
- {
- /* is "right" */
- assert( bmin > amax );
- d = bmin - amax;
- }
+ amin = GIDX_GET_MIN(a, mdim_a);
+ amax = GIDX_GET_MAX(a, mdim_a);
+ bmin = GIDX_GET_MIN(b, mdim_b);
+ bmax = GIDX_GET_MAX(b, mdim_b);
+
+ if ((amin <= bmax && amax >= bmin))
+ {
+ /* overlaps */
+ d = 0;
+ }
+ else if (bmax < amin)
+ {
+ /* is "left" */
+ d = amin - bmax;
+ }
+ else
+ {
+ /* is "right" */
+ assert(bmin > amax);
+ d = bmin - amax;
+ }
return d;
}
-#endif /* POSTGIS_PGSQL_VERSION >= 96 */
/**
-* Return a #GSERIALIZED with an expanded bounding box.
-*/
-GSERIALIZED*
+ * Return a #GSERIALIZED with an expanded bounding box.
+ */
+GSERIALIZED *
gserialized_expand(GSERIALIZED *g, double distance)
{
char boxmem[GIDX_MAX_SIZE];
- GIDX *gidx = (GIDX*)boxmem;
+ GIDX *gidx = (GIDX *)boxmem;
float fdistance = (float)distance;
/* Get our bounding box out of the geography, return right away if
input is an EMPTY geometry. */
- if ( gserialized_get_gidx_p(g, gidx) == LW_FAILURE )
- {
+ if (gserialized_get_gidx_p(g, gidx) == LW_FAILURE)
return g;
- }
gidx_expand(gidx, fdistance);
}
/***********************************************************************
-* GiST N-D Index Operator Functions
-*/
+ * GiST N-D Index Operator Functions
+ */
/*
-* Do centroid to centroid n-d distance if you don't have
-* re-check available (PgSQL 9.5+), do "real" n-d distance
-* if you do
-*/
+ * do "real" n-d distance
+ */
PG_FUNCTION_INFO_V1(gserialized_distance_nd);
Datum gserialized_distance_nd(PG_FUNCTION_ARGS)
{
char b1mem[GIDX_MAX_SIZE];
- GIDX *b1 = (GIDX*)b1mem;
+ GIDX *b1 = (GIDX *)b1mem;
char b2mem[GIDX_MAX_SIZE];
- GIDX *b2 = (GIDX*)b2mem;
-
-#if POSTGIS_PGSQL_VERSION < 95
-
- /* Centroid-to-centroid distance */
- Datum gs1 = PG_GETARG_DATUM(0);
- Datum gs2 = PG_GETARG_DATUM(1);
- double box_distance = FLT_MAX;
-
- /* Must be able to build box for each argument (ie, not empty geometry). */
- if ( (gserialized_datum_get_gidx_p(gs1, b1) == LW_SUCCESS) &&
- (gserialized_datum_get_gidx_p(gs2, b2) == LW_SUCCESS) )
- {
- box_distance = gidx_distance_leaf_centroid(b1, b2);
- POSTGIS_DEBUGF(3, "got boxes %s and %s", gidx_to_string(b1), gidx_to_string(b2));
- }
- PG_RETURN_FLOAT8(box_distance);
-
-#else /* POSTGIS_PGSQL_VERSION >= 96 */
+ GIDX *b2 = (GIDX *)b2mem;
/* Feature-to-feature distance */
GSERIALIZED *geom1 = PG_GETARG_GSERIALIZED_P(0);
LWGEOM *closest;
double distance;
-
/* Find an exact shortest line w/ the dimensions we support */
- if ( lwgeom_has_z(lw1) && lwgeom_has_z(lw2) )
+ if (lwgeom_has_z(lw1) && lwgeom_has_z(lw2))
{
closest = lwgeom_closest_line_3d(lw1, lw2);
distance = lwgeom_length(closest);
distance = lwgeom_length_2d(closest);
}
- /* Un-sqrt the distance so we can add extra terms */
- distance = distance*distance;
-
/* Can only add the M term if both objects have M */
- if ( lwgeom_has_m(lw1) && lwgeom_has_m(lw2) )
+ if (lwgeom_has_m(lw1) && lwgeom_has_m(lw2))
{
double m1, m2;
int usebox = false;
+ /* Un-sqrt the distance so we can add extra terms */
+ distance = distance * distance;
- if ( lwgeom_get_type(lw1) == POINTTYPE )
+ if (lwgeom_get_type(lw1) == POINTTYPE)
{
POINT4D p;
- lwpoint_getPoint4d_p((LWPOINT*)lw1, &p);
+ lwpoint_getPoint4d_p((LWPOINT *)lw1, &p);
m1 = p.m;
}
- else if ( lwgeom_get_type(lw1) == LINETYPE )
+ else if (lwgeom_get_type(lw1) == LINETYPE)
{
LWPOINT *lwp1 = lwline_get_lwpoint(lwgeom_as_lwline(closest), 0);
m1 = lwgeom_interpolate_point(lw1, lwp1);
lwpoint_free(lwp1);
}
else
- {
usebox = true;
- }
- if ( lwgeom_get_type(lw2) == POINTTYPE )
+ if (lwgeom_get_type(lw2) == POINTTYPE)
{
POINT4D p;
- lwpoint_getPoint4d_p((LWPOINT*)lw2, &p);
+ lwpoint_getPoint4d_p((LWPOINT *)lw2, &p);
m2 = p.m;
}
- else if ( lwgeom_get_type(lw2) == LINETYPE )
+ else if (lwgeom_get_type(lw2) == LINETYPE)
{
LWPOINT *lwp2 = lwline_get_lwpoint(lwgeom_as_lwline(closest), 1);
m2 = lwgeom_interpolate_point(lw2, lwp2);
lwpoint_free(lwp2);
}
else
- {
usebox = true;
- }
- if ( usebox )
+ if (usebox)
{
double d;
gserialized_get_gidx_p(geom1, b1);
gserialized_get_gidx_p(geom2, b2);
d = gidx_distance_m(b1, b2);
- distance += d*d;
+ distance += d * d;
}
else
- {
- distance += (m2-m1)*(m2-m1);
- }
+ distance += (m2 - m1) * (m2 - m1);
+
+ distance = sqrt(distance);
}
lwgeom_free(closest);
PG_FREE_IF_COPY(geom1, 0);
PG_FREE_IF_COPY(geom2, 1);
- PG_RETURN_FLOAT8(sqrt(distance));
-#endif /* POSTGIS_PGSQL_VERSION >= 96 */
+ PG_RETURN_FLOAT8(distance);
}
/*
-** '~' and operator function. Based on two serialized return true if
+** '~~' and operator function. Based on two serialized return true if
** the first is contained by the second.
*/
PG_FUNCTION_INFO_V1(gserialized_within);
Datum gserialized_within(PG_FUNCTION_ARGS)
{
- if ( gserialized_datum_predicate(PG_GETARG_DATUM(1), PG_GETARG_DATUM(0), gidx_contains) == LW_TRUE )
- {
+ if (gserialized_datum_predicate(PG_GETARG_DATUM(1), PG_GETARG_DATUM(0), gidx_contains))
PG_RETURN_BOOL(true);
- }
PG_RETURN_BOOL(false);
}
#if POSTGIS_PGSQL_VERSION > 94
/*
-** '~' and operator function. Based on a GIDX and a serialized return true if
+** '~~' and operator function. Based on a GIDX and a serialized return true if
** the first is contained by the second.
*/
PG_FUNCTION_INFO_V1(gserialized_gidx_geom_within);
Datum gserialized_gidx_geom_within(PG_FUNCTION_ARGS)
{
- GIDX *gidx = (GIDX *)PG_GETARG_POINTER(0);
+ GIDX *gidx = (GIDX *)PG_GETARG_POINTER(0);
- if ( gserialized_datum_predicate_geom_gidx(PG_GETARG_DATUM(1), gidx, gidx_contains) == LW_TRUE )
- PG_RETURN_BOOL(true);
+ if (gserialized_datum_predicate_geom_gidx(PG_GETARG_DATUM(1), gidx, gidx_contains))
+ PG_RETURN_BOOL(true);
- PG_RETURN_BOOL(false);
+ PG_RETURN_BOOL(false);
}
/*
-** '~' and operator function. Based on two GIDX return true if
+** '~~' and operator function. Based on two GIDX return true if
** the first is contained by the second.
*/
PG_FUNCTION_INFO_V1(gserialized_gidx_gidx_within);
Datum gserialized_gidx_gidx_within(PG_FUNCTION_ARGS)
{
- if ( gidx_contains((GIDX *)PG_GETARG_POINTER(1), (GIDX *)PG_GETARG_POINTER(0)))
- PG_RETURN_BOOL(true);
+ if (gidx_contains((GIDX *)PG_GETARG_POINTER(1), (GIDX *)PG_GETARG_POINTER(0)))
+ PG_RETURN_BOOL(true);
- PG_RETURN_BOOL(false);
+ PG_RETURN_BOOL(false);
}
#endif
/*
-** '@' and operator function. Based on two serialized return true if
+** '@@' and operator function. Based on two serialized return true if
** the first contains the second.
*/
PG_FUNCTION_INFO_V1(gserialized_contains);
Datum gserialized_contains(PG_FUNCTION_ARGS)
{
- if ( gserialized_datum_predicate(PG_GETARG_DATUM(0),PG_GETARG_DATUM(1), gidx_contains) == LW_TRUE )
- {
+ if (gserialized_datum_predicate(PG_GETARG_DATUM(0), PG_GETARG_DATUM(1), gidx_contains))
PG_RETURN_BOOL(true);
- }
PG_RETURN_BOOL(false);
}
-#if POSTGIS_PGSQL_VERSION > 94
/*
-** '@' and operator function. Based on a GIDX and a serialized return true if
+** '@@' and operator function. Based on a GIDX and a serialized return true if
** the first contains the second.
*/
PG_FUNCTION_INFO_V1(gserialized_gidx_geom_contains);
Datum gserialized_gidx_geom_contains(PG_FUNCTION_ARGS)
{
- GIDX *gidx = (GIDX *)PG_GETARG_POINTER(0);
+ GIDX *gidx = (GIDX *)PG_GETARG_POINTER(0);
- if ( gserialized_datum_predicate_gidx_geom(gidx, PG_GETARG_DATUM(1), gidx_contains) == LW_TRUE )
- PG_RETURN_BOOL(true);
+ if (gserialized_datum_predicate_gidx_geom(gidx, PG_GETARG_DATUM(1), gidx_contains))
+ PG_RETURN_BOOL(true);
- PG_RETURN_BOOL(false);
+ PG_RETURN_BOOL(false);
}
/*
-** '@' and operator function. Based on two GIDX return true if
+** '@@' and operator function. Based on two GIDX return true if
** the first contains the second.
*/
PG_FUNCTION_INFO_V1(gserialized_gidx_gidx_contains);
Datum gserialized_gidx_gidx_contains(PG_FUNCTION_ARGS)
{
- if ( gidx_contains((GIDX *)PG_GETARG_POINTER(0), (GIDX *)PG_GETARG_POINTER(1)))
- PG_RETURN_BOOL(true);
+ if (gidx_contains((GIDX *)PG_GETARG_POINTER(0), (GIDX *)PG_GETARG_POINTER(1)))
+ PG_RETURN_BOOL(true);
- PG_RETURN_BOOL(false);
+ PG_RETURN_BOOL(false);
+}
+
+/*
+** '~=' and operator function. Based on two serialized return true if
+** the first equals the second.
+*/
+PG_FUNCTION_INFO_V1(gserialized_same);
+Datum gserialized_same(PG_FUNCTION_ARGS)
+{
+ if (gserialized_datum_predicate(PG_GETARG_DATUM(0), PG_GETARG_DATUM(1), gidx_equals))
+ PG_RETURN_BOOL(true);
+
+ PG_RETURN_BOOL(false);
}
PG_FUNCTION_INFO_V1(gserialized_gidx_geom_same);
Datum gserialized_gidx_geom_same(PG_FUNCTION_ARGS)
{
- GIDX *gidx = (GIDX *)PG_GETARG_POINTER(0);
+ GIDX *gidx = (GIDX *)PG_GETARG_POINTER(0);
- if ( gserialized_datum_predicate_gidx_geom(gidx, PG_GETARG_DATUM(1), gidx_equals) == LW_TRUE )
- PG_RETURN_BOOL(true);
+ if (gserialized_datum_predicate_gidx_geom(gidx, PG_GETARG_DATUM(1), gidx_equals))
+ PG_RETURN_BOOL(true);
- PG_RETURN_BOOL(false);
+ PG_RETURN_BOOL(false);
}
+/*
+** '~=' and operator function. Based on two GIDX return true if
+** the first equals the second.
+*/
PG_FUNCTION_INFO_V1(gserialized_gidx_gidx_same);
Datum gserialized_gidx_gidx_same(PG_FUNCTION_ARGS)
{
- if ( gidx_equals((GIDX *)PG_GETARG_POINTER(0), (GIDX *)PG_GETARG_POINTER(1)) )
- PG_RETURN_BOOL(true);
+ if (gidx_equals((GIDX *)PG_GETARG_POINTER(0), (GIDX *)PG_GETARG_POINTER(1)))
+ PG_RETURN_BOOL(true);
- PG_RETURN_BOOL(false);
+ PG_RETURN_BOOL(false);
}
-#endif
/*
-** '&&' operator function. Based on two serialized return true if
+** '&&&' operator function. Based on two serialized return true if
** they overlap and false otherwise.
*/
PG_FUNCTION_INFO_V1(gserialized_overlaps);
Datum gserialized_overlaps(PG_FUNCTION_ARGS)
{
- if ( gserialized_datum_predicate(PG_GETARG_DATUM(0),PG_GETARG_DATUM(1), gidx_overlaps) == LW_TRUE )
- {
+ if (gserialized_datum_predicate(PG_GETARG_DATUM(0), PG_GETARG_DATUM(1), gidx_overlaps))
PG_RETURN_BOOL(true);
- }
PG_RETURN_BOOL(false);
}
-#if POSTGIS_PGSQL_VERSION > 94
/*
* This is the cross-operator for the geographies
*/
PG_FUNCTION_INFO_V1(gserialized_gidx_geog_overlaps);
Datum gserialized_gidx_geog_overlaps(PG_FUNCTION_ARGS)
{
- GIDX *gidx = (GIDX *)PG_GETARG_POINTER(0);
+ GIDX *gidx = (GIDX *)PG_GETARG_POINTER(0);
- if ( gserialized_datum_predicate_gidx_geom(gidx, PG_GETARG_DATUM(1), gidx_overlaps) == LW_TRUE )
- PG_RETURN_BOOL(true);
+ if (gserialized_datum_predicate_gidx_geom(gidx, PG_GETARG_DATUM(1), gidx_overlaps))
+ PG_RETURN_BOOL(true);
- PG_RETURN_BOOL(false);
+ PG_RETURN_BOOL(false);
}
PG_FUNCTION_INFO_V1(gserialized_gidx_geom_overlaps);
Datum gserialized_gidx_geom_overlaps(PG_FUNCTION_ARGS)
{
- GIDX *gidx = (GIDX *)PG_GETARG_POINTER(0);
+ GIDX *gidx = (GIDX *)PG_GETARG_POINTER(0);
- if ( gserialized_datum_predicate_gidx_geom(gidx, PG_GETARG_DATUM(1), gidx_overlaps) == LW_TRUE )
- PG_RETURN_BOOL(true);
+ if (gserialized_datum_predicate_gidx_geom(gidx, PG_GETARG_DATUM(1), gidx_overlaps))
+ PG_RETURN_BOOL(true);
- PG_RETURN_BOOL(false);
+ PG_RETURN_BOOL(false);
}
PG_FUNCTION_INFO_V1(gserialized_gidx_gidx_overlaps);
Datum gserialized_gidx_gidx_overlaps(PG_FUNCTION_ARGS)
{
- if ( gidx_overlaps((GIDX *)PG_GETARG_POINTER(0), (GIDX *)PG_GETARG_POINTER(1)) )
- PG_RETURN_BOOL(true);
+ if (gidx_overlaps((GIDX *)PG_GETARG_POINTER(0), (GIDX *)PG_GETARG_POINTER(1)))
+ PG_RETURN_BOOL(true);
- PG_RETURN_BOOL(false);
+ PG_RETURN_BOOL(false);
}
-#endif
/***********************************************************************
-* GiST Index Support Functions
-*/
+ * GiST Index Support Functions
+ */
/*
** GiST support function. Given a geography, return a "compressed"
PG_FUNCTION_INFO_V1(gserialized_gist_compress);
Datum gserialized_gist_compress(PG_FUNCTION_ARGS)
{
- GISTENTRY *entry_in = (GISTENTRY*)PG_GETARG_POINTER(0);
+ GISTENTRY *entry_in = (GISTENTRY *)PG_GETARG_POINTER(0);
GISTENTRY *entry_out = NULL;
char gidxmem[GIDX_MAX_SIZE];
- GIDX *bbox_out = (GIDX*)gidxmem;
+ GIDX *bbox_out = (GIDX *)gidxmem;
int result = LW_SUCCESS;
uint32_t i;
** Not a leaf key? There's nothing to do.
** Return the input unchanged.
*/
- if ( ! entry_in->leafkey )
+ if (!entry_in->leafkey)
{
POSTGIS_DEBUG(4, "[GIST] non-leafkey entry, returning input unaltered");
PG_RETURN_POINTER(entry_in);
** Null key? Make a copy of the input entry and
** return.
*/
- if ( DatumGetPointer(entry_in->key) == NULL )
+ if (!DatumGetPointer(entry_in->key))
{
POSTGIS_DEBUG(4, "[GIST] leafkey is null");
- gistentryinit(*entry_out, (Datum) 0, entry_in->rel,
- entry_in->page, entry_in->offset, false);
+ gistentryinit(*entry_out, (Datum)0, entry_in->rel, entry_in->page, entry_in->offset, false);
POSTGIS_DEBUG(4, "[GIST] returning copy of input");
PG_RETURN_POINTER(entry_out);
}
/* Is the bounding box valid (non-empty, non-infinite) ?
* If not, use the "unknown" GIDX. */
- if ( result == LW_FAILURE )
+ if (result == LW_FAILURE)
{
POSTGIS_DEBUG(4, "[GIST] empty geometry!");
gidx_set_unknown(bbox_out);
- gistentryinit(*entry_out, PointerGetDatum(gidx_copy(bbox_out)),
- entry_in->rel, entry_in->page,
- entry_in->offset, false);
+ gistentryinit(*entry_out,
+ PointerGetDatum(gidx_copy(bbox_out)),
+ entry_in->rel,
+ entry_in->page,
+ entry_in->offset,
+ false);
PG_RETURN_POINTER(entry_out);
}
POSTGIS_DEBUGF(4, "[GIST] got entry_in->key: %s", gidx_to_string(bbox_out));
+ /* ORIGINAL VERSION */
/* Check all the dimensions for finite values.
* If not, use the "unknown" GIDX as a key */
- for ( i = 0; i < GIDX_NDIMS(bbox_out); i++ )
+ for (i = 0; i < GIDX_NDIMS(bbox_out); i++)
{
- if ( ! isfinite(GIDX_GET_MAX(bbox_out, i))
- || ! isfinite(GIDX_GET_MIN(bbox_out, i)) )
+ if (!isfinite(GIDX_GET_MAX(bbox_out, i)) || !isfinite(GIDX_GET_MIN(bbox_out, i)))
{
gidx_set_unknown(bbox_out);
gistentryinit(*entry_out,
- PointerGetDatum(gidx_copy(bbox_out)),
- entry_in->rel, entry_in->page,
- entry_in->offset, false);
+ PointerGetDatum(gidx_copy(bbox_out)),
+ entry_in->rel,
+ entry_in->page,
+ entry_in->offset,
+ false);
PG_RETURN_POINTER(entry_out);
}
}
- /* Enure bounding box has minimums below maximums. */
+ /* Ensure bounding box has minimums below maximums. */
gidx_validate(bbox_out);
/* Prepare GISTENTRY for return. */
- gistentryinit(*entry_out, PointerGetDatum(gidx_copy(bbox_out)),
- entry_in->rel, entry_in->page, entry_in->offset, false);
+ gistentryinit(
+ *entry_out, PointerGetDatum(gidx_copy(bbox_out)), entry_in->rel, entry_in->page, entry_in->offset, false);
/* Return GISTENTRY. */
POSTGIS_DEBUG(4, "[GIST] 'compress' function complete");
/*
** GiST support function. Called from gserialized_gist_consistent below.
*/
-static inline bool gserialized_gist_consistent_leaf(GIDX *key, GIDX *query, StrategyNumber strategy)
+static inline bool
+gserialized_gist_consistent_leaf(GIDX *key, GIDX *query, StrategyNumber strategy)
{
bool retval;
- POSTGIS_DEBUGF(4, "[GIST] leaf consistent, strategy [%d], count[%i]",
- strategy, geog_counter_leaf++);
+ POSTGIS_DEBUGF(4, "[GIST] leaf consistent, strategy [%d], count[%i]", strategy, geog_counter_leaf++);
switch (strategy)
{
case RTOverlapStrategyNumber:
- retval = (bool) gidx_overlaps(key, query);
+ retval = (bool)gidx_overlaps(key, query);
break;
case RTSameStrategyNumber:
- retval = (bool) gidx_equals(key, query);
+ retval = (bool)gidx_equals(key, query);
break;
case RTContainsStrategyNumber:
case RTOldContainsStrategyNumber:
- retval = (bool) gidx_contains(key, query);
+ retval = (bool)gidx_contains(key, query);
break;
case RTContainedByStrategyNumber:
case RTOldContainedByStrategyNumber:
- retval = (bool) gidx_contains(query, key);
+ retval = (bool)gidx_contains(query, key);
break;
default:
retval = false;
/*
** GiST support function. Called from gserialized_gist_consistent below.
*/
-static inline bool gserialized_gist_consistent_internal(GIDX *key, GIDX *query, StrategyNumber strategy)
+static inline bool
+gserialized_gist_consistent_internal(GIDX *key, GIDX *query, StrategyNumber strategy)
{
- bool retval;
+ bool retval;
- POSTGIS_DEBUGF(4, "[GIST] internal consistent, strategy [%d], count[%i], query[%s], key[%s]",
- strategy, geog_counter_internal++, gidx_to_string(query), gidx_to_string(key) );
+ POSTGIS_DEBUGF(4,
+ "[GIST] internal consistent, strategy [%d], count[%i], query[%s], key[%s]",
+ strategy,
+ geog_counter_internal++,
+ gidx_to_string(query),
+ gidx_to_string(key));
switch (strategy)
{
case RTOverlapStrategyNumber:
- retval = (bool) gidx_overlaps(key, query);
+ case RTContainedByStrategyNumber:
+ case RTOldContainedByStrategyNumber:
+ retval = (bool)gidx_overlaps(key, query);
break;
case RTSameStrategyNumber:
case RTContainsStrategyNumber:
case RTOldContainsStrategyNumber:
- retval = (bool) gidx_contains(key, query);
- break;
- case RTContainedByStrategyNumber:
- case RTOldContainedByStrategyNumber:
- retval = (bool) gidx_overlaps(key, query);
+ retval = (bool)gidx_contains(key, query);
break;
default:
retval = false;
PG_FUNCTION_INFO_V1(gserialized_gist_consistent);
Datum gserialized_gist_consistent(PG_FUNCTION_ARGS)
{
- GISTENTRY *entry = (GISTENTRY*) PG_GETARG_POINTER(0);
- StrategyNumber strategy = (StrategyNumber) PG_GETARG_UINT16(2);
+ GISTENTRY *entry = (GISTENTRY *)PG_GETARG_POINTER(0);
+ StrategyNumber strategy = (StrategyNumber)PG_GETARG_UINT16(2);
bool result;
char gidxmem[GIDX_MAX_SIZE];
- GIDX *query_gbox_index = (GIDX*)gidxmem;
+ GIDX *query_gbox_index = (GIDX *)gidxmem;
/* PostgreSQL 8.4 and later require the RECHECK flag to be set here,
rather than being supplied as part of the operator class definition */
- bool *recheck = (bool *) PG_GETARG_POINTER(4);
+ bool *recheck = (bool *)PG_GETARG_POINTER(4);
/* We set recheck to false to avoid repeatedly pulling every "possibly matched" geometry
out during index scans. For cases when the geometries are large, rechecking
POSTGIS_DEBUG(4, "[GIST] 'consistent' function called");
/* Quick sanity check on query argument. */
- if ( DatumGetPointer(PG_GETARG_DATUM(1)) == NULL )
+ if (!DatumGetPointer(PG_GETARG_DATUM(1)))
{
POSTGIS_DEBUG(4, "[GIST] null query pointer (!?!), returning false");
PG_RETURN_BOOL(false); /* NULL query! This is screwy! */
}
/* Quick sanity check on entry key. */
- if ( DatumGetPointer(entry->key) == NULL )
+ if (!DatumGetPointer(entry->key))
{
POSTGIS_DEBUG(4, "[GIST] null index entry, returning false");
PG_RETURN_BOOL(false); /* NULL entry! */
}
/* Null box should never make this far. */
- if ( gserialized_datum_get_gidx_p(PG_GETARG_DATUM(1), query_gbox_index) == LW_FAILURE )
+ if (gserialized_datum_get_gidx_p(PG_GETARG_DATUM(1), query_gbox_index) == LW_FAILURE)
{
POSTGIS_DEBUG(4, "[GIST] null query_gbox_index!");
PG_RETURN_BOOL(false);
/* Treat leaf node tests different from internal nodes */
if (GIST_LEAF(entry))
{
- result = gserialized_gist_consistent_leaf(
- (GIDX*)DatumGetPointer(entry->key),
- query_gbox_index, strategy);
+ result =
+ gserialized_gist_consistent_leaf((GIDX *)DatumGetPointer(entry->key), query_gbox_index, strategy);
}
else
{
result = gserialized_gist_consistent_internal(
- (GIDX*)DatumGetPointer(entry->key),
- query_gbox_index, strategy);
+ (GIDX *)DatumGetPointer(entry->key), query_gbox_index, strategy);
}
PG_RETURN_BOOL(result);
** greater than float b, integer A with same bit representation as a is greater
** than integer B with same bits as b.
*/
-static float pack_float(const float value, const int realm)
+static float
+pack_float(const float value, const int realm)
{
- union {
- float f;
- struct { unsigned value:31, sign:1; } vbits;
- struct { unsigned value:29, realm:2, sign:1; } rbits;
- } a;
+ union {
+ float f;
+ struct
+ {
+ unsigned value : 31, sign : 1;
+ } vbits;
+ struct
+ {
+ unsigned value : 29, realm : 2, sign : 1;
+ } rbits;
+ } a;
- a.f = value;
- a.rbits.value = a.vbits.value >> 2;
- a.rbits.realm = realm;
+ a.f = value;
+ a.rbits.value = a.vbits.value >> 2;
+ a.rbits.realm = realm;
- return a.f;
+ return a.f;
}
/*
PG_FUNCTION_INFO_V1(gserialized_gist_penalty);
Datum gserialized_gist_penalty(PG_FUNCTION_ARGS)
{
- GISTENTRY *origentry = (GISTENTRY*) PG_GETARG_POINTER(0);
- GISTENTRY *newentry = (GISTENTRY*) PG_GETARG_POINTER(1);
- float *result = (float*) PG_GETARG_POINTER(2);
+ GISTENTRY *origentry = (GISTENTRY *)PG_GETARG_POINTER(0);
+ GISTENTRY *newentry = (GISTENTRY *)PG_GETARG_POINTER(1);
+ float *result = (float *)PG_GETARG_POINTER(2);
GIDX *gbox_index_orig, *gbox_index_new;
float size_union, size_orig, edge_union, edge_orig;
POSTGIS_DEBUG(4, "[GIST] 'penalty' function called");
- gbox_index_orig = (GIDX*)DatumGetPointer(origentry->key);
- gbox_index_new = (GIDX*)DatumGetPointer(newentry->key);
+ gbox_index_orig = (GIDX *)DatumGetPointer(origentry->key);
+ gbox_index_new = (GIDX *)DatumGetPointer(newentry->key);
/* Drop out if we're dealing with null inputs. Shouldn't happen. */
- if ( (gbox_index_orig == NULL) && (gbox_index_new == NULL) )
+ if (!gbox_index_orig && !gbox_index_new)
{
POSTGIS_DEBUG(4, "[GIST] both inputs NULL! returning penalty of zero");
*result = 0.0;
*result = size_union - size_orig;
/* REALM 0: No extension is required, volume is zero, return edge */
- /* REALM 1: No extension is required, return nonzero area */
- /* REALM 2: Area extension is zero, return nonzero edge extension */
- /* REALM 3: Area extension is nonzero, return it */
+ /* REALM 1: No extension is required, return nonzero area */
+ /* REALM 2: Area extension is zero, return nonzero edge extension */
+ /* REALM 3: Area extension is nonzero, return it */
- if( *result == 0 )
- {
+ if (*result == 0)
+ {
if (size_orig > 0)
- {
*result = pack_float(size_orig, 1); /* REALM 1 */
- }
else
{
edge_union = gidx_union_edge(gbox_index_orig, gbox_index_new);
edge_orig = gidx_edge(gbox_index_orig);
- *result = edge_union - edge_orig;
- if( *result == 0 )
- {
- *result = pack_float(edge_orig, 0); /* REALM 0 */
- }
- else
- {
- *result = pack_float(*result, 2); /* REALM 2 */
- }
+ *result = edge_union - edge_orig;
+ if (*result == 0)
+ *result = pack_float(edge_orig, 0); /* REALM 0 */
+ else
+ *result = pack_float(*result, 2); /* REALM 2 */
}
- }
- else
- {
- *result = pack_float(*result, 3); /* REALM 3 */
- }
+ }
+ else
+ *result = pack_float(*result, 3); /* REALM 3 */
- POSTGIS_DEBUGF(4, "[GIST] union size (%.12f), original size (%.12f), penalty (%.12f)", size_union, size_orig, *result);
+ POSTGIS_DEBUGF(
+ 4, "[GIST] union size (%.12f), original size (%.12f), penalty (%.12f)", size_union, size_orig, *result);
PG_RETURN_POINTER(result);
}
PG_FUNCTION_INFO_V1(gserialized_gist_union);
Datum gserialized_gist_union(PG_FUNCTION_ARGS)
{
- GistEntryVector *entryvec = (GistEntryVector *) PG_GETARG_POINTER(0);
- int *sizep = (int *) PG_GETARG_POINTER(1); /* Size of the return value */
- int numranges, i;
+ GistEntryVector *entryvec = (GistEntryVector *)PG_GETARG_POINTER(0);
+ int *sizep = (int *)PG_GETARG_POINTER(1); /* Size of the return value */
+ int numranges, i;
GIDX *box_cur, *box_union;
POSTGIS_DEBUG(4, "[GIST] 'union' function called");
numranges = entryvec->n;
- box_cur = (GIDX*) DatumGetPointer(entryvec->vector[0].key);
+ box_cur = (GIDX *)DatumGetPointer(entryvec->vector[0].key);
box_union = gidx_copy(box_cur);
- for ( i = 1; i < numranges; i++ )
+ for (i = 1; i < numranges; i++)
{
- box_cur = (GIDX*) DatumGetPointer(entryvec->vector[i].key);
+ box_cur = (GIDX *)DatumGetPointer(entryvec->vector[i].key);
gidx_merge(&box_union, box_cur);
}
POSTGIS_DEBUGF(4, "[GIST] union called, numranges(%i), pageunion %s", numranges, gidx_to_string(box_union));
PG_RETURN_POINTER(box_union);
-
}
/*
PG_FUNCTION_INFO_V1(gserialized_gist_same);
Datum gserialized_gist_same(PG_FUNCTION_ARGS)
{
- GIDX *b1 = (GIDX*)PG_GETARG_POINTER(0);
- GIDX *b2 = (GIDX*)PG_GETARG_POINTER(1);
- bool *result = (bool*)PG_GETARG_POINTER(2);
+ GIDX *b1 = (GIDX *)PG_GETARG_POINTER(0);
+ GIDX *b2 = (GIDX *)PG_GETARG_POINTER(1);
+ bool *result = (bool *)PG_GETARG_POINTER(2);
POSTGIS_DEBUG(4, "[GIST] 'same' function called");
PG_RETURN_POINTER(result);
}
-
-
-
PG_FUNCTION_INFO_V1(gserialized_gist_geog_distance);
Datum gserialized_gist_geog_distance(PG_FUNCTION_ARGS)
{
- GISTENTRY *entry = (GISTENTRY*) PG_GETARG_POINTER(0);
+ GISTENTRY *entry = (GISTENTRY *)PG_GETARG_POINTER(0);
Datum query_datum = PG_GETARG_DATUM(1);
- StrategyNumber strategy = (StrategyNumber) PG_GETARG_UINT16(2);
-#if POSTGIS_PGSQL_VERSION >= 95
- bool *recheck = (bool *) PG_GETARG_POINTER(4);
-#endif
+ StrategyNumber strategy = (StrategyNumber)PG_GETARG_UINT16(2);
+ bool *recheck = (bool *)PG_GETARG_POINTER(4);
char query_box_mem[GIDX_MAX_SIZE];
- GIDX *query_box = (GIDX*)query_box_mem;
+ GIDX *query_box = (GIDX *)query_box_mem;
GIDX *entry_box;
double distance;
POSTGIS_DEBUGF(3, "[GIST] '%s' function called", __func__);
/* We are using '13' as the gist geography distance <-> strategy number */
- if ( strategy != 13 )
+ if (strategy != 13)
{
elog(ERROR, "unrecognized strategy number: %d", strategy);
PG_RETURN_FLOAT8(FLT_MAX);
}
/* Null box should never make this far. */
- if ( gserialized_datum_get_gidx_p(query_datum, query_box) == LW_FAILURE )
+ if (gserialized_datum_get_gidx_p(query_datum, query_box) == LW_FAILURE)
{
POSTGIS_DEBUG(2, "[GIST] null query_gbox_index!");
PG_RETURN_FLOAT8(FLT_MAX);
}
-#if POSTGIS_PGSQL_VERSION >= 95
/* When we hit leaf nodes, it's time to turn on recheck */
if (GIST_LEAF(entry))
- {
*recheck = true;
- }
-#endif
/* Get the entry box */
- entry_box = (GIDX*)DatumGetPointer(entry->key);
+ entry_box = (GIDX *)DatumGetPointer(entry->key);
/* Return distances from key-based tests should always be */
/* the minimum possible distance, box-to-box */
PG_RETURN_FLOAT8(distance);
}
-
/*
** GiST support function.
** Take in a query and an entry and return the "distance" between them.
PG_FUNCTION_INFO_V1(gserialized_gist_distance);
Datum gserialized_gist_distance(PG_FUNCTION_ARGS)
{
- GISTENTRY *entry = (GISTENTRY*) PG_GETARG_POINTER(0);
- StrategyNumber strategy = (StrategyNumber) PG_GETARG_UINT16(2);
+ GISTENTRY *entry = (GISTENTRY *)PG_GETARG_POINTER(0);
+ StrategyNumber strategy = (StrategyNumber)PG_GETARG_UINT16(2);
char query_box_mem[GIDX_MAX_SIZE];
- GIDX *query_box = (GIDX*)query_box_mem;
+ GIDX *query_box = (GIDX *)query_box_mem;
GIDX *entry_box;
-#if POSTGIS_PGSQL_VERSION >= 95
- bool *recheck = (bool *) PG_GETARG_POINTER(4);
-#endif
+ bool *recheck = (bool *)PG_GETARG_POINTER(4);
double distance;
/* Strategy 13 is <<->> */
/* Strategy 20 is |=| */
- if ( strategy != 13 && strategy != 20 ) {
+ if (strategy != 13 && strategy != 20)
+ {
elog(ERROR, "unrecognized strategy number: %d", strategy);
PG_RETURN_FLOAT8(FLT_MAX);
}
/* Null box should never make this far. */
- if ( gserialized_datum_get_gidx_p(PG_GETARG_DATUM(1), query_box) == LW_FAILURE )
+ if (gserialized_datum_get_gidx_p(PG_GETARG_DATUM(1), query_box) == LW_FAILURE)
{
POSTGIS_DEBUG(4, "[GIST] null query_gbox_index!");
PG_RETURN_FLOAT8(FLT_MAX);
}
/* Get the entry box */
- entry_box = (GIDX*)DatumGetPointer(entry->key);
-
-#if POSTGIS_PGSQL_VERSION >= 95
+ entry_box = (GIDX *)DatumGetPointer(entry->key);
/* Strategy 20 is |=| */
distance = gidx_distance(entry_box, query_box, strategy == 20);
/* Treat leaf node tests different from internal nodes */
if (GIST_LEAF(entry))
*recheck = true;
-#else
- if ( strategy == 20 )
- {
- elog(ERROR, "You need PostgreSQL 9.5.0 or higher in order to use |=| with index");
- PG_RETURN_FLOAT8(FLT_MAX);
- }
-
- /* Treat leaf node tests different from internal nodes */
- if (GIST_LEAF(entry))
- {
- /* Calculate distance to leaves */
- distance = (double)gidx_distance_leaf_centroid(entry_box, query_box);
- }
- else
- {
- /* Calculate distance for internal nodes */
- distance = (double)gidx_distance_node_centroid(entry_box, query_box);
- }
-#endif
PG_RETURN_FLOAT8(distance);
}
-
/*
** Utility function to add entries to the axis partition lists in the
** picksplit function.
*/
-static void gserialized_gist_picksplit_addlist(OffsetNumber *list, GIDX **box_union, GIDX *box_current, int *pos, int num)
+static void
+gserialized_gist_picksplit_addlist(OffsetNumber *list, GIDX **box_union, GIDX *box_current, int *pos, int num)
{
- if ( *pos )
- gidx_merge(box_union, box_current);
+ if (*pos)
+ gidx_merge(box_union, box_current);
else
- memcpy((void*)(*box_union), (void*)box_current, VARSIZE(box_current));
+ memcpy((void *)(*box_union), (void *)box_current, VARSIZE(box_current));
list[*pos] = num;
(*pos)++;
}
** Utility function check whether the number of entries two halves of the
** space constitute a "bad ratio" (poor balance).
*/
-static int gserialized_gist_picksplit_badratio(int x, int y)
+static int
+gserialized_gist_picksplit_badratio(int x, int y)
{
POSTGIS_DEBUGF(4, "[GIST] checking split ratio (%d, %d)", x, y);
- if ( (y == 0) || (((float)x / (float)y) < LIMIT_RATIO) ||
- (x == 0) || (((float)y / (float)x) < LIMIT_RATIO) )
+ if ((y == 0) || (((float)x / (float)y) < LIMIT_RATIO) || (x == 0) || (((float)y / (float)x) < LIMIT_RATIO))
return true;
return false;
}
-static bool gserialized_gist_picksplit_badratios(int *pos, int dims)
+static bool
+gserialized_gist_picksplit_badratios(int *pos, int dims)
{
int i;
- for ( i = 0; i < dims; i++ )
+ for (i = 0; i < dims; i++)
{
- if ( gserialized_gist_picksplit_badratio(pos[2*i],pos[2*i+1]) == false )
+ if (gserialized_gist_picksplit_badratio(pos[2 * i], pos[2 * i + 1]) == false)
return false;
}
return true;
}
-
/*
** Where the picksplit algorithm cannot find any basis for splitting one way
** or another, we simply split the overflowing node in half.
*/
-static void gserialized_gist_picksplit_fallback(GistEntryVector *entryvec, GIST_SPLITVEC *v)
+static void
+gserialized_gist_picksplit_fallback(GistEntryVector *entryvec, GIST_SPLITVEC *v)
{
OffsetNumber i, maxoff;
GIDX *unionL = NULL;
maxoff = entryvec->n - 1;
nbytes = (maxoff + 2) * sizeof(OffsetNumber);
- v->spl_left = (OffsetNumber*) palloc(nbytes);
- v->spl_right = (OffsetNumber*) palloc(nbytes);
+ v->spl_left = (OffsetNumber *)palloc(nbytes);
+ v->spl_right = (OffsetNumber *)palloc(nbytes);
v->spl_nleft = v->spl_nright = 0;
for (i = FirstOffsetNumber; i <= maxoff; i = OffsetNumberNext(i))
{
- GIDX *cur = (GIDX*)DatumGetPointer(entryvec->vector[i].key);
+ GIDX *cur = (GIDX *)DatumGetPointer(entryvec->vector[i].key);
if (i <= (maxoff - FirstOffsetNumber + 1) / 2)
{
v->spl_left[v->spl_nleft] = i;
- if (unionL == NULL)
- {
+ if (!unionL)
unionL = gidx_copy(cur);
- }
else
- {
gidx_merge(&unionL, cur);
- }
v->spl_nleft++;
}
else
{
v->spl_right[v->spl_nright] = i;
- if (unionR == NULL)
- {
+ if (!unionR)
unionR = gidx_copy(cur);
- }
else
- {
gidx_merge(&unionR, cur);
- }
v->spl_nright++;
}
}
if (v->spl_ldatum_exists)
- gidx_merge(&unionL, (GIDX*)DatumGetPointer(v->spl_ldatum));
+ gidx_merge(&unionL, (GIDX *)DatumGetPointer(v->spl_ldatum));
v->spl_ldatum = PointerGetDatum(unionL);
if (v->spl_rdatum_exists)
- gidx_merge(&unionR, (GIDX*)DatumGetPointer(v->spl_rdatum));
+ gidx_merge(&unionR, (GIDX *)DatumGetPointer(v->spl_rdatum));
v->spl_rdatum = PointerGetDatum(unionR);
v->spl_ldatum_exists = v->spl_rdatum_exists = false;
}
-
-
-static void gserialized_gist_picksplit_constructsplit(GIST_SPLITVEC *v, OffsetNumber *list1, int nlist1, GIDX **union1, OffsetNumber *list2, int nlist2, GIDX **union2)
+static void
+gserialized_gist_picksplit_constructsplit(GIST_SPLITVEC *v,
+ OffsetNumber *list1,
+ int nlist1,
+ GIDX **union1,
+ OffsetNumber *list2,
+ int nlist2,
+ GIDX **union2)
{
- bool firstToLeft = true;
+ bool firstToLeft = true;
POSTGIS_DEBUG(4, "[GIST] picksplit in constructsplit function");
GIDX *RLr = gidx_copy(*union1);
double sizeLR, sizeRL;
- gidx_merge(&LRl, (GIDX*)DatumGetPointer(v->spl_ldatum));
- gidx_merge(&LRr, (GIDX*)DatumGetPointer(v->spl_rdatum));
- gidx_merge(&RLl, (GIDX*)DatumGetPointer(v->spl_ldatum));
- gidx_merge(&RLr, (GIDX*)DatumGetPointer(v->spl_rdatum));
+ gidx_merge(&LRl, (GIDX *)DatumGetPointer(v->spl_ldatum));
+ gidx_merge(&LRr, (GIDX *)DatumGetPointer(v->spl_rdatum));
+ gidx_merge(&RLl, (GIDX *)DatumGetPointer(v->spl_ldatum));
+ gidx_merge(&RLr, (GIDX *)DatumGetPointer(v->spl_rdatum));
- sizeLR = gidx_inter_volume(LRl,LRr);
- sizeRL = gidx_inter_volume(RLl,RLr);
+ sizeLR = gidx_inter_volume(LRl, LRr);
+ sizeRL = gidx_inter_volume(RLl, RLr);
POSTGIS_DEBUGF(4, "[GIST] sizeLR / sizeRL == %.12g / %.12g", sizeLR, sizeRL);
if (sizeLR > sizeRL)
firstToLeft = false;
-
}
else
{
float p1, p2;
- GISTENTRY oldUnion, addon;
+ GISTENTRY oldUnion, addon;
- gistentryinit(oldUnion, (v->spl_ldatum_exists) ? v->spl_ldatum : v->spl_rdatum,
- NULL, NULL, InvalidOffsetNumber, false);
+ gistentryinit(oldUnion,
+ (v->spl_ldatum_exists) ? v->spl_ldatum : v->spl_rdatum,
+ NULL,
+ NULL,
+ InvalidOffsetNumber,
+ false);
gistentryinit(addon, PointerGetDatum(*union1), NULL, NULL, InvalidOffsetNumber, false);
- DirectFunctionCall3(gserialized_gist_penalty, PointerGetDatum(&oldUnion), PointerGetDatum(&addon), PointerGetDatum(&p1));
+ DirectFunctionCall3(gserialized_gist_penalty,
+ PointerGetDatum(&oldUnion),
+ PointerGetDatum(&addon),
+ PointerGetDatum(&p1));
gistentryinit(addon, PointerGetDatum(*union2), NULL, NULL, InvalidOffsetNumber, false);
- DirectFunctionCall3(gserialized_gist_penalty, PointerGetDatum(&oldUnion), PointerGetDatum(&addon), PointerGetDatum(&p2));
+ DirectFunctionCall3(gserialized_gist_penalty,
+ PointerGetDatum(&oldUnion),
+ PointerGetDatum(&addon),
+ PointerGetDatum(&p2));
POSTGIS_DEBUGF(4, "[GIST] p1 / p2 == %.12g / %.12g", p1, p2);
v->spl_nleft = nlist1;
v->spl_nright = nlist2;
if (v->spl_ldatum_exists)
- gidx_merge(union1, (GIDX*)DatumGetPointer(v->spl_ldatum));
+ gidx_merge(union1, (GIDX *)DatumGetPointer(v->spl_ldatum));
v->spl_ldatum = PointerGetDatum(*union1);
if (v->spl_rdatum_exists)
- gidx_merge(union2, (GIDX*)DatumGetPointer(v->spl_rdatum));
+ gidx_merge(union2, (GIDX *)DatumGetPointer(v->spl_rdatum));
v->spl_rdatum = PointerGetDatum(*union2);
}
else
v->spl_nleft = nlist2;
v->spl_nright = nlist1;
if (v->spl_ldatum_exists)
- gidx_merge(union2, (GIDX*)DatumGetPointer(v->spl_ldatum));
+ gidx_merge(union2, (GIDX *)DatumGetPointer(v->spl_ldatum));
v->spl_ldatum = PointerGetDatum(*union2);
if (v->spl_rdatum_exists)
- gidx_merge(union1, (GIDX*)DatumGetPointer(v->spl_rdatum));
+ gidx_merge(union1, (GIDX *)DatumGetPointer(v->spl_rdatum));
v->spl_rdatum = PointerGetDatum(*union1);
}
v->spl_ldatum_exists = v->spl_rdatum_exists = false;
}
-
-#define BELOW(d) (2*(d))
-#define ABOVE(d) ((2*(d))+1)
+#define BELOW(d) (2 * (d))
+#define ABOVE(d) ((2 * (d)) + 1)
/*
** GiST support function. Split an overflowing node into two new nodes.
Datum gserialized_gist_picksplit(PG_FUNCTION_ARGS)
{
- GistEntryVector *entryvec = (GistEntryVector*) PG_GETARG_POINTER(0);
+ GistEntryVector *entryvec = (GistEntryVector *)PG_GETARG_POINTER(0);
- GIST_SPLITVEC *v = (GIST_SPLITVEC*) PG_GETARG_POINTER(1);
+ GIST_SPLITVEC *v = (GIST_SPLITVEC *)PG_GETARG_POINTER(1);
OffsetNumber i;
/* One union box for each half of the space. */
GIDX **box_union;
*/
max_offset = entryvec->n - 1;
- box_current = (GIDX*) DatumGetPointer(entryvec->vector[FirstOffsetNumber].key);
+ box_current = (GIDX *)DatumGetPointer(entryvec->vector[FirstOffsetNumber].key);
box_pageunion = gidx_copy(box_current);
/* Calculate the containing box (box_pageunion) for the whole page we are going to split. */
- for ( i = OffsetNumberNext(FirstOffsetNumber); i <= max_offset; i = OffsetNumberNext(i) )
+ for (i = OffsetNumberNext(FirstOffsetNumber); i <= max_offset; i = OffsetNumberNext(i))
{
- box_current = (GIDX*) DatumGetPointer(entryvec->vector[i].key);
+ box_current = (GIDX *)DatumGetPointer(entryvec->vector[i].key);
- if ( all_entries_equal == true && ! gidx_equals (box_pageunion, box_current) )
+ if (all_entries_equal && !gidx_equals(box_pageunion, box_current))
all_entries_equal = false;
- gidx_merge( &box_pageunion, box_current );
+ gidx_merge(&box_pageunion, box_current);
}
POSTGIS_DEBUGF(3, "[GIST] box_pageunion: %s", gidx_to_string(box_pageunion));
/* Every box in the page is the same! So, we split and just put half the boxes in each child. */
- if ( all_entries_equal )
+ if (all_entries_equal)
{
POSTGIS_DEBUG(4, "[GIST] picksplit finds all entries equal!");
gserialized_gist_picksplit_fallback(entryvec, v);
nbytes = (max_offset + 2) * sizeof(OffsetNumber);
ndims_pageunion = GIDX_NDIMS(box_pageunion);
POSTGIS_DEBUGF(4, "[GIST] ndims_pageunion == %d", ndims_pageunion);
- pos = palloc(2*ndims_pageunion * sizeof(int));
- list = palloc(2*ndims_pageunion * sizeof(OffsetNumber*));
- box_union = palloc(2*ndims_pageunion * sizeof(GIDX*));
- for ( d = 0; d < ndims_pageunion; d++ )
+ pos = palloc(2 * ndims_pageunion * sizeof(int));
+ list = palloc(2 * ndims_pageunion * sizeof(OffsetNumber *));
+ box_union = palloc(2 * ndims_pageunion * sizeof(GIDX *));
+ for (d = 0; d < ndims_pageunion; d++)
{
- list[BELOW(d)] = (OffsetNumber*) palloc(nbytes);
- list[ABOVE(d)] = (OffsetNumber*) palloc(nbytes);
+ list[BELOW(d)] = (OffsetNumber *)palloc(nbytes);
+ list[ABOVE(d)] = (OffsetNumber *)palloc(nbytes);
box_union[BELOW(d)] = gidx_new(ndims_pageunion);
box_union[ABOVE(d)] = gidx_new(ndims_pageunion);
pos[BELOW(d)] = 0;
** Each entry thereby ends up in three of the six partitions.
*/
POSTGIS_DEBUG(4, "[GIST] 'picksplit' calculating best split axis");
- for ( i = FirstOffsetNumber; i <= max_offset; i = OffsetNumberNext(i) )
+ for (i = FirstOffsetNumber; i <= max_offset; i = OffsetNumberNext(i))
{
- box_current = (GIDX*) DatumGetPointer(entryvec->vector[i].key);
+ box_current = (GIDX *)DatumGetPointer(entryvec->vector[i].key);
- for ( d = 0; d < ndims_pageunion; d++ )
+ for (d = 0; d < ndims_pageunion; d++)
{
- if ( GIDX_GET_MIN(box_current,d)-GIDX_GET_MIN(box_pageunion,d) < GIDX_GET_MAX(box_pageunion,d)-GIDX_GET_MAX(box_current,d) )
- {
- gserialized_gist_picksplit_addlist(list[BELOW(d)], &(box_union[BELOW(d)]), box_current, &(pos[BELOW(d)]), i);
- }
+ if (GIDX_GET_MIN(box_current, d) - GIDX_GET_MIN(box_pageunion, d) <
+ GIDX_GET_MAX(box_pageunion, d) - GIDX_GET_MAX(box_current, d))
+ gserialized_gist_picksplit_addlist(
+ list[BELOW(d)], &(box_union[BELOW(d)]), box_current, &(pos[BELOW(d)]), i);
else
- {
- gserialized_gist_picksplit_addlist(list[ABOVE(d)], &(box_union[ABOVE(d)]), box_current, &(pos[ABOVE(d)]), i);
- }
-
+ gserialized_gist_picksplit_addlist(
+ list[ABOVE(d)], &(box_union[ABOVE(d)]), box_current, &(pos[ABOVE(d)]), i);
}
-
}
/*
** sides of the page union box can occasionally all end up in one place, leading
** to this condition.
*/
- if ( gserialized_gist_picksplit_badratios(pos,ndims_pageunion) == true )
+ if (gserialized_gist_picksplit_badratios(pos, ndims_pageunion) == true)
{
/*
** Instead we split on center points and see if we do better.
*/
double *avgCenter = palloc(ndims_pageunion * sizeof(double));
- for ( d = 0; d < ndims_pageunion; d++ )
- {
+ for (d = 0; d < ndims_pageunion; d++)
avgCenter[d] = 0.0;
- }
POSTGIS_DEBUG(4, "[GIST] picksplit can't find good split axis, trying center point method");
- for ( i = FirstOffsetNumber; i <= max_offset; i = OffsetNumberNext(i) )
+ for (i = FirstOffsetNumber; i <= max_offset; i = OffsetNumberNext(i))
{
- box_current = (GIDX*) DatumGetPointer(entryvec->vector[i].key);
- for ( d = 0; d < ndims_pageunion; d++ )
- {
- avgCenter[d] += (GIDX_GET_MAX(box_current,d) + GIDX_GET_MIN(box_current,d)) / 2.0;
- }
+ box_current = (GIDX *)DatumGetPointer(entryvec->vector[i].key);
+ for (d = 0; d < ndims_pageunion; d++)
+ avgCenter[d] += (GIDX_GET_MAX(box_current, d) + GIDX_GET_MIN(box_current, d)) / 2.0;
}
- for ( d = 0; d < ndims_pageunion; d++ )
+ for (d = 0; d < ndims_pageunion; d++)
{
avgCenter[d] /= max_offset;
pos[BELOW(d)] = pos[ABOVE(d)] = 0; /* Re-initialize our counters. */
}
/* For each of our entries... */
- for ( i = FirstOffsetNumber; i <= max_offset; i = OffsetNumberNext(i) )
+ for (i = FirstOffsetNumber; i <= max_offset; i = OffsetNumberNext(i))
{
double center;
- box_current = (GIDX*) DatumGetPointer(entryvec->vector[i].key);
+ box_current = (GIDX *)DatumGetPointer(entryvec->vector[i].key);
- for ( d = 0; d < ndims_pageunion; d++ )
+ for (d = 0; d < ndims_pageunion; d++)
{
- center = (GIDX_GET_MIN(box_current,d)+GIDX_GET_MAX(box_current,d))/2.0;
- if ( center < avgCenter[d] )
- gserialized_gist_picksplit_addlist(list[BELOW(d)], &(box_union[BELOW(d)]), box_current, &(pos[BELOW(d)]), i);
- else if ( FPeq(center, avgCenter[d]) )
- if ( pos[BELOW(d)] > pos[ABOVE(d)] )
- gserialized_gist_picksplit_addlist(list[ABOVE(d)], &(box_union[ABOVE(d)]), box_current, &(pos[ABOVE(d)]), i);
+ center = (GIDX_GET_MIN(box_current, d) + GIDX_GET_MAX(box_current, d)) / 2.0;
+ if (center < avgCenter[d])
+ gserialized_gist_picksplit_addlist(
+ list[BELOW(d)], &(box_union[BELOW(d)]), box_current, &(pos[BELOW(d)]), i);
+ else if (FPeq(center, avgCenter[d]))
+ if (pos[BELOW(d)] > pos[ABOVE(d)])
+ gserialized_gist_picksplit_addlist(list[ABOVE(d)],
+ &(box_union[ABOVE(d)]),
+ box_current,
+ &(pos[ABOVE(d)]),
+ i);
else
- gserialized_gist_picksplit_addlist(list[BELOW(d)], &(box_union[BELOW(d)]), box_current, &(pos[BELOW(d)]), i);
+ gserialized_gist_picksplit_addlist(list[BELOW(d)],
+ &(box_union[BELOW(d)]),
+ box_current,
+ &(pos[BELOW(d)]),
+ i);
else
- gserialized_gist_picksplit_addlist(list[ABOVE(d)], &(box_union[ABOVE(d)]), box_current, &(pos[ABOVE(d)]), i);
+ gserialized_gist_picksplit_addlist(
+ list[ABOVE(d)], &(box_union[ABOVE(d)]), box_current, &(pos[ABOVE(d)]), i);
}
-
}
/* Do we have a good disposition now? If not, screw it, just cut the node in half. */
- if ( gserialized_gist_picksplit_badratios(pos,ndims_pageunion) == true )
+ if (gserialized_gist_picksplit_badratios(pos, ndims_pageunion))
{
- POSTGIS_DEBUG(4, "[GIST] picksplit still cannot find a good split! just cutting the node in half");
+ POSTGIS_DEBUG(4,
+ "[GIST] picksplit still cannot find a good split! just cutting the node in half");
gserialized_gist_picksplit_fallback(entryvec, v);
PG_RETURN_POINTER(v);
}
-
}
/*
** number of entries in its regions is the most evenly distributed.
** TODO: what if the distributions are equal in two or more axes?
*/
- for ( d = 0; d < ndims_pageunion; d++ )
+ for (d = 0; d < ndims_pageunion; d++)
{
- int posd = Max(pos[ABOVE(d)],pos[BELOW(d)]);
- if ( posd < posmin )
+ int posd = Max(pos[ABOVE(d)], pos[BELOW(d)]);
+ if (posd < posmin)
{
direction = d;
posmin = posd;
}
}
- if ( direction == -1 || posmin == entryvec->n )
- {
- /* ERROR OUT HERE */
+ if (direction == -1 || posmin == entryvec->n)
elog(ERROR, "Error in building split, unable to determine split direction.");
- }
POSTGIS_DEBUGF(3, "[GIST] 'picksplit' splitting on axis %d", direction);
- gserialized_gist_picksplit_constructsplit(v, list[BELOW(direction)],
- pos[BELOW(direction)],
- &(box_union[BELOW(direction)]),
- list[ABOVE(direction)],
- pos[ABOVE(direction)],
- &(box_union[ABOVE(direction)]) );
-
- POSTGIS_DEBUGF(4, "[GIST] spl_ldatum: %s", gidx_to_string((GIDX*)v->spl_ldatum));
- POSTGIS_DEBUGF(4, "[GIST] spl_rdatum: %s", gidx_to_string((GIDX*)v->spl_rdatum));
-
- POSTGIS_DEBUGF(4, "[GIST] axis %d: parent range (%.12g, %.12g) left range (%.12g, %.12g), right range (%.12g, %.12g)",
- direction,
- GIDX_GET_MIN(box_pageunion, direction), GIDX_GET_MAX(box_pageunion, direction),
- GIDX_GET_MIN((GIDX*)v->spl_ldatum, direction), GIDX_GET_MAX((GIDX*)v->spl_ldatum, direction),
- GIDX_GET_MIN((GIDX*)v->spl_rdatum, direction), GIDX_GET_MAX((GIDX*)v->spl_rdatum, direction) );
+ gserialized_gist_picksplit_constructsplit(v,
+ list[BELOW(direction)],
+ pos[BELOW(direction)],
+ &(box_union[BELOW(direction)]),
+ list[ABOVE(direction)],
+ pos[ABOVE(direction)],
+ &(box_union[ABOVE(direction)]));
+
+ POSTGIS_DEBUGF(4, "[GIST] spl_ldatum: %s", gidx_to_string((GIDX *)v->spl_ldatum));
+ POSTGIS_DEBUGF(4, "[GIST] spl_rdatum: %s", gidx_to_string((GIDX *)v->spl_rdatum));
+
+ POSTGIS_DEBUGF(
+ 4,
+ "[GIST] axis %d: parent range (%.12g, %.12g) left range (%.12g, %.12g), right range (%.12g, %.12g)",
+ direction,
+ GIDX_GET_MIN(box_pageunion, direction),
+ GIDX_GET_MAX(box_pageunion, direction),
+ GIDX_GET_MIN((GIDX *)v->spl_ldatum, direction),
+ GIDX_GET_MAX((GIDX *)v->spl_ldatum, direction),
+ GIDX_GET_MIN((GIDX *)v->spl_rdatum, direction),
+ GIDX_GET_MAX((GIDX *)v->spl_rdatum, direction));
PG_RETURN_POINTER(v);
-
}
/*
PG_FUNCTION_INFO_V1(gidx_in);
Datum gidx_in(PG_FUNCTION_ARGS)
{
- ereport(ERROR,(errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
- errmsg("function gidx_in not implemented")));
+ ereport(ERROR, (errcode(ERRCODE_FEATURE_NOT_SUPPORTED), errmsg("function gidx_in not implemented")));
PG_RETURN_POINTER(NULL);
}
PG_FUNCTION_INFO_V1(gidx_out);
Datum gidx_out(PG_FUNCTION_ARGS)
{
- GIDX *box = (GIDX *) PG_GETARG_POINTER(0);
- char *result = gidx_to_string(box);
- PG_RETURN_CSTRING(result);
+ GIDX *box = (GIDX *)PG_GETARG_POINTER(0);
+ char *result = gidx_to_string(box);
+ PG_RETURN_CSTRING(result);
}
projects / postgis / commitdiff