|
typedef KDNode< N, T, P > | Node |
typedef KDTree< N, T, P > | Tree |
typedef KDNode< N, char, double > | 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 & | operator= (const KDTree &rhs) |
void | erase (Node *node, KDNode< N, char, double > *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 double pos[N], const char &data) |
Node * | find (const double pos[N]) |
Node * | findNearest (const double pos[N]) |
std::vector< Node * > | findCloseTo (const double pos[N], const double distance) |
std::vector< Node * > | findNNearest (const double pos[N], int amount) |
The documentation for this class was generated from the following file: