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
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
|
#ifndef STR_H
#define STR_H
#include <stddef.h>
#include "arena.h"
/* non-const *s for convenience's sake, but strings should
* be treated as immutable unless absolutely certain there
* are no dangling references to substrings concatenated
* into it (because str_cat() is sometimes in-place).
*/
typedef struct {
char *s;
ptrdiff_t n;
} Str;
typedef struct {
Str head, tail;
} Cut;
#define S(s) (Str){s,sizeof(s)-1}
Str str_from_cstr(const char *s);
int str_eql(Str a, Str b);
int str_starts(Str a, Str b);
int str_ends(Str a, Str b);
Str str_skip(Str a, ptrdiff_t n);
Str str_trunc(Str a, ptrdiff_t n);
Str str_trim_left(Str a);
Str str_trim_right(Str a);
Str str_trim(Str a);
Cut str_cut(Str s, char c);
Str str_findc(Str s, char c);
Str str_find(Str haystack, Str needle);
int str_contains(Str a, Str b);
char *cstr_dup(const char *s, Arena *a);
char *str_to_cstr(Str s, Arena *a);
void str_cat(Str *a, Str b, Arena *m);
void str_catc(Str *a, char b, Arena *m);
Str str_dup(Str a, Arena *m);
Str str_replace_end(Str s, Str a, Str b, Arena *m);
#ifdef STR_IMPL
#include <string.h>
/* conversions */
Str str_from_cstr(const char *s) {
return (Str) { (char*)s, strlen(s) };
}
/* pure functions */
int str_eql(Str a, Str b) {
return a.n == b.n && !memcmp(a.s, b.s, b.n);
}
int str_starts(Str a, Str b) {
return a.n >= b.n && !memcmp(a.s, b.s, b.n);
}
int str_ends(Str a, Str b) {
return a.n >= b.n && !memcmp(&a.s[a.n - b.n], b.s, b.n);
}
Str str_skip(Str a, ptrdiff_t n) {
return (Str) { a.s + n, a.n - n };
}
Str str_trunc(Str a, ptrdiff_t n) {
return (Str) { a.s, n < a.n ? n : a.n };
}
static inline int str_is_space(char c) {
return c == ' ' || c == '\t' || c == '\n' || c == '\r';
}
Str str_trim_left(Str a) {
while (a.n > 0 && str_is_space(a.s[0])) a.s++, a.n--;
return a;
}
Str str_trim_right(Str a) {
while (a.n > 0 && str_is_space(a.s[a.n - 1])) a.n--;
return a;
}
Str str_trim(Str a) {
return str_trim_left(str_trim_right(a));
}
/* splitting, searching */
Cut str_cut(Str s, char c) {
char *p = memchr(s.s, c, s.n);
if (!p) {
return (Cut) { s, { &s.s[s.n], 0 } };
} else {
return (Cut) {
{ s.s, p - s.s },
{ p + 1, &s.s[s.n] - (p + 1) }
};
}
}
Str str_findc(Str s, char c) {
char *p = memchr(s.s, c, s.n);
return p ? (Str) { p, s.n - (p - s.s) } : (Str) { &s.s[s.n], 0 };
}
Str str_find(Str haystack, Str needle) {
if (needle.n < 1) return haystack;
while (haystack.n > 0) {
haystack = str_findc(haystack, needle.s[0]);
if (str_starts(haystack, needle)) break;
if (haystack.n > 0) haystack = str_skip(haystack, 1);
}
return haystack;
}
int str_contains(Str a, Str b) {
return str_find(a, b).n > 0;
}
/* allocating */
char *cstr_dup(const char *s, Arena *a) {
u32 n = strlen(s) + 1;
char *p = new_arr(a, char, n);
memcpy(p, s, n);
return p;
}
char *str_to_cstr(Str s, Arena *a) {
if (!s.n) return "";
char *r = new_arr(a, char, s.n + 1);
memcpy(r, s.s, s.n);
r[s.n] = 0;
return r;
}
Str str_dup(Str a, Arena *m) {
char *s = new_arr(m, char, a.n);
memcpy(s, a.s, a.n);
a.s = s;
return a;
}
void str_cat(Str *a, Str b, Arena *m) {
a->s = arena_concat(m, a->s, a->n, b.s, b.n, _Alignof(char));
a->n += b.n;
}
void str_catc(Str *a, char b, Arena *m) {
a->s = arena_concat(m, a->s, a->n, &b, 1, _Alignof(char));
a->n++;
}
Str str_replace_end(Str s, Str a, Str b, Arena *m) {
if (!str_ends(s, a)) return s;
char *p = new_arr(m, char, s.n + b.n - a.n);
memcpy(p, s.s, s.n - a.n);
memcpy(p + s.n - a.n, b.s, b.n);
return (Str) { p, s.n + b.n - a.n };
}
#endif
#endif
|
