#include "linear_index.h"
|
| LinearIndex (const Matrix< ElementType > &inputData, const IndexParams ¶ms=LinearIndexParams(), Distance d=Distance()) |
|
| LinearIndex (const LinearIndex &) |
|
void | buildIndex () |
| Builds the index. More...
|
|
void | findNeighbors (ResultSet< DistanceType > &resultSet, const ElementType *vec, const SearchParams &) |
| Method that searches for nearest-neighbours. More...
|
|
IndexParams | getParameters () const |
|
flann_algorithm_t | getType () const |
|
void | loadIndex (FILE *) |
| Loads the index from a stream. More...
|
|
LinearIndex & | operator= (const LinearIndex &) |
|
void | saveIndex (FILE *) |
| Saves the index to a stream. More...
|
|
size_t | size () const |
|
int | usedMemory () const |
|
size_t | veclen () const |
|
virtual | ~NNIndex () |
|
virtual void | knnSearch (const Matrix< ElementType > &queries, Matrix< int > &indices, Matrix< DistanceType > &dists, int knn, const SearchParams ¶ms) |
| Perform k-nearest neighbor search. More...
|
|
virtual int | radiusSearch (const Matrix< ElementType > &query, Matrix< int > &indices, Matrix< DistanceType > &dists, float radius, const SearchParams ¶ms) |
| Perform radius search. More...
|
|
◆ DistanceType
template<typename Distance>
◆ ElementType
template<typename Distance>
◆ LinearIndex() [1/2]
template<typename Distance>
◆ LinearIndex() [2/2]
template<typename Distance>
◆ buildIndex()
template<typename Distance>
◆ findNeighbors()
template<typename Distance>
◆ getParameters()
template<typename Distance>
◆ getType()
template<typename Distance>
◆ loadIndex()
template<typename Distance>
◆ operator=()
template<typename Distance>
◆ saveIndex()
template<typename Distance>
◆ size()
template<typename Distance>
◆ usedMemory()
template<typename Distance>
◆ veclen()
template<typename Distance>
The documentation for this class was generated from the following file: