37 #ifndef Foam_FIFOStack_H 38 #define Foam_FIFOStack_H 79 void push(
const T& elem)
A FIFO stack based on a singly-linked list.
reference front()
The first entry in the list.
Template class for non-intrusive linked lists.
T removeHead()
Remove and return first entry.
void push(const T &elem)
Push an element onto the back of the stack.
void push_back(const T &elem)
Add copy at back of list.
const T & top() const
Const reference to the top element.
void T(FieldField< Field, Type > &f1, const FieldField< Field, Type > &f2)
const T & bottom() const
Const reference to the bottom element.
T pop()
Pop the bottom element off the stack.
Non-intrusive singly-linked list.
reference back()
The last entry in the list.