Non-intrusive singly-linked list.
A LIFO stack based on a singly-linked list.
T top() const
Return a copy of the top element.
T bottom() const
Return a copy of the bottom element.
void push(const T &a)
Push an element onto the stack.
T pop()
Pop the top element off the stack.
Template class for non-intrusive linked lists.
void insert(const T &a)
Add at head of list.
T & first()
Return the first entry added.
T & last()
Return the last entry added.
T removeHead()
Remove and return head.
void T(FieldField< Field, Type > &f1, const FieldField< Field, Type > &f2)