test/string_tests.c@2bc19726c340
test/string_tests.c
Tue, 27 Oct 2015 15:29:34 +0100
- author
- Mike Becker <universe@uap-core.de>
- date
- Tue, 27 Oct 2015 15:29:34 +0100
- changeset 214
- 2bc19726c340
- parent 213
- fa8b745be7b5
- child 225
- a1a068c2c4ef
- permissions
- -rw-r--r--
added sstrstr() function + improved sstrsplit variants by using sstrprefix()
1 /*
2 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
3 *
4 * Copyright 2015 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 */
29 #include "string_tests.h"
31 UCX_TEST(test_sstr) {
32 sstr_t s1 = sstr((char*)"1234");
33 sstr_t s2 = sstrn((char*)"ab", 2);
35 UCX_TEST_BEGIN
37 UCX_TEST_ASSERT(s1.length == 4, "s1 length must be 4");
38 UCX_TEST_ASSERT(s2.length == 2, "s2 length must be 2");
40 UCX_TEST_END
41 }
43 UCX_TEST(test_sstr_len) {
44 sstr_t s1 = ST("1234");
45 sstr_t s2 = ST(".:.:.");
46 sstr_t s3 = ST("X");
48 size_t len1 = sstrnlen(1, s1);
49 size_t len2 = sstrnlen(2, s1, s2);
50 size_t len3 = sstrnlen(3, s1, s2, s3);
52 UCX_TEST_BEGIN
54 UCX_TEST_ASSERT(len1 == 4, "sstrnlen returned wrong size");
55 UCX_TEST_ASSERT(len2 == 9, "sstrnlen returned wrong size");
56 UCX_TEST_ASSERT(len3 == 10, "sstrnlen returned wrong size");
58 UCX_TEST_END
59 }
62 UCX_TEST(test_sstrchr_sstrrchr) {
63 sstr_t str = ST("I will find you - and I will kill you");
64 UCX_TEST_BEGIN
66 sstr_t notfound = sstrchr(str, 'x');
67 UCX_TEST_ASSERT(notfound.length == 0, "string length not 0");
69 sstr_t result = sstrchr(str, 'w');
70 UCX_TEST_ASSERT(result.length == 35, "sstrchr returned wrong length");
71 UCX_TEST_ASSERT(strcmp("will find you - and I will kill you", result.ptr)
72 == 0, "sstrchr did not return the expected string");
74 result = sstrrchr(str, 'w');
75 UCX_TEST_ASSERT(result.length == 13, "sstrrchr returned wrong length");
76 UCX_TEST_ASSERT(strcmp("will kill you", result.ptr)
77 == 0, "sstrrchr did not return the expected string");
79 UCX_TEST_END
80 }
82 UCX_TEST(test_sstrstr) {
83 sstr_t str = ST("find the match in this string");
84 UCX_TEST_BEGIN
86 sstr_t notfound = sstrstr(str, S("no match"));
87 UCX_TEST_ASSERT(notfound.length == 0, "no match must return empty string");
89 sstr_t result = sstrstr(str, S("match"));
90 UCX_TEST_ASSERT(result.length == 20, "sstrstr returned wrong length");
91 UCX_TEST_ASSERT(!strcmp("match in this string", result.ptr),
92 "sstrstr did not return the expected string");
94 result = sstrstr(str, S(""));
95 UCX_TEST_ASSERT(result.length == str.length,
96 "sstrstr with empty match string returned wrong length");
97 UCX_TEST_ASSERT(!strcmp(str.ptr, result.ptr),
98 "sstrstr with empty match string did not return the original string");
100 UCX_TEST_END
101 }
103 UCX_TEST(test_sstrcmp) {
104 sstr_t str = ST("compare this");
106 UCX_TEST_BEGIN
107 UCX_TEST_ASSERT(sstrcmp(str, S("")) == 1, "empty cmp failed");
108 UCX_TEST_ASSERT(sstrcmp(S(""), S("")) == 0, "empty cmp false negative");
109 UCX_TEST_ASSERT(sstrcmp(str, S("compare this")) == 0, "false negative");
110 UCX_TEST_ASSERT(sstrcmp(str, S("Compare This")) != 0, "false positive");
111 UCX_TEST_ASSERT(sstrcmp(str, S("compare tool")) < 0, "memcmp < 0 failed");
112 UCX_TEST_ASSERT(sstrcmp(str, S("compare shit")) > 0, "memcmp > 0 failed");
113 UCX_TEST_ASSERT(sstrcmp(str, S("compare this not")) < 0, "len < 0 failed");
114 UCX_TEST_ASSERT(sstrcmp(str, S("compare")) > 0, "len > 0 failed");
115 UCX_TEST_END
116 }
118 UCX_TEST(test_sstrcasecmp) {
120 sstr_t str = ST("compare this");
122 UCX_TEST_BEGIN
123 UCX_TEST_ASSERT(sstrcasecmp(str, S("")) == 1, "empty cmp failed");
124 UCX_TEST_ASSERT(sstrcasecmp(S(""), S("")) == 0, "empty cmp false negative");
125 UCX_TEST_ASSERT(sstrcasecmp(str, S("compare this")) == 0, "false negative");
126 UCX_TEST_ASSERT(sstrcasecmp(str, S("Compare This")) == 0,
127 "not ignoring case");
128 UCX_TEST_ASSERT(sstrcasecmp(str, S("compare tool")) < 0, "< 0 failed");
129 UCX_TEST_ASSERT(sstrcasecmp(str, S("compare shit")) > 0, "> 0 failed");
130 UCX_TEST_ASSERT(sstrcasecmp(str, S("compare this not")) < 0,
131 "len < 0 failed");
132 UCX_TEST_ASSERT(sstrcasecmp(str, S("compare")) > 0, "len > 0 failed");
133 UCX_TEST_END
134 }
137 UCX_TEST(test_sstrcat) {
138 sstr_t s1 = S("12");
139 sstr_t s2 = S("34");
140 sstr_t s3 = S("56");
141 sstr_t sn = { NULL, 0 };
143 UCX_TEST_BEGIN
145 sstr_t t1 = sstrcat(2, s1, s2);
146 UCX_TEST_ASSERT(!sstrcmp(t1, S("1234")), "t1: wrong content");
147 free(t1.ptr);
149 sstr_t t2 = sstrcat(3, s1, s2, s3);
150 UCX_TEST_ASSERT(!sstrcmp(t2, S("123456")), "t2: wrong content");
151 free(t2.ptr);
153 sstr_t t3 = sstrcat(6, s1, sn, s2, sn, s3, sn);
154 UCX_TEST_ASSERT(!sstrcmp(t3, S("123456")), "t3: wrong content");
155 free(t3.ptr);
157 sstr_t t4 = sstrcat(2, sn, sn);
158 UCX_TEST_ASSERT(t4.ptr, "t4.ptr is NULL");
159 UCX_TEST_ASSERT(t4.length == 0, "t4 has wrong length");
160 free(t4.ptr);
163 UCX_TEST_END
165 }
167 UCX_TEST(test_sstrsplit) {
169 const char *original = "this,is,a,csv,string";
170 sstr_t test = ST("this,is,a,csv,string"); /* use copy of original here */
171 ssize_t n;
172 sstr_t *list;
174 UCX_TEST_BEGIN
176 /* Nullpointer check */
177 n = 0;
178 UCX_TEST_ASSERT(sstrsplit(test, S(""), &n) == NULL,
179 "empty delimiter must return NULL");
181 /* no delimiter occurence (ndo) */
182 n = 0;
183 list = sstrsplit(test, S("z"), &n);
184 UCX_TEST_ASSERT(n == 1, "ndo, list length must be 1");
185 UCX_TEST_ASSERT(strcmp(list[0].ptr, original) == 0, "ndo, "
186 "original string shall be returned as single list element");
187 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
188 "ndo, original has been modified");
189 for(int i=0;i<n;i++) {
190 free(list[i].ptr);
191 }
192 free(list);
194 /* partially matching delimiter (pmd) */
195 n = 0;
196 list = sstrsplit(test, S("stringbuilder"), &n);
197 UCX_TEST_ASSERT(n == 1, "pmd, list length must be 1");
198 UCX_TEST_ASSERT(strcmp(list[0].ptr, original) == 0, "pmd, "
199 "original string shall be returned as single list element");
200 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
201 "pmd, original has been modified");
202 for(int i=0;i<n;i++) {
203 free(list[i].ptr);
204 }
205 free(list);
207 /* matching single-char delimiter (mscd) */
208 n = 0;
209 list = sstrsplit(test, S(","), &n);
210 UCX_TEST_ASSERT(n == 5, "mscd, list length must be 5");
211 UCX_TEST_ASSERT(strcmp(list[0].ptr, "this") == 0, "mscd, item 0 mismatch");
212 UCX_TEST_ASSERT(strcmp(list[1].ptr, "is") == 0, "mscd, item 1 mismatch");
213 UCX_TEST_ASSERT(strcmp(list[2].ptr, "a") == 0, "mscd, item 2 mismatch");
214 UCX_TEST_ASSERT(strcmp(list[3].ptr, "csv") == 0, "mscd, item 3 mismatch");
215 UCX_TEST_ASSERT(strcmp(list[4].ptr, "string")==0, "mscd, item 4 mismatch");
216 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
217 "mscd, original has been modified");
218 for(int i=0;i<n;i++) {
219 free(list[i].ptr);
220 }
221 free(list);
223 /* matching multi-char delimiter (mmcd) */
224 n = 0;
225 list = sstrsplit(test, S("is"), &n);
226 UCX_TEST_ASSERT(n == 3, "mscd, list length must be 3");
227 UCX_TEST_ASSERT(strcmp(list[0].ptr, "th") == 0, "mmcd, item 0 mismatch");
228 UCX_TEST_ASSERT(strcmp(list[1].ptr, ",") == 0, "mmcd, item 1 mismatch");
229 UCX_TEST_ASSERT(strcmp(list[2].ptr, ",a,csv,string") == 0,
230 "mmcd, item 2 mismatch");
231 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
232 "mmcd, original has been modified");
233 for(int i=0;i<n;i++) {
234 free(list[i].ptr);
235 }
236 free(list);
238 /* bounded list using single-char delimiter (blsc) */
239 n = 3;
240 list = sstrsplit(test, S(","), &n);
241 UCX_TEST_ASSERT(n == 3, "blsc, list length must be 3");
242 UCX_TEST_ASSERT(strcmp(list[0].ptr, "this") == 0, "blsc, item 0 mismatch");
243 UCX_TEST_ASSERT(strcmp(list[1].ptr, "is") == 0, "blsc, item 1 mismatch");
244 UCX_TEST_ASSERT(strcmp(list[2].ptr, "a,csv,string") == 0,
245 "blsc, item 2 mismatch");
246 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
247 "blsc, original has been modified");
248 for(int i=0;i<n;i++) {
249 free(list[i].ptr);
250 }
251 free(list);
253 /* bounded list using multi-char delimiter (blmc) */
254 n = 2;
255 list = sstrsplit(test, S("is"), &n);
256 UCX_TEST_ASSERT(n == 2, "blmc, list length must be 2");
257 UCX_TEST_ASSERT(strcmp(list[0].ptr, "th") == 0, "blmc, item 0 mismatch");
258 UCX_TEST_ASSERT(strcmp(list[1].ptr, ",is,a,csv,string") == 0,
259 "blmc, item 1 mismatch");
260 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
261 "blmc, original has been modified");
262 for(int i=0;i<n;i++) {
263 free(list[i].ptr);
264 }
265 free(list);
267 /* start with delimiter (swd) */
268 n = 0;
269 list = sstrsplit(test, S("this"), &n);
270 UCX_TEST_ASSERT(n == 2, "swd, list length must be 2");
271 UCX_TEST_ASSERT(list[0].length == 0, "swd, first item must be empty");
272 UCX_TEST_ASSERT(strcmp(list[1].ptr, ",is,a,csv,string") == 0,
273 "swd, second item corrupt");
274 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
275 "swd, original has been modified");
276 for(int i=0;i<n;i++) {
277 free(list[i].ptr);
278 }
279 free(list);
281 /* end with delimiter (ewd) */
282 n = 0;
283 list = sstrsplit(test, S("string"), &n);
284 UCX_TEST_ASSERT(n == 2, "ewd, list length must be 2");
285 UCX_TEST_ASSERT(strcmp(list[0].ptr, "this,is,a,csv,") == 0,
286 "swd, first item corrupt");
287 UCX_TEST_ASSERT(list[1].length == 0, "ewd, second item must be empty");
288 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
289 "ewd, original has been modified");
290 for(int i=0;i<n;i++) {
291 free(list[i].ptr);
292 }
293 free(list);
295 /* exact match (exm) */
296 n = 0;
297 list = sstrsplit(test, S("this,is,a,csv,string"), &n);
298 UCX_TEST_ASSERT(n == 0, "exm, list length must be 0");
299 UCX_TEST_ASSERT(list == NULL, "exm, list must be NULL");
300 for(int i=0;i<n;i++) {
301 free(list[i].ptr);
302 }
303 free(list);
305 /* substring (subs) */
306 n = 0;
307 list = sstrsplit(test, S("this,is,a,csv,string,with,extension"), &n);
308 UCX_TEST_ASSERT(n == 1, "subs, list length must be 1");
309 UCX_TEST_ASSERT(strcmp(list[0].ptr, original) == 0,
310 "subs, single item must be the original string");
311 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
312 "subs, original has been modified");
313 for(int i=0;i<n;i++) {
314 free(list[i].ptr);
315 }
316 free(list);
318 /* double encounter delimiter (ded) */
319 n = 0;
320 list = sstrsplit(test, S("is,"), &n);
321 UCX_TEST_ASSERT(n == 3, "ded, list length must be 3");
322 UCX_TEST_ASSERT(strcmp(list[0].ptr, "th") == 0, "ded, item 0 mismatch");
323 UCX_TEST_ASSERT(list[1].length == 0, "ded, item 1 not empty!");
324 UCX_TEST_ASSERT(strcmp(list[2].ptr, "a,csv,string") == 0,
325 "ded, item 2 mismatch");
326 for(int i=0;i<n;i++) {
327 free(list[i].ptr);
328 }
329 free(list);
331 UCX_TEST_END
332 }
334 UCX_TEST(test_sstrtrim) {
335 sstr_t t1 = sstrtrim(sstr((char*)" ein test "));
336 sstr_t t2 = sstrtrim(sstr((char*)"abc"));
337 sstr_t t3 = sstrtrim(sstr((char*)" 123"));
338 sstr_t t4 = sstrtrim(sstr((char*)"xyz "));
339 sstr_t t5 = sstrtrim(sstr((char*)" "));
340 sstr_t empty = sstrtrim(sstr((char*)""));
341 UCX_TEST_BEGIN
342 UCX_TEST_ASSERT(strncmp(t1.ptr, "ein test", t1.length) == 0, "failed");
343 UCX_TEST_ASSERT(strncmp(t2.ptr, "abc", t2.length) == 0, "failed");
344 UCX_TEST_ASSERT(strncmp(t3.ptr, "123", t3.length) == 0, "failed");
345 UCX_TEST_ASSERT(strncmp(t4.ptr, "xyz", t4.length) == 0, "failed");
346 UCX_TEST_ASSERT(t5.length == 0, "string t5 not empty");
347 UCX_TEST_ASSERT(empty.length == 0, "empty string failed");
348 UCX_TEST_END
349 }
351 UCX_TEST(test_sstrprefixsuffix) {
352 sstr_t str = ST("test my prefix and my suffix");
353 sstr_t empty = ST("");
355 UCX_TEST_BEGIN
357 UCX_TEST_ASSERT(!sstrprefix(empty, S("pref")), "prefix empty string fails");
358 UCX_TEST_ASSERT(!sstrsuffix(empty, S("suf")), "suffix empty string fails");
360 UCX_TEST_ASSERT(sstrprefix(str, empty), "empty prefix fails");
361 UCX_TEST_ASSERT(sstrsuffix(str, empty), "empty suffix fails");
363 UCX_TEST_ASSERT(sstrprefix(empty, empty), "string and prefix empty fails");
364 UCX_TEST_ASSERT(sstrsuffix(empty, empty), "string and suffix empty fails");
366 UCX_TEST_ASSERT(sstrprefix(str, S("test ")), "prefix false negative");
367 UCX_TEST_ASSERT(!sstrprefix(str, S("8-) fsck ")), "prefix false positive");
369 UCX_TEST_ASSERT(sstrsuffix(str, S("fix")), "suffix false negative");
370 UCX_TEST_ASSERT(!sstrsuffix(str, S("fox")), "suffix false positive");
373 UCX_TEST_END
374 }
