#include <nanoflann.hpp>
Public Member Functions | |
| void | addPoint (DistanceType dist, IndexType index) |
| void | clear () |
| bool | full () const |
| void | init () |
| RadiusResultSet (DistanceType radius_, std::vector< std::pair< IndexType, DistanceType > > &indices_dists) | |
| void | set_radius_and_clear (const DistanceType r) |
| size_t | size () const |
| std::pair< IndexType, DistanceType > | worst_item () const |
| DistanceType | worstDist () const |
| ~RadiusResultSet () | |
Public Attributes | |
| std::vector< std::pair< IndexType, DistanceType > > & | m_indices_dists |
| const DistanceType | radius |
A result-set class used when performing a radius based search.
Definition at line 159 of file nanoflann.hpp.
|
inline |
Definition at line 166 of file nanoflann.hpp.
|
inline |
Definition at line 171 of file nanoflann.hpp.
|
inline |
Definition at line 180 of file nanoflann.hpp.
|
inline |
Definition at line 174 of file nanoflann.hpp.
|
inline |
Definition at line 178 of file nanoflann.hpp.
|
inline |
Definition at line 173 of file nanoflann.hpp.
|
inline |
Clears the result set and adjusts the search radius.
Definition at line 189 of file nanoflann.hpp.
|
inline |
Definition at line 176 of file nanoflann.hpp.
|
inline |
Find the worst result (furtherest neighbor) without copying or sorting Pre-conditions: size() > 0
Definition at line 199 of file nanoflann.hpp.
|
inline |
Definition at line 186 of file nanoflann.hpp.
| std::vector<std::pair<IndexType,DistanceType> >& nanoflann::RadiusResultSet< DistanceType, IndexType >::m_indices_dists |
Definition at line 164 of file nanoflann.hpp.
| const DistanceType nanoflann::RadiusResultSet< DistanceType, IndexType >::radius |
Definition at line 162 of file nanoflann.hpp.