| 1 |
schorsch |
3.7 |
/* RCSid: $Id: sm_list.h,v 3.6 2003/02/22 02:07:25 greg Exp $ */ |
| 2 |
gwlarson |
3.1 |
/* |
| 3 |
|
|
* list.h |
| 4 |
|
|
* Linked list data structure and routines |
| 5 |
|
|
*/ |
| 6 |
schorsch |
3.7 |
#ifndef _RAD_SM_LIST_H_ |
| 7 |
|
|
#define _RAD_SM_LIST_H_ |
| 8 |
|
|
|
| 9 |
|
|
#ifdef __cplusplus |
| 10 |
|
|
extern "C" { |
| 11 |
|
|
#endif |
| 12 |
gwlarson |
3.1 |
|
| 13 |
|
|
#ifndef TRUE |
| 14 |
|
|
#define TRUE 1 |
| 15 |
|
|
#define FALSE 0 |
| 16 |
|
|
#endif |
| 17 |
|
|
|
| 18 |
|
|
typedef struct _LIST { |
| 19 |
|
|
int d; |
| 20 |
|
|
struct _LIST *next; |
| 21 |
|
|
}LIST; |
| 22 |
|
|
|
| 23 |
|
|
|
| 24 |
|
|
#define LIST_NEXT(l) ((l)->next) |
| 25 |
|
|
#define LIST_DATA(l) ((l)->d) |
| 26 |
|
|
#define SET_LIST_NEXT(l,d) ((l)->next = (d)) |
| 27 |
|
|
#define SET_LIST_DATA(l,id) ((l)->d = (int)(id)) |
| 28 |
gwlarson |
3.4 |
|
| 29 |
gwlarson |
3.1 |
/* |
| 30 |
|
|
LIST *new_list(void); |
| 31 |
|
|
LIST *free_list(LIST *l); |
| 32 |
|
|
LIST *append_list(LIST *a, LIST *b); |
| 33 |
gwlarson |
3.4 |
|
| 34 |
gwlarson |
3.1 |
int pop_data(LIST **l); |
| 35 |
|
|
LIST *add_data_to_circular_list(LIST *l,LIST **end,int d) |
| 36 |
|
|
int remove_from_list(int d,LIST **list) |
| 37 |
|
|
*/ |
| 38 |
|
|
LIST *new_list(); |
| 39 |
|
|
LIST *free_list(); |
| 40 |
|
|
LIST *append_list(); |
| 41 |
gwlarson |
3.4 |
int pop_data(); |
| 42 |
gwlarson |
3.1 |
LIST *push_data(); |
| 43 |
|
|
LIST *add_data_to_circular_list(); |
| 44 |
|
|
int remove_from_list(); |
| 45 |
gwlarson |
3.3 |
LIST *add_data(); |
| 46 |
gwlarson |
3.1 |
|
| 47 |
|
|
|
| 48 |
schorsch |
3.7 |
#ifdef __cplusplus |
| 49 |
|
|
} |
| 50 |
|
|
#endif |
| 51 |
|
|
#endif /* _RAD_SM_LIST_H_ */ |
| 52 |
gwlarson |
3.1 |
|
| 53 |
|
|
|
