Simple single-linked list.
More...
|
void | add (T *e) |
| Add an element to the front of the list.
|
|
void | push_front (T *e) |
| Add an element to the front of the list.
|
|
T * | pop_front () |
| Remove and return the head element of the list. More...
|
|
bool | empty () const |
| Check if the list is empty.
|
|
Value_type | front () const |
| Return the first element in the list.
|
|
void | clear () |
| Remove all elements from the list. More...
|
|
Iterator | begin () |
| Return an iterator to the beginning of the list.
|
|
Const_iterator | begin () const |
| Return a const iterator to the beginning of the list.
|
|
Const_iterator | end () const |
| Return a const iterator to the end of the list.
|
|
Iterator | end () |
| Return an iterator to the end of the list.
|
|
|
static Const_iterator | iter (Const_value_type c) |
| Return a const iterator that begins at the given element. More...
|
|
POLICY::Head_type | _f |
| Pointer to front of the list.
|
|
template<typename T, typename POLICY = Bits::Basic_list_policy< T, S_list_item >>
class cxx::S_list< T, POLICY >
Simple single-linked list.
- Template Parameters
-
T | Type of elements saved in the list. Must inherit from cxx::S_list_item |
Definition at line 50 of file slist.
◆ pop_front()
template<typename T, typename POLICY = Bits::Basic_list_policy< T, S_list_item >>
Remove and return the head element of the list.
- Precondition
- The list must not be empty or the behaviour will be undefined.
Definition at line 91 of file slist.
The documentation for this class was generated from the following file: