|
| KDNode (const P pos[N], const T &data, KDNode *parent=0) |
|
KDNode * | clone () |
|
bool | isLeaf () const |
|
bool | isRightLeaf () const |
|
bool | isLeftLeaf () const |
|
unsigned long | depth () const |
|
unsigned long | size () const |
|
T & | get () |
|
const T & | get () const |
|
T * | getDataAsPointer () |
|
P * | getPosition () |
|
bool | isOk () const |
|
KDNode * | findMin (unsigned int dim) |
|
KDNode * | findMax (unsigned int dim) |
|
KDNode * | insert (const P pos[N], const T &data) |
|
KDNode * | find (const P pos[N]) |
|
KDNode * | findParent (const KDNode *n) |
|
KDNode * | getRightChild () |
|
KDNode * | getLeftChild () |
|
std::pair< KDNode *, KDNode * > | getChilds () |
|
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 >> ¤t) |
|
void | findCloseTo (const P pos[N], const P squaredDistance, std::vector< KDNode * > &nodes) |
|
void | getAsVector (std::vector< KDNode * > &nodes) |
|
|
static void | swap (KDNode< N, T, P > *n0, KDNode< N, T, P > *n1, KDNode< N, T, P > *p0, KDNode< N, T, P > *p1) |
|
The documentation for this class was generated from the following file: