test/string_tests.c

Sat, 28 Oct 2017 15:43:51 +0200

author
Mike Becker <universe@uap-core.de>
date
Sat, 28 Oct 2017 15:43:51 +0200
changeset 259
2f5dea574a75
parent 250
b7d1317b138e
child 272
2def28b65328
permissions
-rw-r--r--

modules documentation

universe@39 1 /*
universe@103 2 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
universe@39 3 *
universe@259 4 * Copyright 2017 Mike Becker, 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@236 84 sstr_t longstr = ST(
universe@236 85 "abcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijkl"
universe@236 86 "mnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwx"
universe@236 87 "yzabcdeababababnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghij"
universe@236 88 "klmnopqrstuvwxyzaababababababababrstuvwxyzabcdefghijklmnopqrstuv"
universe@236 89 "abababababababababababababababababababababababababababababababab"
universe@236 90 "abababababababababababababababababababababababababababababababab"
universe@236 91 "abababababababababababababababababababababababababababababababab"
universe@236 92 "abababababababababababababababababababababababababababababababab"
universe@236 93 "abababababababababababababababababababababababababababababababab"
universe@236 94 "abababababababababababababababababababababababababababababababab"
universe@236 95 "wxyz1234567890");
universe@236 96 sstr_t longstrpattern = ST(
universe@236 97 "abababababababababababababababababababababababababababababababab"
universe@236 98 "abababababababababababababababababababababababababababababababab"
universe@236 99 "abababababababababababababababababababababababababababababababab"
universe@236 100 "abababababababababababababababababababababababababababababababab"
universe@236 101 "abababababababababababababababababababababababababababababababab"
universe@236 102 );
universe@236 103 sstr_t longstrresult = ST(
universe@236 104 "abababababababababababababababababababababababababababababababab"
universe@236 105 "abababababababababababababababababababababababababababababababab"
universe@236 106 "abababababababababababababababababababababababababababababababab"
universe@236 107 "abababababababababababababababababababababababababababababababab"
universe@236 108 "abababababababababababababababababababababababababababababababab"
universe@236 109 "abababababababababababababababababababababababababababababababab"
universe@236 110 "wxyz1234567890"
universe@236 111 );
universe@214 112 UCX_TEST_BEGIN
universe@214 113
universe@214 114 sstr_t notfound = sstrstr(str, S("no match"));
universe@214 115 UCX_TEST_ASSERT(notfound.length == 0, "no match must return empty string");
universe@214 116
universe@214 117 sstr_t result = sstrstr(str, S("match"));
universe@214 118 UCX_TEST_ASSERT(result.length == 20, "sstrstr returned wrong length");
universe@214 119 UCX_TEST_ASSERT(!strcmp("match in this string", result.ptr),
universe@214 120 "sstrstr did not return the expected string");
universe@214 121
universe@214 122 result = sstrstr(str, S(""));
universe@214 123 UCX_TEST_ASSERT(result.length == str.length,
universe@214 124 "sstrstr with empty match string returned wrong length");
universe@214 125 UCX_TEST_ASSERT(!strcmp(str.ptr, result.ptr),
universe@214 126 "sstrstr with empty match string did not return the original string");
universe@214 127
universe@236 128 result = sstrstr(longstr, longstrpattern);
universe@236 129 UCX_TEST_ASSERT(result.length == longstrresult.length,
universe@236 130 "long string result length incorrect");
universe@236 131 UCX_TEST_ASSERT(!strcmp(result.ptr, longstrresult.ptr),
universe@236 132 "long string result content incorrect");
universe@236 133
universe@214 134 UCX_TEST_END
universe@214 135 }
universe@214 136
universe@149 137 UCX_TEST(test_sstrcmp) {
universe@149 138 sstr_t str = ST("compare this");
universe@149 139
universe@149 140 UCX_TEST_BEGIN
olaf@184 141 UCX_TEST_ASSERT(sstrcmp(str, S("")) == 1, "empty cmp failed");
olaf@184 142 UCX_TEST_ASSERT(sstrcmp(S(""), S("")) == 0, "empty cmp false negative");
universe@149 143 UCX_TEST_ASSERT(sstrcmp(str, S("compare this")) == 0, "false negative");
universe@149 144 UCX_TEST_ASSERT(sstrcmp(str, S("Compare This")) != 0, "false positive");
universe@149 145 UCX_TEST_ASSERT(sstrcmp(str, S("compare tool")) < 0, "memcmp < 0 failed");
universe@149 146 UCX_TEST_ASSERT(sstrcmp(str, S("compare shit")) > 0, "memcmp > 0 failed");
universe@149 147 UCX_TEST_ASSERT(sstrcmp(str, S("compare this not")) < 0, "len < 0 failed");
universe@149 148 UCX_TEST_ASSERT(sstrcmp(str, S("compare")) > 0, "len > 0 failed");
universe@149 149 UCX_TEST_END
universe@149 150 }
universe@149 151
universe@149 152 UCX_TEST(test_sstrcasecmp) {
universe@149 153
universe@149 154 sstr_t str = ST("compare this");
universe@149 155
universe@149 156 UCX_TEST_BEGIN
olaf@184 157 UCX_TEST_ASSERT(sstrcasecmp(str, S("")) == 1, "empty cmp failed");
olaf@184 158 UCX_TEST_ASSERT(sstrcasecmp(S(""), S("")) == 0, "empty cmp false negative");
universe@149 159 UCX_TEST_ASSERT(sstrcasecmp(str, S("compare this")) == 0, "false negative");
universe@149 160 UCX_TEST_ASSERT(sstrcasecmp(str, S("Compare This")) == 0,
universe@149 161 "not ignoring case");
universe@149 162 UCX_TEST_ASSERT(sstrcasecmp(str, S("compare tool")) < 0, "< 0 failed");
universe@149 163 UCX_TEST_ASSERT(sstrcasecmp(str, S("compare shit")) > 0, "> 0 failed");
universe@149 164 UCX_TEST_ASSERT(sstrcasecmp(str, S("compare this not")) < 0,
universe@149 165 "len < 0 failed");
universe@149 166 UCX_TEST_ASSERT(sstrcasecmp(str, S("compare")) > 0, "len > 0 failed");
universe@149 167 UCX_TEST_END
universe@149 168 }
universe@149 169
olaf@180 170
olaf@180 171 UCX_TEST(test_sstrcat) {
olaf@180 172 sstr_t s1 = S("12");
olaf@180 173 sstr_t s2 = S("34");
olaf@180 174 sstr_t s3 = S("56");
olaf@180 175 sstr_t sn = { NULL, 0 };
olaf@180 176
olaf@180 177 UCX_TEST_BEGIN
olaf@180 178
olaf@180 179 sstr_t t1 = sstrcat(2, s1, s2);
olaf@180 180 UCX_TEST_ASSERT(!sstrcmp(t1, S("1234")), "t1: wrong content");
olaf@180 181 free(t1.ptr);
olaf@180 182
olaf@180 183 sstr_t t2 = sstrcat(3, s1, s2, s3);
olaf@180 184 UCX_TEST_ASSERT(!sstrcmp(t2, S("123456")), "t2: wrong content");
olaf@180 185 free(t2.ptr);
olaf@180 186
olaf@180 187 sstr_t t3 = sstrcat(6, s1, sn, s2, sn, s3, sn);
olaf@180 188 UCX_TEST_ASSERT(!sstrcmp(t3, S("123456")), "t3: wrong content");
olaf@180 189 free(t3.ptr);
olaf@180 190
olaf@180 191 sstr_t t4 = sstrcat(2, sn, sn);
olaf@180 192 UCX_TEST_ASSERT(t4.ptr, "t4.ptr is NULL");
olaf@180 193 UCX_TEST_ASSERT(t4.length == 0, "t4 has wrong length");
olaf@180 194 free(t4.ptr);
olaf@180 195
olaf@180 196
olaf@180 197 UCX_TEST_END
olaf@180 198
olaf@180 199 }
olaf@180 200
universe@134 201 UCX_TEST(test_sstrsplit) {
universe@39 202
universe@39 203 const char *original = "this,is,a,csv,string";
universe@116 204 sstr_t test = ST("this,is,a,csv,string"); /* use copy of original here */
universe@173 205 ssize_t n;
universe@39 206 sstr_t *list;
universe@39 207
universe@39 208 UCX_TEST_BEGIN
universe@39 209
universe@39 210 /* Nullpointer check */
universe@39 211 n = 0;
universe@116 212 UCX_TEST_ASSERT(sstrsplit(test, S(""), &n) == NULL,
universe@39 213 "empty delimiter must return NULL");
universe@39 214
universe@39 215 /* no delimiter occurence (ndo) */
universe@39 216 n = 0;
universe@116 217 list = sstrsplit(test, S("z"), &n);
universe@39 218 UCX_TEST_ASSERT(n == 1, "ndo, list length must be 1");
universe@39 219 UCX_TEST_ASSERT(strcmp(list[0].ptr, original) == 0, "ndo, "
universe@39 220 "original string shall be returned as single list element");
universe@39 221 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
universe@39 222 "ndo, original has been modified");
olaf@147 223 for(int i=0;i<n;i++) {
olaf@147 224 free(list[i].ptr);
olaf@147 225 }
universe@39 226 free(list);
universe@39 227
universe@39 228 /* partially matching delimiter (pmd) */
universe@39 229 n = 0;
universe@116 230 list = sstrsplit(test, S("stringbuilder"), &n);
universe@39 231 UCX_TEST_ASSERT(n == 1, "pmd, list length must be 1");
universe@39 232 UCX_TEST_ASSERT(strcmp(list[0].ptr, original) == 0, "pmd, "
universe@39 233 "original string shall be returned as single list element");
universe@39 234 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
universe@39 235 "pmd, original has been modified");
olaf@147 236 for(int i=0;i<n;i++) {
olaf@147 237 free(list[i].ptr);
olaf@147 238 }
universe@39 239 free(list);
universe@39 240
universe@39 241 /* matching single-char delimiter (mscd) */
universe@39 242 n = 0;
universe@116 243 list = sstrsplit(test, S(","), &n);
universe@39 244 UCX_TEST_ASSERT(n == 5, "mscd, list length must be 5");
universe@39 245 UCX_TEST_ASSERT(strcmp(list[0].ptr, "this") == 0, "mscd, item 0 mismatch");
universe@39 246 UCX_TEST_ASSERT(strcmp(list[1].ptr, "is") == 0, "mscd, item 1 mismatch");
universe@39 247 UCX_TEST_ASSERT(strcmp(list[2].ptr, "a") == 0, "mscd, item 2 mismatch");
universe@39 248 UCX_TEST_ASSERT(strcmp(list[3].ptr, "csv") == 0, "mscd, item 3 mismatch");
universe@39 249 UCX_TEST_ASSERT(strcmp(list[4].ptr, "string")==0, "mscd, item 4 mismatch");
universe@39 250 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
universe@39 251 "mscd, original has been modified");
olaf@147 252 for(int i=0;i<n;i++) {
olaf@147 253 free(list[i].ptr);
olaf@147 254 }
universe@39 255 free(list);
universe@39 256
universe@39 257 /* matching multi-char delimiter (mmcd) */
universe@39 258 n = 0;
universe@116 259 list = sstrsplit(test, S("is"), &n);
universe@39 260 UCX_TEST_ASSERT(n == 3, "mscd, list length must be 3");
universe@39 261 UCX_TEST_ASSERT(strcmp(list[0].ptr, "th") == 0, "mmcd, item 0 mismatch");
universe@39 262 UCX_TEST_ASSERT(strcmp(list[1].ptr, ",") == 0, "mmcd, item 1 mismatch");
universe@39 263 UCX_TEST_ASSERT(strcmp(list[2].ptr, ",a,csv,string") == 0,
universe@39 264 "mmcd, item 2 mismatch");
universe@39 265 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
universe@39 266 "mmcd, original has been modified");
olaf@147 267 for(int i=0;i<n;i++) {
olaf@147 268 free(list[i].ptr);
olaf@147 269 }
universe@39 270 free(list);
universe@39 271
universe@39 272 /* bounded list using single-char delimiter (blsc) */
universe@39 273 n = 3;
universe@116 274 list = sstrsplit(test, S(","), &n);
universe@39 275 UCX_TEST_ASSERT(n == 3, "blsc, list length must be 3");
universe@39 276 UCX_TEST_ASSERT(strcmp(list[0].ptr, "this") == 0, "blsc, item 0 mismatch");
universe@39 277 UCX_TEST_ASSERT(strcmp(list[1].ptr, "is") == 0, "blsc, item 1 mismatch");
universe@39 278 UCX_TEST_ASSERT(strcmp(list[2].ptr, "a,csv,string") == 0,
universe@39 279 "blsc, item 2 mismatch");
universe@39 280 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
universe@39 281 "blsc, original has been modified");
olaf@147 282 for(int i=0;i<n;i++) {
olaf@147 283 free(list[i].ptr);
olaf@147 284 }
universe@39 285 free(list);
universe@39 286
universe@39 287 /* bounded list using multi-char delimiter (blmc) */
universe@39 288 n = 2;
universe@116 289 list = sstrsplit(test, S("is"), &n);
universe@39 290 UCX_TEST_ASSERT(n == 2, "blmc, list length must be 2");
universe@39 291 UCX_TEST_ASSERT(strcmp(list[0].ptr, "th") == 0, "blmc, item 0 mismatch");
universe@39 292 UCX_TEST_ASSERT(strcmp(list[1].ptr, ",is,a,csv,string") == 0,
universe@39 293 "blmc, item 1 mismatch");
universe@39 294 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
universe@39 295 "blmc, original has been modified");
olaf@147 296 for(int i=0;i<n;i++) {
olaf@147 297 free(list[i].ptr);
olaf@147 298 }
universe@39 299 free(list);
universe@39 300
universe@39 301 /* start with delimiter (swd) */
universe@39 302 n = 0;
universe@116 303 list = sstrsplit(test, S("this"), &n);
universe@39 304 UCX_TEST_ASSERT(n == 2, "swd, list length must be 2");
universe@39 305 UCX_TEST_ASSERT(list[0].length == 0, "swd, first item must be empty");
universe@39 306 UCX_TEST_ASSERT(strcmp(list[1].ptr, ",is,a,csv,string") == 0,
universe@39 307 "swd, second item corrupt");
universe@39 308 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
universe@39 309 "swd, original has been modified");
olaf@147 310 for(int i=0;i<n;i++) {
olaf@147 311 free(list[i].ptr);
olaf@147 312 }
universe@39 313 free(list);
universe@39 314
universe@39 315 /* end with delimiter (ewd) */
universe@39 316 n = 0;
universe@116 317 list = sstrsplit(test, S("string"), &n);
universe@39 318 UCX_TEST_ASSERT(n == 2, "ewd, list length must be 2");
universe@39 319 UCX_TEST_ASSERT(strcmp(list[0].ptr, "this,is,a,csv,") == 0,
universe@232 320 "ewd, first item corrupt");
universe@39 321 UCX_TEST_ASSERT(list[1].length == 0, "ewd, second item must be empty");
universe@39 322 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
universe@39 323 "ewd, original has been modified");
olaf@147 324 for(int i=0;i<n;i++) {
olaf@147 325 free(list[i].ptr);
olaf@147 326 }
universe@39 327 free(list);
universe@232 328
universe@232 329 /* end with delimiter exceed bound (ewdeb) */
universe@232 330 n = 3;
universe@232 331 sstr_t ewdebtest = ST("a,b,c,");
universe@232 332 list = sstrsplit(ewdebtest, S(","), &n);
universe@232 333 UCX_TEST_ASSERT(n == 3, "ewdeb, list length must be 3");
universe@232 334 UCX_TEST_ASSERT(strcmp(list[0].ptr, "a") == 0, "ewdeb, fst item corrupt");
universe@232 335 UCX_TEST_ASSERT(strcmp(list[1].ptr, "b") == 0, "ewdeb, snd item corrupt");
universe@233 336 UCX_TEST_ASSERT(strcmp(list[2].ptr, "c,") == 0, "ewdeb, trd item corrupt");
universe@232 337 for(int i=0;i<n;i++) {
universe@232 338 free(list[i].ptr);
universe@232 339 }
universe@232 340 free(list);
universe@39 341
universe@39 342 /* exact match (exm) */
universe@39 343 n = 0;
universe@116 344 list = sstrsplit(test, S("this,is,a,csv,string"), &n);
universe@71 345 UCX_TEST_ASSERT(n == 0, "exm, list length must be 0");
universe@71 346 UCX_TEST_ASSERT(list == NULL, "exm, list must be NULL");
olaf@147 347 for(int i=0;i<n;i++) {
olaf@147 348 free(list[i].ptr);
olaf@147 349 }
universe@39 350 free(list);
universe@39 351
universe@39 352 /* substring (subs) */
universe@39 353 n = 0;
universe@116 354 list = sstrsplit(test, S("this,is,a,csv,string,with,extension"), &n);
universe@39 355 UCX_TEST_ASSERT(n == 1, "subs, list length must be 1");
universe@39 356 UCX_TEST_ASSERT(strcmp(list[0].ptr, original) == 0,
universe@39 357 "subs, single item must be the original string");
universe@39 358 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
universe@39 359 "subs, original has been modified");
olaf@147 360 for(int i=0;i<n;i++) {
olaf@147 361 free(list[i].ptr);
olaf@147 362 }
universe@39 363 free(list);
universe@213 364
universe@213 365 /* double encounter delimiter (ded) */
universe@213 366 n = 0;
universe@213 367 list = sstrsplit(test, S("is,"), &n);
universe@213 368 UCX_TEST_ASSERT(n == 3, "ded, list length must be 3");
universe@213 369 UCX_TEST_ASSERT(strcmp(list[0].ptr, "th") == 0, "ded, item 0 mismatch");
universe@213 370 UCX_TEST_ASSERT(list[1].length == 0, "ded, item 1 not empty!");
universe@213 371 UCX_TEST_ASSERT(strcmp(list[2].ptr, "a,csv,string") == 0,
universe@213 372 "ded, item 2 mismatch");
universe@213 373 for(int i=0;i<n;i++) {
universe@213 374 free(list[i].ptr);
universe@213 375 }
universe@213 376 free(list);
universe@39 377
universe@39 378 UCX_TEST_END
universe@39 379 }
universe@97 380
universe@134 381 UCX_TEST(test_sstrtrim) {
olaf@104 382 sstr_t t1 = sstrtrim(sstr((char*)" ein test "));
olaf@104 383 sstr_t t2 = sstrtrim(sstr((char*)"abc"));
olaf@104 384 sstr_t t3 = sstrtrim(sstr((char*)" 123"));
olaf@104 385 sstr_t t4 = sstrtrim(sstr((char*)"xyz "));
olaf@104 386 sstr_t t5 = sstrtrim(sstr((char*)" "));
universe@100 387 sstr_t empty = sstrtrim(sstr((char*)""));
universe@97 388 UCX_TEST_BEGIN
olaf@104 389 UCX_TEST_ASSERT(strncmp(t1.ptr, "ein test", t1.length) == 0, "failed");
olaf@104 390 UCX_TEST_ASSERT(strncmp(t2.ptr, "abc", t2.length) == 0, "failed");
olaf@104 391 UCX_TEST_ASSERT(strncmp(t3.ptr, "123", t3.length) == 0, "failed");
olaf@104 392 UCX_TEST_ASSERT(strncmp(t4.ptr, "xyz", t4.length) == 0, "failed");
olaf@104 393 UCX_TEST_ASSERT(t5.length == 0, "string t5 not empty");
universe@98 394 UCX_TEST_ASSERT(empty.length == 0, "empty string failed");
universe@97 395 UCX_TEST_END
universe@97 396 }
universe@146 397
universe@146 398 UCX_TEST(test_sstrprefixsuffix) {
universe@146 399 sstr_t str = ST("test my prefix and my suffix");
universe@146 400 sstr_t empty = ST("");
universe@146 401
universe@146 402 UCX_TEST_BEGIN
universe@146 403
universe@146 404 UCX_TEST_ASSERT(!sstrprefix(empty, S("pref")), "prefix empty string fails");
universe@146 405 UCX_TEST_ASSERT(!sstrsuffix(empty, S("suf")), "suffix empty string fails");
universe@146 406
universe@146 407 UCX_TEST_ASSERT(sstrprefix(str, empty), "empty prefix fails");
universe@146 408 UCX_TEST_ASSERT(sstrsuffix(str, empty), "empty suffix fails");
universe@146 409
universe@146 410 UCX_TEST_ASSERT(sstrprefix(empty, empty), "string and prefix empty fails");
universe@146 411 UCX_TEST_ASSERT(sstrsuffix(empty, empty), "string and suffix empty fails");
universe@146 412
universe@146 413 UCX_TEST_ASSERT(sstrprefix(str, S("test ")), "prefix false negative");
universe@146 414 UCX_TEST_ASSERT(!sstrprefix(str, S("8-) fsck ")), "prefix false positive");
universe@146 415
universe@146 416 UCX_TEST_ASSERT(sstrsuffix(str, S("fix")), "suffix false negative");
universe@146 417 UCX_TEST_ASSERT(!sstrsuffix(str, S("fox")), "suffix false positive");
universe@146 418
universe@146 419
universe@146 420 UCX_TEST_END
universe@146 421 }

mercurial