PostGIS  2.1.10dev-r@@SVN_REVISION@@
lwtree.h
Go to the documentation of this file.
1 
4 typedef struct rect_node
5 {
6  double xmin;
7  double xmax;
8  double ymin;
9  double ymax;
14 } RECT_NODE;
15 
16 int rect_tree_contains_point(const RECT_NODE *tree, const POINT2D *pt, int *on_boundary);
17 int rect_tree_intersects_tree(const RECT_NODE *tree1, const RECT_NODE *tree2);
18 void rect_tree_free(RECT_NODE *node);
19 RECT_NODE* rect_node_leaf_new(const POINTARRAY *pa, int i);
struct rect_node * right_node
Definition: lwtree.h:11
int rect_tree_intersects_tree(const RECT_NODE *tree1, const RECT_NODE *tree2)
Definition: lwtree.c:55
int rect_tree_contains_point(const RECT_NODE *tree, const POINT2D *pt, int *on_boundary)
Definition: lwtree.c:34
POINT2D * p1
Definition: lwtree.h:12
RECT_NODE * rect_tree_new(const POINTARRAY *pa)
Build a tree of nodes from a point array, one node per edge, and each with an associated measure rang...
Definition: lwtree.c:151
POINT2D * p2
Definition: lwtree.h:13
double xmax
Definition: lwtree.h:7
double ymax
Definition: lwtree.h:9
struct rect_node RECT_NODE
Note that p1 and p2 are pointers into an independent POINTARRAY, do not free them.
Note that p1 and p2 are pointers into an independent POINTARRAY, do not free them.
Definition: lwtree.h:4
RECT_NODE * rect_node_leaf_new(const POINTARRAY *pa, int i)
Create a new leaf node, calculating a measure value for each point on the edge and storing pointers b...
Definition: lwtree.c:104
double xmin
Definition: lwtree.h:6
double ymin
Definition: lwtree.h:8
void rect_tree_free(RECT_NODE *node)
Recurse from top of node tree and free all children.
Definition: lwtree.c:18
RECT_NODE * rect_node_internal_new(RECT_NODE *left_node, RECT_NODE *right_node)
Create a new internal node, calculating the new measure range for the node, and storing pointers to t...
Definition: lwtree.c:132
struct rect_node * left_node
Definition: lwtree.h:10