67 item->next_ = last_->next_;
68 last_ = last_->next_ = item;
72 last_ = item->next_ = item;
82 <<
"remove from empty list" 90 SLListBase::link *ret = last_->next_;
98 last_->next_ = ret->next_;
109 SLListBase::link *prev = iter.get_node();
116 for (iter.next(); iter !=
end(); iter.next())
118 SLListBase::link *
p = iter.get_node();
124 prev->next_ =
p->next_;
link * next_
Pointer to next entry in list.
error FatalError
Error stream (stdout output on all processes), with additional 'FOAM FATAL ERROR' header text and sta...
#define FatalErrorInFunction
Report an error message using Foam::FatalError.
The structure for a singly-linked storage node.
errorManip< error > abort(error &err)
constexpr auto end(C &c) -> decltype(c.end())
Return iterator to the end of the container c.
void push_front(link *item)
Add at front of list.
link * removeHead()
Remove and return first entry.
constexpr auto begin(C &c) -> decltype(c.begin())
Return iterator to the beginning of the container c.
link * remove(link *item)
void push_back(link *item)
Add at back of list.