-
Notifications
You must be signed in to change notification settings - Fork 0
/
split_quotes.c
119 lines (109 loc) · 3.01 KB
/
split_quotes.c
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
110
111
112
113
114
115
116
117
118
119
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* split_quotes.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: rjobert <rjobert@student.42barcelo> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2023/07/30 15:55:43 by rjobert #+# #+# */
/* Updated: 2023/08/01 22:18:50 by rjobert ### ########.fr */
/* */
/* ************************************************************************** */
#include "pipex.h"
char find_sep(char *cmd)
{
int i;
i = 0;
while (cmd[i] && cmd[i] != 34 && cmd[i] != 39)
i++;
return (cmd[i]);
}
/*
count how many words are present, words being being separated by char when
it is not preceded by escape cahracter (\). for instance the sentence if c = '
"Hello, what's up" -> 2 words (Hello, what, s up) but the sentence
"Hello, what\'s up" -> 1 word
*/
static int wordcount(const char *s, char c)
{
int count;
int i;
count = 0;
i = 0;
while (s[i])
{
if (i > 0 && s[i] == c && s[i - 1] != 92 && s[i + 1] != 0)
count++;
i++;
}
return (count + 1);
}
/*
we insert words only when they terminate by the separator not preceded
by
1 - we count how many characters we have until the seprator without escape
and minus the separator (so it "what"\s up") -> 10 characters minus -1 : 9
and we malloc this size
2 - until we have the separator not preceded by escapa character, we
copy characters in new words only if it is not the sep character
*/
static char *word_insert(const char *str, char c, int i, int j)
{
char *word;
while (str[i] && !(str[i] == c && str[i - 1] != 92))
{
if (str[i] == 92)
j++;
i++;
}
word = malloc(i - j + 1);
if (!word)
return (NULL);
i = 0;
j = 0;
while (str[i] && !(str[i] == c && str[i - 1] != 92))
{
if (str[i] != 92)
{
word[j] = str[i];
j++;
}
i++;
}
word[j] = '\0';
return (word);
}
/*
1 - count how many words with wordcount and malloc matrix
2 - while separator we traverse, then as soon as we encounter
a character that is not a seperatorr and that is not preceded by
an escape character -> we fill the matrix with word insert
3 - then we traverse again until we find a separator (not preceded)
*/
char **split_quotes(char const *s, char c)
{
char **matrix;
int i;
int wc;
if (!s)
return (NULL);
wc = wordcount(s, c);
matrix = malloc((wc + 1) * sizeof(char *));
if (!matrix)
return (NULL);
i = 0;
while (*s)
{
while (*s && *s == c)
s++;
if (*s && *s != c && *(s - 1) != 92)
{
matrix[i] = word_insert(s, c, 0, 0);
i++;
while (*s && !(*s == c && *(s - 1) != 92))
s++;
}
}
matrix[i] = NULL;
return (matrix);
}