PostGIS  2.5.7dev-r@@SVN_REVISION@@

◆ tree_inter()

static int tree_inter ( const char *  wkt1,
const char *  wkt2 
)
static

Definition at line 402 of file cu_measures.c.

403 {
404  LWGEOM *g1 = lwgeom_from_wkt(wkt1, LW_PARSER_CHECK_NONE);
405  LWGEOM *g2 = lwgeom_from_wkt(wkt2, LW_PARSER_CHECK_NONE);
406  RECT_NODE *t1 = rect_tree_from_lwgeom(g1);
407  RECT_NODE *t2 = rect_tree_from_lwgeom(g2);
408  int result = rect_tree_intersects_tree(t1, t2);
409  rect_tree_free(t1);
410  rect_tree_free(t2);
411  lwgeom_free(g1);
412  lwgeom_free(g2);
413  return result;
414 }
lwgeom_free
void lwgeom_free(LWGEOM *geom)
Definition: lwgeom.c:1144
LW_PARSER_CHECK_NONE
#define LW_PARSER_CHECK_NONE
Definition: liblwgeom.h:2005
lwgeom_from_wkt
LWGEOM * lwgeom_from_wkt(const char *wkt, const char check)
Definition: lwin_wkt.c:904
rect_tree_from_lwgeom
RECT_NODE * rect_tree_from_lwgeom(const LWGEOM *lwgeom)
Create a tree index on top an LWGEOM.
Definition: lwtree.c:861
rect_tree_free
void rect_tree_free(RECT_NODE *node)
Recurse from top of node tree and free all children.
Definition: lwtree.c:69
rect_tree_intersects_tree
int rect_tree_intersects_tree(RECT_NODE *n1, RECT_NODE *n2)
Test if two RECT_NODE trees intersect one another.
Definition: lwtree.c:990
rect_node
Definition: lwtree.h:66

References LW_PARSER_CHECK_NONE, lwgeom_free(), lwgeom_from_wkt(), rect_tree_free(), rect_tree_from_lwgeom(), and rect_tree_intersects_tree().

Referenced by test_rect_tree_intersects_tree().

Here is the call graph for this function:
Here is the caller graph for this function: