blob: 5d164d4633c348f4d3e1229d52de2f0239f9064d (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
|
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_split.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: cacharle <marvin@42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2019/10/17 08:29:02 by cacharle #+# #+# */
/* Updated: 2020/05/11 15:54:10 by charles ### ########.fr */
/* */
/* ************************************************************************** */
#include "libft.h"
static size_t count_segment(char const *s, char c)
{
size_t counter;
int i;
counter = 0;
i = 0;
while (s[i])
{
if (s[i] == c)
{
i++;
continue ;
}
counter++;
while (s[i] && s[i] != c)
i++;
}
return (counter);
}
char **ft_split(char const *s, char c)
{
char **strs;
size_t tab_counter;
size_t i;
size_t j;
if (s == NULL)
return (NULL);
tab_counter = count_segment(s, c);
if ((strs = (char**)malloc(sizeof(char*) * (tab_counter + 1))) == NULL)
return (NULL);
tab_counter = 0;
j = -1;
while (s[++j])
{
if (s[j] == c)
continue ;
i = 0;
while (s[j + i] && s[j + i] != c)
i++;
if ((strs[tab_counter++] = ft_strndup(&s[j], i)) == NULL)
return (ft_strsdestroy(strs));
j += i - 1;
}
strs[tab_counter] = NULL;
return (strs);
}
|
