Elm
1.0
ELM is a library providing generic data structures, OS-independent interface, plugins and XML.
|
#include </home/casse/otawa/elm/src/concepts.h>
Public Member Functions | |
const T & | first (void) |
const T & | last (void) |
Iterator< T > | find (const T &item) |
Iterator< T > | find (const T &item, const Iterator &start) |
Public Member Functions inherited from elm::concept::Collection< T > | |
int | count (void) |
bool | contains (const T &item) |
bool | containsAll (const C< T > &collection) |
bool | isEmpty (void) |
operator bool (void) | |
A list is an ordered sequence of items. It implements the Collection concept but the iterator traverse the list in the sequence of the items.
Iterator<T> elm::concept::List< T >::find | ( | const T & | item | ) |
Find the iterator of the item equal to the given one in the list.
item | Item to look for. |
Iterator<T> elm::concept::List< T >::find | ( | const T & | item, |
const Iterator & | start | ||
) |
Find the iterator of the item equal to the given one in the list.
item | Item to look for. |
iter | Position to start from. |
const T& elm::concept::List< T >::first | ( | void | ) |
Get the first item of the list.
const T& elm::concept::List< T >::last | ( | void | ) |
Get the last item of the list.