54 class CircularLinkList;
107 template <
typename T>
182 void*
operator new(
size_t sz,
void* pv) {
return reinterpret_cast<DoubleLinkList*
>(pv); };
256 void PivotBackward();
275 template <
typename T>
346 template <
typename T>
void Add(LinkListNode *node_)
Add the linked list node to this linked list.
void SetHead(T *pclNode_)
SetHead Set the head node of a linked list.
The TypedDoubleLinkList Class Doubly-linked-list data type, inherited from the base LinkList type...
Basic data type primatives used throughout the OS.
void InsertNodeBefore(LinkListNode *node_, LinkListNode *insert_)
InsertNodeBefore Insert a linked-list node into the list before the specified insertion point...
void SetHead(T *pclNode_)
SetHead Set the head node of a linked list.
LinkListNode * prev
Pointer to the previous node in the list.
void Remove(T *pNode_)
Remove Add the linked list node to this linked list.
DoubleLinkList()
DoubleLinkList.
void Remove(LinkListNode *node_)
Remove.
void ClearNode()
ClearNode.
void InsertNodeBefore(T *pNode_, T *pInsert_)
InsertNodeBefore Insert a linked-list node into the list before the specified insertion point...
void Add(T *pNode_)
Add Add the linked list node to this linked list.
void SetTail(LinkListNode *pclNode_)
SetTail.
void Remove(LinkListNode *node_)
Remove Add the linked list node to this linked list.
The DoubleLinkList Class Doubly-linked-list data type, inherited from the base LinkList type...
The TypedCircularLinkList Class Circular-linked-list data type, inherited from the base LinkList type...
void Add(LinkListNode *node_)
Add.
void Add(T *pNode_)
Add the linked list node to this linked list.
The LinkListNode Class Basic linked-list node data structure. This data is managed by the linked-list...
T * GetTail()
GetTail Get the tail node of the linked list.
LinkListNode * GetHead()
GetHead.
The LinkList Class Abstract-data-type from which all other linked-lists are derived.
LinkListNode * GetNext(void)
GetNext.
LinkListNode * GetPrev(void)
GetPrev.
void SetTail(T *pclNode_)
SetTail Set the tail node of the linked list.
The CircularLinkList class Circular-linked-list data type, inherited from the base LinkList type...
T * GetHead()
GetHead Get the head node in the linked list.
LinkListNode * m_pclHead
Pointer to the head node in the list.
LinkListNode * GetTail()
GetTail.
LinkListNode * next
Pointer to the next node in the list.
The TypedLinkListNode class The TypedLinkListNode class provides a linked-list node type for a specif...
void Remove(T *pNode_)
Remove Add the linked list node to this linked list.
void SetHead(LinkListNode *pclNode_)
SetHead.
LinkListNode * m_pclTail
Pointer to the tail node in the list.
void SetTail(T *pclNode_)
SetTail Set the tail node of the linked list.
T * GetHead()
GetHead Get the head node in the linked list.
T Add(T *pSource_, T val_)
Add Add a value to a variable in an uninterruptable operation.
T * GetTail()
GetTail Get the tail node of the linked list.