ugdk::structure::ikdtree::Node< T, DIMENSIONS > Singleton Reference

#include <ugdk/structure/intervalkdtree.h>

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

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

Public Member Functions
	Node (IntervalKDTree< T, DIMENSIONS > *tree, Node *parent, int depth, const std::array< Coordinate, DIMENSIONS > &min_coordinates, const std::array< Coordinate, DIMENSIONS > &max_coordinates)
	Node (IntervalKDTree< T, DIMENSIONS > *tree, Node *parent, int depth, const Box< DIMENSIONS > &coordinates)
	~Node ()
void	InsertItem (Item< T, DIMENSIONS > *item)
void	RemoveItem (Item< T, DIMENSIONS > *item)
template<typename Iterator >
void	FindIntersectingItems (const Box< DIMENSIONS > &boundary, Iterator it) const
void	Clear ()
Public Member Functions inherited from ugdk::structure::Box< DIMENSIONS >
	Box ()
	Box (const Point &min_coordinates, const Point &max_coordinates)
virtual	~Box ()
void	UpdateBox (const 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
const Point &	min_coordinates () const
const Point &	max_coordinates () const

Public Attributes
int	depth_
Coordinate	division_boundary_
bool	has_children_

Additional Inherited Members
Public Types inherited from ugdk::structure::Box< DIMENSIONS >
typedef std::array< Coordinate, DIMENSIONS >	Point
Protected Attributes inherited from ugdk::structure::Box< DIMENSIONS >
Point	min_coordinates_
Point	max_coordinates_

Constructor & Destructor Documentation

template<class T , int DIMENSIONS>

ugdk::structure::ikdtree::Node< T, DIMENSIONS >::Node	(	IntervalKDTree< T, DIMENSIONS > *	tree,
		Node< T, DIMENSIONS > *	parent,
		int	depth,
		const std::array< Coordinate, DIMENSIONS > &	min_coordinates,
		const std::array< Coordinate, DIMENSIONS > &	max_coordinates
	)

template<class T , int DIMENSIONS>

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

template<class T , int DIMENSIONS>

ugdk::structure::ikdtree::Node< T, DIMENSIONS >::~Node

(

)

Member Function Documentation

template<class T , int DIMENSIONS>

void ugdk::structure::ikdtree::Node< T, DIMENSIONS >::Clear

(

)

template<class T , int DIMENSIONS>

template<class Iterator >

void ugdk::structure::ikdtree::Node< T, DIMENSIONS >::FindIntersectingItems	(	const Box< DIMENSIONS > &	boundary,
		Iterator	it
	)		const

template<class T , int DIMENSIONS>

void ugdk::structure::ikdtree::Node< T, DIMENSIONS >::InsertItem

(

Item< T, DIMENSIONS > *

item

)

template<class T , int DIMENSIONS>

void ugdk::structure::ikdtree::Node< T, DIMENSIONS >::RemoveItem

(

Item< T, DIMENSIONS > *

item

)

Member Data Documentation

template<class T, int DIMENSIONS>

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

template<class T, int DIMENSIONS>

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

template<class T, int DIMENSIONS>

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

---

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

• modules/ugdk-core/include/ugdk/structure/intervalkdtree.h