Libft/ft_split.c at main · devPaidion/Libft · GitHub

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
/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   ft_split.c                                         :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: kjungoo <kjungoo@student.42seoul.kr>       +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2022/07/15 17:19:53 by kjungoo           #+#    #+#             */
/*   Updated: 2022/07/30 12:52:21 by kjungoo          ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

#include "libft.h"

static char	*ft_strndup(char const *s, size_t n)
{
	size_t	i;
	char	*p;

	i = 0;
	p = (char *)malloc(sizeof(char) * (n + 1));
	if (p == 0)
		return (0);
	while (i < n)
	{
		p[i] = s[i];
		i++;
	}
	p[i] = '\0';
	return (p);
}

static size_t	ft_word_len(char const *s, char c)
{
	size_t	i;
	size_t	len;

	i = 0;
	len = 0;
	while (s[i] && s[i] != c)
	{
		i++;
		len++;
	}
	return (len);
}

static size_t	ft_word_count(char const *s, char c)
{
	size_t	i;
	size_t	count;

	i = 0;
	count = 0;
	while (s[i] && s[i] == c)
		i++;
	while (s[i])
	{
		count++;
		while (s[i] && s[i] != c)
			i++;
		while (s[i] && s[i] == c)
			i++;
	}
	return (count);
}

static char	**ft_free_all(char **p_arr)
{
	size_t	i;

	i = 0;
	while (p_arr[i])
	{
		free(p_arr[i]);
		i++;
	}
	free(p_arr);
	return (0);
}

char	**ft_split(char const *s, char c)
{
	size_t	i;
	size_t	len;
	size_t	count;
	char	**p_arr;

	if (s == 0)
		return (0);
	i = 0;
	count = ft_word_count(s, c);
	p_arr = (char **)malloc(sizeof(char *) * (count + 1));
	if (p_arr == 0)
		return (0);
	while (i < count)
	{
		while (*s && *s == c)
			s++;
		len = ft_word_len(s, c);
		p_arr[i] = ft_strndup(s, len);
		if (p_arr[i] == 0)
			return (ft_free_all(p_arr));
		s += len;
		i++;
	}
	p_arr[i] = 0;
	return (p_arr);
}