
Go to the source code of this file.
Data Structures | |
| struct | Rect |
| struct | Branch |
| struct | Node |
| struct | ListNode |
Defines | |
| #define | PGSIZE 512 |
| #define | NUMDIMS 3 |
| #define | NDEBUG |
| #define | TRUE 1 |
| #define | FALSE 0 |
| #define | NUMSIDES 2*NUMDIMS |
| #define | MAXCARD (int)((PGSIZE-(2*sizeof(int))) / sizeof(struct Branch)) |
Typedefs | |
| typedef double | RectReal |
| typedef int(* | SearchHitCallback )(int id, void *arg) |
Functions | |
| int | RTreeSearch (struct Node *, struct Rect *, SearchHitCallback, void *) |
| int | RTreeInsertRect (struct Rect *, int, struct Node **, int depth) |
| int | RTreeDeleteRect (struct Rect *, int, struct Node **) |
| struct Node * | RTreeNewIndex (void) |
| struct Node * | RTreeNewNode (void) |
| void | RTreeInitNode (struct Node *) |
| void | RTreeFreeNode (struct Node *) |
| void | RTreeDestroyNode (struct Node *) |
| void | RTreePrintNode (struct Node *, int) |
| void | RTreeTabIn (int) |
| struct Rect | RTreeNodeCover (struct Node *) |
| void | RTreeInitRect (struct Rect *) |
| struct Rect | RTreeNullRect (void) |
| RectReal | RTreeRectArea (struct Rect *) |
| RectReal | RTreeRectSphericalVolume (struct Rect *R) |
| RectReal | RTreeRectVolume (struct Rect *R) |
| struct Rect | RTreeCombineRect (struct Rect *, struct Rect *) |
| int | RTreeOverlap (struct Rect *, struct Rect *) |
| void | RTreePrintRect (struct Rect *, int) |
| int | RTreeAddBranch (struct Branch *, struct Node *, struct Node **) |
| int | RTreePickBranch (struct Rect *, struct Node *) |
| void | RTreeDisconnectBranch (struct Node *, int) |
| void | RTreeSplitNode (struct Node *, struct Branch *, struct Node **) |
| int | RTreeSetNodeMax (int) |
| int | RTreeSetLeafMax (int) |
| int | RTreeGetNodeMax (void) |
| int | RTreeGetLeafMax (void) |
| #define FALSE 0 |
Definition at line 35 of file index.h.
Referenced by dig_init_portable(), RTreeContained(), RTreeOverlap(), Vect_cat_in_array(), Vect_cat_in_cat_list(), and Vect_read_dblinks().
| #define MAXCARD (int)((PGSIZE-(2*sizeof(int))) / sizeof(struct Branch)) |
| #define NUMDIMS 3 |
| #define NUMSIDES 2*NUMDIMS |
| #define TRUE 1 |
Definition at line 32 of file index.h.
Referenced by dig_init_portable(), RTreeContained(), RTreeOverlap(), Vect_cat_in_array(), and Vect_cat_in_cat_list().
| typedef int(* SearchHitCallback)(int id, void *arg) |
Definition at line 273 of file index.c.
References Node::branch, Branch::child, Node::level, MAXKIDS, ListNode::next, ListNode::node, Branch::rect, RTreeFreeNode(), and RTreeInsertRect().
| void RTreeDestroyNode | ( | struct Node * | ) |
Definition at line 221 of file node.c.
Referenced by dig_spidx_free_areas(), dig_spidx_free_isles(), dig_spidx_free_lines(), dig_spidx_free_nodes(), RTreeDestroyNode(), Vect_break_polygons(), Vect_line_check_intersection(), Vect_line_intersection(), Vect_snap_lines(), and Vect_spatial_index_destroy().
| void RTreeFreeNode | ( | struct Node * | ) |
| void RTreeInitNode | ( | struct Node * | ) |
| void RTreeInitRect | ( | struct Rect * | ) |
Definition at line 142 of file index.c.
References Rect::boundary, Branch::child, Node::level, NUMDIMS, Branch::rect, RTreeAddBranch(), RTreeNewNode(), and RTreeNodeCover().
| struct Node* RTreeNewIndex | ( | void | ) | [read] |
| struct Node* RTreeNewNode | ( | void | ) | [read] |
Definition at line 42 of file node.c.
Referenced by rtree_read_branch(), RTreeInsertRect(), RTreeNewIndex(), and RTreeSplitNode().
| int RTreeSearch | ( | struct Node * | , | |
| struct Rect * | , | |||
| SearchHitCallback | , | |||
| void * | ||||
| ) |
Definition at line 37 of file index.c.
References Node::branch, Branch::child, LEAFCARD, Node::level, NODECARD, Branch::rect, RTreeOverlap(), and RTreeSearch().
| void RTreeTabIn | ( | int | ) |
1.5.3