src/hd/sm_list.h

/* RCSid: $Id$ */
/*
 *  list.h
 *  Linked list data structure and routines 
 */

#ifndef TRUE
#define TRUE 1
#define FALSE 0
#endif

typedef struct _LIST {
    int d;
    struct _LIST *next;
}LIST;


#define LIST_NEXT(l) ((l)->next)
#define LIST_DATA(l) ((l)->d)
#define SET_LIST_NEXT(l,d) ((l)->next = (d))
#define SET_LIST_DATA(l,id) ((l)->d = (int)(id))

/*
LIST *new_list(void);
LIST *free_list(LIST *l);
LIST *append_list(LIST *a, LIST *b);

int pop_data(LIST **l);
LIST *add_data_to_circular_list(LIST *l,LIST **end,int d)
int remove_from_list(int d,LIST **list)
*/
LIST *new_list();
LIST *free_list();
LIST *append_list();
int  pop_data();
LIST *push_data();
LIST *add_data_to_circular_list();
int remove_from_list();
LIST *add_data();


Revision:	3.6
Committed:	Sat Feb 22 02:07:25 2003 UTC (21 years, 2 months ago) by greg
Content type:	text/plain
Branch:	MAIN
CVS Tags:	rad3R5
Changes since 3.5:	+1 -4 lines
Log Message:	Changes and check-in for 3.5 release Includes new source files and modifications not recorded for many years See ray/doc/notes/ReleaseNotes for notes between 3.1 and 3.5 release
#	Content
1	/* RCSid: $Id$ */
2	/*
3	* list.h
4	* Linked list data structure and routines
5	*/
6
7	#ifndef TRUE
8	#define TRUE 1
9	#define FALSE 0
10	#endif
11
12	typedef struct _LIST {
13	int d;
14	struct _LIST *next;
15	}LIST;
16
17
18	#define LIST_NEXT(l) ((l)->next)
19	#define LIST_DATA(l) ((l)->d)
20	#define SET_LIST_NEXT(l,d) ((l)->next = (d))
21	#define SET_LIST_DATA(l,id) ((l)->d = (int)(id))
22
23	/*
24	LIST *new_list(void);
25	LIST free_list(LIST l);
26	LIST append_list(LIST a, LIST *b);
27
28	int pop_data(LIST **l);
29	LIST add_data_to_circular_list(LIST l,LIST **end,int d)
30	int remove_from_list(int d,LIST **list)
31	*/
32	LIST *new_list();
33	LIST *free_list();
34	LIST *append_list();
35	int pop_data();
36	LIST *push_data();
37	LIST *add_data_to_circular_list();
38	int remove_from_list();
39	LIST *add_data();
40
41
42
43