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

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

add(const T &v)ListSet< T, C, A >inline
addAll(const CC &c)SortedList< T, Comparator< T >, DefaultAlloc >inline
allocator()SortedList< T, Comparator< T >, DefaultAlloc >inline
at(const Iter &i)SortedList< T, Comparator< T >, DefaultAlloc >inline
begin(void) constSortedList< T, Comparator< T >, DefaultAlloc >inline
clear(void)SortedList< T, Comparator< T >, DefaultAlloc >inline
comparator()SortedList< T, Comparator< T >, DefaultAlloc >inline
comparator() constSortedList< T, Comparator< T >, DefaultAlloc >inline
contains(const T &item) constSortedList< T, Comparator< T >, DefaultAlloc >inline
containsAll(const CC &c) constSortedList< T, Comparator< T >, DefaultAlloc >inline
copy(const SortedList< T > &l)SortedList< T, Comparator< T >, DefaultAlloc >inline
count(void) constSortedList< T, Comparator< T >, DefaultAlloc >inline
diff(const self_t &set)ListSet< T, C, A >inline
end(void) constSortedList< T, Comparator< T >, DefaultAlloc >inline
equals(const SortedList< T > &l) constSortedList< T, Comparator< T >, DefaultAlloc >inline
find(const T &item, const Iter &iter) constSortedList< T, Comparator< T >, DefaultAlloc >inline
find(const T &item) constSortedList< T, Comparator< T >, DefaultAlloc >inline
first(void) constSortedList< T, Comparator< T >, DefaultAlloc >inline
insert(const T &v)ListSet< T, C, A >inline
isEmpty(void) constSortedList< T, Comparator< T >, DefaultAlloc >inline
items(void) constSortedList< T, Comparator< T >, DefaultAlloc >inline
join(const self_t &set)ListSet< T, C, A >inline
last(void) constSortedList< T, Comparator< T >, DefaultAlloc >inline
listSortedList< T, Comparator< T >, DefaultAlloc >protected
list_t typedefSortedList< T, Comparator< T >, DefaultAlloc >protected
ListSet(void)ListSet< T, C, A >inline
ListSet(const ListSet< T, C > &set)ListSet< T, C, A >inline
meet(const self_t &set)ListSet< T, C, A >inline
nth(int n) constSortedList< T, Comparator< T >, DefaultAlloc >inline
operator bool(void) constSortedList< T, Comparator< T >, DefaultAlloc >inline
operator Iter(void) constSortedList< T, Comparator< T >, DefaultAlloc >inline
operator!=(const SortedList< T > &l) constSortedList< T, Comparator< T >, DefaultAlloc >inline
operator&(const self_t &set)ListSet< T, C, A >inline
SortedList< T, Comparator< T >, DefaultAlloc >::operator&(const T &e) constSortedList< T, Comparator< T >, DefaultAlloc >inline
operator&=(const self_t &set)ListSet< T, C, A >inline
operator*(const self_t &set)ListSet< T, C, A >inline
SortedList< T, Comparator< T >, DefaultAlloc >::operator*(void) constSortedList< T, Comparator< T >, DefaultAlloc >inline
operator*=(const self_t &set)ListSet< T, C, A >inline
operator+(const self_t &set)ListSet< T, C, A >inline
operator+=(const self_t &set)ListSet< T, C, A >inline
operator+=(const T &val)ListSet< T, C, A >inline
operator-(const self_t &set)ListSet< T, C, A >inline
operator-=(const self_t &set)ListSet< T, C, A >inline
operator-=(const T &val)ListSet< T, C, A >inline
operator<(const SortedList< T > &l) constListSet< T, C, A >inline
operator<=(const SortedList< T > &l) constListSet< T, C, A >inline
operator=(const SortedList< T, Comparator< T > > &sl)SortedList< T, Comparator< T >, DefaultAlloc >inline
operator==(const SortedList< T > &l) constSortedList< T, Comparator< T >, DefaultAlloc >inline
operator>(const SortedList< T > &l) constListSet< T, C, A >inline
operator>=(const SortedList< T > &l) constListSet< T, C, A >inline
operator[](int k)SortedList< T, Comparator< T >, DefaultAlloc >inline
operator[](int k) constSortedList< T, Comparator< T >, DefaultAlloc >inline
operator|(const self_t &set)ListSet< T, C, A >inline
operator|=(const self_t &set)ListSet< T, C, A >inline
remove(const T &item)SortedList< T, Comparator< T >, DefaultAlloc >inline
remove(const Iter &iter)SortedList< T, Comparator< T >, DefaultAlloc >inline
removeAll(const CC &c)SortedList< T, Comparator< T >, DefaultAlloc >inline
removeFirst(void)SortedList< T, Comparator< T >, DefaultAlloc >inline
removeLast(void)SortedList< T, Comparator< T >, DefaultAlloc >inline
self_t typedefListSet< T, C, A >
set(Iter i, const T &val)SortedList< T, Comparator< T >, DefaultAlloc >inlineprotected
SortedList(void)SortedList< T, Comparator< T >, DefaultAlloc >inline
SortedList(const SortedList< T, Comparator< T >, DefaultAlloc > &l)SortedList< T, Comparator< T >, DefaultAlloc >inline
subsetOf(const SortedList< T > &l) constListSet< T, C, A >inline
t typedefListSet< T, C, A >