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()

universe@39 1 /*
universe@103 2 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
universe@39 3 *
universe@192 4 * Copyright 2015 Olaf Wintermann. All rights reserved.
universe@103 5 *
universe@103 6 * Redistribution and use in source and binary forms, with or without
universe@103 7 * modification, are permitted provided that the following conditions are met:
universe@103 8 *
universe@103 9 * 1. Redistributions of source code must retain the above copyright
universe@103 10 * notice, this list of conditions and the following disclaimer.
universe@103 11 *
universe@103 12 * 2. Redistributions in binary form must reproduce the above copyright
universe@103 13 * notice, this list of conditions and the following disclaimer in the
universe@103 14 * documentation and/or other materials provided with the distribution.
universe@103 15 *
universe@103 16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
universe@103 17 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
universe@103 18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
universe@103 19 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
universe@103 20 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
universe@103 21 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
universe@103 22 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
universe@103 23 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
universe@103 24 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
universe@103 25 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
universe@103 26 * POSSIBILITY OF SUCH DAMAGE.
universe@39 27 */
universe@39 28
universe@39 29 #include "string_tests.h"
universe@39 30
universe@134 31 UCX_TEST(test_sstr) {
universe@74 32 sstr_t s1 = sstr((char*)"1234");
universe@74 33 sstr_t s2 = sstrn((char*)"ab", 2);
olaf@198 34
olaf@47 35 UCX_TEST_BEGIN
olaf@47 36
olaf@47 37 UCX_TEST_ASSERT(s1.length == 4, "s1 length must be 4");
olaf@47 38 UCX_TEST_ASSERT(s2.length == 2, "s2 length must be 2");
olaf@47 39
olaf@47 40 UCX_TEST_END
olaf@47 41 }
olaf@47 42
universe@179 43 UCX_TEST(test_sstr_len) {
universe@116 44 sstr_t s1 = ST("1234");
universe@116 45 sstr_t s2 = ST(".:.:.");
universe@116 46 sstr_t s3 = ST("X");
olaf@47 47
olaf@184 48 size_t len1 = sstrnlen(1, s1);
olaf@184 49 size_t len2 = sstrnlen(2, s1, s2);
olaf@184 50 size_t len3 = sstrnlen(3, s1, s2, s3);
olaf@47 51
olaf@47 52 UCX_TEST_BEGIN
olaf@47 53
olaf@184 54 UCX_TEST_ASSERT(len1 == 4, "sstrnlen returned wrong size");
olaf@184 55 UCX_TEST_ASSERT(len2 == 9, "sstrnlen returned wrong size");
olaf@184 56 UCX_TEST_ASSERT(len3 == 10, "sstrnlen returned wrong size");
universe@179 57
olaf@47 58 UCX_TEST_END
olaf@47 59 }
olaf@47 60
olaf@180 61
universe@149 62 UCX_TEST(test_sstrchr_sstrrchr) {
universe@148 63 sstr_t str = ST("I will find you - and I will kill you");
universe@148 64 UCX_TEST_BEGIN
universe@148 65
olaf@184 66 sstr_t notfound = sstrchr(str, 'x');
olaf@184 67 UCX_TEST_ASSERT(notfound.length == 0, "string length not 0");
olaf@184 68
universe@148 69 sstr_t result = sstrchr(str, 'w');
universe@148 70 UCX_TEST_ASSERT(result.length == 35, "sstrchr returned wrong length");
universe@148 71 UCX_TEST_ASSERT(strcmp("will find you - and I will kill you", result.ptr)
universe@148 72 == 0, "sstrchr did not return the expected string");
universe@148 73
universe@148 74 result = sstrrchr(str, 'w');
universe@148 75 UCX_TEST_ASSERT(result.length == 13, "sstrrchr returned wrong length");
universe@148 76 UCX_TEST_ASSERT(strcmp("will kill you", result.ptr)
universe@148 77 == 0, "sstrrchr did not return the expected string");
universe@148 78
universe@148 79 UCX_TEST_END
universe@148 80 }
universe@148 81
universe@214 82 UCX_TEST(test_sstrstr) {
universe@214 83 sstr_t str = ST("find the match in this string");
universe@214 84 UCX_TEST_BEGIN
universe@214 85
universe@214 86 sstr_t notfound = sstrstr(str, S("no match"));
universe@214 87 UCX_TEST_ASSERT(notfound.length == 0, "no match must return empty string");
universe@214 88
universe@214 89 sstr_t result = sstrstr(str, S("match"));
universe@214 90 UCX_TEST_ASSERT(result.length == 20, "sstrstr returned wrong length");
universe@214 91 UCX_TEST_ASSERT(!strcmp("match in this string", result.ptr),
universe@214 92 "sstrstr did not return the expected string");
universe@214 93
universe@214 94 result = sstrstr(str, S(""));
universe@214 95 UCX_TEST_ASSERT(result.length == str.length,
universe@214 96 "sstrstr with empty match string returned wrong length");
universe@214 97 UCX_TEST_ASSERT(!strcmp(str.ptr, result.ptr),
universe@214 98 "sstrstr with empty match string did not return the original string");
universe@214 99
universe@214 100 UCX_TEST_END
universe@214 101 }
universe@214 102
universe@149 103 UCX_TEST(test_sstrcmp) {
universe@149 104 sstr_t str = ST("compare this");
universe@149 105
universe@149 106 UCX_TEST_BEGIN
olaf@184 107 UCX_TEST_ASSERT(sstrcmp(str, S("")) == 1, "empty cmp failed");
olaf@184 108 UCX_TEST_ASSERT(sstrcmp(S(""), S("")) == 0, "empty cmp false negative");
universe@149 109 UCX_TEST_ASSERT(sstrcmp(str, S("compare this")) == 0, "false negative");
universe@149 110 UCX_TEST_ASSERT(sstrcmp(str, S("Compare This")) != 0, "false positive");
universe@149 111 UCX_TEST_ASSERT(sstrcmp(str, S("compare tool")) < 0, "memcmp < 0 failed");
universe@149 112 UCX_TEST_ASSERT(sstrcmp(str, S("compare shit")) > 0, "memcmp > 0 failed");
universe@149 113 UCX_TEST_ASSERT(sstrcmp(str, S("compare this not")) < 0, "len < 0 failed");
universe@149 114 UCX_TEST_ASSERT(sstrcmp(str, S("compare")) > 0, "len > 0 failed");
universe@149 115 UCX_TEST_END
universe@149 116 }
universe@149 117
universe@149 118 UCX_TEST(test_sstrcasecmp) {
universe@149 119
universe@149 120 sstr_t str = ST("compare this");
universe@149 121
universe@149 122 UCX_TEST_BEGIN
olaf@184 123 UCX_TEST_ASSERT(sstrcasecmp(str, S("")) == 1, "empty cmp failed");
olaf@184 124 UCX_TEST_ASSERT(sstrcasecmp(S(""), S("")) == 0, "empty cmp false negative");
universe@149 125 UCX_TEST_ASSERT(sstrcasecmp(str, S("compare this")) == 0, "false negative");
universe@149 126 UCX_TEST_ASSERT(sstrcasecmp(str, S("Compare This")) == 0,
universe@149 127 "not ignoring case");
universe@149 128 UCX_TEST_ASSERT(sstrcasecmp(str, S("compare tool")) < 0, "< 0 failed");
universe@149 129 UCX_TEST_ASSERT(sstrcasecmp(str, S("compare shit")) > 0, "> 0 failed");
universe@149 130 UCX_TEST_ASSERT(sstrcasecmp(str, S("compare this not")) < 0,
universe@149 131 "len < 0 failed");
universe@149 132 UCX_TEST_ASSERT(sstrcasecmp(str, S("compare")) > 0, "len > 0 failed");
universe@149 133 UCX_TEST_END
universe@149 134 }
universe@149 135
olaf@180 136
olaf@180 137 UCX_TEST(test_sstrcat) {
olaf@180 138 sstr_t s1 = S("12");
olaf@180 139 sstr_t s2 = S("34");
olaf@180 140 sstr_t s3 = S("56");
olaf@180 141 sstr_t sn = { NULL, 0 };
olaf@180 142
olaf@180 143 UCX_TEST_BEGIN
olaf@180 144
olaf@180 145 sstr_t t1 = sstrcat(2, s1, s2);
olaf@180 146 UCX_TEST_ASSERT(!sstrcmp(t1, S("1234")), "t1: wrong content");
olaf@180 147 free(t1.ptr);
olaf@180 148
olaf@180 149 sstr_t t2 = sstrcat(3, s1, s2, s3);
olaf@180 150 UCX_TEST_ASSERT(!sstrcmp(t2, S("123456")), "t2: wrong content");
olaf@180 151 free(t2.ptr);
olaf@180 152
olaf@180 153 sstr_t t3 = sstrcat(6, s1, sn, s2, sn, s3, sn);
olaf@180 154 UCX_TEST_ASSERT(!sstrcmp(t3, S("123456")), "t3: wrong content");
olaf@180 155 free(t3.ptr);
olaf@180 156
olaf@180 157 sstr_t t4 = sstrcat(2, sn, sn);
olaf@180 158 UCX_TEST_ASSERT(t4.ptr, "t4.ptr is NULL");
olaf@180 159 UCX_TEST_ASSERT(t4.length == 0, "t4 has wrong length");
olaf@180 160 free(t4.ptr);
olaf@180 161
olaf@180 162
olaf@180 163 UCX_TEST_END
olaf@180 164
olaf@180 165 }
olaf@180 166
universe@134 167 UCX_TEST(test_sstrsplit) {
universe@39 168
universe@39 169 const char *original = "this,is,a,csv,string";
universe@116 170 sstr_t test = ST("this,is,a,csv,string"); /* use copy of original here */
universe@173 171 ssize_t n;
universe@39 172 sstr_t *list;
universe@39 173
universe@39 174 UCX_TEST_BEGIN
universe@39 175
universe@39 176 /* Nullpointer check */
universe@39 177 n = 0;
universe@116 178 UCX_TEST_ASSERT(sstrsplit(test, S(""), &n) == NULL,
universe@39 179 "empty delimiter must return NULL");
universe@39 180
universe@39 181 /* no delimiter occurence (ndo) */
universe@39 182 n = 0;
universe@116 183 list = sstrsplit(test, S("z"), &n);
universe@39 184 UCX_TEST_ASSERT(n == 1, "ndo, list length must be 1");
universe@39 185 UCX_TEST_ASSERT(strcmp(list[0].ptr, original) == 0, "ndo, "
universe@39 186 "original string shall be returned as single list element");
universe@39 187 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
universe@39 188 "ndo, original has been modified");
olaf@147 189 for(int i=0;i<n;i++) {
olaf@147 190 free(list[i].ptr);
olaf@147 191 }
universe@39 192 free(list);
universe@39 193
universe@39 194 /* partially matching delimiter (pmd) */
universe@39 195 n = 0;
universe@116 196 list = sstrsplit(test, S("stringbuilder"), &n);
universe@39 197 UCX_TEST_ASSERT(n == 1, "pmd, list length must be 1");
universe@39 198 UCX_TEST_ASSERT(strcmp(list[0].ptr, original) == 0, "pmd, "
universe@39 199 "original string shall be returned as single list element");
universe@39 200 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
universe@39 201 "pmd, original has been modified");
olaf@147 202 for(int i=0;i<n;i++) {
olaf@147 203 free(list[i].ptr);
olaf@147 204 }
universe@39 205 free(list);
universe@39 206
universe@39 207 /* matching single-char delimiter (mscd) */
universe@39 208 n = 0;
universe@116 209 list = sstrsplit(test, S(","), &n);
universe@39 210 UCX_TEST_ASSERT(n == 5, "mscd, list length must be 5");
universe@39 211 UCX_TEST_ASSERT(strcmp(list[0].ptr, "this") == 0, "mscd, item 0 mismatch");
universe@39 212 UCX_TEST_ASSERT(strcmp(list[1].ptr, "is") == 0, "mscd, item 1 mismatch");
universe@39 213 UCX_TEST_ASSERT(strcmp(list[2].ptr, "a") == 0, "mscd, item 2 mismatch");
universe@39 214 UCX_TEST_ASSERT(strcmp(list[3].ptr, "csv") == 0, "mscd, item 3 mismatch");
universe@39 215 UCX_TEST_ASSERT(strcmp(list[4].ptr, "string")==0, "mscd, item 4 mismatch");
universe@39 216 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
universe@39 217 "mscd, original has been modified");
olaf@147 218 for(int i=0;i<n;i++) {
olaf@147 219 free(list[i].ptr);
olaf@147 220 }
universe@39 221 free(list);
universe@39 222
universe@39 223 /* matching multi-char delimiter (mmcd) */
universe@39 224 n = 0;
universe@116 225 list = sstrsplit(test, S("is"), &n);
universe@39 226 UCX_TEST_ASSERT(n == 3, "mscd, list length must be 3");
universe@39 227 UCX_TEST_ASSERT(strcmp(list[0].ptr, "th") == 0, "mmcd, item 0 mismatch");
universe@39 228 UCX_TEST_ASSERT(strcmp(list[1].ptr, ",") == 0, "mmcd, item 1 mismatch");
universe@39 229 UCX_TEST_ASSERT(strcmp(list[2].ptr, ",a,csv,string") == 0,
universe@39 230 "mmcd, item 2 mismatch");
universe@39 231 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
universe@39 232 "mmcd, original has been modified");
olaf@147 233 for(int i=0;i<n;i++) {
olaf@147 234 free(list[i].ptr);
olaf@147 235 }
universe@39 236 free(list);
universe@39 237
universe@39 238 /* bounded list using single-char delimiter (blsc) */
universe@39 239 n = 3;
universe@116 240 list = sstrsplit(test, S(","), &n);
universe@39 241 UCX_TEST_ASSERT(n == 3, "blsc, list length must be 3");
universe@39 242 UCX_TEST_ASSERT(strcmp(list[0].ptr, "this") == 0, "blsc, item 0 mismatch");
universe@39 243 UCX_TEST_ASSERT(strcmp(list[1].ptr, "is") == 0, "blsc, item 1 mismatch");
universe@39 244 UCX_TEST_ASSERT(strcmp(list[2].ptr, "a,csv,string") == 0,
universe@39 245 "blsc, item 2 mismatch");
universe@39 246 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
universe@39 247 "blsc, original has been modified");
olaf@147 248 for(int i=0;i<n;i++) {
olaf@147 249 free(list[i].ptr);
olaf@147 250 }
universe@39 251 free(list);
universe@39 252
universe@39 253 /* bounded list using multi-char delimiter (blmc) */
universe@39 254 n = 2;
universe@116 255 list = sstrsplit(test, S("is"), &n);
universe@39 256 UCX_TEST_ASSERT(n == 2, "blmc, list length must be 2");
universe@39 257 UCX_TEST_ASSERT(strcmp(list[0].ptr, "th") == 0, "blmc, item 0 mismatch");
universe@39 258 UCX_TEST_ASSERT(strcmp(list[1].ptr, ",is,a,csv,string") == 0,
universe@39 259 "blmc, item 1 mismatch");
universe@39 260 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
universe@39 261 "blmc, original has been modified");
olaf@147 262 for(int i=0;i<n;i++) {
olaf@147 263 free(list[i].ptr);
olaf@147 264 }
universe@39 265 free(list);
universe@39 266
universe@39 267 /* start with delimiter (swd) */
universe@39 268 n = 0;
universe@116 269 list = sstrsplit(test, S("this"), &n);
universe@39 270 UCX_TEST_ASSERT(n == 2, "swd, list length must be 2");
universe@39 271 UCX_TEST_ASSERT(list[0].length == 0, "swd, first item must be empty");
universe@39 272 UCX_TEST_ASSERT(strcmp(list[1].ptr, ",is,a,csv,string") == 0,
universe@39 273 "swd, second item corrupt");
universe@39 274 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
universe@39 275 "swd, original has been modified");
olaf@147 276 for(int i=0;i<n;i++) {
olaf@147 277 free(list[i].ptr);
olaf@147 278 }
universe@39 279 free(list);
universe@39 280
universe@39 281 /* end with delimiter (ewd) */
universe@39 282 n = 0;
universe@116 283 list = sstrsplit(test, S("string"), &n);
universe@39 284 UCX_TEST_ASSERT(n == 2, "ewd, list length must be 2");
universe@39 285 UCX_TEST_ASSERT(strcmp(list[0].ptr, "this,is,a,csv,") == 0,
universe@39 286 "swd, first item corrupt");
universe@39 287 UCX_TEST_ASSERT(list[1].length == 0, "ewd, second item must be empty");
universe@39 288 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
universe@39 289 "ewd, original has been modified");
olaf@147 290 for(int i=0;i<n;i++) {
olaf@147 291 free(list[i].ptr);
olaf@147 292 }
universe@39 293 free(list);
universe@39 294
universe@39 295 /* exact match (exm) */
universe@39 296 n = 0;
universe@116 297 list = sstrsplit(test, S("this,is,a,csv,string"), &n);
universe@71 298 UCX_TEST_ASSERT(n == 0, "exm, list length must be 0");
universe@71 299 UCX_TEST_ASSERT(list == NULL, "exm, list must be NULL");
olaf@147 300 for(int i=0;i<n;i++) {
olaf@147 301 free(list[i].ptr);
olaf@147 302 }
universe@39 303 free(list);
universe@39 304
universe@39 305 /* substring (subs) */
universe@39 306 n = 0;
universe@116 307 list = sstrsplit(test, S("this,is,a,csv,string,with,extension"), &n);
universe@39 308 UCX_TEST_ASSERT(n == 1, "subs, list length must be 1");
universe@39 309 UCX_TEST_ASSERT(strcmp(list[0].ptr, original) == 0,
universe@39 310 "subs, single item must be the original string");
universe@39 311 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
universe@39 312 "subs, original has been modified");
olaf@147 313 for(int i=0;i<n;i++) {
olaf@147 314 free(list[i].ptr);
olaf@147 315 }
universe@39 316 free(list);
universe@213 317
universe@213 318 /* double encounter delimiter (ded) */
universe@213 319 n = 0;
universe@213 320 list = sstrsplit(test, S("is,"), &n);
universe@213 321 UCX_TEST_ASSERT(n == 3, "ded, list length must be 3");
universe@213 322 UCX_TEST_ASSERT(strcmp(list[0].ptr, "th") == 0, "ded, item 0 mismatch");
universe@213 323 UCX_TEST_ASSERT(list[1].length == 0, "ded, item 1 not empty!");
universe@213 324 UCX_TEST_ASSERT(strcmp(list[2].ptr, "a,csv,string") == 0,
universe@213 325 "ded, item 2 mismatch");
universe@213 326 for(int i=0;i<n;i++) {
universe@213 327 free(list[i].ptr);
universe@213 328 }
universe@213 329 free(list);
universe@39 330
universe@39 331 UCX_TEST_END
universe@39 332 }
universe@97 333
universe@134 334 UCX_TEST(test_sstrtrim) {
olaf@104 335 sstr_t t1 = sstrtrim(sstr((char*)" ein test "));
olaf@104 336 sstr_t t2 = sstrtrim(sstr((char*)"abc"));
olaf@104 337 sstr_t t3 = sstrtrim(sstr((char*)" 123"));
olaf@104 338 sstr_t t4 = sstrtrim(sstr((char*)"xyz "));
olaf@104 339 sstr_t t5 = sstrtrim(sstr((char*)" "));
universe@100 340 sstr_t empty = sstrtrim(sstr((char*)""));
universe@97 341 UCX_TEST_BEGIN
olaf@104 342 UCX_TEST_ASSERT(strncmp(t1.ptr, "ein test", t1.length) == 0, "failed");
olaf@104 343 UCX_TEST_ASSERT(strncmp(t2.ptr, "abc", t2.length) == 0, "failed");
olaf@104 344 UCX_TEST_ASSERT(strncmp(t3.ptr, "123", t3.length) == 0, "failed");
olaf@104 345 UCX_TEST_ASSERT(strncmp(t4.ptr, "xyz", t4.length) == 0, "failed");
olaf@104 346 UCX_TEST_ASSERT(t5.length == 0, "string t5 not empty");
universe@98 347 UCX_TEST_ASSERT(empty.length == 0, "empty string failed");
universe@97 348 UCX_TEST_END
universe@97 349 }
universe@146 350
universe@146 351 UCX_TEST(test_sstrprefixsuffix) {
universe@146 352 sstr_t str = ST("test my prefix and my suffix");
universe@146 353 sstr_t empty = ST("");
universe@146 354
universe@146 355 UCX_TEST_BEGIN
universe@146 356
universe@146 357 UCX_TEST_ASSERT(!sstrprefix(empty, S("pref")), "prefix empty string fails");
universe@146 358 UCX_TEST_ASSERT(!sstrsuffix(empty, S("suf")), "suffix empty string fails");
universe@146 359
universe@146 360 UCX_TEST_ASSERT(sstrprefix(str, empty), "empty prefix fails");
universe@146 361 UCX_TEST_ASSERT(sstrsuffix(str, empty), "empty suffix fails");
universe@146 362
universe@146 363 UCX_TEST_ASSERT(sstrprefix(empty, empty), "string and prefix empty fails");
universe@146 364 UCX_TEST_ASSERT(sstrsuffix(empty, empty), "string and suffix empty fails");
universe@146 365
universe@146 366 UCX_TEST_ASSERT(sstrprefix(str, S("test ")), "prefix false negative");
universe@146 367 UCX_TEST_ASSERT(!sstrprefix(str, S("8-) fsck ")), "prefix false positive");
universe@146 368
universe@146 369 UCX_TEST_ASSERT(sstrsuffix(str, S("fix")), "suffix false negative");
universe@146 370 UCX_TEST_ASSERT(!sstrsuffix(str, S("fox")), "suffix false positive");
universe@146 371
universe@146 372
universe@146 373 UCX_TEST_END
universe@146 374 }

mercurial