1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
| #ifndef LIST_H
| #define LIST_H
|
| typedef struct node{
| void *val;
| struct node *next;
| struct node *prev;
| } node;
|
| typedef struct list{
| int size;
| node *front;
| node *back;
| } list;
|
| list *make_list();
| int list_find(list *l, void *val);
|
| void list_insert(list *, void *);
|
| void **list_to_array(list *l);
|
| void free_list(list *l);
| void free_list_contents(list *l);
| void free_list_contents_kvp(list *l);
|
| #endif
|
|
