| a_ (defined in node_t< kd, point_t, data_t >) | node_t< kd, point_t, data_t > | |
| b_ (defined in node_t< kd, point_t, data_t >) | node_t< kd, point_t, data_t > | |
| dump(std::ostream &so) const (defined in node_t< kd, point_t, data_t >) | node_t< kd, point_t, data_t > | inline |
| euclidian_distance(const point_t &query) const (defined in node_t< kd, point_t, data_t >) | node_t< kd, point_t, data_t > | inline |
| i_ (defined in node_t< kd, point_t, data_t >) | node_t< kd, point_t, data_t > | |
| leaf(std::list< unexplored_branch_t > &unexplored, const point_t &query, const data_t &best_distance) const (defined in node_t< kd, point_t, data_t >) | node_t< kd, point_t, data_t > | inline |
| m_ (defined in node_t< kd, point_t, data_t >) | node_t< kd, point_t, data_t > | |
| max_ (defined in node_t< kd, point_t, data_t >) | node_t< kd, point_t, data_t > | |
| min_ (defined in node_t< kd, point_t, data_t >) | node_t< kd, point_t, data_t > | |
| node_t() (defined in node_t< kd, point_t, data_t >) | node_t< kd, point_t, data_t > | inline |
| node_t(const node_t< kd, point_t, data_t > &node) (defined in node_t< kd, point_t, data_t >) | node_t< kd, point_t, data_t > | inline |
| node_t(node_t< kd, point_t, data_t > *parent, point_t *points, const unsigned int num_pts) (defined in node_t< kd, point_t, data_t >) | node_t< kd, point_t, data_t > | inline |
| num_pts_ (defined in node_t< kd, point_t, data_t >) | node_t< kd, point_t, data_t > | |
| operator=(const node_t< kd, point_t, data_t > &node) (defined in node_t< kd, point_t, data_t >) | node_t< kd, point_t, data_t > | inline |
| parent_ (defined in node_t< kd, point_t, data_t >) | node_t< kd, point_t, data_t > | |
| points_ (defined in node_t< kd, point_t, data_t >) | node_t< kd, point_t, data_t > | |
| ~node_t() (defined in node_t< kd, point_t, data_t >) | node_t< kd, point_t, data_t > | inline |