inviwo::KDNode< N, T, P > Class Template Reference

Public Member Functions
KDNode *	clone ()
unsigned long	depth () const
KDNode *	find (const P pos[N])
void	findCloseTo (const P pos[N], const P squaredDistance, std::vector< KDNode * > &nodes)
KDNode *	findMax (unsigned int dim)
KDNode *	findMin (unsigned int dim)
KDNode< N, T, P > *	findNearest (const P pos[N], KDNode *nearest)
void	findNNearest (const P pos[N], size_t amount, std::vector< KDNodeDistWrapper< N, T, P > > &current)
KDNode *	findParent (const KDNode *n)
T &	get ()
const T &	get () const
void	getAsVector (std::vector< KDNode * > &nodes)
std::pair< KDNode *, KDNode * >	getChilds ()
T *	getDataAsPointer ()
KDNode *	getLeftChild ()
P *	getPosition ()
KDNode *	getRightChild ()
KDNode *	insert (const P pos[N], const T &data)
bool	isLeaf () const
bool	isLeftLeaf () const
bool	isOk () const
bool	isRightLeaf () const
	KDNode (const P pos[N], const T &data, KDNode *parent=0)
unsigned long	size () const

Static Public Member Functions
static void	swap (KDNode< N, T, P > *n0, KDNode< N, T, P > *n1, KDNode< N, T, P > *p0, KDNode< N, T, P > *p1)

Friends
class	KDTree< N, T, P >

---

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

• modules/base/include/modules/base/datastructures/kdtree.h