Libft/ft_lstmap.c at main · eagoumi/Libft · GitHub

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
/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   ft_lstmap.c                                        :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: eagoumi <eagoumi@student.42.fr>            +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2022/11/05 19:07:31 by eagoumi           #+#    #+#             */
/*   Updated: 2022/11/08 20:38:34 by eagoumi          ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

#include "./libft.h"

typedef struct s_params
{
	void	*new_content;
	t_list	*new_node;
	t_list	*new_lst;
	t_list	*last_node;
}	t_params;

void	*del_free(t_list **lst, void (*del)(void *))
{
	ft_lstclear(lst, del);
	return (NULL);
}

t_list	*ft_lstmap(t_list *lst, void *(*f)(void *), void (*del)(void *))
{
	t_params	params;

	params.new_lst = NULL;
	while (f != NULL && del != NULL && lst != NULL)
	{
		params.new_content = f(lst->content);
		if (!params.new_content)
			return (del_free(&params.new_lst, del));
		params.new_node = ft_lstnew(params.new_content);
		if (!params.new_node)
			return (del_free(&params.new_lst, del));
		if (params.new_lst == NULL)
		{
			params.new_lst = params.new_node;
			params.last_node = params.new_lst;
		}
		else
		{
			params.last_node->next = params.new_node;
			params.last_node = params.last_node->next;
		}
		lst = lst->next;
	}
	return (params.new_lst);
}