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
|
/*
Libft Copyright (C) 2026 yctct
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
#include "libft.h"
static int ft_countword(char const *s, char c)
{
int i;
int wordcounter;
i = 0;
wordcounter = 0;
while (s[i])
{
if (s[i] == c)
i++;
else
{
wordcounter++;
while (s[i] != c && s[i])
i++;
}
}
return (wordcounter);
}
static char **ft_addwords(char **a, char const *s, char c, int wordcounter)
{
int i;
int start;
int word;
i = 0;
word = 0;
while (wordcounter--)
{
while (s[i] == c)
i++;
start = i;
while (s[i] != c && s[i] != 0)
i++;
a[word] = ft_substr(s, start, i - start);
if (!a[word])
{
while (word-- >= 0)
free(a[word]);
return (free(a), NULL);
}
word++;
i++;
}
return (a[word] = 0, a);
}
char **ft_split(char const *s, char c)
{
char **a;
int wordcounter;
wordcounter = ft_countword(s, c);
a = malloc(sizeof(a) * (wordcounter + 1));
if (!a)
return (NULL);
a = ft_addwords(a, s, c, wordcounter);
return (a);
}
/*
#include <stdio.h>
int main(void)
{
char **b;
int i;
char *s2;
// char *s= "xxxhelloxxallxxofxyoux";
s2 = " code 42 ";
// char **a;
// a = ft_split(s, 'x');
b = ft_split(s2, ' ');
i = 0;
while (b[i])
{
printf("b[%i]: %s\n", i, b[i]);
free(b[i]);
i++;
}
free(b);
}
*/
|
