Revision 275
implementing transmission with queues
| list.h | ||
|---|---|---|
| 18 | 18 |
list_node_t* (list_begin )(list_t *l); |
| 19 | 19 |
list_node_t* (list_end )(list_t *l); |
| 20 | 20 |
size_t (list_size )(const list_t *l); |
| 21 |
int (list_empty )(const list_t *l); |
|
| 21 | 22 |
list_node_t* (list_insert)(list_t *l, list_node_t *position, void *val); |
| 22 | 23 |
void* (list_erase )(list_t *l, list_node_t *position); |
| 24 |
void (list_push_back)(list_t *l, void *val); |
|
| 25 |
void** (list_front)(list_t *l); |
|
| 26 |
void (list_pop_front)(list_t *l); |
|
| 23 | 27 |
|
| 24 | 28 |
#endif //LIST_H_INCLUDED |
Also available in: Unified diff