67 item->next_ = last_->next_;
68 last_ = last_->next_ = item;
72 last_ = item->next_ = item;
82 <<
"remove from empty list"
98 last_->next_ = ret->next_;
109 SLListBase::link *prev = iter.get_node();
116 for (iter.next(); iter !=
end(); iter.next())
124 prev->next_ =
p->next_;
A primitive non-const node iterator.
void next()
Move forward through list.
link * get_node() const noexcept
The storage node.
link * remove(link *item)
const iterator & end()
End of list for iterators.
void push_back(link *item)
Add at back of list.
link * removeHead()
Remove and return first entry.
iterator begin()
Iterator to first item in list with non-const access.
void push_front(link *item)
Add at front of list.
#define FatalErrorInFunction
Report an error message using Foam::FatalError.
errorManip< error > abort(error &err)
error FatalError
Error stream (stdout output on all processes), with additional 'FOAM FATAL ERROR' header text and sta...
The structure for a singly-linked storage node.
link * next_
Pointer to next entry in list.
void deregister() noexcept
Deregister the node (after removal).