test/string_tests.c

Mon, 14 Jul 2014 13:51:02 +0200

author
Olaf Wintermann <olaf.wintermann@gmail.com>
date
Mon, 14 Jul 2014 13:51:02 +0200
changeset 180
2185f19dcc45
parent 179
ee25d79a4187
child 184
5c0990c95f74
permissions
-rw-r--r--

added new sstrcat

universe@39 1 /*
universe@103 2 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
universe@39 3 *
universe@177 4 * Copyright 2014 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@47 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
universe@100 48 size_t len = sstrnlen(3, s1, s2, s3);
olaf@47 49
olaf@47 50 UCX_TEST_BEGIN
olaf@47 51
universe@100 52 UCX_TEST_ASSERT(len == 10, "sstrnlen returned wrong size");
universe@179 53
olaf@47 54 UCX_TEST_END
olaf@47 55 }
olaf@47 56
olaf@180 57
universe@149 58 UCX_TEST(test_sstrchr_sstrrchr) {
universe@148 59 sstr_t str = ST("I will find you - and I will kill you");
universe@148 60 UCX_TEST_BEGIN
universe@148 61
universe@148 62 sstr_t result = sstrchr(str, 'w');
universe@148 63 UCX_TEST_ASSERT(result.length == 35, "sstrchr returned wrong length");
universe@148 64 UCX_TEST_ASSERT(strcmp("will find you - and I will kill you", result.ptr)
universe@148 65 == 0, "sstrchr did not return the expected string");
universe@148 66
universe@148 67 result = sstrrchr(str, 'w');
universe@148 68 UCX_TEST_ASSERT(result.length == 13, "sstrrchr returned wrong length");
universe@148 69 UCX_TEST_ASSERT(strcmp("will kill you", result.ptr)
universe@148 70 == 0, "sstrrchr did not return the expected string");
universe@148 71
universe@148 72 UCX_TEST_END
universe@148 73 }
universe@148 74
universe@149 75 UCX_TEST(test_sstrcmp) {
universe@149 76 sstr_t str = ST("compare this");
universe@149 77
universe@149 78 UCX_TEST_BEGIN
universe@149 79 UCX_TEST_ASSERT(sstrcmp(str, S("compare this")) == 0, "false negative");
universe@149 80 UCX_TEST_ASSERT(sstrcmp(str, S("Compare This")) != 0, "false positive");
universe@149 81 UCX_TEST_ASSERT(sstrcmp(str, S("compare tool")) < 0, "memcmp < 0 failed");
universe@149 82 UCX_TEST_ASSERT(sstrcmp(str, S("compare shit")) > 0, "memcmp > 0 failed");
universe@149 83 UCX_TEST_ASSERT(sstrcmp(str, S("compare this not")) < 0, "len < 0 failed");
universe@149 84 UCX_TEST_ASSERT(sstrcmp(str, S("compare")) > 0, "len > 0 failed");
universe@149 85 UCX_TEST_END
universe@149 86 }
universe@149 87
universe@149 88 UCX_TEST(test_sstrcasecmp) {
universe@149 89
universe@149 90 sstr_t str = ST("compare this");
universe@149 91
universe@149 92 UCX_TEST_BEGIN
universe@149 93 UCX_TEST_ASSERT(sstrcasecmp(str, S("compare this")) == 0, "false negative");
universe@149 94 UCX_TEST_ASSERT(sstrcasecmp(str, S("Compare This")) == 0,
universe@149 95 "not ignoring case");
universe@149 96 UCX_TEST_ASSERT(sstrcasecmp(str, S("compare tool")) < 0, "< 0 failed");
universe@149 97 UCX_TEST_ASSERT(sstrcasecmp(str, S("compare shit")) > 0, "> 0 failed");
universe@149 98 UCX_TEST_ASSERT(sstrcasecmp(str, S("compare this not")) < 0,
universe@149 99 "len < 0 failed");
universe@149 100 UCX_TEST_ASSERT(sstrcasecmp(str, S("compare")) > 0, "len > 0 failed");
universe@149 101 UCX_TEST_END
universe@149 102 }
universe@149 103
olaf@180 104
olaf@180 105 UCX_TEST(test_sstrcat) {
olaf@180 106 sstr_t s1 = S("12");
olaf@180 107 sstr_t s2 = S("34");
olaf@180 108 sstr_t s3 = S("56");
olaf@180 109 sstr_t sn = { NULL, 0 };
olaf@180 110
olaf@180 111 UCX_TEST_BEGIN
olaf@180 112
olaf@180 113 sstr_t t1 = sstrcat(2, s1, s2);
olaf@180 114 UCX_TEST_ASSERT(!sstrcmp(t1, S("1234")), "t1: wrong content");
olaf@180 115 free(t1.ptr);
olaf@180 116
olaf@180 117 sstr_t t2 = sstrcat(3, s1, s2, s3);
olaf@180 118 UCX_TEST_ASSERT(!sstrcmp(t2, S("123456")), "t2: wrong content");
olaf@180 119 free(t2.ptr);
olaf@180 120
olaf@180 121 sstr_t t3 = sstrcat(6, s1, sn, s2, sn, s3, sn);
olaf@180 122 UCX_TEST_ASSERT(!sstrcmp(t3, S("123456")), "t3: wrong content");
olaf@180 123 free(t3.ptr);
olaf@180 124
olaf@180 125 sstr_t t4 = sstrcat(2, sn, sn);
olaf@180 126 UCX_TEST_ASSERT(t4.ptr, "t4.ptr is NULL");
olaf@180 127 UCX_TEST_ASSERT(t4.length == 0, "t4 has wrong length");
olaf@180 128 free(t4.ptr);
olaf@180 129
olaf@180 130
olaf@180 131 UCX_TEST_END
olaf@180 132
olaf@180 133 }
olaf@180 134
universe@134 135 UCX_TEST(test_sstrsplit) {
universe@39 136
universe@39 137 const char *original = "this,is,a,csv,string";
universe@116 138 sstr_t test = ST("this,is,a,csv,string"); /* use copy of original here */
universe@173 139 ssize_t n;
universe@39 140 sstr_t *list;
universe@39 141
universe@39 142 UCX_TEST_BEGIN
universe@39 143
universe@39 144 /* Nullpointer check */
universe@39 145 n = 0;
universe@116 146 UCX_TEST_ASSERT(sstrsplit(test, S(""), &n) == NULL,
universe@39 147 "empty delimiter must return NULL");
universe@39 148
universe@39 149 /* no delimiter occurence (ndo) */
universe@39 150 n = 0;
universe@116 151 list = sstrsplit(test, S("z"), &n);
universe@39 152 UCX_TEST_ASSERT(n == 1, "ndo, list length must be 1");
universe@39 153 UCX_TEST_ASSERT(strcmp(list[0].ptr, original) == 0, "ndo, "
universe@39 154 "original string shall be returned as single list element");
universe@39 155 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
universe@39 156 "ndo, original has been modified");
olaf@147 157 for(int i=0;i<n;i++) {
olaf@147 158 free(list[i].ptr);
olaf@147 159 }
universe@39 160 free(list);
universe@39 161
universe@39 162 /* partially matching delimiter (pmd) */
universe@39 163 n = 0;
universe@116 164 list = sstrsplit(test, S("stringbuilder"), &n);
universe@39 165 UCX_TEST_ASSERT(n == 1, "pmd, list length must be 1");
universe@39 166 UCX_TEST_ASSERT(strcmp(list[0].ptr, original) == 0, "pmd, "
universe@39 167 "original string shall be returned as single list element");
universe@39 168 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
universe@39 169 "pmd, original has been modified");
olaf@147 170 for(int i=0;i<n;i++) {
olaf@147 171 free(list[i].ptr);
olaf@147 172 }
universe@39 173 free(list);
universe@39 174
universe@39 175 /* matching single-char delimiter (mscd) */
universe@39 176 n = 0;
universe@116 177 list = sstrsplit(test, S(","), &n);
universe@39 178 UCX_TEST_ASSERT(n == 5, "mscd, list length must be 5");
universe@39 179 UCX_TEST_ASSERT(strcmp(list[0].ptr, "this") == 0, "mscd, item 0 mismatch");
universe@39 180 UCX_TEST_ASSERT(strcmp(list[1].ptr, "is") == 0, "mscd, item 1 mismatch");
universe@39 181 UCX_TEST_ASSERT(strcmp(list[2].ptr, "a") == 0, "mscd, item 2 mismatch");
universe@39 182 UCX_TEST_ASSERT(strcmp(list[3].ptr, "csv") == 0, "mscd, item 3 mismatch");
universe@39 183 UCX_TEST_ASSERT(strcmp(list[4].ptr, "string")==0, "mscd, item 4 mismatch");
universe@39 184 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
universe@39 185 "mscd, original has been modified");
olaf@147 186 for(int i=0;i<n;i++) {
olaf@147 187 free(list[i].ptr);
olaf@147 188 }
universe@39 189 free(list);
universe@39 190
universe@39 191 /* matching multi-char delimiter (mmcd) */
universe@39 192 n = 0;
universe@116 193 list = sstrsplit(test, S("is"), &n);
universe@39 194 UCX_TEST_ASSERT(n == 3, "mscd, list length must be 3");
universe@39 195 UCX_TEST_ASSERT(strcmp(list[0].ptr, "th") == 0, "mmcd, item 0 mismatch");
universe@39 196 UCX_TEST_ASSERT(strcmp(list[1].ptr, ",") == 0, "mmcd, item 1 mismatch");
universe@39 197 UCX_TEST_ASSERT(strcmp(list[2].ptr, ",a,csv,string") == 0,
universe@39 198 "mmcd, item 2 mismatch");
universe@39 199 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
universe@39 200 "mmcd, original has been modified");
olaf@147 201 for(int i=0;i<n;i++) {
olaf@147 202 free(list[i].ptr);
olaf@147 203 }
universe@39 204 free(list);
universe@39 205
universe@39 206 /* bounded list using single-char delimiter (blsc) */
universe@39 207 n = 3;
universe@116 208 list = sstrsplit(test, S(","), &n);
universe@39 209 UCX_TEST_ASSERT(n == 3, "blsc, list length must be 3");
universe@39 210 UCX_TEST_ASSERT(strcmp(list[0].ptr, "this") == 0, "blsc, item 0 mismatch");
universe@39 211 UCX_TEST_ASSERT(strcmp(list[1].ptr, "is") == 0, "blsc, item 1 mismatch");
universe@39 212 UCX_TEST_ASSERT(strcmp(list[2].ptr, "a,csv,string") == 0,
universe@39 213 "blsc, item 2 mismatch");
universe@39 214 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
universe@39 215 "blsc, original has been modified");
olaf@147 216 for(int i=0;i<n;i++) {
olaf@147 217 free(list[i].ptr);
olaf@147 218 }
universe@39 219 free(list);
universe@39 220
universe@39 221 /* bounded list using multi-char delimiter (blmc) */
universe@39 222 n = 2;
universe@116 223 list = sstrsplit(test, S("is"), &n);
universe@39 224 UCX_TEST_ASSERT(n == 2, "blmc, list length must be 2");
universe@39 225 UCX_TEST_ASSERT(strcmp(list[0].ptr, "th") == 0, "blmc, item 0 mismatch");
universe@39 226 UCX_TEST_ASSERT(strcmp(list[1].ptr, ",is,a,csv,string") == 0,
universe@39 227 "blmc, item 1 mismatch");
universe@39 228 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
universe@39 229 "blmc, original has been modified");
olaf@147 230 for(int i=0;i<n;i++) {
olaf@147 231 free(list[i].ptr);
olaf@147 232 }
universe@39 233 free(list);
universe@39 234
universe@39 235 /* start with delimiter (swd) */
universe@39 236 n = 0;
universe@116 237 list = sstrsplit(test, S("this"), &n);
universe@39 238 UCX_TEST_ASSERT(n == 2, "swd, list length must be 2");
universe@39 239 UCX_TEST_ASSERT(list[0].length == 0, "swd, first item must be empty");
universe@39 240 UCX_TEST_ASSERT(strcmp(list[1].ptr, ",is,a,csv,string") == 0,
universe@39 241 "swd, second item corrupt");
universe@39 242 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
universe@39 243 "swd, original has been modified");
olaf@147 244 for(int i=0;i<n;i++) {
olaf@147 245 free(list[i].ptr);
olaf@147 246 }
universe@39 247 free(list);
universe@39 248
universe@39 249 /* end with delimiter (ewd) */
universe@39 250 n = 0;
universe@116 251 list = sstrsplit(test, S("string"), &n);
universe@39 252 UCX_TEST_ASSERT(n == 2, "ewd, list length must be 2");
universe@39 253 UCX_TEST_ASSERT(strcmp(list[0].ptr, "this,is,a,csv,") == 0,
universe@39 254 "swd, first item corrupt");
universe@39 255 UCX_TEST_ASSERT(list[1].length == 0, "ewd, second item must be empty");
universe@39 256 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
universe@39 257 "ewd, original has been modified");
olaf@147 258 for(int i=0;i<n;i++) {
olaf@147 259 free(list[i].ptr);
olaf@147 260 }
universe@39 261 free(list);
universe@39 262
universe@39 263 /* exact match (exm) */
universe@39 264 n = 0;
universe@116 265 list = sstrsplit(test, S("this,is,a,csv,string"), &n);
universe@71 266 UCX_TEST_ASSERT(n == 0, "exm, list length must be 0");
universe@71 267 UCX_TEST_ASSERT(list == NULL, "exm, list must be NULL");
olaf@147 268 for(int i=0;i<n;i++) {
olaf@147 269 free(list[i].ptr);
olaf@147 270 }
universe@39 271 free(list);
universe@39 272
universe@39 273 /* substring (subs) */
universe@39 274 n = 0;
universe@116 275 list = sstrsplit(test, S("this,is,a,csv,string,with,extension"), &n);
universe@39 276 UCX_TEST_ASSERT(n == 1, "subs, list length must be 1");
universe@39 277 UCX_TEST_ASSERT(strcmp(list[0].ptr, original) == 0,
universe@39 278 "subs, single item must be the original string");
universe@39 279 UCX_TEST_ASSERT(strcmp(test.ptr, original) == 0,
universe@39 280 "subs, original has been modified");
olaf@147 281 for(int i=0;i<n;i++) {
olaf@147 282 free(list[i].ptr);
olaf@147 283 }
universe@39 284 free(list);
universe@39 285
universe@39 286 UCX_TEST_END
universe@39 287 }
universe@97 288
universe@134 289 UCX_TEST(test_sstrtrim) {
olaf@104 290 sstr_t t1 = sstrtrim(sstr((char*)" ein test "));
olaf@104 291 sstr_t t2 = sstrtrim(sstr((char*)"abc"));
olaf@104 292 sstr_t t3 = sstrtrim(sstr((char*)" 123"));
olaf@104 293 sstr_t t4 = sstrtrim(sstr((char*)"xyz "));
olaf@104 294 sstr_t t5 = sstrtrim(sstr((char*)" "));
universe@100 295 sstr_t empty = sstrtrim(sstr((char*)""));
universe@97 296 UCX_TEST_BEGIN
olaf@104 297 UCX_TEST_ASSERT(strncmp(t1.ptr, "ein test", t1.length) == 0, "failed");
olaf@104 298 UCX_TEST_ASSERT(strncmp(t2.ptr, "abc", t2.length) == 0, "failed");
olaf@104 299 UCX_TEST_ASSERT(strncmp(t3.ptr, "123", t3.length) == 0, "failed");
olaf@104 300 UCX_TEST_ASSERT(strncmp(t4.ptr, "xyz", t4.length) == 0, "failed");
olaf@104 301 UCX_TEST_ASSERT(t5.length == 0, "string t5 not empty");
universe@98 302 UCX_TEST_ASSERT(empty.length == 0, "empty string failed");
universe@97 303 UCX_TEST_END
universe@97 304 }
universe@146 305
universe@146 306 UCX_TEST(test_sstrprefixsuffix) {
universe@146 307 sstr_t str = ST("test my prefix and my suffix");
universe@146 308 sstr_t empty = ST("");
universe@146 309
universe@146 310 UCX_TEST_BEGIN
universe@146 311
universe@146 312 UCX_TEST_ASSERT(!sstrprefix(empty, S("pref")), "prefix empty string fails");
universe@146 313 UCX_TEST_ASSERT(!sstrsuffix(empty, S("suf")), "suffix empty string fails");
universe@146 314
universe@146 315 UCX_TEST_ASSERT(sstrprefix(str, empty), "empty prefix fails");
universe@146 316 UCX_TEST_ASSERT(sstrsuffix(str, empty), "empty suffix fails");
universe@146 317
universe@146 318 UCX_TEST_ASSERT(sstrprefix(empty, empty), "string and prefix empty fails");
universe@146 319 UCX_TEST_ASSERT(sstrsuffix(empty, empty), "string and suffix empty fails");
universe@146 320
universe@146 321 UCX_TEST_ASSERT(sstrprefix(str, S("test ")), "prefix false negative");
universe@146 322 UCX_TEST_ASSERT(!sstrprefix(str, S("8-) fsck ")), "prefix false positive");
universe@146 323
universe@146 324 UCX_TEST_ASSERT(sstrsuffix(str, S("fix")), "suffix false negative");
universe@146 325 UCX_TEST_ASSERT(!sstrsuffix(str, S("fox")), "suffix false positive");
universe@146 326
universe@146 327
universe@146 328 UCX_TEST_END
universe@146 329 }

mercurial