![]() |
Elm
2
ELM is a library providing generic data structures, OS-independent interface, plugins and XML.
|
#include <elm/data/ListMap.h>
Inheritance diagram for ListMap< K, T, C, E, A >:Classes | |
| class | Iter |
| class | KeyIter |
| class | MutIter |
| class | PreIter |
Public Types | |
| typedef ListMap< K, T, C, E, A > | self_t |
| typedef base_t::Iter | PairIter |
Public Types inherited from Equiv< T > | |
| typedef T | t |
Public Member Functions | |
| ListMap () | |
| ListMap (const self_t &l) | |
| E & | equivalence () |
| Iter | begin () const |
| Iter | end () const |
| int | count (void) const |
| bool | contains (const T &v) const |
| template<class CC > | |
| bool | containsAll (const CC &c) const |
| bool | isEmpty (void) const |
| operator bool (void) const | |
| Iter | items (void) const |
| Iter | operator* (void) const |
| operator Iter (void) const | |
| bool | equals (const self_t &m) const |
| bool | operator== (const self_t &m) const |
| bool | operator!= (const self_t &m) const |
| bool | contains (const self_t &m) const |
| bool | operator<= (const self_t &m) const |
| bool | operator< (const self_t &m) const |
| bool | operator>= (const self_t &m) const |
| bool | operator> (const self_t &m) const |
| Option< T > | get (const K &k) const |
| const T & | get (const K &k, const T &d) const |
| bool | hasKey (const K &k) const |
| Iterable< KeyIter > | keys () const |
| Iterable< PairIter > | pairs () const |
| MutIter | begin () |
| MutIter | end () |
| void | put (const K &k, const T &v) |
| void | remove (const MutIter &i) |
| void | remove (const K &k) |
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 |
Map implemented as a list of sorted pairs. This class is relatively cheap but should not be used with a big number of entries (without enduring severe performances degradation).
For a map of size N, the complexity are:
| K | Type of keys. |
| T | Type of values. |
| M | Manager type (default to ListMapManager). |
| typedef base_t::Iter PairIter |
|
inline |
References SortedList< T, C, A >::contains().
|
inline |
|
inline |
References ListMap< K, T, C, E, A >::contains().
|
inline |
References SortedList< T, C, A >::count().
Referenced by XSLTransform::transformDocument().
|
inline |
|
inline |
References elm::none, and elm::some().
Referenced by Section::get(), and File::get().
|
inline |
|
inline |
Referenced by Section::get(), and Section::isDefined().
References SortedList< T, C, A >::isEmpty().
Referenced by ListMap< K, T, C, E, A >::operator bool().
References ListMap< K, T, C, E, A >::begin().
Referenced by File::~File().
References elm::subiter().
References ListMap< K, T, C, E, A >::isEmpty().
References ListMap< K, T, C, E, A >::begin().
References ListMap< K, T, C, E, A >::equals().
References ListMap< K, T, C, E, A >::begin().
References ListMap< K, T, C, E, A >::contains(), and ListMap< K, T, C, E, A >::equals().
References ListMap< K, T, C, E, A >::contains().
References ListMap< K, T, C, E, A >::equals().
References ListMap< K, T, C, E, A >::contains(), and ListMap< K, T, C, E, A >::equals().
References ListMap< K, T, C, E, A >::contains().
References elm::subiter().
Referenced by XSLTransform::transformDocument().
|
inline |
References SortedList< T, C, A >::add(), elm::pair(), and SortedList< T, C, A >::set().
Referenced by File::load(), and XSLTransform::setParameter().
|
inline |
References SortedList< T, C, A >::remove().
References ListMap< K, T, C, E, A >::PreIter::i, and SortedList< T, C, A >::remove().