sources/ft_list_tests.c
inline int	ft_list_empty_careful(const t_list_head *head)
{
	t_list_head *next;

	next = head->next;
	return ((next == head) && (next == head->prev));
}
/*
** ft_list_empty_careful - test wether a list is empty and not being modified
*/
test wether a list is empty and not being modified
test wether a list is empty and not being modified
inline int	ft_list_empty_careful(const t_list_head *head)
{
	t_list_head *next;
	next = head->next;
	return ((next == head) && (next == head->prev));
}
inline int ft_list_empty_careful ( const t_list_head * head ) { t_list_head * next ; next = head -> next ; return ( ( next == head ) && ( next == head -> prev ) ) ; }
ft_list_empty_careful - test wether a list is empty and not being modified
ft_list_empty_careful - test wether a list is empty and not being modified