Defines |
#define | add_on(l, x) l = push (l,first_node (x)) |
#define | next_one(l) l = rest (l) |
Functions |
int | count (LIST var_list) |
LIST | delete_d (LIST list, void *key, int_compare is_equal) |
LIST | delete_d (LIST list, void *key, ResultCallback2< int, void *, void * > *is_equal) |
LIST | destroy (LIST list) |
void | destroy_nodes (LIST list, void_dest destructor) |
void | insert (LIST list, void *node) |
int | is_same_node (void *item1, void *item2) |
int | is_same (void *item1, void *item2) |
LIST | join (LIST list1, LIST list2) |
LIST | last (LIST var_list) |
void * | nth_cell (LIST var_list, int item_num) |
LIST | pop (LIST list) |
LIST | push (LIST list, void *element) |
LIST | push_last (LIST list, void *item) |
LIST | reverse (LIST list) |
LIST | reverse_d (LIST list) |
LIST | s_adjoin (LIST var_list, void *variable, int_compare compare) |
LIST | search (LIST list, void *key, int_compare is_equal) |
LIST | search (LIST list, void *key, ResultCallback2< int, void *, void * > *is_equal) |