diff options
| author | Charles Cabergs <me@cacharle.xyz> | 2020-10-11 15:52:52 +0200 |
|---|---|---|
| committer | Charles Cabergs <me@cacharle.xyz> | 2020-10-11 15:52:52 +0200 |
| commit | c98de126d2252fe47dc2a9094a5f9a8fa6b4b60a (patch) | |
| tree | 12f1c827ee063ed3e7038f6a704014e611e4f388 /libft/include/libft_lst.h | |
| parent | a4ceb5974d1b7dcdd12cc81b7eb07893ea16c8ad (diff) | |
| download | minishell-c98de126d2252fe47dc2a9094a5f9a8fa6b4b60a.tar.gz minishell-c98de126d2252fe47dc2a9094a5f9a8fa6b4b60a.tar.bz2 minishell-c98de126d2252fe47dc2a9094a5f9a8fa6b4b60a.zip | |
Removing libft/minishell_test submodules, Removing subject/README/etc
Diffstat (limited to 'libft/include/libft_lst.h')
| -rw-r--r-- | libft/include/libft_lst.h | 68 |
1 files changed, 68 insertions, 0 deletions
diff --git a/libft/include/libft_lst.h b/libft/include/libft_lst.h new file mode 100644 index 0000000..0dc1e7c --- /dev/null +++ b/libft/include/libft_lst.h @@ -0,0 +1,68 @@ +/* ************************************************************************** */ +/* */ +/* ::: :::::::: */ +/* libft_lst.h :+: :+: :+: */ +/* +:+ +:+ +:+ */ +/* By: cacharle <marvin@42.fr> +#+ +:+ +#+ */ +/* +#+#+#+#+#+ +#+ */ +/* Created: 2020/01/31 10:36:39 by cacharle #+# #+# */ +/* Updated: 2020/08/20 14:40:01 by charles ### ########.fr */ +/* */ +/* ************************************************************************** */ + +#ifndef LIBFT_LST_H +# define LIBFT_LST_H + +/* +** \file libft_lst.h +** \brief Linked list Manipulation +*/ + +# include <stdlib.h> +# include "libft_def.h" +# include "libft_algo.h" + +/* +** \brief List struct +** \param data Pointer to node data +** \param next Pointer to next node or NULL if last node +*/ + +typedef struct s_ftlst +{ + void *data; + struct s_ftlst *next; +} t_ftlst; + +typedef void (*t_ftdel_func)(void *); + +t_ftlst *ft_lstnew(void const *data); +int ft_lstsize(t_ftlst *lst); +void ft_lstpush_front(t_ftlst **alst, t_ftlst *new); +t_ftlst *ft_lstpush_front_node(t_ftlst **alst, void *data); +void ft_lstpush_back(t_ftlst **alst, t_ftlst *new); +void ft_lstpop_front(t_ftlst **lst, void (*del)(void *)); +void ft_lstpop_back(t_ftlst **lst, void (*del)(void *)); +t_ftlst *ft_lstlast(t_ftlst *lst); +void ft_lstdelone(t_ftlst *lst, void (*del)(void *)); +void *ft_lstdestroy(t_ftlst **lst, void (*del)(void *)); +void ft_lstiter(t_ftlst *lst, void (*f)(void *)); +t_ftlst *ft_lstmap(t_ftlst *lst, void *(*f)(void *), + t_ftdel_func del); +t_ftlst *ft_lstreverse_ret(t_ftlst *lst); +void ft_lstreverse(t_ftlst **lst); +void ft_lstremove_if(t_ftlst **lst, + t_ftcompar_func cmp, const void *ref, + t_ftdel_func del); +void ft_lstinsert(t_ftlst **lst, t_ftlst *insert, size_t i); +t_ftlst *ft_lstbsearch(t_ftlst *lst, t_ftcompar_func cmp, + const void *ref); +t_ftlst *ft_lstlsearch(t_ftlst *lst, t_ftcompar_func cmp, + const void *ref); +t_ftlst *ft_lstlfind(t_ftlst *lst, t_ftcompar_func cmp, + const void *ref); +void ft_lstsort(t_ftlst **begin_list, t_ftcompar_func cmp); +t_ftlst *ft_lstsorted_merge(t_ftlst *l1, t_ftlst *l2, + t_ftcompar_func cmp); + +#endif |
