| OpenMS 2.5.0

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

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

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