spatial::kd_tree< Point, Value, Discriminator, Size > Member List

This is the complete list of members for spatial::kd_tree< Point, Value, Discriminator, Size >, including all inherited members.

begin()	spatial::kd_tree< Point, Value, Discriminator, Size >	[inline]
begin() const	spatial::kd_tree< Point, Value, Discriminator, Size >	[inline]
begin(const key_type &lower, const key_type &upper)	spatial::kd_tree< Point, Value, Discriminator, Size >	[inline]
begin(const key_type &lower, const key_type &upper) const	spatial::kd_tree< Point, Value, Discriminator, Size >	[inline]
begin(const Region &region)	spatial::kd_tree< Point, Value, Discriminator, Size >	[inline]
begin(const Region &region) const	spatial::kd_tree< Point, Value, Discriminator, Size >	[inline]
clear()	spatial::kd_tree< Point, Value, Discriminator, Size >	[inline]
const_iterator typedef	spatial::kd_tree< Point, Value, Discriminator, Size >
const_pointer typedef	spatial::kd_tree< Point, Value, Discriminator, Size >
const_reference typedef	spatial::kd_tree< Point, Value, Discriminator, Size >
const_traits typedef	spatial::kd_tree< Point, Value, Discriminator, Size >
default_region_type typedef	spatial::kd_tree< Point, Value, Discriminator, Size >
discriminator_type typedef	spatial::kd_tree< Point, Value, Discriminator, Size >
empty() const	spatial::kd_tree< Point, Value, Discriminator, Size >	[inline]
end()	spatial::kd_tree< Point, Value, Discriminator, Size >	[inline]
end() const	spatial::kd_tree< Point, Value, Discriminator, Size >	[inline]
end()	spatial::kd_tree< Point, Value, Discriminator, Size >	[inline]
end() const	spatial::kd_tree< Point, Value, Discriminator, Size >	[inline]
erase(const key_type &point)	spatial::kd_tree< Point, Value, Discriminator, Size >	[inline]
erase(iterator pos)	spatial::kd_tree< Point, Value, Discriminator, Size >	[inline]
find(const key_type &point)	spatial::kd_tree< Point, Value, Discriminator, Size >	[inline]
find(const key_type &point) const	spatial::kd_tree< Point, Value, Discriminator, Size >	[inline]
find_nearest_neighbor(const key_type &point, const bool omit_query_point=true)	spatial::kd_tree< Point, Value, Discriminator, Size >	[inline]
get(const key_type &point, mapped_type *const value=0) const	spatial::kd_tree< Point, Value, Discriminator, Size >	[inline]
insert(const key_type &point, const mapped_type &value, mapped_type *const replaced=0)	spatial::kd_tree< Point, Value, Discriminator, Size >	[inline]
insert(const value_type &mapping)	spatial::kd_tree< Point, Value, Discriminator, Size >	[inline]
iterator typedef	spatial::kd_tree< Point, Value, Discriminator, Size >
kd_tree()	spatial::kd_tree< Point, Value, Discriminator, Size >	[inline, explicit]
kd_tree(const kd_tree &tree)	spatial::kd_tree< Point, Value, Discriminator, Size >	[inline]
key_type typedef	spatial::kd_tree< Point, Value, Discriminator, Size >
mapped_type typedef	spatial::kd_tree< Point, Value, Discriminator, Size >
max_size() const	spatial::kd_tree< Point, Value, Discriminator, Size >	[inline]
node_type typedef	spatial::kd_tree< Point, Value, Discriminator, Size >
operator=(const kd_tree &tree)	spatial::kd_tree< Point, Value, Discriminator, Size >	[inline]
operator==(const kd_tree &tree1, const kd_tree &tree2)	spatial::kd_tree< Point, Value, Discriminator, Size >	[friend]
operator[](const key_type &point)	spatial::kd_tree< Point, Value, Discriminator, Size >	[inline]
optimize()	spatial::kd_tree< Point, Value, Discriminator, Size >	[inline]
pointer typedef	spatial::kd_tree< Point, Value, Discriminator, Size >
reference typedef	spatial::kd_tree< Point, Value, Discriminator, Size >
remove(const key_type &point, mapped_type *const erased=0)	spatial::kd_tree< Point, Value, Discriminator, Size >	[inline]
size() const	spatial::kd_tree< Point, Value, Discriminator, Size >	[inline]
size_type typedef	spatial::kd_tree< Point, Value, Discriminator, Size >
traits typedef	spatial::kd_tree< Point, Value, Discriminator, Size >
value_type typedef	spatial::kd_tree< Point, Value, Discriminator, Size >
~kd_tree()	spatial::kd_tree< Point, Value, Discriminator, Size >	[inline, virtual]