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
|
/* ************************************************************************** */
/* LE - / */
/* / */
/* ft_split.c .:: .:/ . .:: */
/* +:+:+ +: +: +:+:+ */
/* By: rbousset <marvin@le-101.fr> +:+ +: +: +:+ */
/* #+# #+ #+ #+# */
/* Created: 2019/10/12 19:24:20 by rbousset #+# ## ## #+# */
/* Updated: 2019/10/13 08:37:16 by rbousset ### #+. /#+ ###.fr */
/* / */
/* / */
/* ************************************************************************** */
#include "libft.h"
#include <stddef.h>
#include <stdlib.h>
#include <inttypes.h>
static uint8_t
ft_check(int c, char sep)
{
if (c == sep)
return (1);
return (0);
}
static size_t
ft_strlen_plus(const char *str, char c)
{
size_t i;
size_t count;
uint8_t ibool;
i = 0;
count = 0;
ibool = 1;
while (str[i])
{
while (ft_check(str[i], c) && str[i])
i++;
while (!ft_check(str[i], c) && str[i])
{
if (ibool == 1)
count++;
ibool = 0;
i++;
}
ibool = 1;
}
return (count);
}
static size_t
ft_strlen_again(const char *str, char c)
{
size_t i;
i = 0;
while (!ft_check(str[i], c) && str[i])
i++;
return (i);
}
static char
*ft_strdup_plus(const char *src, char c)
{
size_t i;
size_t slen;
char *nstr;
i = 0;
slen = ft_strlen_again(src, c) + 1;
if (!(nstr = (char*)ft_calloc(slen, sizeof(char))))
return (NULL);
while (!ft_check(src[i], c) && src[i])
{
nstr[i] = src[i];
i++;
}
nstr[i] = '\0';
return (nstr);
}
char
**ft_split(const char *s, char c)
{
size_t i;
size_t j;
char **best_split;
i = 0;
j = 0;
if (!(best_split = (char **)ft_calloc(ft_strlen_plus(s, c) + 1,
sizeof(char *))))
return (NULL);
while (s[i])
{
while (ft_check(s[i], c) && s[i])
i++;
while (!ft_check(s[i], c) && s[i])
{
best_split[j] = ft_strdup_plus(&s[i], c);
i += ft_strlen_again(&s[i], c);
j++;
}
}
best_split[j] = 0;
return (best_split);
}
|
