remplissage fichier list

src/list.c

+#include<stdio.h>
+#include<stdlib.h>
+
 struct cell_t {
   void* val;
   unsigned long int id;
@@ -7,30 +10,56 @@ struct cell_t {
 typedef struct cell_t* list_t;
 
 list_t list_empty(){
+  return NULL;
 }
 
 int list_is_empty(list_t l){
+  return l==NULL;
 }
 
 list_t list_push(list_t l, void* x){
+  list_t c = malloc(sizeof(struct cell_t));
+  c -> val = x;
+  if(list_is_empty(l))
+    c -> id = 1;
+  else
+    c -> id = l->id + 1;
+  c -> next = l;
+  return c;
 }
 
 list_t list_tail(list_t l){
+  return l->next;
 }
 
 void* list_pop(list_t* l){
+  list_t tmp = (*l)->next;
+  void* res = (*l)->val;
+  free(*l);
+  *l=tmp;
+  return res;
 }
 
 void* list_top(list_t l){
+  return l->val;
 }
 
-void list_destroy(list_t l, void (*free)(void*)){
+void list_destroy(list_t l, void (*free_void)(void*)){
+  while(!list_is_empty(l)){
+    free_void(list_pop(&l));
+  }
 }
 
 // return the found element or NULL
 void* list_in(list_t l, void* x, int (*eq)(void*, void*)){
+  while(!list_is_empty(l)){
+    if(eq(l->val,x))
+      return l->val;
+    l=list_tail(l);
+  }
+  return NULL;
 }
 
 unsigned long int list_len(list_t l){
+  return l->id;
 }
-

tests/exemple_collision.c

@@ -43,6 +43,7 @@ int main(){
 
       return 0;
     } else {
+      i++;
       l = list_push(l, p);
     }
   }

tests/list_tests.c

 #include <assert.h>
 #include <stdio.h>
-#include "linked_list.h"
+#include "list.h"
 #include "bignum.h"
 
 void test_emptyness() {