|
| Node (const ::std::size_t &index, const ::std::size_t &siblings, const ::std::size_t °ree, const ::std::size_t &capacity, const bool &removed=false) |
|
template<typename InputIterator > |
| Node (InputIterator first, InputIterator last, const ::std::size_t &index, const ::std::size_t &siblings, const ::std::size_t °ree, const ::std::size_t &capacity, const bool &removed=false) |
|
| ~Node () |
|
void | swap (Node &other) |
|
◆ Node() [1/2]
template<typename MetricT >
rl::math::GnatNearestNeighbors< MetricT >::Node::Node |
( |
const ::std::size_t & |
index, |
|
|
const ::std::size_t & |
siblings, |
|
|
const ::std::size_t & |
degree, |
|
|
const ::std::size_t & |
capacity, |
|
|
const bool & |
removed = false |
|
) |
| |
|
inline |
◆ Node() [2/2]
template<typename MetricT >
template<typename InputIterator >
rl::math::GnatNearestNeighbors< MetricT >::Node::Node |
( |
InputIterator |
first, |
|
|
InputIterator |
last, |
|
|
const ::std::size_t & |
index, |
|
|
const ::std::size_t & |
siblings, |
|
|
const ::std::size_t & |
degree, |
|
|
const ::std::size_t & |
capacity, |
|
|
const bool & |
removed = false |
|
) |
| |
|
inline |
◆ ~Node()
template<typename MetricT >
◆ swap()
template<typename MetricT >
◆ swap
template<typename MetricT >
◆ children
template<typename MetricT >
◆ data
template<typename MetricT >
◆ degree
template<typename MetricT >
◆ index
template<typename MetricT >
◆ max
template<typename MetricT >
◆ min
template<typename MetricT >
◆ pivot
template<typename MetricT >
◆ removed
template<typename MetricT >
The documentation for this struct was generated from the following file: