algorithm with no double nodes and nearly efficient enough still some optimizations to find for --big-superposition maps
24 lines
1.1 KiB
C
24 lines
1.1 KiB
C
/* ************************************************************************** */
|
|
/* */
|
|
/* ::: :::::::: */
|
|
/* ft_lstdel.c :+: :+: :+: */
|
|
/* +:+ +:+ +:+ */
|
|
/* By: tmaze <tmaze@student.42.fr> +#+ +:+ +#+ */
|
|
/* +#+#+#+#+#+ +#+ */
|
|
/* Created: 2018/04/08 17:19:32 by tmaze #+# #+# */
|
|
/* Updated: 2018/06/12 00:33:45 by tmaze ### ########.fr */
|
|
/* */
|
|
/* ************************************************************************** */
|
|
|
|
#include "libft.h"
|
|
|
|
void ft_lstdel(t_list **alst, void (*del)(void*, size_t))
|
|
{
|
|
if (*alst)
|
|
{
|
|
if ((*alst)->next != NULL)
|
|
ft_lstdel(&((*alst)->next), del);
|
|
ft_lstdelone(alst, del);
|
|
}
|
|
}
|