mpblocks::kd_tree::Traits::Node Class Reference
the node class must be defined in traits since it uses the CTRP, it must derive from kd_tree::Node<Traits> where Traits is the class containing Node More...
Inheritance diagram for mpblocks::kd_tree::Traits::Node:
Public Member Functions | |
| void * | getData () |
| your class implementation may have extra methods More... | |
| void | setData (void *data) |
| your class implementation may have extra methods More... | |
 Public Member Functions inherited from mpblocks::kd_tree::Node< Traits > | |
| void | construct (Node_t *parent, unsigned int i) |
| construct a new node More... | |
| template<typename BackInserter > | |
| void | enumerate (HyperRect_t &container, BackInserter bs) |
| void | findNearest (const Point_t &q, HyperRect_t &rect, NNIface_t &search) |
| perform a generic Nearest Neighbor query, different queries provide different implementations of the search structure More... | |
| void | findRange (RangeIface_t &search, HyperRect_t &rect) |
| find all nodes in the tree that lie inside the specified range ( can be arbitrary volume, which is implemented by the deriving class of the interface ) More... | |
| Node_t * | getParent () |
| return the parent node More... | |
| const Point_t & | getPoint () |
| returns a Point_t of the point stored at this node More... | |
| void | insert (Node_t *) |
| recursively inserts point as a new node in the tree More... | |
| Node () | |
| does nothing, see construct More... | |
| void | setPoint (const Point_t &p) |
| fill point data (convenience method) More... | |
Private Attributes | |
| void * | m_extraData |
| your class implementation may contain extra data More... | |
Additional Inherited Members | |
| Public Types inherited from mpblocks::kd_tree::Node< Traits > | |
| typedef Traits::Format_t | Format_t |
| typedef Traits::HyperRect | HyperRect_t |
| typedef NearestSearchIface < Traits > | NNIface_t |
| typedef Traits::Node | Node_t |
| typedef ListPair< Traits > | Pair_t |
| typedef Vector_t | Point_t |
| typedef RangeSearchIface< Traits > | RangeIface_t |
| typedef Node< Traits > | This_t |
| typedef Eigen::Matrix < Format_t, Traits::NDim, 1 > | Vector_t |
| Protected Attributes inherited from mpblocks::kd_tree::Node< Traits > | |
| Node_t * | m_greaterChild |
| child node who's i'th value is larger More... | |
| unsigned int | m_i |
| dimension that this node splits on, also index of hyperplane's constant component More... | |
| Node_t * | m_parent |
| parent node More... | |
| Point_t | m_point |
| the point that this node contains More... | |
| Node_t * | m_smallerChild |
| child node who's i'th value is smaller More... | |
| Node_t * | m_this |
Detailed Description
the node class must be defined in traits since it uses the CTRP, it must derive from kd_tree::Node<Traits> where Traits is the class containing Node
Member Function Documentation
| void* mpblocks::kd_tree::Traits::Node::getData | ( | ) |
your class implementation may have extra methods
| void mpblocks::kd_tree::Traits::Node::setData | ( | void * | data | ) |
your class implementation may have extra methods
Member Data Documentation
|
private |
The documentation for this class was generated from the following file:
- include/mpblocks/kd_tree/Traits.h
