libft/ft_split.c at master · oishchen42/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
/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   ft_split.c                                         :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: oishchen <oishchen@student.42.fr>          +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2025/03/14 11:18:36 by oishchen          #+#    #+#             */
/*   Updated: 2025/03/24 09:40:39 by oishchen         ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

#include <stdlib.h>
#include <stddef.h>
#include "libft.h"

static int	ft_count_words(char const *str, char sep)
{
	int	words;
	int	i;

	if (!(*str))
		return (0);
	words = 0;
	i = 0;
	while (str[i])
	{
		if (str[i] != sep && (i == 0 || str[i - 1] == sep))
			words++;
		i++;
	}
	return (words);
}

int	nword_len(char const *str, char sep)
{
	int	len;

	len = 0;
	while (*str && *str != sep)
	{
		len++;
		str++;
	}
	return (len);
}

char	**each_node_free(char **str_split, int pos)
{
	while (pos >= 0)
	{
		free(str_split[pos]);
		pos--;
	}
	free(str_split);
	return (NULL);
}

char	**ft_split(char const *str, char sep)
{
	int		split_pos;
	int		str_pos;
	char	**result;
	int		next_len;

	result = (char **)malloc((ft_count_words(str, sep) + 1) * sizeof(char *));
	if (!result)
		return (NULL);
	str_pos = 0;
	split_pos = 0;
	while (str[str_pos])
	{
		while (str[str_pos] == sep)
			str_pos++;
		if (str[str_pos])
		{
			next_len = nword_len((str + str_pos), sep);
			result[split_pos++] = ft_substr(str, str_pos, next_len);
			if (!result[split_pos - 1])
				return (each_node_free(result, split_pos - 1));
			str_pos += next_len;
		}
	}
	result[split_pos] = (NULL);
	return (result);
}
		// while (str[str_pos] == sep)
		// 	str_pos++;
// int	skip_sep(char *str, char sep, int *pos)
// {
// 	while (str[*pos] == sep)
// 		*pos++;
// 	if (str[*pos])
// 		return (1);
// 	return (0);
// }