NearestNeighborsLinear.h
166 ElemSort(const _T &e, const typename NearestNeighbors<_T>::DistanceFunction &df) : e_(e), df_(df)
boost::function< double(const _T &, const _T &)> DistanceFunction
The definition of a distance function.
Definition: NearestNeighbors.h:55
virtual void nearestR(const _T &data, double radius, std::vector< _T > &nbh) const
Return the nearest neighbors within distance radius in sorted order.
Definition: NearestNeighborsLinear.h:138
virtual void nearestK(const _T &data, std::size_t k, std::vector< _T > &nbh) const
Return the k nearest neighbors in sorted order.
Definition: NearestNeighborsLinear.h:122
virtual void add(const std::vector< _T > &data)
Add a vector of points.
Definition: NearestNeighborsLinear.h:83
virtual void list(std::vector< _T > &data) const
Get all the elements in the datastructure.
Definition: NearestNeighborsLinear.h:152
A nearest neighbors datastructure that uses linear search.
Definition: NearestNeighborsLinear.h:57
Abstract representation of a container that can perform nearest neighbors queries.
Definition: NearestNeighbors.h:50
virtual std::size_t size() const
Get the number of elements in the datastructure.
Definition: NearestNeighborsLinear.h:147
virtual bool reportsSortedResults() const
Return true if the solutions reported by this data structure are sorted, when calling nearestK / near...
Definition: NearestNeighborsLinear.h:73
virtual void add(const _T &data)
Add an element to the datastructure.
Definition: NearestNeighborsLinear.h:78
std::vector< _T > data_
The data elements stored in this structure.
Definition: NearestNeighborsLinear.h:160
virtual _T nearest(const _T &data) const
Get the nearest neighbor of a point.
Definition: NearestNeighborsLinear.h:101