algorithm with no double nodes and nearly efficient enough still some optimizations to find for --big-superposition maps
24 lines
1.0 KiB
C
24 lines
1.0 KiB
C
/* ************************************************************************** */
|
|
/* */
|
|
/* ::: :::::::: */
|
|
/* ft_striter.c :+: :+: :+: */
|
|
/* +:+ +:+ +:+ */
|
|
/* By: tmaze <marvin@42.fr> +#+ +:+ +#+ */
|
|
/* +#+#+#+#+#+ +#+ */
|
|
/* Created: 2018/04/07 11:17:26 by tmaze #+# #+# */
|
|
/* Updated: 2018/04/10 14:05:25 by tmaze ### ########.fr */
|
|
/* */
|
|
/* ************************************************************************** */
|
|
|
|
#include "libft.h"
|
|
|
|
void ft_striter(char *s, void (*f)(char*))
|
|
{
|
|
unsigned int i;
|
|
|
|
i = 0;
|
|
if (s != NULL && f != NULL)
|
|
while (s[i])
|
|
(*f)(&s[i++]);
|
|
}
|