#include <result_set.h>
Classes | |
| struct | DistIndex |
Public Member Functions | |
| void | copy (size_t *indices, DistanceType *dist, int n_neighbors, bool sorted=true) |
| bool | full () const |
| size_t | size () const |
| UniqueResultSet () | |
| DistanceType | worstDist () const |
 Public Member Functions inherited from rtflann::ResultSet< DistanceType > | |
| virtual void | addPoint (DistanceType dist, size_t index)=0 |
| virtual | ~ResultSet () |
Protected Attributes | |
| std::set< DistIndex > | dist_indices_ |
| bool | is_full_ |
| DistanceType | worst_distance_ |
Detailed Description
template<typename DistanceType>
class rtflann::UniqueResultSet< DistanceType >
Class that holds the k NN neighbors
Definition at line 704 of file result_set.h.
Constructor & Destructor Documentation
|
inline |
Default cosntructor
Definition at line 722 of file result_set.h.
Member Function Documentation
|
inline |
Copy the set to two C arrays
- Parameters
-
indices pointer to a C array of indices dist pointer to a C array of distances n_neighbors the number of neighbors to copy
Definition at line 740 of file result_set.h.
|
inlinevirtual |
Check the status of the set
- Returns
- true if we have k NN
Implements rtflann::ResultSet< DistanceType >.
Reimplemented in rtflann::RadiusUniqueResultSet< DistanceType >.
Definition at line 730 of file result_set.h.
|
inline |
|
inlinevirtual |
The distance of the furthest neighbor If we don't have enough neighbors, it returns the max possible value
- Returns
Implements rtflann::ResultSet< DistanceType >.
Reimplemented in rtflann::RadiusUniqueResultSet< DistanceType >.
Definition at line 764 of file result_set.h.
Member Data Documentation
|
protected |
The best candidates so far
Definition at line 776 of file result_set.h.
|
protected |
Flag to say if the set is full
Definition at line 770 of file result_set.h.
|
protected |
The worst distance found so far
Definition at line 773 of file result_set.h.
The documentation for this class was generated from the following file: