![]() |
Elm
2
ELM is a library providing generic data structures, OS-independent interface, plugins and XML.
|
#include <elm/avl/Map.h>
Inheritance diagram for Map< K, T, C, E, A >:Classes | |
| class | Iter |
| class | KeyIter |
| class | PairIter |
Public Types | |
| typedef Map< K, T, C, E, A > | self_t |
Public Types inherited from Equiv< T > | |
| typedef T | t |
Public Member Functions | |
| 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) |
Public Member Functions inherited from Equiv< T > | |
| bool | isEqual (const T &v1, const T &v2) const |
Additional Inherited Members | |
Static Public Member Functions inherited from Equiv< T > | |
| static bool | equals (const T &v1, const T &v2) |
Static Public Attributes inherited from Equiv< T > | |
| static Equiv< T > | def |
Implements a map based on AVL tree, that is, a map supporting O(log n) accesses.
| K | Type of keys of the map. |
| T | Type of stored items. |
| C | Comparator used to sort the items (must implements the elm::concept::Comparator<K> concept, as a default elm::Comparator<K>). |
|
inline |
References GenTree< T, K, C, A >::allocator().
|
inline |
References GenTree< T, K, C, A >::allocator().
References GenTree< T, K, C, A >::clear().
|
inline |
References GenTree< T, K, C, A >::comparator().
|
inline |
References GenTree< T, K, C, A >::comparator().
|
inline |
Referenced by Map< K, T, C, E, A >::containsAll().
|
inline |
References Map< K, T, C, E, A >::contains().
References GenTree< T, K, C, A >::copy(), and elm::map().
Referenced by Map< K, T, C, E, A >::operator=().
|
inline |
References GenTree< T, K, C, A >::count().
References GenTree< T, K, C, A >::equals(), and elm::map().
Referenced by Map< K, T, C, E, A >::operator!=(), and Map< K, T, C, E, A >::operator==().
|
inline |
|
inline |
|
inline |
References GenTree< T, K, C, A >::get(), elm::none, elm::io::p(), and elm::some().
|
inline |
References Equiv< T >::def, GenTree< T, K, C, A >::get(), and elm::io::p().
|
inline |
References GenTree< T, K, C, A >::get(), and elm::io::p().
References GenTree< T, K, C, A >::isEmpty().
Referenced by Map< K, T, C, E, A >::operator bool().
References elm::subiter().
|
inline |
References Map< K, T, C, E, A >::isEmpty().
References Map< K, T, C, E, A >::equals(), and elm::map().
References Map< K, T, C, E, A >::copy(), and elm::map().
References Map< K, T, C, E, A >::equals(), and elm::map().
|
inline |
References GenTree< T, K, C, A >::get(), and Pair< T1, T2 >::snd.
References elm::subiter().
|
inline |
References GenTree< T, K, C, A >::set().
Referenced by SegmentBuilder< K, T, C >::add().
References Map< K, T, C, E, A >::Iter::item(), and GenTree< T, K, C, A >::remove().
|
inline |
References GenTree< T, K, C, A >::removeByKey().