ugdk::ikdtree::Node< T, DIMENSIONS > Class Template Reference

#include <ugdk/util/intervalkdtree.h>

Inheritance diagram for ugdk::ikdtree::Node< T, DIMENSIONS >:

Collaboration diagram for ugdk::ikdtree::Node< T, DIMENSIONS >:

Public Member Functions
	Node (IntervalKDTree< T, DIMENSIONS > *const tree, Node *parent, int depth, Coordinate *min_coordinates, Coordinate *max_coordinates)
	Node (IntervalKDTree< T, DIMENSIONS > *const tree, Node *parent, int depth, const Box< DIMENSIONS > &coordinates)
	~Node ()
void	InsertItem (Item< T, DIMENSIONS > *item)
void	RemoveItem (Item< T, DIMENSIONS > *item)
void	getIntersectingItems (const Box< DIMENSIONS > &boundary, std::vector< T > *items) const
void	Clear ()
Public Member Functions inherited from ugdk::ikdtree::Box< DIMENSIONS >
	Box (const Coordinate *min_coordinates, const Coordinate *max_coordinates)
	Box (const Box &box)
void	setBox (const Box &box)
	~Box ()
bool	IsBelow (int depth, Coordinate boundary) const
bool	IsAbove (int depth, Coordinate boundary) const
bool	Contains (const Box &box) const
bool	Intersects (const Box *box) const

Public Attributes
int	depth_
Coordinate	division_boundary_
bool	has_children_

Additional Inherited Members
Protected Attributes inherited from ugdk::ikdtree::Box< DIMENSIONS >
Coordinate	min_coordinates_ [DIMENSIONS]
Coordinate	max_coordinates_ [DIMENSIONS]

Constructor & Destructor Documentation

template<class T , int DIMENSIONS>

Node< T, DIMENSIONS >::Node	(	IntervalKDTree< T, DIMENSIONS > *const	tree,
		Node< T, DIMENSIONS > *	parent,
		int	depth,
		Coordinate *	min_coordinates,
		Coordinate *	max_coordinates
	)

template<class T , int DIMENSIONS>

Node< T, DIMENSIONS >::Node	(	IntervalKDTree< T, DIMENSIONS > *const	tree,
		Node< T, DIMENSIONS > *	parent,
		int	depth,
		const Box< DIMENSIONS > &	coordinates
	)

template<class T , int DIMENSIONS>

Node< T, DIMENSIONS >::~Node

(

)

Member Function Documentation

template<class T , int DIMENSIONS>

void Node< T, DIMENSIONS >::Clear

(

)

template<class T , int DIMENSIONS>

void Node< T, DIMENSIONS >::getIntersectingItems	(	const Box< DIMENSIONS > &	boundary,
		std::vector< T > *	items
	)		const

template<class T , int DIMENSIONS>

void Node< T, DIMENSIONS >::InsertItem

(

Item< T, DIMENSIONS > *

item

)

template<class T , int DIMENSIONS>

void Node< T, DIMENSIONS >::RemoveItem

(

Item< T, DIMENSIONS > *

item

)

Member Data Documentation

template<class T, int DIMENSIONS>

int ugdk::ikdtree::Node< T, DIMENSIONS >::depth_

template<class T, int DIMENSIONS>

Coordinate ugdk::ikdtree::Node< T, DIMENSIONS >::division_boundary_

template<class T, int DIMENSIONS>

bool ugdk::ikdtree::Node< T, DIMENSIONS >::has_children_

---

The documentation for this class was generated from the following file:

• src/ugdk/util/intervalkdtree.h