Loading...
read.c
read_nat.c
read_ogr.c
Rect
Rect
Branch::rect()
rect.c
RectReal
index.h
rects
test.c
remove_areas.c
REMOVE_DANGLE
dangles.c
remove_duplicates.c
residuals_a_predicts_b
transform.c
residuals_b_predicts_a
transform.c
rewind.c
rewind_nat.c
rewind_ogr.c
RIGHT_SIDE
buffer2.c
rtree.h
rtree_dump_branch
spindex_rw.c
rtree_dump_node
spindex_rw.c
rtree_read_branch
spindex_rw.c
rtree_read_node
spindex_rw.c
rtree_write_branch
spindex_rw.c
rtree_write_node
spindex_rw.c
RTreeAddBranch
RTreeAddBranch(struct Branch *, struct Node *, struct Node **): node.c
RTreeAddBranch(struct Branch *B, struct Node *N, struct Node **New_node): node.c
RTreeCombineRect
RTreeCombineRect(struct Rect *, struct Rect *): rect.c
RTreeCombineRect(struct Rect *R, struct Rect *Rr): rect.c
RTreeContained
rect.c
RTreeDeleteRect
RTreeDeleteRect(struct Rect *R, int Tid, struct Node **Nn): index.c
RTreeDeleteRect(struct Rect *, int, struct Node **): index.c
RTreeDeleteRect1
RTreeDeleteRect1(struct Rect *R, struct Node *Child, struct Node **Nn): index.c
RTreeDeleteRect1(struct Rect *, struct Node *, struct Node **): index.c
RTreeDestroyNode
RTreeDestroyNode(struct Node *): node.c
RTreeDestroyNode(struct Node *n): node.c
RTreeDisconnectBranch
RTreeDisconnectBranch(struct Node *, int): node.c
RTreeDisconnectBranch(struct Node *n, int i): node.c
RTreeFreeNode
RTreeFreeNode(struct Node *): node.c
RTreeFreeNode(struct Node *p): node.c
RTreeGetLeafMax
RTreeGetLeafMax(void): card.c
RTreeGetLeafMax(void): card.c
RTreeGetNodeMax
RTreeGetNodeMax(void): card.c
RTreeGetNodeMax(void): card.c
RTreeInitNode
RTreeInitNode(struct Node *): node.c
RTreeInitNode(struct Node *N): node.c
RTreeInitRect
RTreeInitRect(struct Rect *): rect.c
RTreeInitRect(struct Rect *R): rect.c
RTreeInsertRect
RTreeInsertRect(struct Rect *R, int Tid, struct Node **Root, int Level): index.c
RTreeInsertRect(struct Rect *, int, struct Node **, int depth): index.c
RTreeInsertRect1
RTreeInsertRect1(struct Rect *R, struct Node *Child, struct Node **Root, int Level): index.c
RTreeInsertRect1(struct Rect *, struct Node *, struct Node **, int depth): index.c
RTreeNewIndex
RTreeNewIndex(void): index.c
RTreeNewIndex(void): index.c
RTreeNewNode
RTreeNewNode(void): node.c
RTreeNewNode(void): node.c
RTreeNodeCover
RTreeNodeCover(struct Node *): node.c
RTreeNodeCover(struct Node *N): node.c
RTreeNullRect
RTreeNullRect(void): rect.c
RTreeNullRect(void): rect.c
RTreeOverlap
RTreeOverlap(struct Rect *, struct Rect *): rect.c
RTreeOverlap(struct Rect *R, struct Rect *S): rect.c
RTreePickBranch
RTreePickBranch(struct Rect *, struct Node *): node.c
RTreePickBranch(struct Rect *R, struct Node *N): node.c
RTreePrintNode
RTreePrintNode(struct Node *, int): node.c
RTreePrintNode(struct Node *n, int depth): node.c
RTreePrintRect
RTreePrintRect(struct Rect *, int): rect.c
RTreePrintRect(struct Rect *R, int depth): rect.c
RTreeRectArea
index.h
RTreeRectSphericalVolume
RTreeRectSphericalVolume(struct Rect *R): rect.c
RTreeRectSphericalVolume(struct Rect *R): rect.c
RTreeRectSurfaceArea
rect.c
RTreeRectVolume
RTreeRectVolume(struct Rect *R): rect.c
RTreeRectVolume(struct Rect *R): rect.c
RTreeSearch
RTreeSearch(struct Node *N, struct Rect *R, SearchHitCallback shcb, void *cbarg): index.c
RTreeSearch(struct Node *, struct Rect *, SearchHitCallback, void *): index.c
RTreeSetLeafMax
RTreeSetLeafMax(int new_max): card.c
RTreeSetLeafMax(int): card.c
RTreeSetNodeMax
RTreeSetNodeMax(int new_max): card.c
RTreeSetNodeMax(int): card.c
RTreeSplitNode
RTreeSplitNode(struct Node *, struct Branch *, struct Node **): split_q.c
RTreeSplitNode(struct Node *n, struct Branch *b, struct Node **nn): split_q.c
RTreeTabIn
RTreeTabIn(int): node.c
RTreeTabIn(int depth): node.c
test.c
Searching...
No Matches