Geophysical Inversion and Modelling Library v1.5.4
Loading...
Searching...
No Matches
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.

_Alloc_base(allocator_type const &__A) (defined in KDTree::_Alloc_base< _Tp, _Alloc >)KDTree::_Alloc_base< _Tp, _Alloc >inlineprotected
_Base typedef (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >protected
_Base_const_ptr typedef (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >protected
_Base_ptr typedef (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >protected
_Link_const_type typedef (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >protected
_Link_type typedef (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >protected
_M_acc (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >protected
_M_allocate_node() (defined in KDTree::_Alloc_base< _Tp, _Alloc >)KDTree::_Alloc_base< _Tp, _Alloc >inlineprotected
_M_check_children(_Link_const_type child, _Link_const_type parent, size_type const level, bool to_the_left) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotected
_M_check_node(_Link_const_type node, size_type const level) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotected
_M_cmp (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >protected
_M_construct_node(_Node_ *__p, _Tp const __V=_Tp(), _Base_ptr const __PARENT=NULL, _Base_ptr const __LEFT=NULL, _Base_ptr const __RIGHT=NULL) (defined in KDTree::_Alloc_base< _Tp, _Alloc >)KDTree::_Alloc_base< _Tp, _Alloc >inlineprotected
_M_count (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >protected
_M_count_within_range(_Link_const_type __N, _Region_ const &__REGION, _Region_ const &__BOUNDS, size_type const __L) const (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotected
_M_deallocate_node(_Node_ *const __P) (defined in KDTree::_Alloc_base< _Tp, _Alloc >)KDTree::_Alloc_base< _Tp, _Alloc >inlineprotected
_M_delete_node(_Link_type __p) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotected
_M_destroy_node(_Node_ *__p) (defined in KDTree::_Alloc_base< _Tp, _Alloc >)KDTree::_Alloc_base< _Tp, _Alloc >inlineprotected
_M_dist (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >protected
_M_empty_initialise() (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotected
_M_erase(_Link_type dead_dad, size_type const level) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotected
_M_erase_subtree(_Link_type __n) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotected
_M_find(_Link_const_type node, const_reference value, size_type const level) const (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotected
_M_find_exact(_Link_const_type node, const_reference value, size_type const level) const (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotected
_M_find_within_range(_OutputIterator out, _Link_const_type __N, _Region_ const &__REGION, _Region_ const &__BOUNDS, size_type const __L) const (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotected
_M_get_erase_replacement(_Link_type node, size_type const level) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotected
_M_get_j_max(std::pair< _Link_type, size_type > const node, size_type const level) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotected
_M_get_j_min(std::pair< _Link_type, size_type > const node, size_type const level) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotected
_M_get_leftmost() const (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotected
_M_get_rightmost() const (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotected
_M_get_root() const (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotected
_M_get_root() (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotected
_M_header (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >protected
_M_insert(_Link_type __N, const_reference __V, size_type const __L) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotected
_M_insert_left(_Link_type __N, const_reference __V) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotected
_M_insert_right(_Link_type __N, const_reference __V) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotected
_M_matches_node(_Link_const_type __N, const_reference __V, size_type __L=0) const (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotected
_M_matches_node_in_d(_Link_const_type __N, const_reference __V, size_type const __L) const (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotected
_M_matches_node_in_other_ds(_Link_const_type __N, const_reference __V, size_type const __L=0) const (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotected
_M_new_node(const_reference __V, _Base_ptr const __PARENT=NULL, _Base_ptr const __LEFT=NULL, _Base_ptr const __RIGHT=NULL) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotected
_M_node_allocator (defined in KDTree::_Alloc_base< _Tp, _Alloc >)KDTree::_Alloc_base< _Tp, _Alloc >protected
_M_optimise(_Iter const &__A, _Iter const &__B, size_type const __L) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotected
_M_root (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >protected
_M_set_leftmost(_Node_base *a) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotected
_M_set_rightmost(_Node_base *a) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotected
_M_set_root(_Link_type n) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotected
_M_visit_within_range(Visitor visitor, _Link_const_type N, _Region_ const &REGION, _Region_ const &BOUNDS, size_type const L) const (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotected
_Node_ typedef (defined in KDTree::_Alloc_base< _Tp, _Alloc >)KDTree::_Alloc_base< _Tp, _Alloc >protected
_Node_compare_ typedef (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >protected
_Region_ typedef (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
_S_is_leaf(_Base_const_ptr N) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotectedstatic
_S_left(_Base_ptr N) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotectedstatic
_S_left(_Base_const_ptr N) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotectedstatic
_S_maximum(_Link_const_type __X) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotectedstatic
_S_minimum(_Link_const_type __X) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotectedstatic
_S_parent(_Base_ptr N) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotectedstatic
_S_parent(_Base_const_ptr N) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotectedstatic
_S_right(_Base_ptr N) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotectedstatic
_S_right(_Base_const_ptr N) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotectedstatic
_S_set_left(_Base_ptr N, _Base_ptr l) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotectedstatic
_S_set_parent(_Base_ptr N, _Base_ptr p) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotectedstatic
_S_set_right(_Base_ptr N, _Base_ptr r) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotectedstatic
_S_value(_Link_const_type N) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotectedstatic
_S_value(_Base_const_ptr N) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inlineprotectedstatic
allocator_type typedef (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >protected
begin() const (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
check_tree() (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
clear() (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
const_iterator typedef (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
const_pointer typedef (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
const_reference typedef (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
const_reverse_iterator typedef (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
count_within_range(const_reference __V, subvalue_type const __R) const (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
count_within_range(_Region_ const &__REGION) const (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
difference_type typedef (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
distance_type typedef (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
efficient_replace_and_optimise(std::vector< value_type > &writable_vector) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
empty() const (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
end() const (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
erase(const_reference __V) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
erase(const_iterator const &__IT) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
erase_exact(const_reference __V) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
find(SearchVal const &__V) const (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
find_exact(SearchVal const &__V) const (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
find_nearest(SearchVal const &__val) const (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
find_nearest(SearchVal const &__val, distance_type __max) const (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
find_nearest_if(SearchVal const &__val, distance_type __max, _Predicate __p) const (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
find_within_range(SearchVal const &val, subvalue_type const range, _OutputIterator out) const (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
find_within_range(_Region_ const &region, _OutputIterator out) const (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
find_within_range_iterative(const_reference __a, const_reference __b) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
get_allocator() const (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
insert(iterator, const_reference __V) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
insert(const_reference __V) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
insert(_InputIterator __first, _InputIterator __last) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
insert(iterator __pos, size_type __n, const value_type &__x) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
insert(iterator __pos, _InputIterator __first, _InputIterator __last) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
iterator typedef (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)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()) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
KDTree(const KDTree &__x) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
KDTree(_InputIterator __first, _InputIterator __last, _Acc const &acc=_Acc(), _Dist const &__dist=_Dist(), _Cmp const &__cmp=_Cmp(), const allocator_type &__a=allocator_type()) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
max_size() const (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
operator=(const KDTree &__x) (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
optimise() (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
optimize() (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
pointer typedef (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
rbegin() const (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
reference typedef (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
rend() const (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
reverse_iterator typedef (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
size() const (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
size_type typedef (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
subvalue_type typedef (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
value_acc() constKDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
value_comp() constKDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
value_distance() constKDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
value_distance() (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
value_type typedef (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >
visit_within_range(SearchVal const &V, subvalue_type const R, Visitor visitor) const (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
visit_within_range(_Region_ const &REGION, Visitor visitor) const (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline
~KDTree() (defined in KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >)KDTree::KDTree< __K, _Val, _Acc, _Dist, _Cmp, _Alloc >inline