Go to the documentation of this file.
68 last_ = last_->
next_ = item;
72 last_ = item->
next_ = item;
84 <<
"remove from empty list"
link * next_
Pointer to next entry in list.
constexpr auto begin(C &c) -> decltype(c.begin())
Return iterator to the beginning of the container c.
link * remove(link *item)
void append(link *item)
Add at tail of list.
link * get_node() const
The storage node.
The structure for a singly-linked storage node.
link * removeHead()
Remove and return head.
void next()
Move forward through list.
constexpr auto end(C &c) -> decltype(c.end())
Return iterator to the end of the container c.
errorManip< error > abort(error &err)
A primitive non-const node iterator.
#define FatalErrorInFunction
Report an error message using Foam::FatalError.
void insert(link *item)
Add at head of list.