A FIFO stack based on a singly-linked list.
T & first()
Return the first entry added.
An Istream is an abstract base class for all input systems (streams, files, token lists etc)...
T bottom() const
Return a copy of the bottom element.
FIFOStack()
Construct null.
T top() const
Return a copy of the top element.
T removeHead()
Remove and return head.
Non-intrusive singly-linked list.
T & last()
Return the last entry added.
void T(FieldField< Field, Type > &f1, const FieldField< Field, Type > &f2)
void append(const T &a)
Add at tail of list.
void push(const T &a)
Push an element onto the stack.
T pop()
Pop the bottom element off the stack.