algorithm with no double nodes and nearly efficient enough still some optimizations to find for --big-superposition maps
20 lines
1014 B
C
20 lines
1014 B
C
/* ************************************************************************** */
|
|
/* */
|
|
/* ::: :::::::: */
|
|
/* ft_putstr_fd.c :+: :+: :+: */
|
|
/* +:+ +:+ +:+ */
|
|
/* By: tmaze <tmaze@student.42.fr> +#+ +:+ +#+ */
|
|
/* +#+#+#+#+#+ +#+ */
|
|
/* Created: 2018/04/07 23:06:30 by tmaze #+# #+# */
|
|
/* Updated: 2018/04/10 14:26:43 by tmaze ### ########.fr */
|
|
/* */
|
|
/* ************************************************************************** */
|
|
|
|
#include "libft.h"
|
|
|
|
void ft_putstr_fd(char const *s, int fd)
|
|
{
|
|
if (s != NULL && fd >= 0)
|
|
write(fd, s, ft_strlen(s));
|
|
}
|