index.c File Reference

#include <stdlib.h>
#include <label/index.h>
#include <stddef.h>
#include <stdio.h>
#include <assert.h>
#include <stdbool.h>

Include dependency graph for index.c:

Go to the source code of this file.

Functions
LeafList_t *	RTreeNewLeafList (Leaf_t *lp)
LeafList_t *	RTreeLeafListAdd (LeafList_t *llp, Leaf_t *lp)
void	RTreeLeafListFree (LeafList_t *llp)
RTree_t *	RTreeOpen (void)
Node_t *	RTreeNewIndex (void)
static int	RTreeClose2 (RTree_t *rtp, Node_t *n)
int	RTreeClose (RTree_t *rtp)
LeafList_t *	RTreeSearch (RTree_t *rtp, Node_t *n, Rect_t *r)
static int	RTreeInsert2 (RTree_t *, Rect_t *, void *, Node_t *, Node_t **, int)
int	RTreeInsert (RTree_t *rtp, Rect_t *r, void *data, Node_t **n, int level)

Function Documentation

RTreeClose()

int RTreeClose

(

RTree_t *

rtp

)

Definition at line 89 of file index.c.

References free(), RTree::root, and RTreeClose2().

Referenced by xlfree().

Here is the call graph for this function:

Here is the caller graph for this function:

RTreeClose2()

static int RTreeClose2 ( RTree_t *  rtp, Node_t *  n  )

static

Definition at line 67 of file index.c.

References Node::branch, Branch::child, DisconBranch(), free(), Node::level, NODECARD, and RTreeClose2().

Referenced by RTreeClose(), and RTreeClose2().

Here is the call graph for this function:

Here is the caller graph for this function:

RTreeInsert()

int RTreeInsert	(	RTree_t *	rtp,
		Rect_t *	r,
		void *	data,
		Node_t **	n,
		int	level
	)

Definition at line 182 of file index.c.

References AddBranch(), Rect::boundary, Branch::child, Node::level, newnode(), NodeCover(), NULL, NUMDIMS, Branch::rect, RTreeInsert2(), and RTreeNewNode().

Referenced by xlspdxload().

Here is the call graph for this function:

Here is the caller graph for this function:

RTreeInsert2()

static int RTreeInsert2 ( RTree_t *  rtp, Rect_t *  r, void *  data, Node_t *  n, Node_t **  new, int  level  )

static

Definition at line 224 of file index.c.

References AddBranch(), Node::branch, Branch::child, CombineRect(), Node::level, NodeCover(), PickBranch(), Branch::rect, and RTreeInsert2().

Referenced by RTreeInsert(), and RTreeInsert2().

Here is the call graph for this function:

Here is the caller graph for this function:

RTreeLeafListAdd()

LeafList_t * RTreeLeafListAdd	(	LeafList_t *	llp,
		Leaf_t *	lp
	)

Definition at line 30 of file index.c.

References LeafList::next, and RTreeNewLeafList().

Referenced by RTreeSearch().

Here is the call graph for this function:

Here is the caller graph for this function:

RTreeLeafListFree()

void RTreeLeafListFree

(

LeafList_t *

llp

)

Definition at line 40 of file index.c.

References free(), and LeafList::next.

Referenced by xlintersections().

Here is the call graph for this function:

Here is the caller graph for this function:

RTreeNewIndex()

Node_t * RTreeNewIndex

(

void

)

Definition at line 61 of file index.c.

References Node::level, and RTreeNewNode().

Referenced by RTreeOpen().

Here is the call graph for this function:

Here is the caller graph for this function:

RTreeNewLeafList()

LeafList_t * RTreeNewLeafList

(

Leaf_t *

lp

)

Definition at line 19 of file index.c.

References LeafList::leaf, and LeafList::next.

Referenced by RTreeLeafListAdd().

Here is the caller graph for this function:

RTreeOpen()

RTree_t * RTreeOpen

(

void

)

Definition at line 51 of file index.c.

References RTree::root, and RTreeNewIndex().

Referenced by xlnew().

Here is the call graph for this function:

Here is the caller graph for this function:

RTreeSearch()

LeafList_t * RTreeSearch	(	RTree_t *	rtp,
		Node_t *	n,
		Rect_t *	r
	)

Definition at line 140 of file index.c.

References Node::branch, Branch::child, Node::level, LeafList::next, NODECARD, Overlap(), Branch::rect, RTreeLeafListAdd(), and RTreeSearch().

Referenced by RTreeSearch(), and xlintersections().

Here is the call graph for this function:

Here is the caller graph for this function: