Repository navigation
Expand file tree
/
Copy pathft_split.c
More file actions
81 lines (73 loc) · 1.78 KB
/
Copy pathft_split.c
File metadata and controls
81 lines (73 loc) · 1.78 KB
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
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_split.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: edpolat <edpolat@student.42istanbul.com +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2026/01/09 20:30:34 by edpolat #+# #+# */
/* Updated: 2026/01/17 23:01:11 by edpolat ### ########.fr */
/* */
/* ************************************************************************** */
#include "libft.h"
static size_t wordcount(char const *ptr, char c)
{
size_t i;
size_t k;
k = 0;
i = 0;
if (!ptr)
return (0);
while (ptr[i])
{
if (ptr[i] != c && (i == 0 || ptr[i - 1] == c))
k++;
i++;
}
return (k);
}
static void freeptr(char **ptr, size_t l)
{
while (l > 0)
{
free(ptr[l]);
l--;
}
free(ptr[0]);
free(ptr);
}
static char **fill_words(char **ptr, char const *s, char c)
{
size_t a;
size_t b;
size_t l;
a = 0;
l = 0;
while (s[a])
{
while (s[a] == c && s[a])
a++;
if (s[a])
{
b = 0;
while (s[a + b] && s[a + b] != c)
b++;
ptr[l] = ft_substr(s, a, b);
if (!ptr[l++])
return (freeptr(ptr, l - 1), NULL);
a += b;
}
}
ptr[l] = NULL;
return (ptr);
}
char **ft_split(char const *s, char c)
{
char **ptr;
if (!s)
return (NULL);
ptr = malloc(sizeof(char *) * (wordcount(s, c) + 1));
if (!ptr)
return (NULL);
return (fill_words(ptr, s, c));
}