simple_list.h File Reference

Go to the source code of this file.

Defines
#define	remove_from_list(elem)
#define	insert_at_head(list, elem)
#define	insert_at_tail(list, elem)
#define	move_to_head(list, elem)
#define	move_to_tail(list, elem)
#define	make_empty_list(sentinal)
#define	first_elem(list)   ((list)->next)
#define	last_elem(list)   ((list)->prev)
#define	next_elem(elem)   ((elem)->next)
#define	prev_elem(elem)   ((elem)->prev)
#define	at_end(list, elem)   ((elem) == (list))
#define	is_empty_list(list)   ((list)->next == (list))
#define	foreach(ptr, list)   for( ptr=(list)->next ; ptr!=list ; ptr=(ptr)->next )
#define	foreach_s(ptr, t, list)   for(ptr=(list)->next,t=(ptr)->next; list != ptr; ptr=t, t=(t)->next)

---

Detailed Description

Simple macros for type-safe, intrusive lists.

Intended to work with a list sentinal which is created as an empty list. Insert & delete are O(1).

Author:

(C) 1997, Keith Whitwell

Definition in file simple_list.h.