mylist.h

Go to the documentation of this file.

/*
** EPITECH PROJECT, 2023
** Libmylist
** File description:
** The header file of the libmylist
*/
#include "my.h"
 
#ifndef MYLIST_H
    #define MYLIST_H
 
// TYPEDEFS :
 
/* Enum for the type of the data */
typedef enum type {
    SHORT_SHORT,
    SHORT,
    INT,
    LONG,
    LONG_LONG,
    UNSIGNED_SHORT,
    UNSIGNED_SHORT_SHORT,
    UNSIGNED_INT,
    UNSIGNED_LONG,
    UNSIGNED_LONG_LONG,
    SIZE_T,
    FLOAT,
    DOUBLE,
    CHAR,
    STRING,
    ARRAY_OF_STRING,
    VOID,
    UNKNOWN
} type_t;
 
/* Node of the linked list */
typedef struct node_s {
    struct node_s *prev; /* Pointer to the previous node */
    void *data; /* Pointer to the data */
    type_t type; /* Type of the data */
    struct node_s *next; /* Pointer to the next node */
} node_t;
 
 
 
// FUNCTIONS PROTOTYPES :
 
    // Add functions :
 
void my_push_front(node_t **begin, void *data, type_t type);
 
void my_push_back(node_t **begin, void *data, type_t type);
 
    // Remove functions :
 
int my_delete_nodes(node_t **begin, void const *data_ref, int (*cmp)());
 
void my_delete_list(node_t **begin);
 
node_t *my_pop_front(node_t **begin);
 
node_t *my_pop_back(node_t **begin);
 
node_t *my_pop_node(node_t **begin, void const *data_ref, int (*cmp)());
 
    // Circular list functions :
 
void my_push_back_circled(node_t **begin, void *data, type_t type);
 
int my_list_size_circled(node_t const *begin);
 
void **my_list_to_array_circled(node_t **list);
 
void my_delete_circle_list(node_t **begin);
 
    // Other functions :
 
void my_show_list(node_t *list);
 
int my_list_size(node_t const *begin);
 
void my_rev_list(node_t **begin);
 
node_t *my_find_node(node_t const *begin, void const *data, int (*cmp)());
 
void my_concat_list(node_t **begin1, node_t *begin2);
 
void my_sort_list(node_t **begin, int (*cmp)());
 
void my_merge_list(node_t **begin1, node_t *begin2, int (*cmp)());
 
void **my_list_to_array(node_t *list);
 
node_t *my_params_to_list(int ac, char *const *av);
 
node_t *my_previous_to_next(node_t **head, node_t *to_delete);
 
#endif