-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path_tokenize.c
More file actions
93 lines (89 loc) · 2.16 KB
/
Copy path_tokenize.c
File metadata and controls
93 lines (89 loc) · 2.16 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
82
83
84
85
86
87
88
89
90
91
92
93
#include "shell.h"
/**
* _splitString - Function splits a string into words based on a delimiter
* @str: The input string
* @delim: The delimiter string
* Return: Return a pointer to an array of strings, or NULL on failure
*/
char **_splitString(char *str, char *delim)
{
int i, j, k, m, num_words = 0;
char **result;
if (str == NULL || str[0] == '\0')
return (NULL);
if (!delim)
delim = " ";
for (i = 0; str[i] != '\0'; i++)
if (!_isDelimeter(str[i], delim) && (_isDelimeter(str[i + 1], delim) ||
!str[i + 1]))
num_words++;
if (num_words == 0)
return (NULL);
result = malloc((1 + num_words) * sizeof(char *));
if (!result)
return (NULL);
for (i = 0, j = 0; j < num_words; j++)
{
while (_isDelimeter(str[i], delim))
i++;
k = 0;
while (!_isDelimeter(str[i + k], delim) && str[i + k])
k++;
result[j] = malloc((k + 1) * sizeof(char));
if (!result[j])
{
for (k = 0; k < j; k++)
free(result[k]);
free(result);
return (NULL);
}
for (m = 0; m < k; m++)
result[j][m] = str[i++];
result[j][m] = '\0';
}
result[j] = NULL;
return (result);
}
/**
* _splitStringBySingleDelim - splits string into words based on a single delim
* @str: The input string
* @delim: The delimiter
* Return: Return a pointer to an array of strings, or NULL on failure
*/
char **_splitStringBySingleDelim(char *str, char delim)
{
int i, j, k, m, num_words = 0;
char **result;
if (str == NULL || str[0] == '\0')
return (NULL);
for (i = 0; str[i] != '\0'; i++)
if ((str[i] != delim && str[i + 1] == delim) ||
(str[i] != delim && !str[i + 1]) || str[i + 1] == delim)
num_words++;
if (num_words == 0)
return (NULL);
result = malloc((1 + num_words) * sizeof(char *));
if (!result)
return (NULL);
for (i = 0, j = 0; j < num_words; j++)
{
while (str[i] == delim && str[i] != delim)
i++;
k = 0;
while (str[i + k] != delim && str[i + k] && str[i + k] != delim)
k++;
result[j] = malloc((k + 1) * sizeof(char));
if (!result[j])
{
for (k = 0; k < j; k++)
free(result[k]);
free(result);
return (NULL);
}
for (m = 0; m < k; m++)
result[j][m] = str[i++];
result[j][m] = '\0';
}
result[j] = NULL;
return (result);
}