-
Notifications
You must be signed in to change notification settings - Fork 0
/
ft_split.c
86 lines (77 loc) · 1.96 KB
/
ft_split.c
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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_split.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: amayo-ca <[email protected]...> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2022/01/30 19:31:49 by amayo-ca #+# #+# */
/* Updated: 2022/02/08 16:15:41 by amayo-ca ### ########.fr */
/* */
/* ************************************************************************** */
#include "libft.h"
static int count_words(const char *str, char c)
{
int i;
int trigger;
i = 0;
trigger = 0;
while (*str)
{
if (*str != c && trigger == 0)
{
trigger = 1;
i++;
}
else if (*str == c)
trigger = 0;
str++;
}
return (i);
}
static char *word_dup(const char *str, int start, int finish)
{
char *word;
int i;
i = 0;
word = malloc((finish - start + 1) * sizeof(char));
if (!word)
return (NULL);
while (start < finish)
word[i++] = str[start++];
word[i] = '\0';
return (word);
}
static char **parse_result(char **split, char const *s, char c)
{
int i;
int j;
int index;
i = 0;
j = 0;
index = -1;
while (i <= ft_strlen(s))
{
if (s[i] != c && index < 0)
index = i;
else if ((s[i] == c || i == ft_strlen(s)) && index >= 0)
{
split[j++] = word_dup(s, index, i);
index = -1;
}
i++;
}
split[j] = 0;
return (split);
}
char **ft_split(char const *s, char c)
{
char **split;
if (!s)
return (0);
split = malloc(sizeof(char *) * (count_words(s, c) + 1));
if (!split)
return (NULL);
split = parse_result(split, s, c);
return (split);
}