Intrusive doubly-linked list. More...
#include <OpenFOAM/IDLList.H>
Intrusive doubly-linked list.
Inheritance diagram for IDLList< T >: Collaboration diagram for IDLList< T >:Public Member Functions | |
| IDLList () | |
| Null construct. | |
| IDLList (const T &a) | |
| Construct given initial T. | |
| template<class INew > | |
| IDLList (Istream &is, const INew &inewt) | |
| Construct from Istream using given Istream constructor class. | |
| IDLList (Istream &is) | |
| Construct from Istream. | |
| template<class CloneArg > | |
| IDLList (const IDLList< T > &idll, const CloneArg &cloneArg) | |
| Copy constructor with additional argument for clone. | |
| Public Member Functions inherited from ILList< DLListBase, T > | |
| ILList () | |
| Null construct. | |
| ILList (T *a) | |
| Construct given initial T. | |
| ILList (Istream &) | |
| Construct from Istream. | |
| ILList (const ILList< DLListBase, T > &) | |
| Construct as copy. | |
| ILList (const ILList< DLListBase, T > &lst, const CloneArg &cloneArg) | |
| Copy constructor with additional argument for clone. | |
| ILList (Istream &, const INew &) | |
| Construct from Istream using given Istream constructor class. | |
| ~ILList () | |
| bool | eraseHead () |
| Remove the head element specified from the list and delete it. | |
| bool | erase (T *p) |
| Remove the specified element from the list and delete it. | |
| void | clear () |
| Clear the contents of the list. | |
| void | transfer (ILList< DLListBase, T > &) |
| Transfer the contents of the argument into this List. | |
| void | operator= (const ILList< DLListBase, T > &) |
| Public Member Functions inherited from UILList< DLListBase, T > | |
| UILList () | |
| Null construct. | |
| UILList (T *a) | |
| Construct given initial T. | |
| UILList (const UILList< DLListBase, T > &) | |
| Construct as copy. | |
| T * | first () |
| Return the first entry. | |
| const T * | first () const |
| Return the first entry. | |
| T * | last () |
| Return the last entry. | |
| const T * | last () const |
| Return the last entry. | |
| T * | removeHead () |
| Remove and return head. | |
| T * | remove (T *p) |
| Remove and return element. | |
| T * | remove (iterator &it) |
| Remove and return specified by iterator. | |
| void | operator= (const UILList< DLListBase, T > &) |
| bool | operator== (const UILList< DLListBase, T > &) const |
| Equality operation on ULists of the same type. | |
| bool | operator!= (const UILList< DLListBase, T > &) const |
| The opposite of the equality operation. Takes linear time. | |
| 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 * | remove (link *) |
| Remove and return element. | |
| 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 |
