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
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
|
/* MIT License
*
* Copyright (c) 2021 Tyge Løvset, NORCE, www.norceresearch.no
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
/* A string type with short string optimization in C99 with optimal short string
* utilization (23 characters with 24 bytes string representation).
*/
#ifndef SSTR_INCLUDED
#define SSTR_INCLUDED
#include <stc/ccommon.h>
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#ifndef sstr_size_t
typedef size_t sstr_size_t;
#endif
typedef struct { char* data; sstr_size_t size, cap; } sstr_rep_t;
typedef const char sstr_literal_t[];
typedef union {
struct { char* data; sstr_size_t size, ncap; } lon;
struct { char data[sizeof(sstr_rep_t)]; } sso;
} sstr;
/**************************** PRIVATE API **********************************/
enum { SSO_CAP = offsetof(sstr, lon.ncap) + sizeof((sstr){{0}}.lon.ncap) - 1 };
#define sstr_is_long(s) (bool)((s)->sso.data[SSO_CAP] & 128)
#define sstr_select_(s, memb) (sstr_is_long(s) ? sstr_l_##memb : sstr_s_##memb)
#define sstr_s_cap(s) SSO_CAP
#define sstr_s_size(s) ((sstr_size_t)(SSO_CAP - (s)->sso.data[SSO_CAP]))
#define sstr_s_set_size(s, len) ((s)->sso.data[SSO_CAP] = SSO_CAP - (len), (s)->sso.data[len] = 0)
#define sstr_s_data(s) (s)->sso.data
#define sstr_s_end(s) ((s)->sso.data + sstr_s_size(s))
#if defined(__BYTE_ORDER__) && __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__
#define byte_rotl_(x, b) ((x) << (b)*8 | (x) >> (sizeof(x) - (b))*8)
#define sstr_l_cap(s) (~byte_rotl_((s)->lon.ncap, sizeof((s)->lon.ncap) - 1))
#define sstr_l_set_cap(s, cap) ((s)->lon.ncap = ~byte_rotl_(cap, 1))
#else
#define sstr_l_cap(s) (~(s)->lon.ncap)
#define sstr_l_set_cap(s, cap) ((s)->lon.ncap = ~(cap))
#endif
#define sstr_l_size(s) ((s)->lon.size)
#define sstr_l_set_size(s, len) ((s)->lon.data[(s)->lon.size = (len)] = 0)
#define sstr_l_data(s) (s)->lon.data
#define sstr_l_end(s) ((s)->lon.data + sstr_l_size(s))
#define sstr_l_del(s) free((s)->lon.data)
STC_API char* sstr_init_(sstr* self, sstr_size_t len, sstr_size_t cap);
STC_API void sstr_internal_move_(sstr* self, size_t pos1, size_t pos2);
STC_INLINE void sstr_set_size_(sstr* self, sstr_size_t len) {
sstr_select_(self, set_size(self, len));
}
STC_INLINE sstr_rep_t sstr_rep_(sstr* self) {
return sstr_is_long(self)
? c_make(sstr_rep_t){self->lon.data, sstr_l_size(self), sstr_l_cap(self)}
: c_make(sstr_rep_t){self->sso.data, sstr_s_size(self), sstr_s_cap(self)};
}
/**************************** PUBLIC API **********************************/
#define sstr_lit(lit) sstr_from_n(lit, sizeof((sstr_literal_t){lit}) - 1)
#define sstr_npos (~(sstr_size_t)0 >> 1)
STC_API char* sstr_reserve(sstr* self, sstr_size_t cap);
STC_API void sstr_shrink_to_fit(sstr* self);
STC_API void sstr_resize(sstr* self, sstr_size_t size, char value);
STC_API char* strnstrn(const char *s, const char *needle, size_t slen, size_t nlen);
STC_API sstr_size_t sstr_find_n(sstr s, const char* needle, sstr_size_t pos, sstr_size_t nmax);
STC_API void sstr_assign_n(sstr* self, const char* str, sstr_size_t n);
STC_API void sstr_append_n(sstr* self, const char* str, sstr_size_t n);
STC_API bool sstr_getdelim(sstr *self, int delim, FILE *fp);
STC_API void sstr_erase_n(sstr* self, size_t pos, size_t n);
STC_INLINE sstr sstr_init(void) {
sstr s;
sstr_s_set_size(&s, 0);
return s;
}
STC_INLINE sstr sstr_from_n(const char* str, sstr_size_t n) {
sstr s;
memcpy(sstr_init_(&s, n, n), str, n);
return s;
}
STC_INLINE sstr sstr_from(const char* str) {
return sstr_from_n(str, strlen(str));
}
STC_INLINE sstr sstr_with_size(sstr_size_t size, char value) {
sstr s;
memset(sstr_init_(&s, size, size), value, size);
return s;
}
STC_INLINE sstr sstr_with_capacity(sstr_size_t cap) {
sstr s;
sstr_init_(&s, 0, cap);
return s;
}
STC_INLINE sstr sstr_clone(sstr s) {
sstr_rep_t rep = sstr_rep_(&s);
return sstr_from_n(rep.data, rep.size);
}
STC_INLINE void sstr_del(sstr* self) {
if (sstr_is_long(self)) sstr_l_del(self);
}
STC_INLINE void sstr_clear(sstr* self) {
sstr_set_size_(self, 0);
}
STC_INLINE char* sstr_data(sstr* self) {
return sstr_select_(self, data(self));
}
STC_INLINE const char* sstr_str(const sstr* self) {
return sstr_select_(self, data(self));
}
STC_INLINE bool sstr_empty(sstr s) {
return sstr_select_(&s, size(&s)) == 0;
}
STC_INLINE sstr_size_t sstr_size(sstr s) {
return sstr_select_(&s, size(&s));
}
STC_INLINE sstr_size_t sstr_length(sstr s) {
return sstr_select_(&s, size(&s));
}
STC_INLINE sstr_size_t sstr_capacity(sstr s) {
return sstr_select_(&s, cap(&s));
}
STC_INLINE bool sstr_equals(sstr s1, const char* str) {
return strcmp(sstr_str(&s1), str) == 0;
}
STC_INLINE bool sstr_equals_s(sstr s1, sstr s2) {
return strcmp(sstr_str(&s1), sstr_str(&s2)) == 0;
}
STC_INLINE bool sstr_equalto(const sstr* s1, const sstr* s2) {
return strcmp(sstr_str(s1), sstr_str(s2)) == 0;
}
STC_INLINE int sstr_compare(const sstr* s1, const sstr* s2) {
return strcmp(sstr_str(s1), sstr_str(s2));
}
STC_INLINE sstr_size_t sstr_find(sstr s, const char* needle) {
const char *str = sstr_str(&s), *res = strstr(str, needle);
return res ? res - str : sstr_npos;
}
STC_INLINE bool sstr_find_s(sstr s, sstr needle) {
return sstr_find(s, sstr_str(&needle));
}
STC_INLINE bool sstr_contains(sstr s, const char* needle) {
return strstr(sstr_str(&s), needle) != NULL;
}
STC_INLINE bool sstr_contains_s(sstr s, sstr needle) {
return strstr(sstr_str(&s), sstr_str(&needle)) != NULL;
}
STC_INLINE bool sstr_starts_with(sstr s, const char* sub) {
const char* str = sstr_str(&s);
while (*sub && *str == *sub) ++str, ++sub;
return *sub == 0;
}
STC_INLINE bool sstr_starts_with_s(sstr s, sstr sub) {
return sstr_starts_with(s, sstr_str(&sub));
}
STC_INLINE bool sstr_ends_with(sstr s, const char* sub) {
sstr_rep_t rep = sstr_rep_(&s); sstr_size_t n = strlen(sub);
return n <= rep.size && memcmp(rep.data + rep.size - n, sub, n) == 0;
}
STC_INLINE bool sstr_ends_with_s(sstr s, sstr sub) {
return sstr_ends_with(s, sstr_str(&sub));
}
STC_INLINE void sstr_assign(sstr* self, const char* str) {
sstr_assign_n(self, str, strlen(str));
}
STC_INLINE void sstr_copy(sstr* self, sstr s) {
sstr_rep_t rep = sstr_rep_(&s);
sstr_assign_n(self, rep.data, rep.size);
}
STC_INLINE void sstr_append(sstr* self, const char* str) {
sstr_append_n(self, str, strlen(str));
}
STC_INLINE void sstr_append_s(sstr* self, sstr s) {
sstr_rep_t rep = sstr_rep_(&s);
sstr_append_n(self, rep.data, rep.size);
}
STC_INLINE void sstr_replace_n(sstr* self, size_t pos, size_t len, const char* str, size_t n) {
sstr_internal_move_(self, pos + len, pos + n);
memcpy(&sstr_data(self)[pos], str, n);
}
STC_INLINE void sstr_replace(sstr* self, size_t pos, size_t len, const char* str) {
sstr_replace_n(self, pos, len, str, strlen(str));
}
STC_INLINE void sstr_replace_s(sstr* self, size_t pos, size_t len, sstr s) {
sstr_rep_t rep = sstr_rep_(&s);
sstr_replace_n(self, pos, len, rep.data, rep.size);
}
STC_INLINE void sstr_insert_n(sstr* self, size_t pos, const char* str, size_t n) {
sstr_replace_n(self, pos, 0, str, n);
}
STC_INLINE void sstr_insert(sstr* self, size_t pos, const char* str) {
sstr_replace_n(self, pos, 0, str, strlen(str));
}
STC_INLINE void sstr_insert_s(sstr* self, size_t pos, sstr s) {
sstr_rep_t rep = sstr_rep_(&s);
sstr_replace_n(self, pos, 0, rep.data, rep.size);
}
STC_INLINE bool sstr_getline(sstr *self, FILE *fp) {
return sstr_getdelim(self, '\n', fp);
}
/* -------------------------- IMPLEMENTATION ------------------------- */
#if !defined(STC_HEADER) || defined(STC_IMPLEMENTATION)
STC_DEF void sstr_internal_move_(sstr* self, size_t pos1, size_t pos2) {
if (pos1 == pos2)
return;
sstr_rep_t rep = sstr_rep_(self);
sstr_size_t newlen = rep.size + pos2 - pos1;
if (newlen > rep.cap)
rep.data = sstr_reserve(self, (rep.size*3 >> 1) + pos2 - pos1);
memmove(&rep.data[pos2], &rep.data[pos1], rep.size - pos1);
sstr_set_size_(self, newlen);
}
STC_DEF char* sstr_init_(sstr* self, sstr_size_t len, sstr_size_t cap) {
if (cap > SSO_CAP) {
self->lon.data = (char *)malloc(cap + 1);
sstr_l_set_size(self, len);
sstr_l_set_cap(self, cap);
return self->lon.data;
}
sstr_s_set_size(self, len);
return self->sso.data;
}
STC_DEF void sstr_shrink_to_fit(sstr* self) {
sstr_rep_t rep = sstr_rep_(self);
if (rep.size == rep.cap)
return;
if (rep.size > SSO_CAP) {
self->lon.data = (char *)realloc(self->lon.data, sstr_l_size(self) + 1);
sstr_l_set_cap(self, sstr_l_size(self));
} else if (rep.cap > SSO_CAP) {
memcpy(self->sso.data, rep.data, rep.size + 1);
sstr_s_set_size(self, rep.size);
free(rep.data);
}
}
STC_DEF char* sstr_reserve(sstr* self, sstr_size_t cap) {
if (sstr_is_long(self)) {
if (cap > sstr_l_cap(self)) {
self->lon.data = (char *)realloc(self->lon.data, cap + 1);
sstr_l_set_cap(self, cap);
}
return self->lon.data;
}
/* from short to long: */
if (cap > sstr_s_cap(self)) {
char* data = (char *)malloc(cap + 1);
sstr_size_t len = sstr_s_size(self);
memcpy(data, self->sso.data, len);
self->lon.data = data;
sstr_l_set_size(self, len);
sstr_l_set_cap(self, cap);
return data;
}
return self->sso.data;
}
STC_DEF void sstr_resize(sstr* self, sstr_size_t size, char value) {
sstr_rep_t rep = sstr_rep_(self);
if (size > rep.size) {
if (size > rep.cap) rep.data = sstr_reserve(self, size);
memset(rep.data + rep.size, value, size - rep.size);
}
sstr_set_size_(self, size);
}
STC_DEF char* strnstrn(const char *s, const char *needle, size_t slen, size_t nlen) {
if (!nlen) return (char *)s;
if (nlen > slen) return NULL;
slen -= nlen;
do {
if (*s == *needle && !memcmp(s, needle, nlen)) return (char *)s;
++s;
} while (slen--);
return NULL;
}
STC_DEF sstr_size_t
sstr_find_n(sstr s, const char* needle, sstr_size_t pos, sstr_size_t nmax) {
sstr_rep_t rep = sstr_rep_(&s);
sstr_size_t nlen = (sstr_size_t) strlen(needle);
if (pos > rep.size) return sstr_npos;
char* res = strnstrn(rep.data + pos, needle, rep.size, nmax < nlen ? nmax : nlen);
return res ? res - rep.data : sstr_npos;
}
STC_DEF void sstr_assign_n(sstr* self, const char* str, sstr_size_t n) {
sstr_rep_t rep = sstr_rep_(self);
if (n > rep.cap) {
rep.data = (char *)realloc(sstr_is_long(self) ? rep.data : NULL, n + 1);
sstr_l_set_cap(self, n);
}
memmove(rep.data, str, n);
sstr_set_size_(self, n);
}
STC_DEF void sstr_append_n(sstr* self, const char* str, sstr_size_t n) {
sstr_rep_t rep = sstr_rep_(self);
if (rep.size + n > rep.cap) {
sstr_size_t off = (sstr_size_t)(str - rep.data); /* handle self append */
rep.data = sstr_reserve(self, (rep.size*3 >> 1) + n);
if (off <= rep.size) str = rep.data + off;
}
memcpy(rep.data + rep.size, str, n);
sstr_set_size_(self, rep.size + n);
}
STC_DEF bool sstr_getdelim(sstr *self, int delim, FILE *fp) {
int c = fgetc(fp);
if (c == EOF)
return false;
sstr_size_t pos = 0;
sstr_rep_t rep = sstr_rep_(self);
for (;;) {
if (c == delim || c == EOF) {
sstr_set_size_(self, pos);
return true;
}
if (pos == rep.cap) {
sstr_set_size_(self, pos);
rep.data = sstr_reserve(self, (rep.cap = (rep.cap*3 >> 1) + 16));
}
rep.data[pos++] = (char) c;
c = fgetc(fp);
}
}
STC_DEF void sstr_erase_n(sstr* self, size_t pos, size_t n) {
sstr_rep_t rep = sstr_rep_(self);
if (n > rep.size - pos) n = rep.size - pos;
memmove(&rep.data[pos], &rep.data[pos + n], rep.size - (pos + n));
sstr_set_size_(self, rep.size - n);
}
#endif
#endif
|