|
void | add (const T &value) |
|
template<class CC > |
void | addAll (const CC &coll) |
|
| GenTree (void) |
|
| GenTree (const GenTree< T > &tree) |
|
| ~GenTree (void) |
|
T * | get (const typename IdAdapter< T >::key_t &key) |
|
const T * | get (const typename IdAdapter< T >::key_t &key) const |
|
int | count (void) const |
|
bool | contains (const typename IdAdapter< T >::key_t &item) const |
|
bool | isEmpty (void) const |
|
| operator bool (void) const |
|
bool | containsAll (const Co< T > &coll) const |
|
void | clear (void) |
|
void | copy (const GenTree< T, IdAdapter< T >, C > &tree) |
|
GenTree< T, IdAdapter< T >, C > & | operator= (const GenTree< T, IdAdapter< T >, C > &tree) |
|
void | add (const T &item) |
|
void | set (const T &item) |
|
void | remove (const typename IdAdapter< T >::key_t &item) |
|
void | remove (const Iterator &iter) |
|
void | addAll (const CC &coll) |
|
void | removeAll (const CC &coll) |
|
bool | equals (const GenTree< T, IdAdapter< T >, C > &tree) const |
|
bool | operator== (const GenTree< T, IdAdapter< T >, C > &tree) const |
|
bool | operator!= (const GenTree< T, IdAdapter< T >, C > &tree) const |
|
template<class T, class C = elm::Comparator<T>>
class elm::avl::Set< T, C >
Implements a set collection based on an AVL tree, that is, supporting access and modifications with a O(log n) complexity.
- Implemented concepts
- elm::concept::Collection<T>
- elm::concept::MutableCollection<T>
- elm::concept::Set<T>
- Parameters
-
T | Type of stored items. |
C | Comparator used to sort the items (must implements the elm::concept::Comparator<T> concept, as a default elm::Comparator<T>). |
- See also
- elm::avl::GenTree