Elm  2
ELM is a library providing generic data structures, OS-independent interface, plugins and XML.
GenTree< T, K, C, A > Member List

This is the complete list of members for GenTree< T, K, C, A >, including all inherited members.

_cntAbstractTreeprotected
_rootAbstractTreeprotected
AbstractTree(void)AbstractTreeinlineprotected
add(const T &item)GenTree< T, K, C, A >inline
addAll(const CC &c)GenTree< T, K, C, A >inline
alloc() constDefaultAllocatorDelegateinline
allocate(t::size size) constDefaultAllocatorDelegateinline
allocator() constGenTree< T, K, C, A >inline
allocator()GenTree< T, K, C, A >inline
balance_t typedefAbstractTreeprotected
begin(void) constGenTree< T, K, C, A >inline
clear(void)GenTree< T, K, C, A >inline
comparator() constGenTree< T, K, C, A >inline
comparator()GenTree< T, K, C, A >inline
compare(const typename K::key_t &k1, const typename K::key_t &k2) constGenTree< T, K, C, A >inlineprotected
Comparator< typename IdAdapter< T > ::key_t >::compare(const typename IdAdapter< T > ::key_t &v1, const typename IdAdapter< T > ::key_t &v2)Comparator< typename IdAdapter< T > ::key_t >inlinestatic
contains(const typename K::key_t &item) constGenTree< T, K, C, A >inline
containsAll(const CC &c) constGenTree< T, K, C, A >inline
copy(const GenTree< T, K, C > &tree)GenTree< T, K, C, A >inline
count(void) constGenTree< T, K, C, A >inline
dir_t enum nameAbstractTreeprotected
doCompare(const typename IdAdapter< T > ::key_t &v1, const typename IdAdapter< T > ::key_t &v2) constComparator< typename IdAdapter< T > ::key_t >inline
end(void) constGenTree< T, K, C, A >inline
equals(const GenTree< T, K, C > &tree) constGenTree< T, K, C, A >inline
exchange(Node *n, Node *p)GenTree< T, K, C, A >inlineprotected
elm::avl::AbstractTree::exchange(Node *n, Node *m)AbstractTreeprotected
find(const typename K::key_t &key) constGenTree< T, K, C, A >inlineprotected
free(t::ptr p) constDefaultAllocatorDelegateinline
GenTree(void)GenTree< T, K, C, A >inline
GenTree(const GenTree< T > &tree)GenTree< T, K, C, A >inline
get(const typename K::key_t &key)GenTree< T, K, C, A >inline
get(const typename K::key_t &key) constGenTree< T, K, C, A >inline
insert(Stack &stack, Node *node)AbstractTreeprotected
isEmpty(void) constGenTree< T, K, C, A >inline
LEFT enum valueAbstractTreeprotected
leftMost(Stack &s, Node *n)AbstractTreeprotected
link(const Stack &s)AbstractTreeprotected
lookup(Stack &s, const typename K::key_t &key) constGenTree< T, K, C, A >inlineprotected
MAX_HEIGHTAbstractTreeprotectedstatic
NONE enum valueAbstractTreeprotected
operator bool(void) constGenTree< T, K, C, A >inline
operator!=(const GenTree< T, K, C > &tree) constGenTree< T, K, C, A >inline
operator+=(const T &x)GenTree< T, K, C, A >inline
operator-=(const T &x)GenTree< T, K, C, A >inline
operator=(const GenTree< T, K, C > &tree)GenTree< T, K, C, A >inline
operator==(const GenTree< T, K, C > &tree) constGenTree< T, K, C, A >inline
remove(const T &x)GenTree< T, K, C, A >inline
remove(const Iter &iter)GenTree< T, K, C, A >inline
remove(Stack &s, Node *n)GenTree< T, K, C, A >inlineprotected
elm::avl::AbstractTree::remove(Stack &stack, Node *n)AbstractTreeprotected
removeAll(const CC &c)GenTree< T, K, C, A >inline
removeByKey(const typename K::key_t &item)GenTree< T, K, C, A >inline
RIGHT enum valueAbstractTreeprotected
root(void) constGenTree< T, K, C, A >inlineprotected
rotateLeft(Stack &s)AbstractTreeprotected
rotateRight(Stack &s)AbstractTreeprotected
self_t typedefGenTree< T, K, C, A >
set(const T &item)GenTree< T, K, C, A >inline
t typedefGenTree< T, K, C, A >
~GenTree(void)GenTree< T, K, C, A >inline