|
| node_t (const node_t< kd, point_t, data_t > &node) |
|
| node_t (node_t< kd, point_t, data_t > *parent, point_t *points, const unsigned int num_pts) |
|
node_t< kd, point_t, data_t > & | operator= (const node_t< kd, point_t, data_t > &node) |
|
const node_t< kd, point_t, data_t > * | leaf (std::list< unexplored_branch_t > &unexplored, const point_t &query, const data_t &best_distance) const |
|
data_t | euclidian_distance (const point_t &query) const |
|
void | dump (std::ostream &so) const |
|
|
unsigned int | i_ |
|
data_t | m_ |
|
data_t | min_ |
|
data_t | max_ |
|
point_t * | points_ |
|
unsigned int | num_pts_ |
|
node_t< kd, point_t, data_t > * | parent_ |
|
node_t< kd, point_t, data_t > * | a_ |
|
node_t< kd, point_t, data_t > * | b_ |
|
The documentation for this class was generated from the following file: