Function LinkedList.LinkedListHead.remNodeHead

remNodeHead -- remove node at the head of a list

LinkedList.LinkedListNode* remNodeHead();

Remove a node to the head of a doubly linked list.

Parameters

NameDescription

Returns

Your list is smaller by one node or empty. The returned value is your removed node or null if List was empty

Example

ListHead* myList; ... while ( myList.remNodeHead() ) { // process removed node.... }

Notes

This function does not arbitrate for access to the list. The calling task must be the owner of the involved list. Important note_: The ln_Pred and ln_Succ pointers of the removed node are no longer valid after removal from list. Do not use them after removal.

Bugs

none

See

initListHead(), addNode(), remNode(), addNodeHead(), remNodeHead(), addNodeTail(), remNodeTail(), addNodeSorted(), findNode()