#include <KNN.hpp>
|
| KNN () |
|
| KNN (const KNN &m) |
|
KNN & | operator= (const KNN &m) |
|
virtual | ~KNN () |
|
void | setDistances (const VectorVectorDouble &distances) |
|
void | setIndices (const VectorVectorInt &indices) |
|
void | setNNeighbors (int n_neighbors) |
|
void | setNSamples (int n_samples) |
|
int | btree_query (t_btree *tree, const double **x, int n_samples, int n_features, int n_neigh) |
|
int | btree_query_inPlace (t_btree *tree, const double **x, int n_samples, int n_features, int n_neigh, int rank, VectorInt &indices, VectorDouble &distances) |
|
VectorInt | getIndices (int rank=0) const |
|
int | getIndex (int rank=0, int ineigh=0) const |
|
VectorDouble | getDistances (int rank=0) const |
|
double | getDistance (int rank=0, int ineigh=0) const |
|
◆ KNN() [1/2]
◆ KNN() [2/2]
KNN::KNN |
( |
const KNN & |
m | ) |
|
◆ ~KNN()
◆ btree_query()
int KNN::btree_query |
( |
t_btree * |
tree, |
|
|
const double ** |
x, |
|
|
int |
n_samples, |
|
|
int |
n_features, |
|
|
int |
n_neigh |
|
) |
| |
◆ btree_query_inPlace()
int KNN::btree_query_inPlace |
( |
t_btree * |
tree, |
|
|
const double ** |
x, |
|
|
int |
n_samples, |
|
|
int |
n_features, |
|
|
int |
n_neigh, |
|
|
int |
rank, |
|
|
VectorInt & |
indices, |
|
|
VectorDouble & |
distances |
|
) |
| |
◆ getDistance()
double KNN::getDistance |
( |
int |
rank = 0 , |
|
|
int |
ineigh = 0 |
|
) |
| const |
◆ getDistances()
◆ getIndex()
int KNN::getIndex |
( |
int |
rank = 0 , |
|
|
int |
ineigh = 0 |
|
) |
| const |
◆ getIndices()
VectorInt KNN::getIndices |
( |
int |
rank = 0 | ) |
const |
◆ operator=()
KNN & KNN::operator= |
( |
const KNN & |
m | ) |
|
◆ setDistances()
◆ setIndices()
◆ setNNeighbors()
void KNN::setNNeighbors |
( |
int |
n_neighbors | ) |
|
|
inline |
◆ setNSamples()
void KNN::setNSamples |
( |
int |
n_samples | ) |
|
|
inline |
The documentation for this class was generated from the following files: