KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc > Member List

This is the complete list of members for KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >, including all inherited members.

allocator_type typedef	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >	protected
begin() const	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
check_tree()	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
clear()	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
const_iterator typedef	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
const_pointer typedef	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
const_reference typedef	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
const_reverse_iterator typedef	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
count_within_range(const_reference __V, subvalue_type const __R) const	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
count_within_range(_Region_ const &__REGION) const	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
difference_type typedef	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
distance_type typedef	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
efficient_replace_and_optimise(std::vector< value_type > &writable_vector)	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
empty() const	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
end() const	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
erase(const_reference __V)	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
erase(const_iterator const &__IT)	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
erase_exact(const_reference __V)	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
find(SearchVal const &__V) const	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
find_exact(SearchVal const &__V) const	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
find_nearest(SearchVal const &__val) const	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
find_nearest(SearchVal const &__val, distance_type __max) const	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
find_nearest_if(SearchVal const &__val, distance_type __max, _Predicate __p) const	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
find_within_range(SearchVal const &val, subvalue_type const range, _OutputIterator out) const	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
find_within_range(_Region_ const &region, _OutputIterator out) const	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
find_within_range_iterative(const_reference, const_reference)	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
get_allocator() const	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
insert(iterator, const_reference __V)	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
insert(const_reference __V)	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
insert(_InputIterator __first, _InputIterator __last)	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
insert(iterator __pos, size_type __n, const value_type &__x)	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
insert(iterator __pos, _InputIterator __first, _InputIterator __last)	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
iterator typedef	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
KDTree(_Acc const &__acc=_Acc(), _Dist const &__dist=_Dist(), _Cmp const &__cmp=_Cmp(), const allocator_type &__a=allocator_type())	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
KDTree(const KDTree &__x)	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
KDTree(_InputIterator __first, _InputIterator __last, _Acc const &acc=_Acc(), _Dist const &__dist=_Dist(), _Cmp const &__cmp=_Cmp(), const allocator_type &__a=allocator_type())	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
max_size() const	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
operator=(const KDTree &__x)	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
optimise()	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
optimize()	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
pointer typedef	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
rbegin() const	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
reference typedef	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
rend() const	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
reverse_iterator typedef	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
size() const	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
size_type typedef	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
subvalue_type typedef	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
value_acc() const	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
value_comp() const	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
value_distance() const	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
value_distance()	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
value_type typedef	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
visit_within_range(SearchVal const &V, subvalue_type const R, Visitor visitor) const	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
visit_within_range(_Region_ const &REGION, Visitor visitor) const	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
~KDTree()	KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >