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
|
#ifndef STR_H
#define STR_H
#include <string.h>
#include <stddef.h>
#include "typ.h"
#include "arena.h"
typedef struct {
char *s;
isize n;
} Str;
#define S(s) (Str){s,sizeof(s)-1}
/* allocating */
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;
}
static inline void str_cat(Str *a, Str b, Arena *m) {
a->s = resize(m, a->s, a->n, a->n + b.n);
memcpy(&a->s[a->n], b.s, b.n);
a->n += b.n;
}
/* conversions */
static inline char *str_to_cstr(Str s, Arena *a) {
char *r = new_arr(a, char, s.n + 1);
memcpy(r, s.s, s.n);
r[s.n] = 0;
return r;
}
static inline Str str_from_cstr(const char *s) {
return (Str) { (char*)s, strlen(s) };
}
/* pure functions */
static inline int str_eql(Str a, Str b) {
return a.n == b.n && !memcmp(a.s, b.s, b.n);
}
static inline int str_starts(Str a, Str b) {
return a.n >= b.n && !memcmp(a.s, b.s, b.n);
}
static inline int str_ends(Str a, Str b) {
return a.n >= b.n && !memcmp(&a.s[a.n - b.n], b.s, b.n);
}
static inline void str_catc(Str *a, char b, Arena *m) {
a->s = resize(m, a->s, a->n, a->n + 1);
a->s[a->n++] = b;
}
static inline Str str_skip(Str a, isize n) {
return (Str) { a.s + n, a.n - n };
}
static inline int is_space(char c) {
return c == ' ' || c == '\t' || c == '\n' || c == '\r';
}
static inline Str str_trim_left(Str a) {
while (a.n > 0 && is_space(a.s[0])) a.s++, a.n--;
return a;
}
static inline Str str_trim_right(Str a) {
while (a.n > 0 && is_space(a.s[a.n - 1])) a.n--;
return a;
}
static inline Str str_trim(Str a) {
return str_trim_left(str_trim_right(a));
}
/* splitting, searching */
typedef struct {
Str head, tail;
} Cut;
static inline 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) }
};
}
}
static inline 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 };
}
static inline 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;
}
return haystack;
}
static inline int str_contains(Str a, Str b) {
return str_find(a, b).n > 0;
}
#endif
|
