Go to the documentation of this file.
47 first_ = last_ = item;
72 first_ = last_ = item;
169 <<
"remove from empty list"
174 first_ = first_->
next_;
192 if (item == first_ && first_ == last_)
197 else if (item == first_)
199 first_ = first_->
next_;
200 first_->
prev_ = first_;
202 else if (item == last_)
204 last_ = last_->
prev_;
205 last_->
next_ = last_;
229 if (oldLink == first_ && first_ == last_)
234 else if (oldLink == first_)
239 else if (oldLink == last_)
bool swapUp(link *item)
Swap this element with the one above unless it is at the top.
link * remove(link *item)
Remove and return element.
void insert(link *item)
Add at head of list.
bool swapDown(link *item)
Swap this element with the one below unless it is at the bottom.
void deregister()
Deregister the node after removal.
The structure for a doubly-linked storage node.
link * prev_
Pointer to prev entry in list.
errorManip< error > abort(error &err)
link * removeHead()
Remove and return head.
#define FatalErrorInFunction
Report an error message using Foam::FatalError.
void append(link *item)
Add at tail of list.
link * replace(link *oldLink, link *newLink)
Replace oldLink with newLink and return element.
link * next_
Pointer to next entry in list.