1 /* |
|
2 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER. |
|
3 * |
|
4 * Copyright 2017 Mike Becker, Olaf Wintermann All rights reserved. |
|
5 * |
|
6 * Redistribution and use in source and binary forms, with or without |
|
7 * modification, are permitted provided that the following conditions are met: |
|
8 * |
|
9 * 1. Redistributions of source code must retain the above copyright |
|
10 * notice, this list of conditions and the following disclaimer. |
|
11 * |
|
12 * 2. Redistributions in binary form must reproduce the above copyright |
|
13 * notice, this list of conditions and the following disclaimer in the |
|
14 * documentation and/or other materials provided with the distribution. |
|
15 * |
|
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
|
17 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
|
18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
|
19 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE |
|
20 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
|
21 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
|
22 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
|
23 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
|
24 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
|
25 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|
26 * POSSIBILITY OF SUCH DAMAGE. |
|
27 */ |
|
28 |
|
29 #include "string_tests.h" |
|
30 |
|
31 UCX_TEST(test_sstr_macros) { |
|
32 sstr_t hello = ST("Hello"); |
|
33 sstr_t world = S("World"); |
|
34 |
|
35 char buf[20]; |
|
36 snprintf(buf, sizeof(buf), "%" PRIsstr ", %" PRIsstr "!", SFMT(hello), SFMT(world)); |
|
37 |
|
38 UCX_TEST_BEGIN |
|
39 const char* cmp = "Hello, World!"; |
|
40 UCX_TEST_ASSERT(!strcmp(cmp, buf), "Something weird happened."); |
|
41 UCX_TEST_END |
|
42 } |
|
43 |
|
44 UCX_TEST(test_sstr) { |
|
45 sstr_t s1 = sstr((char*)"1234"); |
|
46 sstr_t s2 = sstrn((char*)"ab", 2); |
|
47 |
|
48 UCX_TEST_BEGIN |
|
49 |
|
50 UCX_TEST_ASSERT(s1.length == 4, "s1 length must be 4"); |
|
51 UCX_TEST_ASSERT(s2.length == 2, "s2 length must be 2"); |
|
52 |
|
53 UCX_TEST_END |
|
54 } |
|
55 |
|
56 UCX_TEST(test_sstr_len) { |
|
57 sstr_t s1 = ST("1234"); |
|
58 sstr_t s2 = ST(".:.:."); |
|
59 sstr_t s3 = ST("X"); |
|
60 |
|
61 size_t len1 = sstrnlen(1, s1); |
|
62 size_t len2 = sstrnlen(2, s1, s2); |
|
63 size_t len3 = sstrnlen(3, s1, s2, s3); |
|
64 |
|
65 UCX_TEST_BEGIN |
|
66 |
|
67 UCX_TEST_ASSERT(len1 == 4, "sstrnlen returned wrong size"); |
|
68 UCX_TEST_ASSERT(len2 == 9, "sstrnlen returned wrong size"); |
|
69 UCX_TEST_ASSERT(len3 == 10, "sstrnlen returned wrong size"); |
|
70 |
|
71 UCX_TEST_END |
|
72 } |
|
73 |
|
74 |
|
75 UCX_TEST(test_sstrchr_sstrrchr) { |
|
76 sstr_t str = ST("I will find you - and I will kill you"); |
|
77 UCX_TEST_BEGIN |
|
78 |
|
79 sstr_t notfound = sstrchr(str, 'x'); |
|
80 UCX_TEST_ASSERT(notfound.length == 0, |
|
81 "string length not 0 after forward search w/o result"); |
|
82 |
|
83 notfound = sstrrchr(str, 'x'); |
|
84 UCX_TEST_ASSERT(notfound.length == 0, |
|
85 "string length not 0 after reverse search w/o result"); |
|
86 |
|
87 sstr_t result = sstrchr(str, 'w'); |
|
88 UCX_TEST_ASSERT(result.length == 35, "sstrchr returned wrong length"); |
|
89 UCX_TEST_ASSERT(strcmp("will find you - and I will kill you", result.ptr) |
|
90 == 0, "sstrchr did not return the expected string"); |
|
91 |
|
92 result = sstrrchr(str, 'w'); |
|
93 UCX_TEST_ASSERT(result.length == 13, "sstrrchr returned wrong length"); |
|
94 UCX_TEST_ASSERT(strcmp("will kill you", result.ptr) |
|
95 == 0, "sstrrchr did not return the expected string"); |
|
96 |
|
97 UCX_TEST_END |
|
98 } |
|
99 |
|
100 UCX_TEST(test_sstrstr) { |
|
101 sstr_t str = ST("find the match in this string"); |
|
102 sstr_t longstr = ST( |
|
103 "abcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijkl" |
|
104 "mnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwx" |
|
105 "yzabcdeababababnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghij" |
|
106 "klmnopqrstuvwxyzaababababababababrstuvwxyzabcdefghijklmnopqrstuv" |
|
107 "abababababababababababababababababababababababababababababababab" |
|
108 "abababababababababababababababababababababababababababababababab" |
|
109 "abababababababababababababababababababababababababababababababab" |
|
110 "abababababababababababababababababababababababababababababababab" |
|
111 "abababababababababababababababababababababababababababababababab" |
|
112 "abababababababababababababababababababababababababababababababab" |
|
113 "wxyz1234567890"); |
|
114 sstr_t longstrpattern = ST( |
|
115 "abababababababababababababababababababababababababababababababab" |
|
116 "abababababababababababababababababababababababababababababababab" |
|
117 "abababababababababababababababababababababababababababababababab" |
|
118 "abababababababababababababababababababababababababababababababab" |
|
119 "abababababababababababababababababababababababababababababababab" |
|
120 ); |
|
121 sstr_t longstrresult = ST( |
|
122 "abababababababababababababababababababababababababababababababab" |
|
123 "abababababababababababababababababababababababababababababababab" |
|
124 "abababababababababababababababababababababababababababababababab" |
|
125 "abababababababababababababababababababababababababababababababab" |
|
126 "abababababababababababababababababababababababababababababababab" |
|
127 "abababababababababababababababababababababababababababababababab" |
|
128 "wxyz1234567890" |
|
129 ); |
|
130 UCX_TEST_BEGIN |
|
131 |
|
132 sstr_t notfound = sstrstr(str, S("no match")); |
|
133 UCX_TEST_ASSERT(notfound.length == 0, "no match must return empty string"); |
|
134 |
|
135 sstr_t result = sstrstr(str, S("match")); |
|
136 UCX_TEST_ASSERT(result.length == 20, "sstrstr returned wrong length"); |
|
137 UCX_TEST_ASSERT(!strcmp("match in this string", result.ptr), |
|
138 "sstrstr did not return the expected string"); |
|
139 |
|
140 result = sstrstr(str, S("")); |
|
141 UCX_TEST_ASSERT(result.length == str.length, |
|
142 "sstrstr with empty match string returned wrong length"); |
|
143 UCX_TEST_ASSERT(!strcmp(str.ptr, result.ptr), |
|
144 "sstrstr with empty match string did not return the original string"); |
|
145 |
|
146 result = sstrstr(longstr, longstrpattern); |
|
147 UCX_TEST_ASSERT(result.length == longstrresult.length, |
|
148 "long string result length incorrect"); |
|
149 UCX_TEST_ASSERT(!strcmp(result.ptr, longstrresult.ptr), |
|
150 "long string result content incorrect"); |
|
151 |
|
152 UCX_TEST_END |
|
153 } |
|
154 |
|
155 UCX_TEST(test_sstrcmp) { |
|
156 sstr_t str = ST("compare this"); |
|
157 |
|
158 UCX_TEST_BEGIN |
|
159 UCX_TEST_ASSERT(sstrcmp(str, S("")) == 1, "empty cmp failed"); |
|
160 UCX_TEST_ASSERT(sstrcmp(S(""), S("")) == 0, "empty cmp false negative"); |
|
161 UCX_TEST_ASSERT(sstrcmp(str, S("compare this")) == 0, "false negative"); |
|
162 UCX_TEST_ASSERT(sstrcmp(str, S("Compare This")) != 0, "false positive"); |
|
163 UCX_TEST_ASSERT(sstrcmp(str, S("compare tool")) < 0, "memcmp < 0 failed"); |
|
164 UCX_TEST_ASSERT(sstrcmp(str, S("compare shit")) > 0, "memcmp > 0 failed"); |
|
165 UCX_TEST_ASSERT(sstrcmp(str, S("compare this not")) < 0, "len < 0 failed"); |
|
166 UCX_TEST_ASSERT(sstrcmp(str, S("compare")) > 0, "len > 0 failed"); |
|
167 UCX_TEST_END |
|
168 } |
|
169 |
|
170 UCX_TEST(test_sstrcasecmp) { |
|
171 |
|
172 sstr_t str = ST("compare this"); |
|
173 |
|
174 UCX_TEST_BEGIN |
|
175 UCX_TEST_ASSERT(sstrcasecmp(str, S("")) == 1, "empty cmp failed"); |
|
176 UCX_TEST_ASSERT(sstrcasecmp(S(""), S("")) == 0, "empty cmp false negative"); |
|
177 UCX_TEST_ASSERT(sstrcasecmp(str, S("compare this")) == 0, "false negative"); |
|
178 UCX_TEST_ASSERT(sstrcasecmp(str, S("Compare This")) == 0, |
|
179 "not ignoring case"); |
|
180 UCX_TEST_ASSERT(sstrcasecmp(str, S("compare tool")) < 0, "< 0 failed"); |
|
181 UCX_TEST_ASSERT(sstrcasecmp(str, S("compare shit")) > 0, "> 0 failed"); |
|
182 UCX_TEST_ASSERT(sstrcasecmp(str, S("compare this not")) < 0, |
|
183 "len < 0 failed"); |
|
184 UCX_TEST_ASSERT(sstrcasecmp(str, S("compare")) > 0, "len > 0 failed"); |
|
185 UCX_TEST_END |
|
186 } |
|
187 |
|
188 |
|
189 UCX_TEST(test_sstrcat) { |
|
190 sstr_t s1 = S("12"); |
|
191 sstr_t s2 = S("34"); |
|
192 sstr_t s3 = S("56"); |
|
193 sstr_t sn = { NULL, 0 }; |
|
194 |
|
195 UCX_TEST_BEGIN |
|
196 |
|
197 sstr_t t1 = sstrcat(2, s1, s2); |
|
198 UCX_TEST_ASSERT(!sstrcmp(t1, S("1234")), "t1: wrong content"); |
|
199 free(t1.ptr); |
|
200 |
|
201 sstr_t t2 = sstrcat(3, s1, s2, s3); |
|
202 UCX_TEST_ASSERT(!sstrcmp(t2, S("123456")), "t2: wrong content"); |
|
203 free(t2.ptr); |
|
204 |
|
205 sstr_t t3 = sstrcat(6, s1, sn, s2, sn, s3, sn); |
|
206 UCX_TEST_ASSERT(!sstrcmp(t3, S("123456")), "t3: wrong content"); |
|
207 free(t3.ptr); |
|
208 |
|
209 sstr_t t4 = sstrcat(2, sn, sn); |
|
210 UCX_TEST_ASSERT(t4.ptr, "t4.ptr is NULL"); |
|
211 UCX_TEST_ASSERT(t4.length == 0, "t4 has wrong length"); |
|
212 free(t4.ptr); |
|
213 |
|
214 // overflow test |
|
215 sstr_t o0; |
|
216 o0.ptr = ""; |
|
217 o0.length = ((size_t)-1) - 50; |
|
218 sstr_t o1; |
|
219 o1.ptr = ""; |
|
220 o1.length = 100; |
|
221 sstr_t o2; |
|
222 o2.ptr = ""; |
|
223 o2.length = 10; |
|
224 |
|
225 sstr_t n = sstrcat(2, o0, o1); |
|
226 UCX_TEST_ASSERT(n.ptr == NULL && n.length == 0, "overflow not detected"); |
|
227 sstr_t n2 = sstrcat(3, o0, o2, o1); |
|
228 UCX_TEST_ASSERT(n2.ptr == NULL && n2.length == 0, "n2: overflow not detected"); |
|
229 |
|
230 UCX_TEST_END |
|
231 |
|
232 } |
|
233 |
|
234 UCX_TEST(test_sstrsplit) { |
|
235 |
|
236 const char *original = "this,is,a,csv,string"; |
|
237 sstr_t test = ST("this,is,a,csv,string"); /* use copy of original here */ |
|
238 ssize_t n; |
|
239 sstr_t *list; |
|
240 |
|
241 UCX_TEST_BEGIN |
|
242 |
|
243 /* Nullpointer check */ |
|
244 n = 0; |
|
245 UCX_TEST_ASSERT(sstrsplit(test, S(""), &n) == NULL, |
|
246 "empty delimiter must return NULL"); |
|
247 |
|
248 /* no delimiter occurence (ndo) */ |
|
249 n = 0; |
|
250 list = sstrsplit(test, S("z"), &n); |
|
251 UCX_TEST_ASSERT(n == 1, "ndo, list length must be 1"); |
|
252 UCX_TEST_ASSERT(strcmp(list[0].ptr, original) == 0, "ndo, " |
|
253 "original string shall be returned as single list element"); |
|
254 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0, |
|
255 "ndo, original has been modified"); |
|
256 for(int i=0;i<n;i++) { |
|
257 free(list[i].ptr); |
|
258 } |
|
259 free(list); |
|
260 |
|
261 /* partially matching delimiter (pmd) */ |
|
262 n = 0; |
|
263 list = sstrsplit(test, S("stringbuilder"), &n); |
|
264 UCX_TEST_ASSERT(n == 1, "pmd, list length must be 1"); |
|
265 UCX_TEST_ASSERT(strcmp(list[0].ptr, original) == 0, "pmd, " |
|
266 "original string shall be returned as single list element"); |
|
267 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0, |
|
268 "pmd, original has been modified"); |
|
269 for(int i=0;i<n;i++) { |
|
270 free(list[i].ptr); |
|
271 } |
|
272 free(list); |
|
273 |
|
274 /* matching single-char delimiter (mscd) */ |
|
275 n = 0; |
|
276 list = sstrsplit(test, S(","), &n); |
|
277 UCX_TEST_ASSERT(n == 5, "mscd, list length must be 5"); |
|
278 UCX_TEST_ASSERT(strcmp(list[0].ptr, "this") == 0, "mscd, item 0 mismatch"); |
|
279 UCX_TEST_ASSERT(strcmp(list[1].ptr, "is") == 0, "mscd, item 1 mismatch"); |
|
280 UCX_TEST_ASSERT(strcmp(list[2].ptr, "a") == 0, "mscd, item 2 mismatch"); |
|
281 UCX_TEST_ASSERT(strcmp(list[3].ptr, "csv") == 0, "mscd, item 3 mismatch"); |
|
282 UCX_TEST_ASSERT(strcmp(list[4].ptr, "string")==0, "mscd, item 4 mismatch"); |
|
283 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0, |
|
284 "mscd, original has been modified"); |
|
285 for(int i=0;i<n;i++) { |
|
286 free(list[i].ptr); |
|
287 } |
|
288 free(list); |
|
289 |
|
290 /* matching multi-char delimiter (mmcd) */ |
|
291 n = 0; |
|
292 list = sstrsplit(test, S("is"), &n); |
|
293 UCX_TEST_ASSERT(n == 3, "mscd, list length must be 3"); |
|
294 UCX_TEST_ASSERT(strcmp(list[0].ptr, "th") == 0, "mmcd, item 0 mismatch"); |
|
295 UCX_TEST_ASSERT(strcmp(list[1].ptr, ",") == 0, "mmcd, item 1 mismatch"); |
|
296 UCX_TEST_ASSERT(strcmp(list[2].ptr, ",a,csv,string") == 0, |
|
297 "mmcd, item 2 mismatch"); |
|
298 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0, |
|
299 "mmcd, original has been modified"); |
|
300 for(int i=0;i<n;i++) { |
|
301 free(list[i].ptr); |
|
302 } |
|
303 free(list); |
|
304 |
|
305 /* bounded list using single-char delimiter (blsc) */ |
|
306 n = 3; |
|
307 list = sstrsplit(test, S(","), &n); |
|
308 UCX_TEST_ASSERT(n == 3, "blsc, list length must be 3"); |
|
309 UCX_TEST_ASSERT(strcmp(list[0].ptr, "this") == 0, "blsc, item 0 mismatch"); |
|
310 UCX_TEST_ASSERT(strcmp(list[1].ptr, "is") == 0, "blsc, item 1 mismatch"); |
|
311 UCX_TEST_ASSERT(strcmp(list[2].ptr, "a,csv,string") == 0, |
|
312 "blsc, item 2 mismatch"); |
|
313 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0, |
|
314 "blsc, original has been modified"); |
|
315 for(int i=0;i<n;i++) { |
|
316 free(list[i].ptr); |
|
317 } |
|
318 free(list); |
|
319 |
|
320 /* bounded list using multi-char delimiter (blmc) */ |
|
321 n = 2; |
|
322 list = sstrsplit(test, S("is"), &n); |
|
323 UCX_TEST_ASSERT(n == 2, "blmc, list length must be 2"); |
|
324 UCX_TEST_ASSERT(strcmp(list[0].ptr, "th") == 0, "blmc, item 0 mismatch"); |
|
325 UCX_TEST_ASSERT(strcmp(list[1].ptr, ",is,a,csv,string") == 0, |
|
326 "blmc, item 1 mismatch"); |
|
327 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0, |
|
328 "blmc, original has been modified"); |
|
329 for(int i=0;i<n;i++) { |
|
330 free(list[i].ptr); |
|
331 } |
|
332 free(list); |
|
333 |
|
334 /* start with delimiter (swd) */ |
|
335 n = 0; |
|
336 list = sstrsplit(test, S("this"), &n); |
|
337 UCX_TEST_ASSERT(n == 2, "swd, list length must be 2"); |
|
338 UCX_TEST_ASSERT(list[0].length == 0, "swd, first item must be empty"); |
|
339 UCX_TEST_ASSERT(strcmp(list[1].ptr, ",is,a,csv,string") == 0, |
|
340 "swd, second item corrupt"); |
|
341 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0, |
|
342 "swd, original has been modified"); |
|
343 for(int i=0;i<n;i++) { |
|
344 free(list[i].ptr); |
|
345 } |
|
346 free(list); |
|
347 |
|
348 /* end with delimiter (ewd) */ |
|
349 n = 0; |
|
350 list = sstrsplit(test, S("string"), &n); |
|
351 UCX_TEST_ASSERT(n == 2, "ewd, list length must be 2"); |
|
352 UCX_TEST_ASSERT(strcmp(list[0].ptr, "this,is,a,csv,") == 0, |
|
353 "ewd, first item corrupt"); |
|
354 UCX_TEST_ASSERT(list[1].length == 0, "ewd, second item must be empty"); |
|
355 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0, |
|
356 "ewd, original has been modified"); |
|
357 for(int i=0;i<n;i++) { |
|
358 free(list[i].ptr); |
|
359 } |
|
360 free(list); |
|
361 |
|
362 /* end with delimiter exceed bound (ewdeb) */ |
|
363 n = 3; |
|
364 sstr_t ewdebtest = ST("a,b,c,"); |
|
365 list = sstrsplit(ewdebtest, S(","), &n); |
|
366 UCX_TEST_ASSERT(n == 3, "ewdeb, list length must be 3"); |
|
367 UCX_TEST_ASSERT(strcmp(list[0].ptr, "a") == 0, "ewdeb, fst item corrupt"); |
|
368 UCX_TEST_ASSERT(strcmp(list[1].ptr, "b") == 0, "ewdeb, snd item corrupt"); |
|
369 UCX_TEST_ASSERT(strcmp(list[2].ptr, "c,") == 0, "ewdeb, trd item corrupt"); |
|
370 for(int i=0;i<n;i++) { |
|
371 free(list[i].ptr); |
|
372 } |
|
373 free(list); |
|
374 |
|
375 /* exact match (exm) */ |
|
376 n = 0; |
|
377 list = sstrsplit(test, S("this,is,a,csv,string"), &n); |
|
378 UCX_TEST_ASSERT(n == 0, "exm, list length must be 0"); |
|
379 UCX_TEST_ASSERT(list == NULL, "exm, list must be NULL"); |
|
380 for(int i=0;i<n;i++) { |
|
381 free(list[i].ptr); |
|
382 } |
|
383 free(list); |
|
384 |
|
385 /* substring (subs) */ |
|
386 n = 0; |
|
387 list = sstrsplit(test, S("this,is,a,csv,string,with,extension"), &n); |
|
388 UCX_TEST_ASSERT(n == 1, "subs, list length must be 1"); |
|
389 UCX_TEST_ASSERT(strcmp(list[0].ptr, original) == 0, |
|
390 "subs, single item must be the original string"); |
|
391 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0, |
|
392 "subs, original has been modified"); |
|
393 for(int i=0;i<n;i++) { |
|
394 free(list[i].ptr); |
|
395 } |
|
396 free(list); |
|
397 |
|
398 /* double encounter delimiter (ded) */ |
|
399 n = 0; |
|
400 list = sstrsplit(test, S("is,"), &n); |
|
401 UCX_TEST_ASSERT(n == 3, "ded, list length must be 3"); |
|
402 UCX_TEST_ASSERT(strcmp(list[0].ptr, "th") == 0, "ded, item 0 mismatch"); |
|
403 UCX_TEST_ASSERT(list[1].length == 0, "ded, item 1 not empty!"); |
|
404 UCX_TEST_ASSERT(strcmp(list[2].ptr, "a,csv,string") == 0, |
|
405 "ded, item 2 mismatch"); |
|
406 for(int i=0;i<n;i++) { |
|
407 free(list[i].ptr); |
|
408 } |
|
409 free(list); |
|
410 |
|
411 UCX_TEST_END |
|
412 } |
|
413 |
|
414 UCX_TEST(test_sstrtrim) { |
|
415 sstr_t t1 = sstrtrim(sstr((char*)" ein test ")); |
|
416 sstr_t t2 = sstrtrim(sstr((char*)"abc")); |
|
417 sstr_t t3 = sstrtrim(sstr((char*)" 123")); |
|
418 sstr_t t4 = sstrtrim(sstr((char*)"xyz ")); |
|
419 sstr_t t5 = sstrtrim(sstr((char*)" ")); |
|
420 sstr_t empty = sstrtrim(sstr((char*)"")); |
|
421 UCX_TEST_BEGIN |
|
422 UCX_TEST_ASSERT(strncmp(t1.ptr, "ein test", t1.length) == 0, "failed"); |
|
423 UCX_TEST_ASSERT(strncmp(t2.ptr, "abc", t2.length) == 0, "failed"); |
|
424 UCX_TEST_ASSERT(strncmp(t3.ptr, "123", t3.length) == 0, "failed"); |
|
425 UCX_TEST_ASSERT(strncmp(t4.ptr, "xyz", t4.length) == 0, "failed"); |
|
426 UCX_TEST_ASSERT(t5.length == 0, "string t5 not empty"); |
|
427 UCX_TEST_ASSERT(empty.length == 0, "empty string failed"); |
|
428 UCX_TEST_END |
|
429 } |
|
430 |
|
431 UCX_TEST(test_sstrprefixsuffix) { |
|
432 sstr_t str = ST("test my prefix and my suffix"); |
|
433 sstr_t empty = ST(""); |
|
434 |
|
435 UCX_TEST_BEGIN |
|
436 |
|
437 UCX_TEST_ASSERT(!sstrprefix(empty, S("pref")), "prefix empty string fails"); |
|
438 UCX_TEST_ASSERT(!sstrsuffix(empty, S("suf")), "suffix empty string fails"); |
|
439 |
|
440 UCX_TEST_ASSERT(sstrprefix(str, empty), "empty prefix fails"); |
|
441 UCX_TEST_ASSERT(sstrsuffix(str, empty), "empty suffix fails"); |
|
442 |
|
443 UCX_TEST_ASSERT(sstrprefix(empty, empty), "string and prefix empty fails"); |
|
444 UCX_TEST_ASSERT(sstrsuffix(empty, empty), "string and suffix empty fails"); |
|
445 |
|
446 UCX_TEST_ASSERT(sstrprefix(str, S("test ")), "prefix false negative"); |
|
447 UCX_TEST_ASSERT(!sstrprefix(str, S("8-) fsck ")), "prefix false positive"); |
|
448 |
|
449 UCX_TEST_ASSERT(sstrsuffix(str, S("fix")), "suffix false negative"); |
|
450 UCX_TEST_ASSERT(!sstrsuffix(str, S("fox")), "suffix false positive"); |
|
451 |
|
452 |
|
453 UCX_TEST_END |
|
454 } |
|
455 |
|
456 UCX_TEST(test_sstrcaseprefixsuffix) { |
|
457 sstr_t str = ST("test my prefix and my suffix"); |
|
458 sstr_t empty = ST(""); |
|
459 |
|
460 UCX_TEST_BEGIN |
|
461 |
|
462 UCX_TEST_ASSERT(!sstrcaseprefix(empty, S("pREf")), "prefix empty string fails"); |
|
463 UCX_TEST_ASSERT(!sstrcasesuffix(empty, S("sUf")), "suffix empty string fails"); |
|
464 |
|
465 UCX_TEST_ASSERT(sstrcaseprefix(str, empty), "empty prefix fails"); |
|
466 UCX_TEST_ASSERT(sstrcasesuffix(str, empty), "empty suffix fails"); |
|
467 |
|
468 UCX_TEST_ASSERT(sstrcaseprefix(empty, empty), "string and prefix empty fails"); |
|
469 UCX_TEST_ASSERT(sstrcasesuffix(empty, empty), "string and suffix empty fails"); |
|
470 |
|
471 UCX_TEST_ASSERT(sstrcaseprefix(str, S("TEST ")), "prefix false negative"); |
|
472 UCX_TEST_ASSERT(!sstrcaseprefix(str, S("8-) fsck ")), "prefix false positive"); |
|
473 |
|
474 UCX_TEST_ASSERT(sstrcasesuffix(str, S("FIX")), "suffix false negative"); |
|
475 UCX_TEST_ASSERT(!sstrcasesuffix(str, S("fox")), "suffix false positive"); |
|
476 |
|
477 UCX_TEST_END |
|
478 } |
|
479 |
|
480 UCX_TEST(test_sstrreplace) { |
|
481 |
|
482 sstr_t str = ST("test ababab string aba"); |
|
483 sstr_t longstr = ST("xyaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaacd"); |
|
484 sstr_t notrail = ST("test abab"); |
|
485 sstr_t empty = ST(""); |
|
486 sstr_t astr = ST("aaaaaaaaaa"); |
|
487 sstr_t csstr = ST("test AB ab TEST xyz"); |
|
488 |
|
489 sstr_t repl = sstrreplace(str, SC("abab"), SC("muchlonger")); |
|
490 sstr_t expected = ST("test muchlongerab string aba"); |
|
491 |
|
492 sstr_t repln = sstrreplacen(str, SC("ab"), SC("c"), 2); |
|
493 sstr_t expectedn = ST("test ccab string aba"); |
|
494 |
|
495 sstr_t longrepl = sstrreplace(longstr, SC("a"), SC("z")); |
|
496 sstr_t longexpect = ST("xyzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzcd"); |
|
497 |
|
498 sstr_t replnotrail = sstrreplace(notrail, SC("ab"), SC("z")); |
|
499 sstr_t notrailexpect = ST("test zz"); |
|
500 |
|
501 sstr_t repleq = sstrreplace(str, str, SC("hello")); |
|
502 sstr_t eqexpect = ST("hello"); |
|
503 |
|
504 sstr_t replempty1 = sstrreplace(empty, SC("ab"), SC("c")); // expect: empty |
|
505 sstr_t replempty2 = sstrreplace(str, SC("abab"), empty); |
|
506 sstr_t emptyexpect2 = ST("test ab string aba"); |
|
507 |
|
508 sstr_t replpre = sstrreplace(str, SC("test "), SC("TEST ")); |
|
509 sstr_t preexpected = ST("TEST ababab string aba"); |
|
510 |
|
511 sstr_t replan1 = sstrreplacen(astr, SC("a"), SC("x"), 1); |
|
512 sstr_t an1expected = ST("xaaaaaaaaa"); |
|
513 |
|
514 sstr_t replan4 = sstrreplacen(astr, SC("a"), SC("x"), 4); |
|
515 sstr_t an4expected = ST("xxxxaaaaaa"); |
|
516 |
|
517 sstr_t replan9 = sstrreplacen(astr, SC("a"), SC("x"), 9); |
|
518 sstr_t an9expected = ST("xxxxxxxxxa"); |
|
519 |
|
520 sstr_t replan10 = sstrreplacen(astr, SC("a"), SC("x"), 10); |
|
521 sstr_t an10expected = ST("xxxxxxxxxx"); |
|
522 |
|
523 sstr_t replcs1 = sstrreplace(csstr, SC("AB"), SC("*")); |
|
524 sstr_t cs1expected = ST("test * ab TEST xyz"); |
|
525 |
|
526 sstr_t replcs2 = sstrreplace(csstr, SC("test"), SC("TEST")); |
|
527 sstr_t cs2expected = ST("TEST AB ab TEST xyz"); |
|
528 |
|
529 UCX_TEST_BEGIN |
|
530 |
|
531 UCX_TEST_ASSERT(repl.ptr != str.ptr, "result string is not fresh"); |
|
532 UCX_TEST_ASSERT(!sstrcmp(repl, expected), "incorrect replacement"); |
|
533 |
|
534 UCX_TEST_ASSERT(repln.ptr != str.ptr, "result string is not fresh"); |
|
535 UCX_TEST_ASSERT(!sstrcmp(repln, expectedn), "incorrect replacement"); |
|
536 |
|
537 UCX_TEST_ASSERT(!sstrcmp(longrepl, longexpect), |
|
538 "incorrect handling of long strings"); |
|
539 |
|
540 UCX_TEST_ASSERT(!sstrcmp(replnotrail, notrailexpect), |
|
541 "no trail replacement fails"); |
|
542 |
|
543 UCX_TEST_ASSERT(!sstrcmp(repleq, eqexpect), |
|
544 "equal replacement fails"); |
|
545 |
|
546 UCX_TEST_ASSERT(!sstrcmp(replempty1, empty), |
|
547 "replacement in empty string fails"); |
|
548 |
|
549 UCX_TEST_ASSERT(!sstrcmp(replempty2, emptyexpect2), |
|
550 "empty replacement fails"); |
|
551 |
|
552 UCX_TEST_ASSERT(!sstrcmp(replpre, preexpected), |
|
553 "prefix replacement fails"); |
|
554 |
|
555 UCX_TEST_ASSERT(!sstrcmp(replan1, an1expected), |
|
556 "a1 replacement fails"); |
|
557 |
|
558 UCX_TEST_ASSERT(!sstrcmp(replan4, an4expected), |
|
559 "a4 replacement fails"); |
|
560 |
|
561 UCX_TEST_ASSERT(!sstrcmp(replan9, an9expected), |
|
562 "a9 replacement fails"); |
|
563 |
|
564 UCX_TEST_ASSERT(!sstrcmp(replan10, an10expected), |
|
565 "a10 replacement fails"); |
|
566 |
|
567 UCX_TEST_ASSERT(!sstrcmp(replcs1, cs1expected), |
|
568 "case sensitivity test1 fails"); |
|
569 |
|
570 UCX_TEST_ASSERT(!sstrcmp(replcs2, cs2expected), |
|
571 "case sensitivity test2 fails"); |
|
572 |
|
573 UCX_TEST_END |
|
574 |
|
575 free(repl.ptr); |
|
576 free(repln.ptr); |
|
577 free(longrepl.ptr); |
|
578 free(replnotrail.ptr); |
|
579 free(repleq.ptr); |
|
580 if(replempty1.ptr) free(replempty1.ptr); |
|
581 free(replempty2.ptr); |
|
582 free(replpre.ptr); |
|
583 free(replan1.ptr); |
|
584 free(replan4.ptr); |
|
585 free(replan9.ptr); |
|
586 free(replan10.ptr); |
|
587 free(replcs1.ptr); |
|
588 free(replcs2.ptr); |
|
589 } |
|