TP1

#ifndef __HASH_TBL__

#define __HASH_TBL__

#include "linked_list.h"

#include "list.h"

struct hash_tbl {

  size_t (*h)(void*);

#include<stdlib.h>

struct cell_t {

  void* val;

  unsigned long int id;

typedef struct cell_t* list_t;

list_t list_empty(){

	list_t l = NULL;

	return l;

}

int list_is_empty(list_t l){

	return l == NULL;

}

list_t list_push(list_t l, void* x){

	list_t head = malloc(sizeof(struct cell_t));

	head->next = l;

	head->id = 1;

	if (!list_is_empty(l))

		head->id += l->id;

	head->val = x;

	return head;

}

list_t list_tail(list_t l){

	return list_is_empty(l) ? NULL : l->next;

}

void* list_pop(list_t* l){

	if (list_is_empty(*l)) 

		return NULL;

	void* res = (*l)->val;

	list_t	new_head = (*l)->next;

	free(*l);

	*l = new_head;

	return res;

}

void* list_top(list_t l){

	return list_is_empty(l) ? NULL : l->val; 

}

void list_destroy(list_t l, void (*free)(void*)){

	while (!list_is_empty(l))

		free(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(x, l->val))

			return l->val;

		else

			l = l->next;

	return NULL;

}

unsigned long int list_len(list_t l){

	return list_is_empty(l) ? 0 : l->id;

}