Chained lists
[Base containers]

---

Detailed Description

Single- and double-chained lists.

Modules
	Single-Chained List
	Double-Chained List
Defines
#define	list_head(_l)   ((_l)->head)
#define	list_tail(_l)   ((_l)->tail)
#define	node_next(_n)   ((_n)->next)
#define	node_prev(_n)   ((_n)->prev)
#define	node_value(_t, _n)   ((_t)((_n)->value))
#define	list_is_empty(_l)   ((_l)->head==NULL)
#define	list_not_empty(_l)   ((_l)->head!=NULL)
#define	node_has_next(_n)   ((_n)->next!=NULL)
#define	node_has_prev(_n)   ((_n)->prev!=NULL)

---

Define Documentation

#define list_head

(

_l

)

((_l)->head)

#define list_tail

(

_l

)

((_l)->tail)

#define node_next

(

_n

)

((_n)->next)

#define node_prev

(

_n

)

((_n)->prev)

#define node_value	(	_t,
		_n		)	((_t)((_n)->value))

#define list_is_empty

(

_l

)

((_l)->head==NULL)

#define list_not_empty

(

_l

)

((_l)->head!=NULL)

#define node_has_next

(

_n

)

((_n)->next!=NULL)

#define node_has_prev

(

_n

)

((_n)->prev!=NULL)

---