vector/rtree/index.c File Reference

#include <stdio.h>
#include <stdlib.h>
#include "assert.h"
#include "index.h"
#include "card.h"

Include dependency graph for vector/rtree/index.c:

Go to the source code of this file.

Functions
struct Node *	RTreeNewIndex (void)
int	RTreeSearch (struct Node *N, struct Rect *R, SearchHitCallback shcb, void *cbarg)
int	RTreeInsertRect (struct Rect *R, int Tid, struct Node **Root, int Level)
int	RTreeInsertRect1 (struct Rect *R, struct Node *Child, struct Node **Root, int Level)
int	RTreeDeleteRect (struct Rect *R, int Tid, struct Node **Nn)
int	RTreeDeleteRect1 (struct Rect *R, struct Node *Child, struct Node **Nn)

Function Documentation

int RTreeDeleteRect	(	struct Rect *	R,
		int	Tid,
		struct Node **	Nn
	)

Definition at line 268 of file vector/rtree/index.c.

References RTreeDeleteRect1().

Referenced by dig_spidx_del_area(), dig_spidx_del_isle(), dig_spidx_del_line(), dig_spidx_del_node(), and Vect_spatial_index_del_item().

int RTreeDeleteRect1	(	struct Rect *	R,
		struct Node *	Child,
		struct Node **	Nn
	)

Definition at line 275 of file vector/rtree/index.c.

References Node::branch, Branch::child, Node::level, MAXKIDS, ListNode::next, ListNode::node, NODECARD, NULL, Branch::rect, RTreeFreeNode(), and RTreeInsertRect1().

Referenced by RTreeDeleteRect().

int RTreeInsertRect	(	struct Rect *	R,
		int	Tid,
		struct Node **	Root,
		int	Level
	)

Definition at line 138 of file vector/rtree/index.c.

References RTreeInsertRect1().

Referenced by dig_spidx_add_area(), dig_spidx_add_isle(), dig_spidx_add_line(), dig_spidx_add_node(), main(), Vect_break_polygons(), Vect_line_check_intersection(), Vect_line_intersection(), Vect_snap_line(), Vect_snap_lines_list(), and Vect_spatial_index_add_item().

int RTreeInsertRect1	(	struct Rect *	R,
		struct Node *	Child,
		struct Node **	Root,
		int	Level
	)

Definition at line 144 of file vector/rtree/index.c.

References Rect::boundary, Branch::child, Node::level, NULL, NUMDIMS, Branch::rect, RTreeAddBranch(), RTreeNewNode(), and RTreeNodeCover().

Referenced by RTreeDeleteRect1(), and RTreeInsertRect().

struct Node* RTreeNewIndex

(

void

)

Definition at line 25 of file vector/rtree/index.c.

References Node::level, and RTreeNewNode().

Referenced by dig_spidx_free_areas(), dig_spidx_free_isles(), dig_spidx_free_lines(), dig_spidx_free_nodes(), dig_spidx_init(), main(), Vect_break_polygons(), Vect_line_check_intersection(), Vect_line_intersection(), Vect_snap_line(), Vect_snap_lines_list(), and Vect_spatial_index_init().

int RTreeSearch	(	struct Node *	N,
		struct Rect *	R,
		SearchHitCallback	shcb,
		void *	cbarg
	)

Definition at line 39 of file vector/rtree/index.c.

References Node::branch, Branch::child, LEAFCARD, Node::level, N, n, NODECARD, r, Branch::rect, RTreeOverlap(), and RTreeSearch().

Referenced by dig_find_node(), dig_select_areas(), dig_select_isles(), dig_select_lines(), dig_select_nodes(), main(), RTreeSearch(), Vect_break_polygons(), Vect_line_check_intersection(), Vect_line_intersection(), Vect_snap_line(), Vect_snap_lines_list(), and Vect_spatial_index_select().