| | |
| | | #include <stdlib.h> |
| | | #include <string.h> |
| | | #include "list.h" |
| | | #include "option_list.h" |
| | | |
| | | list *make_list() |
| | | { |
| | |
| | | return l; |
| | | } |
| | | |
| | | /* |
| | | void transfer_node(list *s, list *d, node *n) |
| | | { |
| | | node *prev, *next; |
| | |
| | | if(s->front == n) s->front = next; |
| | | if(s->back == n) s->back = prev; |
| | | } |
| | | */ |
| | | |
| | | void *list_pop(list *l){ |
| | | if(!l->back) return 0; |
| | |
| | | } |
| | | } |
| | | |
| | | void free_list_contents_kvp(list *l) |
| | | { |
| | | node *n = l->front; |
| | | while (n) { |
| | | kvp *p = n->val; |
| | | free(p->key); |
| | | free(n->val); |
| | | n = n->next; |
| | | } |
| | | } |
| | | |
| | | void **list_to_array(list *l) |
| | | { |
| | | void **a = calloc(l->size, sizeof(void*)); |