![]() |
Elm
2
ELM is a library providing generic data structures, OS-independent interface, plugins and XML.
|
#include <elm/data/TreeBag.h>
Inheritance diagram for TreeBag< T, C, A >:Classes | |
| class | Iter |
Public Member Functions | |
| TreeBag () | |
| TreeBag (const TreeBag< T, C > &t) | |
| ~TreeBag (void) | |
| const C & | comparator () const |
| C & | comparator () |
| A & | allocator () |
| int | count (void) const |
| bool | contains (const T &x) const |
| bool | isEmpty (void) const |
| operator bool (void) const | |
| template<class CC > | |
| bool | containsAll (const CC &c) const |
| Iter | begin () const |
| Iter | end () const |
| bool | equals (const TreeBag< T, C > &t) const |
| bool | operator== (const TreeBag< T, C > &t) const |
| bool | operator!= (const TreeBag< T, C > &t) const |
| void | clear (void) |
| void | add (const T &x) |
| template<class CC > | |
| void | addAll (const CC &c) |
| void | remove (const T &x) |
| template<class CC > | |
| void | removeAll (const CC &c) |
| void | remove (const Iter &iter) |
| void | copy (const TreeBag< T, C > &t) |
| const T * | find (const T &x) const |
Public Member Functions inherited from Comparator< T > | |
| int | doCompare (const T &v1, const T &v2) const |
Public Member Functions inherited from DefaultAllocatorDelegate | |
| t::ptr | allocate (t::size size) const |
| void | free (t::ptr p) const |
| template<class T > | |
| T * | alloc () const |
Additional Inherited Members | |
Public Types inherited from Comparator< T > | |
| typedef T | t |
Static Public Member Functions inherited from Comparator< T > | |
| static int | compare (const T &v1, const T &v2) |
|
inline |
References TreeBag< T, C, A >::copy().
References TreeBag< T, C, A >::clear().
|
inline |
References BinTree::root(), and BinTree::setRoot().
Referenced by TreeBag< T, C, A >::addAll(), and TreeMap< K, T, C, E, A >::put().
|
inline |
References TreeBag< T, C, A >::add().
Referenced by TreeBag< T, C, A >::copy().
|
inline |
Referenced by TreeMap< K, T, C, E, A >::allocator().
Referenced by TreeMap< K, T, C, E, A >::begin().
References VectorQueue< T, E >::get(), TreeBag< T, C, A >::isEmpty(), VectorQueue< T, E >::put(), and BinTree::root().
Referenced by TreeBag< T, C, A >::~TreeBag(), and TreeBag< T, C, A >::copy().
|
inline |
|
inline |
Referenced by TreeMap< K, T, C, E, A >::comparator(), and TreeBag< T, C, A >::equals().
|
inline |
References TreeBag< T, C, A >::find().
Referenced by TreeBag< T, C, A >::containsAll(), and TreeMap< K, T, C, E, A >::hasKey().
|
inline |
References TreeBag< T, C, A >::contains().
References TreeBag< T, C, A >::addAll(), and TreeBag< T, C, A >::clear().
Referenced by TreeBag< T, C, A >::TreeBag().
|
inline |
Referenced by TreeMap< K, T, C, E, A >::count().
Referenced by TreeMap< K, T, C, E, A >::end().
References TreeBag< T, C, A >::comparator().
Referenced by TreeBag< T, C, A >::operator!=(), and TreeBag< T, C, A >::operator==().
|
inline |
References BinTree::root().
Referenced by TreeMap< K, T, C, E, A >::contains(), TreeBag< T, C, A >::contains(), and TreeMap< K, T, C, E, A >::get().
References BinTree::isEmpty().
Referenced by TreeBag< T, C, A >::clear(), TreeMap< K, T, C, E, A >::isEmpty(), and TreeBag< T, C, A >::operator bool().
References TreeBag< T, C, A >::isEmpty().
References TreeBag< T, C, A >::equals().
References TreeBag< T, C, A >::equals().
References TreeBag< T, C, A >::remove().
Referenced by TreeBag< T, C, A >::remove().
|
inline |
References elm::io::left(), IntFormat::left(), elm::io::right(), IntFormat::right(), and BinTree::root().
Referenced by TreeMap< K, T, C, E, A >::remove(), and TreeBag< T, C, A >::removeAll().
|
inline |
References TreeBag< T, C, A >::remove().