rl::math::KdtreeNearestNeighbors< MetricT > Member List

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

checks	rl::math::KdtreeNearestNeighbors< MetricT >	private
clear()	rl::math::KdtreeNearestNeighbors< MetricT >	inline
const_reference typedef	rl::math::KdtreeNearestNeighbors< MetricT >
data() const	rl::math::KdtreeNearestNeighbors< MetricT >	inline
data(const Node &node, ::std::vector< Value > &data) const	rl::math::KdtreeNearestNeighbors< MetricT >	inlineprivate
difference_type typedef	rl::math::KdtreeNearestNeighbors< MetricT >
Distance typedef	rl::math::KdtreeNearestNeighbors< MetricT >
divide(Node &node, InputIterator first, InputIterator last)	rl::math::KdtreeNearestNeighbors< MetricT >	inlineprivate
empty() const	rl::math::KdtreeNearestNeighbors< MetricT >	inline
getChecks() const	rl::math::KdtreeNearestNeighbors< MetricT >	inline
getSamples() const	rl::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
mean	rl::math::KdtreeNearestNeighbors< MetricT >	private
Metric typedef	rl::math::KdtreeNearestNeighbors< MetricT >
metric	rl::math::KdtreeNearestNeighbors< MetricT >	private
nearest(const Value &query, const ::std::size_t &k, const bool &sorted=true) const	rl::math::KdtreeNearestNeighbors< MetricT >	inline
Neighbor typedef	rl::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) const	rl::math::KdtreeNearestNeighbors< MetricT >	inline
reference typedef	rl::math::KdtreeNearestNeighbors< MetricT >
root	rl::math::KdtreeNearestNeighbors< MetricT >	private
samples	rl::math::KdtreeNearestNeighbors< MetricT >	private
search(const Value &query, const ::std::size_t *k, const Distance *radius, const bool &sorted) const	rl::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) const	rl::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 typedef	rl::math::KdtreeNearestNeighbors< MetricT >
size() const	rl::math::KdtreeNearestNeighbors< MetricT >	inline
size_type typedef	rl::math::KdtreeNearestNeighbors< MetricT >
swap(KdtreeNearestNeighbors &other)	rl::math::KdtreeNearestNeighbors< MetricT >	inline
swap(KdtreeNearestNeighbors &lhs, KdtreeNearestNeighbors &rhs)	rl::math::KdtreeNearestNeighbors< MetricT >	friend
Value typedef	rl::math::KdtreeNearestNeighbors< MetricT >
value_type typedef	rl::math::KdtreeNearestNeighbors< MetricT >
values	rl::math::KdtreeNearestNeighbors< MetricT >	private
var	rl::math::KdtreeNearestNeighbors< MetricT >	private
~KdtreeNearestNeighbors()	rl::math::KdtreeNearestNeighbors< MetricT >	inline