|
const C & | comparator () const |
|
C & | comparator () |
|
const C & | allocatr () const |
|
C & | allocator () |
|
const E & | equivalence () const |
|
E & | equivalence () |
|
int | count (void) const |
|
bool | contains (const T &x) const |
|
template<class CC > |
bool | containsAll (const CC &c) const |
|
bool | isEmpty (void) const |
|
| operator bool () const |
|
Iter | begin () const |
|
Iter | end () const |
|
bool | equals (const Map< K, T, C > &map) const |
|
bool | operator== (const Map< K, T, C > &map) const |
|
bool | operator!= (const Map< K, T, C > &map) const |
|
Option< T > | get (const K &key) const |
|
const T & | get (const K &key, const T &def) const |
|
bool | hasKey (const K &key) const |
|
const T & | operator[] (const K &k) const |
|
Iterable< KeyIter > | keys () const |
|
Iterable< PairIter > | pairs () const |
|
void | put (const K &key, const T &value) |
|
void | remove (const K &key) |
|
void | remove (const Iter &i) |
|
void | clear (void) |
|
void | copy (const Map< K, T, C > &map) |
|
Map< K, T, C > & | operator= (const Map< K, T, C > &map) |
|
bool | isEqual (const T &v1, const T &v2) const |
|
template<class K, class T, class C = Comparator<K>, class E = Equiv<T>, class A = DefaultAlloc>
class elm::avl::Map< K, T, C, E, A >
Implements a map based on AVL tree, that is, a map supporting O(log n) accesses.
- Implemented concepts
-
- Parameters
-
- See also
- elm::avl::GenTree