aboutsummaryrefslogtreecommitdiff
path: root/test_mini/libft/src/lst/ft_lstmap.c
diff options
context:
space:
mode:
authornass1pro <nass1pro@gmail.com>2020-06-09 19:48:34 +0200
committernass1pro <nass1pro@gmail.com>2020-06-13 11:31:00 +0200
commit579a26f5593039ffbbd1a81e45ecf0ef8797cb5d (patch)
treec5b6761db98e27d15bab3fb45ba9e0a646cf06e0 /test_mini/libft/src/lst/ft_lstmap.c
parent9fabc25a980550afc6337fd729632462f2680daa (diff)
downloadminishell-579a26f5593039ffbbd1a81e45ecf0ef8797cb5d.tar.gz
minishell-579a26f5593039ffbbd1a81e45ecf0ef8797cb5d.tar.bz2
minishell-579a26f5593039ffbbd1a81e45ecf0ef8797cb5d.zip
add lexer
add single quote
Diffstat (limited to 'test_mini/libft/src/lst/ft_lstmap.c')
-rw-r--r--test_mini/libft/src/lst/ft_lstmap.c56
1 files changed, 56 insertions, 0 deletions
diff --git a/test_mini/libft/src/lst/ft_lstmap.c b/test_mini/libft/src/lst/ft_lstmap.c
new file mode 100644
index 0000000..3182bb0
--- /dev/null
+++ b/test_mini/libft/src/lst/ft_lstmap.c
@@ -0,0 +1,56 @@
+/* ************************************************************************** */
+/* */
+/* ::: :::::::: */
+/* ft_lstmap.c :+: :+: :+: */
+/* +:+ +:+ +:+ */
+/* By: cacharle <marvin@42.fr> +#+ +:+ +#+ */
+/* +#+#+#+#+#+ +#+ */
+/* Created: 2019/10/09 09:03:57 by cacharle #+# #+# */
+/* Updated: 2020/02/15 23:11:42 by cacharle ### ########.fr */
+/* */
+/* ************************************************************************** */
+
+#include "libft_lst.h"
+
+/*
+** \brief Clone a list and map a function to each node data
+** \param lst Origin list
+** \param f Function applied to each node's data
+** \param del Delete function for cleanning up in case of failed allocation
+** \return Mapped clone list
+*/
+
+t_ftlst *ft_lstmap(t_ftlst *lst, void *(*f)(void *), void (*del)(void *))
+{
+ t_ftlst *mapped;
+ t_ftlst *tmp;
+
+ if (lst == NULL || f == NULL)
+ return (NULL);
+ mapped = NULL;
+ while (lst != NULL)
+ {
+ if ((tmp = ft_lstnew((*f)(lst->data))) == NULL)
+ {
+ ft_lstdestroy(&mapped, del);
+ return (NULL);
+ }
+ ft_lstpush_back(&mapped, tmp);
+ lst = lst->next;
+ }
+ return (mapped);
+}
+
+/*
+** Rest in peace, my beautiful recursion.
+**
+** t_ftlst *tmp;
+**
+** if (lst == NULL)
+** return (NULL);
+** if ((tmp = ft_lstnew(lst->data)) == NULL)
+** return (NULL);
+** tmp->data = (*f)(tmp->data);
+** tmp->next = ft_lstmap(lst->next, f);
+** return (tmp);
+*/