ft_lstmap.c

/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   ft_lstmap.c                                        :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: aalvarez <aalvarez@student.42.fr>          +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2022/08/17 22:58:18 by aalvarez          #+#    #+#             */
/*   Updated: 2022/08/17 23:13:47 by aalvarez         ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

#include "libft.h"

/**
 * @brief iterates the list pointed to by lst and applies the function
 * f to the content of every node. Creates a new list resulting of the
 * sucessive apllications of the function f. The del function is used to
 * delete the content of a node if needed.
 * 
 * @param lst the address of a pointer to a node.
 * @param f the address of the function used to iterate on the list.
 * @param del the address of the function used to delete.
 * @return t_list* the new list.
 */
t_list	*ft_lstmap(t_list *lst, void *(*f)(void *), void (*del)(void *))
{
	t_list	*head;
	t_list	*new;

	if (!lst || !f)
		return (NULL);
	head = NULL;
	while (lst)
	{
		new = ft_lstnew((*f)(lst->content));
		if (!new)
		{
			ft_lstclear(&head, del);
			return (NULL);
		}
		ft_lstadd_back(&head, new);
		lst = lst->next;
	}
	return (head);
}