-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathft_split.c
118 lines (108 loc) · 2.31 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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_split.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: luciehdr <luciehdr@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2020/09/15 17:32:20 by luciehdr #+# #+# */
/* Updated: 2020/12/01 19:38:16 by luciehdr ### ########.fr */
/* */
/* ************************************************************************** */
#include "libft.h"
static void ft_free_double_tab(char **tab, int number_tab)
{
while (number_tab >= 0)
{
free(tab[number_tab]);
tab[number_tab] = NULL;
number_tab--;
}
free(tab);
tab = NULL;
}
static int ft_counter_words(char const *s, char c)
{
int i;
int counter;
i = 0;
counter = 0;
while (s[i])
{
while (s[i] && s[i] == c)
i++;
if (s[i] && s[i] != c)
{
counter++;
while (s[i] && s[i] != c)
i++;
}
}
return (counter);
}
static char **ft_len_words(char **tab, char const *s, char c)
{
int i;
int j;
int size;
i = 0;
j = 0;
size = 0;
while (s[i])
{
while (s[i] && s[i] == c)
i++;
if (s[i] && s[i] != c)
{
while (s[i] && s[i++] != c)
size++;
if (!(tab[j++] = malloc(sizeof(char) * (size + 1))))
{
ft_free_double_tab(tab, j);
return (NULL);
}
size = 0;
}
}
tab[j] = NULL;
return (tab);
}
static char **ft_fill_tab(char **tab, char const *s, char c)
{
int i;
int j;
int k;
i = 0;
j = 0;
k = 0;
while (s[i])
{
while (s[i] && s[i] == c)
i++;
if (s[i] && s[i] != c)
{
while (s[i] && s[i] != c)
{
tab[k][j] = s[i];
i++;
j++;
}
tab[k][j] = '\0';
k++;
j = 0;
}
}
return (tab);
}
char **ft_split(char const *s, char c)
{
char **tab;
if (!s)
return (NULL);
tab = NULL;
if (!(tab = malloc(sizeof(char *) * ft_counter_words(s, c) + 1)))
return (NULL);
ft_len_words(tab, s, c);
ft_fill_tab(tab, s, c);
return (tab);
}