28 lines
1.2 KiB
C
28 lines
1.2 KiB
C
/* ************************************************************************** */
|
|
/* */
|
|
/* ::: :::::::: */
|
|
/* ft_lstaddsort.c :+: :+: :+: */
|
|
/* +:+ +:+ +:+ */
|
|
/* By: tmaze <tmaze@student.42.fr> +#+ +:+ +#+ */
|
|
/* +#+#+#+#+#+ +#+ */
|
|
/* Created: 2018/10/01 11:57:25 by tmaze #+# #+# */
|
|
/* Updated: 2018/10/01 13:10:02 by tmaze ### ########.fr */
|
|
/* */
|
|
/* ************************************************************************** */
|
|
|
|
#include "libft.h"
|
|
|
|
void ft_lstaddsort(t_list **lst, t_list *new, int (*f)(void *c1, void *c2),
|
|
int rev)
|
|
{
|
|
t_list *sorted;
|
|
|
|
sorted = *lst;
|
|
if (rev)
|
|
ft_putstr("rev\n");
|
|
while (sorted && (((*f)(sorted->content, new->content) >= 0 && rev))
|
|
|| (*f)(sorted->content, new->content) <= 0)
|
|
sorted = sorted->next;
|
|
ft_lstadd(lst, new);
|
|
}
|