1 #ifndef LIST_H_

2 #define LIST_H_

3

4 #include <stddef.h>

5

6 struct list_node;

7 struct list;

8 struct list_iterator;

9

10 struct list * list_new(void);

11 void list_delete(struct list * l);

12

13 size_t list_size(struct list * l);

14 void * list_push_back(struct list * l, void * elem);

15 void * list_pop_back(struct list * l);

16 void * list_push_front(struct list * l, void * elem);

17 void * list_pop_front(struct list * l);

18

19 // The iterators are different than their c++ STL counterparts.

20 // They are bi-directional, and list_end points to the last element, not the empty space beyond the last elem.

21 struct list_iterator * list_begin (struct list * l);

22 struct list_iterator * list_end (struct list * l);

23 struct list_iterator * list_next (struct list_iterator * lit);

24 struct list_iterator * list_prev (struct list_iterator * lit);

25 struct list_iterator * list_find (struct list_iterator * it, void * data);

26 void * list_remove (struct list_iterator * lit);

27 void * list_value (struct list_iterator * lit);

28

29 struct list_iterator * list_insert_after (struct list_iterator * lit, void * elem);

30 struct list_iterator * list_insert_before (struct list_iterator * lit, void * elem);

31

32 #endif