2 * Sherlock Library -- Linked Lists
4 * (c) 1997--1999 Martin Mares <mj@atrey.karlin.mff.cuni.cz>
9 #define _SHERLOCK_LISTS_C
13 add_tail(list *l, node *n)
17 n->next = (node *) &l->null;
24 add_head(list *l, node *n)
29 n->prev = (node *) &l->head;
35 insert_node(node *n, node *after)
37 node *z = after->next;
58 l->head = (node *) &l->null;
60 l->tail = (node *) &l->head;
64 add_tail_list(list *to, list *l)
72 q->next = (node *) &to->null;