Each query's k nearest points, nearest first.
More...
#include <nearest_neighbors.hpp>
|
| int64_t | index (int64_t row, int64_t rank) const |
| |
| double | score (int64_t row, int64_t rank) const |
| |
Each query's k nearest points, nearest first.
◆ index()
| int64_t pulsatrix::Neighbors::index |
( |
int64_t |
row, |
|
|
int64_t |
rank |
|
) |
| const |
◆ score()
| double pulsatrix::Neighbors::score |
( |
int64_t |
row, |
|
|
int64_t |
rank |
|
) |
| const |
◆ indices
| std::vector<int64_t> pulsatrix::Neighbors::indices |
Row-major rows × k: indices[q * k + r] is query q's r-th nearest point.
| int64_t pulsatrix::Neighbors::k = 0 |
◆ metric
◆ rows
| int64_t pulsatrix::Neighbors::rows = 0 |
◆ scores
| std::vector<double> pulsatrix::Neighbors::scores |
The same layout: cosine similarity, or Euclidean distance.
The documentation for this struct was generated from the following file: