algorithm with no double nodes and nearly efficient enough still some optimizations to find for --big-superposition maps
19 lines
1.0 KiB
C
19 lines
1.0 KiB
C
/* ************************************************************************** */
|
|
/* */
|
|
/* ::: :::::::: */
|
|
/* ft_strequ.c :+: :+: :+: */
|
|
/* +:+ +:+ +:+ */
|
|
/* By: tmaze <tmaze@student.42.fr> +#+ +:+ +#+ */
|
|
/* +#+#+#+#+#+ +#+ */
|
|
/* Created: 2018/04/07 15:10:56 by tmaze #+# #+# */
|
|
/* Updated: 2018/04/10 14:09:20 by tmaze ### ########.fr */
|
|
/* */
|
|
/* ************************************************************************** */
|
|
|
|
#include "libft.h"
|
|
|
|
int ft_strequ(char const *s1, char const *s2)
|
|
{
|
|
return ((s1 != NULL && s2 != NULL) ? ft_strcmp(s1, s2) == 0 : 0);
|
|
}
|