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

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

add(const T &value)List< T, E, A >inline
addAfter(const Iter &pos, const T &value)List< T, E, A >inline
addAll(const C &items)List< T, E, A >inline
addBefore(PrecIter &pos, const T &value)List< T, E, A >inline
addFirst(const T &value)List< T, E, A >inline
addLast(const T &value)List< T, E, A >inline
alloc() constDefaultAllocatorDelegateinline
allocate(t::size size) constDefaultAllocatorDelegateinline
allocator()List< T, E, A >inline
at(const Iter &i) constList< T, E, A >inline
at(const Iter &i)List< T, E, A >inline
begin(void) constList< T, E, A >inline
clear(void)List< T, E, A >inline
contains(const T &item) constList< T, E, A >inline
copy(const List< T, E, A > &list)List< T, E, A >inline
count(void) constList< T, E, A >inline
defEquiv< T >static
end(void) constList< T, E, A >inline
equals(const List< T > &l) constList< T, E, A >inline
elm::Equiv::equals(const T &v1, const T &v2)Equiv< T >inlinestatic
equivalence()List< T, E, A >inline
equivalence() constList< T, E, A >inline
find(const T &item) constList< T, E, A >inline
find(const T &item, const Iter &pos) constList< T, E, A >inline
first(void)List< T, E, A >inline
first(void) constList< T, E, A >inline
free(t::ptr p) constDefaultAllocatorDelegateinline
isEmpty(void) constList< T, E, A >inline
isEqual(const T &v1, const T &v2) constEquiv< T >inline
items(void) constList< T, E, A >inline
last(void)List< T, E, A >inline
last(void) constList< T, E, A >inline
List()List< T, E, A >inline
List(const List< T, E, A > &list)List< T, E, A >inline
nth(int n)List< T, E, A >inline
nth(int n) constList< T, E, A >inline
nullList< T, E, A >static
operator bool(void) constList< T, E, A >inline
operator Iter(void) constList< T, E, A >inline
operator!=(const List< T > &l) constList< T, E, A >inline
operator&(const T &e) constList< T, E, A >inline
operator*(void) constList< T, E, A >inline
operator+=(const T &h)List< T, E, A >inline
operator+=(const List< T > &l)List< T, E, A >inline
operator-=(const T &h)List< T, E, A >inline
operator-=(const List< T > &l)List< T, E, A >inline
operator=(const List &list)List< T, E, A >inline
operator==(const List< T > &l) constList< T, E, A >inline
operator[](int k)List< T, E, A >inline
operator[](int k) constList< T, E, A >inline
pop(void)List< T, E, A >inline
push(const T &i)List< T, E, A >inline
remove(const T &value)List< T, E, A >inline
remove(PrecIter &iter)List< T, E, A >inline
removeAll(const C &items)List< T, E, A >inline
removeFirst(void)List< T, E, A >inline
removeLast(void)List< T, E, A >inline
reset(void)List< T, E, A >inline
set(const Iter &pos, const T &item)List< T, E, A >inline
t typedefEquiv< T >
top(void) constList< T, E, A >inline
~List(void)List< T, E, A >inline