Non-intrusive doubly-linked list. More...
#include <OpenFOAM/DLList.H>
Non-intrusive doubly-linked list.
Inheritance diagram for DLList< T >: Collaboration diagram for DLList< T >:Public Member Functions | |
| DLList () | |
| Null construct. | |
| DLList (T a) | |
| Construct given initial T. | |
| DLList (Istream &is) | |
| Construct from Istream. | |
| Public Member Functions inherited from LList< DLListBase, T > | |
| LList () | |
| Null construct. | |
| LList (T a) | |
| Construct given initial T. | |
| LList (Istream &) | |
| Construct from Istream. | |
| LList (const LList< DLListBase, T > &) | |
| Construct as copy. | |
| ~LList () | |
| T & | first () |
| Return the first entry added. | |
| const T & | first () const |
| Return const access to the first entry added. | |
| T & | last () |
| Return the last entry added. | |
| const T & | last () const |
| Return const access to the last entry added. | |
| void | insert (const T &a) |
| Add at head of list. | |
| void | append (const T &a) |
| Add at tail of list. | |
| T | removeHead () |
| Remove and return head. | |
| T | remove (link *l) |
| Remove and return element. | |
| T | remove (iterator &it) |
| Remove and return element specified by iterator. | |
| void | clear () |
| Delete contents of list. | |
| void | transfer (LList< DLListBase, T > &) |
| Transfer the contents of the argument into this List. | |
| void | operator= (const LList< DLListBase, T > &) |
| Public Member Functions inherited from DLListBase | |
| DLListBase () | |
| Null construct. | |
| DLListBase (link *) | |
| Construct given initial entry. | |
| ~DLListBase () | |
| label | size () const |
| Return number of elements in list. | |
| bool | empty () const |
| Return true if the list is empty. | |
| void | insert (link *) |
| Add at head of list. | |
| void | append (link *) |
| Add at tail of list. | |
| bool | swapUp (link *) |
| Swap this element with the one above unless it is at the top. | |
| bool | swapDown (link *) |
| Swap this element with the one below unless it is at the bottom. | |
| link * | replace (link *oldLink, link *newLink) |
| Replace oldLink with newLink and return element. | |
| link * | replace (iterator &oldIter, link *newLink) |
| Replace oldIter with newLink and return element. | |
| void | transfer (DLListBase &) |
| Transfer the contents of the argument into this List. | |
| iterator | begin () |
| const iterator & | end () |
| const_iterator | cbegin () const |
| const const_iterator & | cend () const |
| const_iterator | begin () const |
| const const_iterator & | end () const |
Additional Inherited Members | |
| Public Types inherited from LList< DLListBase, T > | |
| typedef T | value_type |
| Type of values the LList contains. | |
| typedef T & | reference |
| Type that can be used for storing into value_type. | |
| typedef const T & | const_reference |
| Type that can be used for storing into constant. | |
| typedef label | size_type |
| The type that can represent the size of a LList. | |
| typedef DLListBase::iterator | LListBase_iterator |
| typedef DLListBase::const_iterator | LListBase_const_iterator |
