-
Notifications
You must be signed in to change notification settings - Fork 0
/
ft_split.c
96 lines (87 loc) · 2.04 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
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_split.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: Jev <jsouza-c@student.42sp.org.br> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2021/09/25 19:38:16 by Jev #+# #+# */
/* Updated: 2021/11/06 19:00:20 by Jev ### ########.fr */
/* */
/* ************************************************************************** */
#include "libft.h"
static size_t array_size(char const *str, char c)
{
size_t words;
int i;
int trash;
words = 0;
trash = 0;
i = 0;
if (!str || !*str)
return (words + 1);
if (ft_strchr(str, c) == NULL || !c)
return (words + 2);
while (str[i])
{
if (str[i] == c && trash == 0)
{
words++;
trash++;
}
if (str[i] != c)
trash = 0;
i++;
}
if (str[i - 1] != c)
words++;
return (words + 1);
}
static char *move_n(char const *str, char t)
{
int i;
i = 0;
if (!*str && t == 0)
return (NULL);
while (str[i] == t)
{
i++;
}
str += i;
return ((char *) str);
}
static char *next(char const *s, char c)
{
int range;
char *new;
range = 0;
new = NULL;
while (s[range] != c && s[range] != '\0')
{
range++;
}
if (range > 0)
new = ft_substr(s, 0, range);
return (new);
}
char **ft_split(char const *s, char c)
{
char **storage;
size_t i;
size_t len;
i = 0;
s = move_n(s, c);
len = array_size(s, c);
storage = (char **)malloc(len * sizeof(char *));
if (storage == NULL)
return (NULL);
while (--len)
{
s = move_n(s, c);
storage[i] = next(s, c);
s += ft_strlen(storage[i]);
i++;
}
storage[i] = NULL;
return (storage);
}