Robotics Library  0.7.0
rl::math::KdtreeNearestNeighbors< MetricT > Member List

This is the complete list of members for rl::math::KdtreeNearestNeighbors< MetricT >, including all inherited members.

checksrl::math::KdtreeNearestNeighbors< MetricT >private
clear()rl::math::KdtreeNearestNeighbors< MetricT >inline
const_reference typedefrl::math::KdtreeNearestNeighbors< MetricT >
data() constrl::math::KdtreeNearestNeighbors< MetricT >inline
data(const Node &node, ::std::vector< Value > &data) constrl::math::KdtreeNearestNeighbors< MetricT >inlineprivate
difference_type typedefrl::math::KdtreeNearestNeighbors< MetricT >
Distance typedefrl::math::KdtreeNearestNeighbors< MetricT >
divide(Node &node, InputIterator first, InputIterator last)rl::math::KdtreeNearestNeighbors< MetricT >inlineprivate
empty() constrl::math::KdtreeNearestNeighbors< MetricT >inline
getChecks() constrl::math::KdtreeNearestNeighbors< MetricT >inline
getSamples() constrl::math::KdtreeNearestNeighbors< MetricT >inline
insert(InputIterator first, InputIterator last)rl::math::KdtreeNearestNeighbors< MetricT >inline
KdtreeNearestNeighbors(const Metric &metric)rl::math::KdtreeNearestNeighbors< MetricT >inlineexplicit
KdtreeNearestNeighbors(Metric &&metric=Metric())rl::math::KdtreeNearestNeighbors< MetricT >inlineexplicit
KdtreeNearestNeighbors(InputIterator first, InputIterator last, const Metric &metric)rl::math::KdtreeNearestNeighbors< MetricT >inline
KdtreeNearestNeighbors(InputIterator first, InputIterator last, Metric &&metric=Metric())rl::math::KdtreeNearestNeighbors< MetricT >inline
meanrl::math::KdtreeNearestNeighbors< MetricT >private
Metric typedefrl::math::KdtreeNearestNeighbors< MetricT >
metricrl::math::KdtreeNearestNeighbors< MetricT >private
nearest(const Value &query, const ::std::size_t &k, const bool &sorted=true) constrl::math::KdtreeNearestNeighbors< MetricT >inline
Neighbor typedefrl::math::KdtreeNearestNeighbors< MetricT >
push(const Value &value)rl::math::KdtreeNearestNeighbors< MetricT >inline
push(Node &node, const Value &value)rl::math::KdtreeNearestNeighbors< MetricT >inlineprivate
radius(const Value &query, const Distance &radius, const bool &sorted=true) constrl::math::KdtreeNearestNeighbors< MetricT >inline
reference typedefrl::math::KdtreeNearestNeighbors< MetricT >
rootrl::math::KdtreeNearestNeighbors< MetricT >private
samplesrl::math::KdtreeNearestNeighbors< MetricT >private
search(const Value &query, const ::std::size_t *k, const Distance *radius, const bool &sorted) constrl::math::KdtreeNearestNeighbors< MetricT >inlineprivate
search(const Node &node, const Value &query, const ::std::size_t *k, const Distance *radius, ::std::vector< Branch > &branches, ::std::vector< Neighbor > &neighbors, ::std::size_t &checks, const Distance &mindist, const ::std::vector< Distance > &sidedist) constrl::math::KdtreeNearestNeighbors< MetricT >inlineprivate
select(InputIterator first, InputIterator last)rl::math::KdtreeNearestNeighbors< MetricT >inlineprivate
setChecks(const ::boost::optional< ::std::size_t > &checks)rl::math::KdtreeNearestNeighbors< MetricT >inline
setSamples(const ::std::size_t &samples)rl::math::KdtreeNearestNeighbors< MetricT >inline
Size typedefrl::math::KdtreeNearestNeighbors< MetricT >
size() constrl::math::KdtreeNearestNeighbors< MetricT >inline
size_type typedefrl::math::KdtreeNearestNeighbors< MetricT >
swap(KdtreeNearestNeighbors &other)rl::math::KdtreeNearestNeighbors< MetricT >inline
swap(KdtreeNearestNeighbors &lhs, KdtreeNearestNeighbors &rhs)rl::math::KdtreeNearestNeighbors< MetricT >friend
Value typedefrl::math::KdtreeNearestNeighbors< MetricT >
value_type typedefrl::math::KdtreeNearestNeighbors< MetricT >
valuesrl::math::KdtreeNearestNeighbors< MetricT >private
varrl::math::KdtreeNearestNeighbors< MetricT >private
~KdtreeNearestNeighbors()rl::math::KdtreeNearestNeighbors< MetricT >inline