#include </home/casse/Dev/elm/src/concepts.h>
template<class T>
class elm::concept::List< T >
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.
- Implemented by:
- elm::List elm::BiDiList
◆ find() [1/2]
Iter<T> find |
( |
const T & |
item | ) |
|
Find the iterator of the item equal to the given one in the list.
- Parameters
-
- Returns
- Iterator on the found item, ended item if not found.
◆ find() [2/2]
Find the iterator of the item equal to the given one in the list.
- Parameters
-
item | Item to look for. |
iter | Position to start from. |
- Returns
- Iterator on the found item, ended item if not found.
◆ first()
const T& first |
( |
void |
| ) |
const |
Get the first item of the list.
- Returns
- First item.
◆ last()
const T& last |
( |
void |
| ) |
const |
Get the last item of the list.
- Returns
- Last item.
◆ nth()
Get the nth item of the list. Calling this function with a i greater than the size of the list is forbidden.
- Parameters
-
i | Index of the requested item. |
- Returns
- Nth element.
◆ operator[]()
const T& operator[] |
( |
int |
i | ) |
const |
Get the ith element. It is an error if this function is call with a i greater than list length.
- Parameters
-
i | Index of looked element. |
- Returns
- ith element.
The documentation for this class was generated from the following file: