#include <LinkedList.h>
Inheritance diagram for util::DoublyLinkedList< content >:

It features bidirectional links and can thus be searched in two directions.
Public Methods | |
| DoublyLinkedList (void) | |
| Create an unlinked node. | |
| DoublyLinkedList (const content &obj) | |
| Create an unlinked node with the given contents. | |
| void | setNext (DoublyLinkedList *node) |
| Set the next node for this node. | |
| void | setNext (LinkedList< content > *node) |
| Calls setNext(DoublyLinkedList*). | |
| void | insertAfter (DoublyLinkedList *node) |
| Insert a sequence of nodes after this node. | |
| void | insertAfter (LinkedList< content > *node) |
| Calls insertAfter(DoublyLinkedList*). | |
| void | remove () |
| Remove this node from a linked list. | |
| const DoublyLinkedList * | getFirstElement (void) const |
| Get the first element in this list. | |
| DoublyLinkedList * | getFirstElement (void) |
| Get the first element in this list. | |
Protected Attributes | |
| DoublyLinkedList * | _pPrevious |
| A pointer to the previous element in a sequence. | |
|
||||||||||
|
Get the first element in this list. The sequence is seeked backwards until "getPrevious" returns NULL.
|
|
||||||||||
|
Get the first element in this list. The sequence is seeked backwards until "getPrevious" returns NULL.
|
|
||||||||||
|
Insert a sequence of nodes after this node. Node is set to be the "next" for this node, and the last item in the linked list node is set to be the "previous" of the current "next" node.
|
|
||||||||||
|
Set the next node for this node. The internal pointer to the next node and the "previous" pointer in node are updated.
|