Include dependency graph for listNode.c:

Functions | |
| void | lnRemove (struct lnMinNode *node) |
| Remove a node from the list. | |
| void | lnNewList (struct lnMinList *list) |
| Initialize a list. | |
| void | lnMoveList (struct lnMinList *dest, struct lnMinList *src) |
| Transfer the nodes on src to dest, overwriting any nodes on dest. | |
| void | lnAppendList (struct lnMinList *dest, struct lnMinList *src) |
| Append the nodes from src to dest. | |
| void | lnAddHead (struct lnMinList *list, struct lnMinNode *node) |
| Add a node to the head of the list. | |
| void | lnAddTail (struct lnMinList *list, struct lnMinNode *node) |
| Add a node to the tail of the list. | |
| lnMinNode * | lnRemHead (struct lnMinList *list) |
| Remove and return the node at the head of the list, or NULL if the list is empty. | |
| lnMinNode * | lnRemTail (struct lnMinList *list) |
| Remove and return the node at the tail of the list, or NULL if the list is empty. | |
| void | lnInsert (struct lnMinNode *pred, struct lnMinNode *node) |
| Insert a node at a specific position in a list. | |
| void | lnEnqueue (struct lnList *list, struct lnNode *node) |
| Insert a node into a prioritized list. | |
| lnNode * | lnFindName (struct lnList *list, const char *name) |
| Find a node with the given name. | |
| unsigned int | lnCountNodes (struct lnMinList *list) |
| Count the number of nodes in a list. | |
|
||||||||||||
|
Add a node to the head of the list.
|
|
||||||||||||
|
Add a node to the tail of the list.
|
|
||||||||||||
|
Append the nodes from src to dest.
|
|
|
Count the number of nodes in a list.
|
|
||||||||||||
|
Insert a node into a prioritized list.
|
|
||||||||||||
|
Find a node with the given name.
|
|
||||||||||||
|
Insert a node at a specific position in a list.
|
|
||||||||||||
|
Transfer the nodes on src to dest, overwriting any nodes on dest.
|
|
|
Initialize a list.
|
|
|
Remove and return the node at the head of the list, or NULL if the list is empty.
|
|
|
Remove a node from the list.
|
|
|
Remove and return the node at the tail of the list, or NULL if the list is empty.
|
1.3.4