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