#include <ball_algorithm.h>
◆ t_nheap()
gstlrn::t_nheap::t_nheap |
( |
| ) |
|
|
default |
◆ largest()
double gstlrn::t_nheap::largest |
( |
Id |
row | ) |
const |
◆ load()
void gstlrn::t_nheap::load |
( |
const t_btree & |
b, |
|
|
const MatrixT< double > & |
x |
|
) |
| |
◆ push()
Id gstlrn::t_nheap::push |
( |
Id |
row, |
|
|
double |
val, |
|
|
Id |
i_val |
|
) |
| |
◆ resize()
void gstlrn::t_nheap::resize |
( |
Id |
n_pts, |
|
|
Id |
n_nbrs |
|
) |
| |
◆ sort()
void gstlrn::t_nheap::sort |
( |
| ) |
|
◆ distances
MatrixT<double> gstlrn::t_nheap::distances |
◆ indices
◆ n_nbrs
Id gstlrn::t_nheap::n_nbrs |
◆ n_pts
Id gstlrn::t_nheap::n_pts |
The documentation for this struct was generated from the following files:
- include/Tree/ball_algorithm.h
- src/Tree/neighbors_heap.cpp