#include <cathier/kdtree.h>
|
| KDTree () |
|
template<typename T_Container > |
| KDTree (const T_Container &c) |
|
| NaryTree () |
| Default constructor builds an emtpy tree. More...
|
|
| ~NaryTree () |
| Destructor. More...
|
|
std::size_t | size () const |
|
const_iterator | root () const |
| Return a const iterator on the root element of the tree. More...
|
|
iterator | root () |
| Return a non_const iterator on the root element of the tree. More...
|
|
iterator | addChild (Node *parent, std::size_t childNumber, KDNode< TIndex > value=KDNode< TIndex >()) |
| Add a child to a node. More...
|
|
iterator | addChild (iterator &parent, std::size_t childNumber, KDNode< TIndex > value=KDNode< TIndex >()) |
| Add a child to a node. More...
|
|
template<typename TIndex, typename TContainer>
class til::KDTree< TIndex, TContainer >
Definition at line 76 of file kdtree.h.
◆ Base
template<typename TIndex, typename TContainer>
◆ Collection
template<typename TIndex, typename TContainer>
◆ Self
template<typename TIndex, typename TContainer>
◆ anonymous enum
template<typename TIndex, typename TContainer>
◆ KDTree() [1/2]
template<typename TIndex, typename TContainer>
◆ KDTree() [2/2]
template<typename TIndex, typename TContainer>
template<typename T_Container >
The documentation for this class was generated from the following file: