|
|
void | delist (void) |
| | Remove our object from the list it is currently part of.
|
| void | enlist (OrderedIndex *index) |
| | Attach our object to a linked list.
|
| void | enlistHead (OrderedIndex *index) |
| | Attach our object to the start of a linked list though an ordered index.
|
| void | enlistTail (OrderedIndex *index) |
| | Attach our object to the end of a linked list though an ordered index.
|
| DLinkedObject * | getNext (void) const |
| | Get next node in the list when iterating.
|
| DLinkedObject * | getPrev (void) const |
| | Get previous node in the list for reverse iteration.
|
| virtual void | insert (DLinkedObject *object) |
| | Insert object, method in derived object.
|
| void | insertHead (DLinkedObject *object) |
| | Insert object in front of our object.
|
| void | insertTail (DLinkedObject *object) |
| | Insert object behind our object.
|
| bool | is_head (void) const |
| | Test if we are at the head of a list.
|
| bool | is_tail (void) const |
| | Test if we are at the end of a list.
|
| DLinkedObject & | operator*= (DLinkedObject *object) |
| | Insert object in list with our object.
|
| DLinkedObject & | operator+= (DLinkedObject *object) |
| | Insert object behind our object.
|
| DLinkedObject & | operator-= (DLinkedObject *object) |
| | Insert object in front of our object.
|
| void | delist (OrderedIndex *index) |
| | Remove our ordered object from an existing index.
|
| void | enlistHead (OrderedIndex *index) |
| | List our ordered object at start of a linked list on an index.
|
| void | enlistTail (OrderedIndex *index) |
| | List our ordered object at end of a linked list on an index.
|
| OrderedObject * | getNext (void) const |
| | Get next ordered member when iterating.
|
| void | delist (LinkedObject **root) |
| | Locate and remove ourselves from a list of objects.
|
| void | enlist (LinkedObject **root) |
| | Add our object to an existing linked list through a pointer.
|
| LinkedObject * | getNext (void) const |
| | Get next effective object when iterating.
|
| bool | is_member (LinkedObject *list) const |
| | Search to see if we are a member of a specific list.
|
| virtual void | release (void) |
| | Release list, mark as no longer linked.
|
| virtual void | retain (void) |
| | Retain by marking as self referenced list.
|
|
ObjectProtocol * | copy (void) |
| | Retain (increase retention of) object when copying.
|
| void | operator++ (void) |
| | Increase retention operator.
|
| void | operator-- (void) |
| | Decrease retention operator.
|
|
virtual | ~ObjectProtocol () |
| | Required virtual destructor.
|
|
|
| DLinkedObject () |
| | Construct an unlinked object.
|
|
| DLinkedObject (const DLinkedObject &from) |
| | DLinkedObject (OrderedIndex *index) |
| | Construct and add our object to an existing double linked list at end.
|
| virtual | ~DLinkedObject () |
| | Delete linked list object.
|
|
| OrderedObject () |
| | Construct an ordered object unattached.
|
|
| OrderedObject (const OrderedObject &from) |
| | OrderedObject (OrderedIndex *index) |
| | Construct an ordered object aot end of a an index.
|
| | LinkedObject () |
| | Construct base class unattached to anyone.
|
|
| LinkedObject (const LinkedObject &from) |
| | LinkedObject (LinkedObject **root) |
| | Construct base class attached to a chain of objects.
|
A double linked list object.
This is used as a base class for objects that will be organized through ordered double linked lists which allow convenient insertion and deletion of list members anywhere in the list.
- Author
- David Sugar dyfet.nosp@m.@gnu.nosp@m.telep.nosp@m.hony.nosp@m..org
- Examples
- linked.cpp.
Definition at line 768 of file linked.h.