blob: bf96892426f331b1fded26675900b8fe9547856b (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
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);
*/
|
