Loading src/bst.c +2 −0 Changes for src/bst.c: 2 added lines, 0 removed lines. Original line number Diff line number Diff line #include<stdlib.h> struct node_t { unsigned long int key; void* val; Loading src/list.c +3 −2 Changes for src/list.c: 3 added lines, 2 removed lines. Original line number Diff line number Diff line Loading @@ -60,15 +60,16 @@ void list_destroy(list_t l, void (*free_void)(void*)){ // return the found element or NULL //recherche l'element x void* list_in(list_t l, void* x, int (*eq)(void*, void*)){ if(list_is_empty(l)) return NULL; while(!list_is_empty(l)){ if(l->val == x) if((eq) (l->val, x)) return l; l=l->next; } return NULL; } // unsigned long int list_len(list_t l){ if(list_is_empty(l)) return 0; Loading Loading
src/bst.c +2 −0 Changes for src/bst.c: 2 added lines, 0 removed lines. Original line number Diff line number Diff line #include<stdlib.h> struct node_t { unsigned long int key; void* val; Loading
src/list.c +3 −2 Changes for src/list.c: 3 added lines, 2 removed lines. Original line number Diff line number Diff line Loading @@ -60,15 +60,16 @@ void list_destroy(list_t l, void (*free_void)(void*)){ // return the found element or NULL //recherche l'element x void* list_in(list_t l, void* x, int (*eq)(void*, void*)){ if(list_is_empty(l)) return NULL; while(!list_is_empty(l)){ if(l->val == x) if((eq) (l->val, x)) return l; l=l->next; } return NULL; } // unsigned long int list_len(list_t l){ if(list_is_empty(l)) return 0; Loading