tlcllists.h

Go to the documentation of this file.

/*
** EPITECH PROJECT, 2022
** (my) Tiny Lib C
** File description:
** linked list part
*/
 
#ifndef TLS_LLISTS_H_
    #define TLS_LLISTS_H_
 
    #include <stdbool.h>
    #include "tlcutils.h"
 
typedef struct llnode node_t;
struct llnode {
    node_t *next;
    void *data;
    void (*destroy)(void *data);
    void *(*copy)(void *data);
};
 
typedef struct llist list_t;
struct llist {
    node_t *start;
    node_t *end;
    int len;
};
 
typedef struct llnodesearch node_result_t;
struct llnodesearch {
    node_t *node_ptr;
    int node_index;
};
 
    #define _COPY_CHECK(x) (x != 0 && (x)->copy != 0)
    #define _DESTROY_CHECK(x) (x != 0 && (x)->destroy != 0)
    #define _VOID(c, e) ((c) ? e : return_void())
 
    #define L_LEN(x) ((x != 0) ? (x)->len : 0)
    #define L_NEXT(x) ((x != 0) ? (x)->next : 0)
    #define L_FIRST(list) ((list != 0) ? (list)->start : 0)
    #define L_LAST(list) ((list != 0) ? (list)->end : 0)
    #define L_COPY(x) ((_COPY_CHECK(x)) ? (x)->copy((x)->data) : 0)
    #define L_DATA(x) ((x != 0) ? (x)->data : 0)
    #define L_DESTROY(x) (_VOID(_DESTROY_CHECK(x), (x)->destroy(L_DATA(x))))
 
    #define L_DECL_FIRST(x, list) node_t *x = L_FIRST(list)
    #define L_DECL_LAST(x, list) node_t *x = L_LAST(list)
    #define L_EACH(x, list) L_DECL_FIRST(x, list); x != 0; x = L_NEXT(x)
 
    #undef _COPY_CHECK
    #undef _DESTROY_CHECK
    #undef _VOID
 
list_t *list_append(list_t *list, void *data, void (*destroy)(void *data),
    void *(*copy)(void *data));
 
list_t *list_create(void);
 
node_t *node_create(void *data, void (*destroy)(void *data),
    void *(*copy)(void *data));
 
void list_delete(list_t *list);
 
list_t *list_duplicate(list_t *list);
 
node_result_t list_find_ptrdata(list_t *list, void *data);
 
int list_find_ptrnode(list_t *list, node_t *node_ptr);
 
node_result_t list_find_f(list_t *list,
    bool (is_this_result)(void *node_data, void *param), void *param);
 
node_t *list_index(list_t *list, int index);
 
list_t *list_insert_end(list_t *list, node_t *node);
 
list_t *list_insert_start(list_t *list, node_t *node);
 
list_t *list_insert(list_t *list, node_t *node, int index);
 
int list_remove_start(list_t *list);
 
int list_remove_end(list_t *list);
 
int list_remove_ptrnode(list_t *list, node_t *node);
 
int list_remove_ptrdata(list_t *list, void *ptrdata);
 
#endif