listNode.h File Reference

---

Detailed Description

Amiga-style doubly linked list functions.

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
struct	lnList
struct	lnMinList
struct	lnMinNode
struct	lnNode
Defines
#define	lnEmptyList(list)   ((struct lnMinNode *)(list)->lh_TailPred == (struct lnMinNode *)(list))
	Check if a list is empty.
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.

---

Define Documentation

#define lnEmptyList (  list   )     ((struct lnMinNode *)(list)->lh_TailPred == (struct lnMinNode *)(list))

Check if a list is empty. Parameters: list  The list to check. Returns: True if the list is empty.

---

Function Documentation

void lnAddHead (  struct lnMinList *  list, struct lnMinNode *  node )

Add a node to the head of the list. Parameters: list  The list object the node is to be added to. node  The node to add.

void lnAddTail (  struct lnMinList *  list, struct lnMinNode *  node )

Add a node to the tail of the list. Parameters: list  The list object the node is to be added to. node  The node to add.

void lnAppendList (  struct lnMinList *  dest, struct lnMinList *  src )

Append the nodes from src to dest. Parameters: dest  The destination list object. src  The source list object.

unsigned int lnCountNodes (  struct lnMinList *  list  )

Count the number of nodes in a list. Parameters: list  The list to scan. Returns: The number of nodes in the list.

void lnEnqueue (  struct lnList *  list, struct lnNode *  node )

Insert a node into a prioritized list. Parameters: list  An ordered list. node  The node to insert.

struct lnNode* lnFindName (  struct lnList *  list, const char *  name )

Find a node with the given name. Parameters: list  The list to search. name  The name to search for. Returns: The first node in the list that matches the given name or NULL if no match could be found.

void lnInsert (  struct lnMinNode *  pred, struct lnMinNode *  node )

Insert a node at a specific position in a list. Parameters: pred  The node in the list that the new node should be inserted after. node  The node to insert.

void lnMoveList (  struct lnMinList *  dest, struct lnMinList *  src )

Transfer the nodes on src to dest, overwriting any nodes on dest. Parameters: dest  The destination list object. src  The source list object.

void lnNewList (  struct lnMinList *  list  )

Initialize a list. Parameters: list  The list object to initialize.

struct lnMinNode* lnRemHead (  struct lnMinList *  list  )

Remove and return the node at the head of the list, or NULL if the list is empty. Parameters: list  A valid list object. Returns: The node at the head of 'list', or NULL if the list is empty.

void lnRemove (  struct lnMinNode *  node  )

Remove a node from the list. Parameters: node  The node to remove.

struct lnMinNode* lnRemTail (  struct lnMinList *  list  )

Remove and return the node at the tail of the list, or NULL if the list is empty. Parameters: list  A valid list object. Returns: The node at the tail of 'list', or NULL if the list is empty.

---