|
typedef KDNode< N, T, P > | Node |
|
typedef KDTree< N, T, P > | Tree |
|
typedef KDNode< N, T, P > | Node |
|
|
Node * | insert (const Vector< N, P > &pos, const T &data) |
|
Node * | find (const Vector< N, P > &pos) |
|
Node * | findNearest (const Vector< N, P > &pos) |
|
std::vector< Node * > | findNNearest (const Vector< N, P > &pos, const int &amount) |
|
std::vector< Node * > | findCloseTo (const Vector< N, P > &pos, const P distance) |
|
| KDTree (const KDTree &tree) |
|
KDTree & | operator= (const KDTree &rhs) |
|
void | erase (Node *node, KDNode< N, T, P > *parent=nullptr) |
|
bool | isOk () const |
|
bool | empty () const |
|
void | clear () |
|
unsigned long | depth () const |
|
unsigned long | size () const |
|
std::vector< Node * > | getAsVector () |
|
Node * | getRoot () |
|
Node * | findMin (unsigned int dim) |
|
Node * | findMax (unsigned int dim) |
|
Node * | insert (const P pos[N], const T &data) |
|
Node * | find (const P pos[N]) |
|
Node * | findNearest (const P pos[N]) |
|
std::vector< Node * > | findCloseTo (const P pos[N], const P distance) |
|
std::vector< Node * > | findNNearest (const P pos[N], int amount) |
|
The documentation for this class was generated from the following file: