68 last_ = last_->
next_ = item;
72 last_ = item->
next_ = item;
84 <<
"remove from empty list"
113 for (iter.
next(); iter != end(); iter.
next())
unsigned int remove()
Remove and return the last element.
A primitive non-const node iterator.
void next()
Move forward through list.
link * get_node() const noexcept
The storage node.
link * removeHead()
Remove and return first entry.
void prepend(link *item)
Add at front of list.
bool append() const noexcept
True if output format uses an append mode.
#define FatalErrorInFunction
Report an error message using Foam::FatalError.
errorManip< error > abort(error &err)
The structure for a singly-linked storage node.
link * next_
Pointer to next entry in list.