lwtree.h File Reference
This graph shows which files directly or indirectly include this file:
Go to the source code of this file.
Data Structures | |
| struct | RECT_NODE_LEAF |
| struct | RECT_NODE_INTERNAL |
| struct | rect_node |
| struct | rect_tree_distance_state |
Macros | |
| #define | RECT_NODE_SIZE 8 |
Typedefs | |
| typedef struct rect_node | RECT_NODE |
| typedef struct rect_tree_distance_state | RECT_TREE_DISTANCE_STATE |
Enumerations | |
| enum | RECT_NODE_TYPE { RECT_NODE_INTERNAL_TYPE , RECT_NODE_LEAF_TYPE } |
| enum | RECT_NODE_RING_TYPE { RECT_NODE_RING_NONE = 0 , RECT_NODE_RING_EXTERIOR , RECT_NODE_RING_INTERIOR } |
| enum | RECT_NODE_SEG_TYPE { RECT_NODE_SEG_UNKNOWN = 0 , RECT_NODE_SEG_POINT , RECT_NODE_SEG_LINEAR , RECT_NODE_SEG_CIRCULAR } |
Functions | |
| RECT_NODE * | rect_tree_from_lwgeom (const LWGEOM *geom) |
| Create a tree index on top an LWGEOM. More... | |
| int | rect_tree_intersects_tree (RECT_NODE *tree1, RECT_NODE *tree2) |
| Test if two RECT_NODE trees intersect one another. More... | |
| double | rect_tree_distance_tree (RECT_NODE *n1, RECT_NODE *n2, double threshold) |
| Return the distance between two RECT_NODE trees. More... | |
| void | rect_tree_free (RECT_NODE *node) |
| Free the rect-tree memory. More... | |
| int | rect_tree_contains_point (RECT_NODE *tree, const POINT2D *pt) |
| RECT_NODE * | rect_tree_from_ptarray (const POINTARRAY *pa, int geom_type) |
| LWGEOM * | rect_tree_to_lwgeom (const RECT_NODE *tree) |
| char * | rect_tree_to_wkt (const RECT_NODE *node) |
| void | rect_tree_printf (const RECT_NODE *node, int depth) |
