Elm
2
ELM is a library providing generic data structures, OS-independent interface, plugins and XML.
|
This is the complete list of members for GenTree< T, K, C, A >, including all inherited members.
_cnt | AbstractTree | protected |
_root | AbstractTree | protected |
AbstractTree(void) | AbstractTree | inlineprotected |
add(const T &item) | GenTree< T, K, C, A > | inline |
addAll(const CC &c) | GenTree< T, K, C, A > | inline |
alloc() const | DefaultAllocatorDelegate | inline |
allocate(t::size size) const | DefaultAllocatorDelegate | inline |
allocator() const | GenTree< T, K, C, A > | inline |
allocator() | GenTree< T, K, C, A > | inline |
balance_t typedef | AbstractTree | protected |
begin(void) const | GenTree< T, K, C, A > | inline |
clear(void) | GenTree< T, K, C, A > | inline |
comparator() const | GenTree< 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) const | GenTree< 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) const | GenTree< T, K, C, A > | inline |
containsAll(const CC &c) const | GenTree< T, K, C, A > | inline |
copy(const GenTree< T, K, C > &tree) | GenTree< T, K, C, A > | inline |
count(void) const | GenTree< T, K, C, A > | inline |
dir_t enum name | AbstractTree | protected |
doCompare(const typename IdAdapter< T > ::key_t &v1, const typename IdAdapter< T > ::key_t &v2) const | Comparator< typename IdAdapter< T > ::key_t > | inline |
end(void) const | GenTree< T, K, C, A > | inline |
equals(const GenTree< T, K, C > &tree) const | GenTree< T, K, C, A > | inline |
exchange(Node *n, Node *p) | GenTree< T, K, C, A > | inlineprotected |
elm::avl::AbstractTree::exchange(Node *n, Node *m) | AbstractTree | protected |
find(const typename K::key_t &key) const | GenTree< T, K, C, A > | inlineprotected |
free(t::ptr p) const | DefaultAllocatorDelegate | inline |
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) const | GenTree< T, K, C, A > | inline |
insert(Stack &stack, Node *node) | AbstractTree | protected |
isEmpty(void) const | GenTree< T, K, C, A > | inline |
LEFT enum value | AbstractTree | protected |
leftMost(Stack &s, Node *n) | AbstractTree | protected |
link(const Stack &s) | AbstractTree | protected |
lookup(Stack &s, const typename K::key_t &key) const | GenTree< T, K, C, A > | inlineprotected |
MAX_HEIGHT | AbstractTree | protectedstatic |
NONE enum value | AbstractTree | protected |
operator bool(void) const | GenTree< T, K, C, A > | inline |
operator!=(const GenTree< T, K, C > &tree) const | GenTree< 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) const | GenTree< 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) | AbstractTree | protected |
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 value | AbstractTree | protected |
root(void) const | GenTree< T, K, C, A > | inlineprotected |
rotateLeft(Stack &s) | AbstractTree | protected |
rotateRight(Stack &s) | AbstractTree | protected |
self_t typedef | GenTree< T, K, C, A > | |
set(const T &item) | GenTree< T, K, C, A > | inline |
t typedef | GenTree< T, K, C, A > | |
~GenTree(void) | GenTree< T, K, C, A > | inline |