The Node class which is used to implement the branching structure in the KDTree.
More...
#include <KDTree.h>
|
bool | isLeaf () const |
| Returns true if this is a leaf node of the tree.
|
|
PointIterator * | permFirst () const |
|
PointIterator * | permLast () const |
|
bool | isBranch () const |
| Returns true if this is a branch node of the tree;.
|
|
unsigned char | cutAxis () const |
|
BaseType | cutValue () const |
|
|
class | KDTree< PointIterator > |
|
template<class PointIterator>
class IECore::KDTree< PointIterator >::Node
The Node class which is used to implement the branching structure in the KDTree.
template<class PointIterator>
unsigned char IECore::KDTree< PointIterator >::Node::cutAxis |
( |
| ) |
const |
|
inline |
Returns the axis in which this node cuts the space. Only valid if isBranch() is true.
template<class PointIterator>
Returns the point within cutAxis() at which the node cuts the space.
template<class PointIterator>
PointIterator* IECore::KDTree< PointIterator >::Node::permFirst |
( |
| ) |
const |
|
inline |
Returns a pointer to an iterator referencing the first child of this Node. Only valid if isLeaf() is true.
template<class PointIterator>
PointIterator* IECore::KDTree< PointIterator >::Node::permLast |
( |
| ) |
const |
|
inline |
Returns a pointer to an iterator referencing the last child of this Node. Only valid if isLeaf() is true.
The documentation for this class was generated from the following file: