#include <result_set.h>
 
  
 | Public Member Functions | |
| KNNUniqueResultSet (unsigned int capacity) | |
| void | addPoint (DistanceType dist, int index) | 
| void | clear () | 
|  Public Member Functions inherited from cvflann::UniqueResultSet< DistanceType > | |
| UniqueResultSet () | |
| bool | full () const | 
| virtual void | copy (int *indices, DistanceType *dist, int n_neighbors=-1) const | 
| virtual void | sortAndCopy (int *indices, DistanceType *dist, int n_neighbors=-1) const | 
| size_t | size () const | 
| DistanceType | worstDist () const | 
|  Public Member Functions inherited from cvflann::ResultSet< DistanceType > | |
| virtual | ~ResultSet () | 
| Protected Types | |
| typedef UniqueResultSet< DistanceType >::DistIndex | DistIndex | 
| Protected Attributes | |
| unsigned int | capacity_ | 
|  Protected Attributes inherited from cvflann::UniqueResultSet< DistanceType > | |
| bool | is_full_ | 
| DistanceType | worst_distance_ | 
| std::set< DistIndex > | dist_indices_ | 
Class that holds the k NN neighbors Faster than KNNResultSet as it uses a binary heap and does not maintain two arrays
| 
 | protected | 
| 
 | inline | 
Constructor
| capacity | the number of neighbors to store at max | 
| 
 | inlinevirtual | 
Add a possible candidate to the best neighbors
| dist | distance for that neighbor | 
| index | index of that neighbor | 
Implements cvflann::ResultSet< DistanceType >.
| 
 | inlinevirtual | 
Remove all elements in the set
Implements cvflann::UniqueResultSet< DistanceType >.
Reimplemented in cvflann::KNNRadiusUniqueResultSet< DistanceType >.
| 
 | protected | 
The number of neighbors to keep