- b -

• begin() : spatial::kd_tree< Point, Value, Discriminator, Size >

- c -

• clear() : spatial::kd_tree< Point, Value, Discriminator, Size >
• contains() : spatial::rectangle_region< Point, 2 > , spatial::rectangle_region< Point, 1 > , spatial::rectangle_region< Point, 0 > , spatial::rectangle_region< Point, i >

- d -

• d2() : spatial::euclidean_distance< Point, Distance, i > , spatial::euclidean_distance< Point, Distance, 2 > , spatial::euclidean_distance< Point, Distance, 1 > , spatial::euclidean_distance< Point, Distance, 0 >

- e -

• empty() : spatial::kd_tree< Point, Value, Discriminator, Size >
• end() : spatial::kd_tree< Point, Value, Discriminator, Size >
• erase() : spatial::kd_tree< Point, Value, Discriminator, Size >

- f -

• find() : spatial::kd_tree< Point, Value, Discriminator, Size >
• find_nearest_neighbor() : spatial::kd_tree< Point, Value, Discriminator, Size >

- g -

• get() : spatial::kd_tree< Point, Value, Discriminator, Size >

- i -

• insert() : spatial::kd_tree< Point, Value, Discriminator, Size >

- k -

• kd_tree() : spatial::kd_tree< Point, Value, Discriminator, Size >

- m -

• max_coordinate() : spatial::kd_tree_traits< Tree >
• max_size() : spatial::kd_tree< Point, Value, Discriminator, Size >
• min_coordinate() : spatial::kd_tree_traits< Tree >

- o -

• operator=() : spatial::kd_tree< Point, Value, Discriminator, Size >
• operator[]() : spatial::kd_tree< Point, Value, Discriminator, Size >
• optimize() : spatial::kd_tree< Point, Value, Discriminator, Size >

- r -

• rectangle_region() : spatial::rectangle_region< Point, i > , spatial::rectangle_region< Point, 0 > , spatial::rectangle_region< Point, 2 > , spatial::rectangle_region< Point, 1 > , spatial::rectangle_region< Point, 2 > , spatial::rectangle_region< Point, 0 >
• remove() : spatial::kd_tree< Point, Value, Discriminator, Size >

- s -

• size() : spatial::kd_tree< Point, Value, Discriminator, Size >

- ~ -

• ~kd_tree() : spatial::kd_tree< Point, Value, Discriminator, Size >