It finnaly kinda works

algorithm with no double nodes and nearly efficient enough
still some optimizations to find for --big-superposition maps
This commit is contained in:
Tanguy MAZE
2019-04-18 20:18:50 +02:00
commit 54be2278c0
137 changed files with 6194 additions and 0 deletions

24
libft/srcs/ft_putstrn.c Normal file
View File

@@ -0,0 +1,24 @@
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_putstrn.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: tmaze <tmaze@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2018/07/25 16:20:52 by tmaze #+# #+# */
/* Updated: 2018/07/25 16:24:41 by tmaze ### ########.fr */
/* */
/* ************************************************************************** */
#include "libft.h"
void ft_putstrn(char const *s, size_t nb)
{
size_t strlen;
if (s != NULL)
{
strlen = ft_strlen(s);
write(1, s, (nb < strlen) ? nb : strlen);
}
}