71 #define copy_first(l1,l2) \
72 (l2=push(l2, first_node(l1)))
86 static int is_same(
void *item1,
void *item2) {
87 return strcmp(
static_cast<char *
>(item1),
static_cast<char *
>(item2)) == 0;
217 t->
node =
static_cast<LIST>(element);
LIST push_last(LIST list, void *item)
void destroy_nodes(LIST list, void_dest destructor)
LIST search(LIST list, void *key, int_compare is_equal)
LIST delete_d(LIST list, void *key, int_compare is_equal)
#define copy_first(l1, l2)
void insert(LIST list, void *node)
LIST push(LIST list, void *element)
void(*)(void *) void_dest
#define set_rest(l, cell)
int(*)(void *, void *) int_compare