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

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

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