Go to the documentation of this file.
79 void push(
const T& element)
85 void push(
T&& element)
87 this->
append(std::move(element));
void append(const T &item)
Add copy at tail of list.
reference first()
The first entry in the list.
void push(const T &element)
Push an element onto the back of the stack.
Template class for non-intrusive linked lists.
T top() const
Return a copy of the top element.
void T(FieldField< Field, Type > &f1, const FieldField< Field, Type > &f2)
void push(T &&element)
Move an element onto the back of the stack.
T pop()
Pop the bottom element off the stack.
Non-intrusive singly-linked list.
T bottom() const
Return a copy of the bottom element.
reference last()
The last entry in the list.
A FIFO stack based on a singly-linked list.
T removeHead()
Remove and return head.