Elm  2
ELM is a library providing generic data structures, OS-independent interface, plugins and XML.
ListMap< K, T, C, E, A > Member List

This is the complete list of members for ListMap< K, T, C, E, A >, including all inherited members.

begin(void) constListMap< K, T, C, E, A >inline
contains(const T &v) constListMap< K, T, C, E, A >inline
contains(const self_t &m) constListMap< K, T, C, E, A >inline
SortedList< Pair< K, T >, AssocComparator< K, T, Comparator< K > >, DefaultAlloc >::contains(const Pair< K, T > &item) constSortedList< Pair< K, T >, AssocComparator< K, T, Comparator< K > >, DefaultAlloc >inlineprivate
containsAll(const CC &c) constListMap< K, T, C, E, A >inline
count(void) constListMap< K, T, C, E, A >inline
defEquiv< T >static
end(void) constListMap< K, T, C, E, A >inline
equals(const self_t &m) constListMap< K, T, C, E, A >inline
SortedList< Pair< K, T >, AssocComparator< K, T, Comparator< K > >, DefaultAlloc >::equals(const SortedList< Pair< K, T > > &l) constSortedList< Pair< K, T >, AssocComparator< K, T, Comparator< K > >, DefaultAlloc >inlineprivate
elm::Equiv::equals(const T &v1, const T &v2)Equiv< T >inlinestatic
equivalence()ListMap< K, T, C, E, A >inline
get(const K &k) constListMap< K, T, C, E, A >inline
get(const K &k, const T &d) constListMap< K, T, C, E, A >inline
hasKey(const K &k) constListMap< K, T, C, E, A >inline
isEmpty(void) constListMap< K, T, C, E, A >inline
isEqual(const T &v1, const T &v2) constEquiv< T >inline
items(void) constListMap< K, T, C, E, A >inline
keys() constListMap< K, T, C, E, A >inline
ListMap()ListMap< K, T, C, E, A >inline
ListMap(const ListMap< K, T > &l)ListMap< K, T, C, E, A >inline
operator bool(void) constListMap< K, T, C, E, A >inline
operator Iter(void) constListMap< K, T, C, E, A >inline
operator!=(const self_t &m) constListMap< K, T, C, E, A >inline
SortedList< Pair< K, T >, AssocComparator< K, T, Comparator< K > >, DefaultAlloc >::operator!=(const SortedList< Pair< K, T > > &l) constSortedList< Pair< K, T >, AssocComparator< K, T, Comparator< K > >, DefaultAlloc >inlineprivate
operator*(void) constListMap< K, T, C, E, A >inline
operator<(const self_t &m) constListMap< K, T, C, E, A >inline
operator<=(const self_t &m) constListMap< K, T, C, E, A >inline
operator==(const self_t &m) constListMap< K, T, C, E, A >inline
SortedList< Pair< K, T >, AssocComparator< K, T, Comparator< K > >, DefaultAlloc >::operator==(const SortedList< Pair< K, T > > &l) constSortedList< Pair< K, T >, AssocComparator< K, T, Comparator< K > >, DefaultAlloc >inlineprivate
operator>(const self_t &m) constListMap< K, T, C, E, A >inline
operator>=(const self_t &m) constListMap< K, T, C, E, A >inline
PairIter typedefListMap< K, T, C, E, A >
pairs() constListMap< K, T, C, E, A >inline
put(const K &k, const T &v)ListMap< K, T, C, E, A >inline
remove(const Iter &i)ListMap< K, T, C, E, A >inline
remove(const K &k)ListMap< K, T, C, E, A >inline
SortedList< Pair< K, T >, AssocComparator< K, T, Comparator< K > >, DefaultAlloc >::remove(const Pair< K, T > &item)SortedList< Pair< K, T >, AssocComparator< K, T, Comparator< K > >, DefaultAlloc >inlineprivate
SortedList< Pair< K, T >, AssocComparator< K, T, Comparator< K > >, DefaultAlloc >::remove(const Iter &iter)SortedList< Pair< K, T >, AssocComparator< K, T, Comparator< K > >, DefaultAlloc >inlineprivate
self_t typedefListMap< K, T, C, E, A >
t typedefEquiv< T >