index.h File Reference

#include <label/rectangle.h>
#include <label/node.h>
#include <label/split.q.h>

Include dependency graph for index.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures
struct	Leaf
struct	LeafList
struct	RTree

Macros
#define	NUMDIMS   2
#define	NUMSIDES   2*NUMDIMS
#define	NODECARD   64
#define	CX(i)   (i)
#define	NX(i)   (i+NUMDIMS)
#define	CY(i)   (i+1)
#define	NY(i)   (i+1+NUMDIMS)

Typedefs
typedef struct RTree	RTree_t
typedef struct Leaf	Leaf_t
typedef struct LeafList	LeafList_t

Functions
RTree_t *	RTreeOpen (void)
void	RTreeClose (RTree_t *rtp)
Node_t *	RTreeNewIndex (void)
LeafList_t *	RTreeSearch (RTree_t *, Node_t *, Rect_t)
int	RTreeInsert (RTree_t *, Rect_t, void *, Node_t **)
void	RTreeLeafListFree (LeafList_t *llp)

Macro Definition Documentation

CX

#define CX

(

i

)

(i)

Definition at line 50 of file index.h.

CY

#define CY

(

i

)

(i+1)

Definition at line 52 of file index.h.

NODECARD

#define NODECARD   64

Definition at line 43 of file index.h.

NUMDIMS

#define NUMDIMS   2

Definition at line 37 of file index.h.

NUMSIDES

#define NUMSIDES   2*NUMDIMS

Definition at line 40 of file index.h.

NX

#define NX

(

i

)

(i+NUMDIMS)

Definition at line 51 of file index.h.

NY

#define NY

(

i

)

(i+1+NUMDIMS)

Definition at line 53 of file index.h.

Typedef Documentation

Leaf_t

typedef struct Leaf Leaf_t

LeafList_t

typedef struct LeafList LeafList_t

RTree_t

typedef struct RTree RTree_t

Definition at line 44 of file index.h.

Function Documentation

RTreeClose()

void RTreeClose

(

RTree_t *

rtp

)

Definition at line 79 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:

RTreeInsert()

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

Definition at line 168 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:

RTreeLeafListFree()

void RTreeLeafListFree

(

LeafList_t *

llp

)

Definition at line 35 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 54 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:

RTreeOpen()

RTree_t * RTreeOpen

(

void

)

Definition at line 46 of file index.c.

References gv_alloc(), 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 128 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: