#ifndef LIST_H_INCLUDED
#define LIST_H_INCLUDED

#define DEBUG_TRACE 0

/** Structure de liste doublement chaînée **/
typedef struct list_node {
    void *content;
    struct list_node *succ, *prev;
} list_node;

typedef list_node* list;
typedef list* plist;

#define ERR -1
#define ID 0
#define OK 1
#define OK_WARNING 2

list new_singleton_list(void *content);
void delete_list(list l);
void print_list_graph(list l, const char *name);
int isEmpty_list (list *file);
void init_list(list file);

#endif // LIST_H_INCLUDED