86 lines
2.0 KiB
C
86 lines
2.0 KiB
C
/* ************************************************************************** */
|
|
/* */
|
|
/* ::: :::::::: */
|
|
/* ft_strsplit.c :+: :+: :+: */
|
|
/* +:+ +:+ +:+ */
|
|
/* By: gbrochar <marvin@42.fr> +#+ +:+ +#+ */
|
|
/* +#+#+#+#+#+ +#+ */
|
|
/* Created: 2015/11/29 09:55:10 by gbrochar #+# #+# */
|
|
/* Updated: 2015/12/07 11:00:21 by gbrochar ### ########.fr */
|
|
/* */
|
|
/* ************************************************************************** */
|
|
|
|
#include "libft.h"
|
|
|
|
static int ft_wordcount(char const *s, char c)
|
|
{
|
|
int word_count;
|
|
int i;
|
|
|
|
i = 0;
|
|
word_count = 0;
|
|
while (s[i] != '\0')
|
|
{
|
|
while (s[i] == c)
|
|
i++;
|
|
if (s[i] != '\0')
|
|
word_count++;
|
|
while (s[i] != c && s[i] != '\0')
|
|
i++;
|
|
}
|
|
return (word_count);
|
|
}
|
|
|
|
static void *ft_taballoc(char const *s, char **str_tab, char c)
|
|
{
|
|
int i;
|
|
int wl;
|
|
|
|
i = 0;
|
|
while (s[i])
|
|
{
|
|
wl = 0;
|
|
while (s[i] == c && s[i] != '\0')
|
|
i++;
|
|
while (s[i] != c && s[i] != '\0')
|
|
{
|
|
wl++;
|
|
i++;
|
|
}
|
|
if (wl != 0)
|
|
*str_tab++ = (char *)malloc((wl + 1) * sizeof(char));
|
|
if (!(str_tab - 1))
|
|
return (NULL);
|
|
}
|
|
return (*str_tab);
|
|
}
|
|
|
|
char **ft_strsplit(char const *s, char c)
|
|
{
|
|
char **str_tab;
|
|
int i;
|
|
int i2;
|
|
int i3;
|
|
int wc;
|
|
|
|
i = 0;
|
|
i3 = 0;
|
|
wc = ft_wordcount(s, c);
|
|
str_tab = (char **)malloc((wc + 1) * sizeof(char *));
|
|
if (!str_tab)
|
|
return (NULL);
|
|
ft_taballoc(s, str_tab, c);
|
|
while (i != wc)
|
|
{
|
|
i2 = 0;
|
|
while (s[i3] == c && s[i3] != '\0')
|
|
i3++;
|
|
while (s[i3] != c && s[i3] != '\0')
|
|
str_tab[i][i2++] = s[i3++];
|
|
str_tab[i][i2] = '\0';
|
|
i++;
|
|
}
|
|
str_tab[i] = NULL;
|
|
return (str_tab);
|
|
}
|