test/test_list.c@2e8878770de0
test/test_list.c
Sun, 06 Mar 2022 13:57:36 +0100
- author
- Mike Becker <universe@uap-core.de>
- date
- Sun, 06 Mar 2022 13:57:36 +0100
- changeset 507
- 2e8878770de0
- parent 506
- 18782bbe3607
- child 509
- 0d3c6075f82c
- permissions
- -rw-r--r--
remove test code duplication for cxListAdd
1 /*
2 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
3 *
4 * Copyright 2021 Mike Becker, 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 "cx/linked_list.h"
30 #include "test_config.h"
31 #include "util_allocator.h"
33 static int cmp_int_impl(
34 int const *l,
35 int const *r
36 ) {
37 int left = *l, right = *r;
38 return left == right ? 0 : (left < right ? -1 : 1);
39 }
41 #define cmp_int ((CxListComparator) cmp_int_impl)
43 struct node {
44 struct node *next;
45 struct node *prev;
46 int data;
47 };
49 #define nd(name) name = {0}
51 const ptrdiff_t loc_prev = offsetof(struct node, prev);
52 const ptrdiff_t loc_next = offsetof(struct node, next);
53 const ptrdiff_t loc_data = offsetof(struct node, data);
55 struct node *create_test_data(
56 size_t n,
57 int const data[]
58 ) {
59 if (n == 0) return NULL;
60 struct node *begin = calloc(1, sizeof(struct node));
61 struct node *prev = begin;
62 if (data) begin->data = data[0];
63 for (size_t i = 1; i < n; i++) {
64 struct node *node = calloc(1, sizeof(struct node));
65 if (data) node->data = data[i];
66 cx_linked_list_link(prev, node, loc_prev, loc_next);
67 prev = node;
68 }
69 return begin;
70 }
72 void destroy_test_data(struct node *begin) {
73 struct node *node = begin;
74 while (node) {
75 struct node *next = node->next;
76 free(node);
77 node = next;
78 }
79 }
81 void test_linked_list_link_unlink(void) {
83 struct node nd(a), nd(b), nd(c);
85 cx_linked_list_link(&a, &b, loc_prev, loc_next);
86 CU_ASSERT_PTR_NULL(a.prev)
87 CU_ASSERT_PTR_EQUAL(a.next, &b)
88 CU_ASSERT_PTR_EQUAL(b.prev, &a)
89 CU_ASSERT_PTR_NULL(b.next)
91 cx_linked_list_unlink(&a, &b, loc_prev, loc_next);
92 CU_ASSERT_PTR_NULL(a.prev)
93 CU_ASSERT_PTR_NULL(a.next)
94 CU_ASSERT_PTR_NULL(b.prev)
95 CU_ASSERT_PTR_NULL(b.next)
97 cx_linked_list_link(&b, &c, loc_prev, loc_next);
98 cx_linked_list_link(&a, &b, loc_prev, loc_next);
99 cx_linked_list_unlink(&b, &c, loc_prev, loc_next);
100 CU_ASSERT_PTR_NULL(a.prev)
101 CU_ASSERT_PTR_EQUAL(a.next, &b)
102 CU_ASSERT_PTR_EQUAL(b.prev, &a)
103 CU_ASSERT_PTR_NULL(b.next)
104 CU_ASSERT_PTR_NULL(c.prev)
105 CU_ASSERT_PTR_NULL(c.next)
106 }
108 void test_linked_list_at(void) {
109 struct node nd(a), nd(b), nd(c), nd(d);
110 cx_linked_list_link(&a, &b, loc_prev, loc_next);
111 cx_linked_list_link(&b, &c, loc_prev, loc_next);
112 cx_linked_list_link(&c, &d, loc_prev, loc_next);
114 CU_ASSERT_PTR_EQUAL(cx_linked_list_at(&a, 0, loc_next, 0), &a)
115 CU_ASSERT_PTR_EQUAL(cx_linked_list_at(&a, 0, loc_next, 1), &b)
116 CU_ASSERT_PTR_EQUAL(cx_linked_list_at(&a, 0, loc_next, 2), &c)
117 CU_ASSERT_PTR_EQUAL(cx_linked_list_at(&a, 0, loc_next, 3), &d)
118 CU_ASSERT_PTR_NULL(cx_linked_list_at(&a, 0, loc_next, 4))
120 CU_ASSERT_PTR_EQUAL(cx_linked_list_at(&b, 1, loc_prev, 0), &a)
121 CU_ASSERT_PTR_EQUAL(cx_linked_list_at(&b, 1, loc_next, 1), &b)
122 CU_ASSERT_PTR_EQUAL(cx_linked_list_at(&b, 1, loc_next, 2), &c)
123 CU_ASSERT_PTR_EQUAL(cx_linked_list_at(&b, 1, loc_next, 3), &d)
124 CU_ASSERT_PTR_NULL(cx_linked_list_at(&b, 1, loc_next, 4))
126 CU_ASSERT_PTR_EQUAL(cx_linked_list_at(&d, 3, loc_prev, 0), &a)
127 CU_ASSERT_PTR_EQUAL(cx_linked_list_at(&d, 3, loc_prev, 1), &b)
128 }
130 void test_linked_list_find(void) {
131 int data[] = {2, 4, 6, 8};
132 void *list = create_test_data(4, data);
133 int s;
135 s = 2;
136 CU_ASSERT_EQUAL(cx_linked_list_find(list, loc_next, loc_data,
137 false, cmp_int, &s), 0)
138 s = 4;
139 CU_ASSERT_EQUAL(cx_linked_list_find(list, loc_next, loc_data,
140 false, cmp_int, &s), 1)
141 s = 6;
142 CU_ASSERT_EQUAL(cx_linked_list_find(list, loc_next, loc_data,
143 false, cmp_int, &s), 2)
144 s = 8;
145 CU_ASSERT_EQUAL(cx_linked_list_find(list, loc_next, loc_data,
146 false, cmp_int, &s), 3)
147 s = 10;
148 CU_ASSERT_EQUAL(cx_linked_list_find(list, loc_next, loc_data,
149 false, cmp_int, &s), 4)
150 s = -2;
151 CU_ASSERT_EQUAL(cx_linked_list_find(list, loc_next, loc_data,
152 false, cmp_int, &s), 4)
153 }
155 void test_linked_list_compare(void) {
156 int a[] = {2, 4, 6, 8};
157 int b[] = {2, 4, 6};
158 int c[] = {2, 4, 6, 9};
160 void *la = create_test_data(4, a);
161 void *lb = create_test_data(3, b);
162 void *lc = create_test_data(4, c);
164 CU_ASSERT_TRUE(0 < cx_linked_list_compare(la, lb, loc_next, loc_data,
165 false, cmp_int)
166 )
167 CU_ASSERT_TRUE(0 > cx_linked_list_compare(lb, la, loc_next, loc_data,
168 false, cmp_int)
169 )
170 CU_ASSERT_TRUE(0 < cx_linked_list_compare(lc, la, loc_next, loc_data,
171 false, cmp_int)
172 )
173 CU_ASSERT_TRUE(0 > cx_linked_list_compare(la, lc, loc_next, loc_data,
174 false, cmp_int)
175 )
176 CU_ASSERT_TRUE(0 == cx_linked_list_compare(la, la, loc_next, loc_data,
177 false, cmp_int)
178 )
180 destroy_test_data(la);
181 destroy_test_data(lb);
182 destroy_test_data(lc);
183 }
185 void test_linked_list_add(void) {
186 struct node nodes[4];
187 void *begin, *end;
189 // test with begin, end / prev, next
190 memset(nodes, 0, 4 * sizeof(struct node));
191 begin = end = NULL;
193 cx_linked_list_add(&begin, &end, loc_prev, loc_next, &nodes[0]);
194 CU_ASSERT_PTR_EQUAL(begin, &nodes[0])
195 CU_ASSERT_PTR_EQUAL(end, &nodes[0])
196 CU_ASSERT_PTR_NULL(nodes[0].prev)
197 CU_ASSERT_PTR_NULL(nodes[0].next)
199 cx_linked_list_add(&begin, &end, loc_prev, loc_next, &nodes[1]);
200 CU_ASSERT_PTR_EQUAL(begin, &nodes[0])
201 CU_ASSERT_PTR_EQUAL(end, &nodes[1])
202 CU_ASSERT_PTR_EQUAL(nodes[0].next, &nodes[1])
203 CU_ASSERT_PTR_EQUAL(nodes[1].prev, &nodes[0])
205 // test with begin only / prev, next
206 memset(nodes, 0, 4 * sizeof(struct node));
207 begin = end = NULL;
209 cx_linked_list_add(&begin, NULL, loc_prev, loc_next, &nodes[0]);
210 CU_ASSERT_PTR_EQUAL(begin, &nodes[0])
211 cx_linked_list_add(&begin, NULL, loc_prev, loc_next, &nodes[1]);
212 CU_ASSERT_PTR_EQUAL(begin, &nodes[0])
213 CU_ASSERT_PTR_EQUAL(nodes[0].next, &nodes[1])
214 CU_ASSERT_PTR_EQUAL(nodes[1].prev, &nodes[0])
216 cx_linked_list_add(&begin, NULL, loc_prev, loc_next, &nodes[2]);
217 CU_ASSERT_PTR_EQUAL(nodes[1].next, &nodes[2])
218 CU_ASSERT_PTR_EQUAL(nodes[2].prev, &nodes[1])
220 // test with end only / prev, next
221 memset(nodes, 0, 4 * sizeof(struct node));
222 begin = end = NULL;
224 cx_linked_list_add(NULL, &end, loc_prev, loc_next, &nodes[0]);
225 CU_ASSERT_PTR_EQUAL(end, &nodes[0])
226 cx_linked_list_add(NULL, &end, loc_prev, loc_next, &nodes[1]);
227 CU_ASSERT_PTR_EQUAL(end, &nodes[1])
228 CU_ASSERT_PTR_EQUAL(nodes[0].next, &nodes[1])
229 CU_ASSERT_PTR_EQUAL(nodes[1].prev, &nodes[0])
231 cx_linked_list_add(NULL, &end, loc_prev, loc_next, &nodes[2]);
232 CU_ASSERT_PTR_EQUAL(end, &nodes[2])
233 CU_ASSERT_PTR_EQUAL(nodes[1].next, &nodes[2])
234 CU_ASSERT_PTR_EQUAL(nodes[2].prev, &nodes[1])
236 // test with begin, end / next
237 memset(nodes, 0, 4 * sizeof(struct node));
238 begin = end = NULL;
240 cx_linked_list_add(&begin, &end, -1, loc_next, &nodes[0]);
241 CU_ASSERT_PTR_EQUAL(begin, &nodes[0])
242 CU_ASSERT_PTR_EQUAL(end, &nodes[0])
243 cx_linked_list_add(&begin, &end, -1, loc_next, &nodes[1]);
244 CU_ASSERT_PTR_EQUAL(end, &nodes[1])
245 CU_ASSERT_PTR_EQUAL(nodes[0].next, &nodes[1])
246 CU_ASSERT_PTR_NULL(nodes[1].prev)
247 }
249 void test_linked_list_prepend(void) {
250 struct node nodes[4];
251 void *begin, *end;
253 // test with begin, end / prev, next
254 memset(nodes, 0, 4 * sizeof(struct node));
255 begin = end = NULL;
257 cx_linked_list_prepend(&begin, &end, loc_prev, loc_next, &nodes[0]);
258 CU_ASSERT_PTR_EQUAL(begin, &nodes[0])
259 CU_ASSERT_PTR_EQUAL(end, &nodes[0])
260 CU_ASSERT_PTR_NULL(nodes[0].prev)
261 CU_ASSERT_PTR_NULL(nodes[0].next)
263 cx_linked_list_prepend(&begin, &end, loc_prev, loc_next, &nodes[1]);
264 CU_ASSERT_PTR_EQUAL(begin, &nodes[1])
265 CU_ASSERT_PTR_EQUAL(end, &nodes[0])
266 CU_ASSERT_PTR_EQUAL(nodes[1].next, &nodes[0])
267 CU_ASSERT_PTR_EQUAL(nodes[0].prev, &nodes[1])
269 // test with begin only / prev, next
270 memset(nodes, 0, 4 * sizeof(struct node));
271 begin = end = NULL;
273 cx_linked_list_prepend(&begin, NULL, loc_prev, loc_next, &nodes[0]);
274 CU_ASSERT_PTR_EQUAL(begin, &nodes[0])
275 cx_linked_list_prepend(&begin, NULL, loc_prev, loc_next, &nodes[1]);
276 CU_ASSERT_PTR_EQUAL(begin, &nodes[1])
277 CU_ASSERT_PTR_EQUAL(nodes[1].next, &nodes[0])
278 CU_ASSERT_PTR_EQUAL(nodes[0].prev, &nodes[1])
280 cx_linked_list_prepend(&begin, NULL, loc_prev, loc_next, &nodes[2]);
281 CU_ASSERT_PTR_EQUAL(begin, &nodes[2])
282 CU_ASSERT_PTR_EQUAL(nodes[2].next, &nodes[1])
283 CU_ASSERT_PTR_EQUAL(nodes[1].prev, &nodes[2])
285 // test with end only / prev, next
286 memset(nodes, 0, 4 * sizeof(struct node));
287 begin = end = NULL;
289 cx_linked_list_prepend(NULL, &end, loc_prev, loc_next, &nodes[0]);
290 CU_ASSERT_PTR_EQUAL(end, &nodes[0])
291 cx_linked_list_prepend(NULL, &end, loc_prev, loc_next, &nodes[1]);
292 CU_ASSERT_PTR_EQUAL(end, &nodes[0])
293 CU_ASSERT_PTR_EQUAL(nodes[1].next, &nodes[0])
294 CU_ASSERT_PTR_EQUAL(nodes[0].prev, &nodes[1])
296 cx_linked_list_prepend(NULL, &end, loc_prev, loc_next, &nodes[2]);
297 CU_ASSERT_PTR_EQUAL(end, &nodes[0])
298 CU_ASSERT_PTR_EQUAL(nodes[2].next, &nodes[1])
299 CU_ASSERT_PTR_EQUAL(nodes[1].prev, &nodes[2])
301 // test with begin, end / next
302 memset(nodes, 0, 4 * sizeof(struct node));
303 begin = end = NULL;
305 cx_linked_list_prepend(&begin, &end, -1, loc_next, &nodes[0]);
306 CU_ASSERT_PTR_EQUAL(begin, &nodes[0])
307 CU_ASSERT_PTR_EQUAL(end, &nodes[0])
308 cx_linked_list_prepend(&begin, &end, -1, loc_next, &nodes[1]);
309 cx_linked_list_prepend(&begin, &end, -1, loc_next, &nodes[2]);
310 CU_ASSERT_PTR_EQUAL(begin, &nodes[2])
311 CU_ASSERT_PTR_EQUAL(end, &nodes[0])
312 CU_ASSERT_PTR_EQUAL(nodes[1].next, &nodes[0])
313 CU_ASSERT_PTR_EQUAL(nodes[2].next, &nodes[1])
314 CU_ASSERT_PTR_NULL(nodes[1].prev)
315 CU_ASSERT_PTR_NULL(nodes[0].prev)
316 }
318 void test_linked_list_insert(void) {
319 struct node nodes[4];
320 void *begin, *end;
322 // insert mid list
323 memset(nodes, 0, 4 * sizeof(struct node));
324 begin = &nodes[0];
325 end = &nodes[2];
327 cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
328 cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
330 cx_linked_list_insert(&begin, &end, loc_prev, loc_next, &nodes[1], &nodes[3]);
331 CU_ASSERT_PTR_EQUAL(begin, &nodes[0])
332 CU_ASSERT_PTR_EQUAL(end, &nodes[2])
333 CU_ASSERT_PTR_EQUAL(nodes[1].next, &nodes[3])
334 CU_ASSERT_PTR_EQUAL(nodes[2].prev, &nodes[3])
335 CU_ASSERT_PTR_EQUAL(nodes[3].prev, &nodes[1])
336 CU_ASSERT_PTR_EQUAL(nodes[3].next, &nodes[2])
338 // insert end
339 memset(nodes, 0, 4 * sizeof(struct node));
340 begin = &nodes[0];
341 end = &nodes[2];
343 cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
344 cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
346 cx_linked_list_insert(&begin, &end, loc_prev, loc_next, &nodes[2], &nodes[3]);
347 CU_ASSERT_PTR_EQUAL(begin, &nodes[0])
348 CU_ASSERT_PTR_EQUAL(end, &nodes[3])
349 CU_ASSERT_PTR_EQUAL(nodes[2].next, &nodes[3])
350 CU_ASSERT_PTR_EQUAL(nodes[3].prev, &nodes[2])
351 CU_ASSERT_PTR_NULL(nodes[3].next)
353 // insert begin
354 memset(nodes, 0, 4 * sizeof(struct node));
355 begin = &nodes[0];
356 end = &nodes[2];
358 cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
359 cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
361 cx_linked_list_insert(&begin, &end, loc_prev, loc_next, NULL, &nodes[3]);
362 CU_ASSERT_PTR_EQUAL(begin, &nodes[3])
363 CU_ASSERT_PTR_EQUAL(end, &nodes[2])
364 CU_ASSERT_PTR_EQUAL(nodes[0].prev, &nodes[3])
365 CU_ASSERT_PTR_NULL(nodes[3].prev)
366 CU_ASSERT_PTR_EQUAL(nodes[3].next, &nodes[0])
367 }
369 void test_linked_list_insert_chain(void) {
370 struct node nodes[5];
371 void *begin, *end;
373 // insert mid list
374 memset(nodes, 0, 5 * sizeof(struct node));
375 begin = &nodes[0];
376 end = &nodes[2];
378 cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
379 cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
380 cx_linked_list_link(&nodes[3], &nodes[4], loc_prev, loc_next);
382 cx_linked_list_insert_chain(&begin, &end, loc_prev, loc_next, &nodes[1], &nodes[3], NULL);
383 CU_ASSERT_PTR_EQUAL(begin, &nodes[0])
384 CU_ASSERT_PTR_EQUAL(end, &nodes[2])
385 CU_ASSERT_PTR_EQUAL(nodes[1].next, &nodes[3])
386 CU_ASSERT_PTR_EQUAL(nodes[2].prev, &nodes[4])
387 CU_ASSERT_PTR_EQUAL(nodes[3].prev, &nodes[1])
388 CU_ASSERT_PTR_EQUAL(nodes[4].next, &nodes[2])
390 // insert end
391 memset(nodes, 0, 5 * sizeof(struct node));
392 begin = &nodes[0];
393 end = &nodes[2];
395 cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
396 cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
397 cx_linked_list_link(&nodes[3], &nodes[4], loc_prev, loc_next);
399 cx_linked_list_insert_chain(&begin, &end, loc_prev, loc_next, &nodes[2], &nodes[3], NULL);
400 CU_ASSERT_PTR_EQUAL(begin, &nodes[0])
401 CU_ASSERT_PTR_EQUAL(end, &nodes[4])
402 CU_ASSERT_PTR_EQUAL(nodes[2].next, &nodes[3])
403 CU_ASSERT_PTR_EQUAL(nodes[3].prev, &nodes[2])
404 CU_ASSERT_PTR_NULL(nodes[4].next)
406 // insert begin
407 memset(nodes, 0, 5 * sizeof(struct node));
408 begin = &nodes[0];
409 end = &nodes[2];
411 cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
412 cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
413 cx_linked_list_link(&nodes[3], &nodes[4], loc_prev, loc_next);
415 cx_linked_list_insert_chain(&begin, &end, loc_prev, loc_next, NULL, &nodes[3], NULL);
416 CU_ASSERT_PTR_EQUAL(begin, &nodes[3])
417 CU_ASSERT_PTR_EQUAL(end, &nodes[2])
418 CU_ASSERT_PTR_EQUAL(nodes[0].prev, &nodes[4])
419 CU_ASSERT_PTR_NULL(nodes[3].prev)
420 CU_ASSERT_PTR_EQUAL(nodes[4].next, &nodes[0])
421 }
423 void test_linked_list_first(void) {
424 struct node *begin = create_test_data(3, NULL);
425 CU_ASSERT_PTR_EQUAL(cx_linked_list_first(begin, loc_prev), begin)
426 CU_ASSERT_PTR_EQUAL(cx_linked_list_first(begin->next, loc_prev), begin)
427 CU_ASSERT_PTR_EQUAL(cx_linked_list_first(begin->next->next, loc_prev), begin)
428 destroy_test_data(begin);
429 }
431 void test_linked_list_last(void) {
432 struct node *begin = create_test_data(3, NULL);
433 struct node *end = begin->next->next;
434 CU_ASSERT_PTR_EQUAL(cx_linked_list_last(begin, loc_next), end)
435 CU_ASSERT_PTR_EQUAL(cx_linked_list_last(begin->next, loc_next), end)
436 CU_ASSERT_PTR_EQUAL(cx_linked_list_last(begin->next->next, loc_next), end)
437 destroy_test_data(begin);
438 }
440 void test_linked_list_prev(void) {
441 struct node *begin = create_test_data(3, NULL);
442 CU_ASSERT_PTR_NULL(cx_linked_list_prev(begin, loc_next, begin))
443 CU_ASSERT_PTR_EQUAL(cx_linked_list_prev(begin, loc_next, begin->next), begin)
444 CU_ASSERT_PTR_EQUAL(cx_linked_list_prev(begin, loc_next, begin->next->next), begin->next)
445 destroy_test_data(begin);
446 }
448 void test_linked_list_remove(void) {
449 void *begin, *end;
451 int data[] = {2, 4, 6};
452 begin = create_test_data(3, data);
453 struct node *first = begin;
454 struct node *second = first->next;
455 struct node *third = second->next;
456 end = third;
458 cx_linked_list_remove(&begin, &end, loc_prev, loc_next, second);
459 CU_ASSERT_PTR_EQUAL(begin, first)
460 CU_ASSERT_PTR_EQUAL(end, third)
461 CU_ASSERT_PTR_NULL(first->prev)
462 CU_ASSERT_PTR_EQUAL(first->next, third)
463 CU_ASSERT_PTR_EQUAL(third->prev, first)
464 CU_ASSERT_PTR_NULL(third->next)
466 cx_linked_list_remove(&begin, &end, loc_prev, loc_next, third);
467 CU_ASSERT_PTR_EQUAL(begin, first)
468 CU_ASSERT_PTR_EQUAL(end, first)
469 CU_ASSERT_PTR_NULL(first->prev)
470 CU_ASSERT_PTR_NULL(first->next)
472 cx_linked_list_remove(&begin, &end, loc_prev, loc_next, first);
473 CU_ASSERT_PTR_NULL(begin)
474 CU_ASSERT_PTR_NULL(end)
476 free(first);
477 free(second);
478 free(third);
479 }
481 void test_linked_list_size(void) {
482 struct node *list;
484 CU_ASSERT_PTR_EQUAL(cx_linked_list_size(NULL, loc_next), 0)
486 list = create_test_data(5, NULL);
487 CU_ASSERT_EQUAL(cx_linked_list_size(list, loc_next), 5)
488 destroy_test_data(list);
490 list = create_test_data(13, NULL);
491 CU_ASSERT_EQUAL(cx_linked_list_size(list, loc_next), 13)
492 destroy_test_data(list);
493 }
495 void test_linked_list_sort(void) {
496 int expected[] = {
497 14, 30, 151, 163, 227, 300, 315, 317, 363, 398, 417, 424, 438, 446, 508, 555, 605, 713, 716, 759, 761, 880,
498 894, 1034, 1077, 1191, 1231, 1264, 1297, 1409, 1423, 1511, 1544, 1659, 1686, 1707, 1734, 1771, 1874, 1894,
499 1976, 2079, 2124, 2130, 2135, 2266, 2338, 2358, 2430, 2500, 2540, 2542, 2546, 2711, 2733, 2754, 2764, 2797,
500 2888, 2900, 3020, 3053, 3109, 3244, 3275, 3302, 3362, 3363, 3364, 3441, 3515, 3539, 3579, 3655, 3675, 3677,
501 3718, 3724, 3757, 3866, 3896, 3906, 3941, 3984, 3994, 4016, 4085, 4121, 4254, 4319, 4366, 4459, 4514, 4681,
502 4785, 4791, 4801, 4859, 4903, 4973
503 };
504 int scrambled[] = {
505 759, 716, 880, 761, 2358, 2542, 2500, 2540, 2546, 2711, 2430, 1707, 1874, 1771, 1894, 1734, 1976, 2079,
506 2124, 2130, 2135, 2266, 2338, 2733, 2754, 2764, 2797, 3362, 3363, 3364, 3441, 3515, 3539, 3579, 3655, 2888,
507 2900, 3020, 3053, 3109, 3244, 3275, 3302, 438, 446, 508, 555, 605, 713, 14, 30, 151, 163, 227, 300,
508 894, 1034, 1077, 1191, 1231, 1264, 1297, 1409, 1423, 1511, 1544, 1659, 1686, 315, 317, 363, 398, 417, 424,
509 3675, 3677, 3718, 3724, 3757, 3866, 3896, 3906, 3941, 3984, 3994, 4785, 4791, 4801, 4859, 4903, 4973,
510 4016, 4085, 4121, 4254, 4319, 4366, 4459, 4514, 4681
511 };
513 void *begin = create_test_data(100, scrambled);
514 void *end = cx_linked_list_last(begin, loc_next);
516 cx_linked_list_sort(&begin, &end, loc_prev, loc_next, loc_data,
517 false, cmp_int);
519 struct node *check = begin;
520 struct node *check_last = NULL;
521 CU_ASSERT_PTR_NULL(check->prev)
522 CU_ASSERT_EQUAL(check->data, expected[0])
523 for (int i = 0; i < 100; i++) {
524 CU_ASSERT_EQUAL(check->data, expected[i])
525 CU_ASSERT_PTR_EQUAL(check->prev, check_last)
526 if (i < 99) {
527 CU_ASSERT_PTR_NOT_NULL(check->next)
528 }
529 check_last = check;
530 check = check->next;
531 }
532 CU_ASSERT_PTR_NULL(check)
533 CU_ASSERT_PTR_EQUAL(end, check_last)
535 destroy_test_data(begin);
536 }
538 void test_linked_list_reverse(void) {
539 void *begin, *end;
541 int data[] = {2, 4, 6, 8};
542 int reversed[] = {8, 6, 4, 2};
544 void *list = create_test_data(4, data);
545 void *expected = create_test_data(4, reversed);
547 begin = list;
548 end = cx_linked_list_last(list, loc_next);
550 cx_linked_list_reverse(&begin, &end, loc_prev, loc_next);
551 CU_ASSERT_PTR_EQUAL(end, list)
552 CU_ASSERT_PTR_EQUAL(begin, cx_linked_list_first(end, loc_prev))
553 CU_ASSERT_TRUE(0 == cx_linked_list_compare(begin, expected, loc_next, loc_data,
554 0, cmp_int))
556 destroy_test_data(begin);
557 destroy_test_data(expected);
558 }
560 static void verify_linked_list_create(CxList *list) {
561 CU_ASSERT_EQUAL(list->size, 0)
562 CU_ASSERT_EQUAL(list->capacity, (size_t) -1)
563 CU_ASSERT_PTR_EQUAL(list->allocator, cxTestingAllocator)
564 CU_ASSERT_PTR_EQUAL(list->cmpfunc, cmp_int)
566 cxListDestroy(list);
567 }
569 void test_hl_linked_list_create(void) {
570 CxList *list = cxLinkedListCreate(cxTestingAllocator, cmp_int, sizeof(int));
571 CU_ASSERT_EQUAL(list->itemsize, sizeof(int))
572 verify_linked_list_create(list);
573 }
575 void test_hl_ptr_linked_list_create(void) {
576 CxList *list = cxPointerLinkedListCreate(cxTestingAllocator, cmp_int);
577 CU_ASSERT_EQUAL(list->itemsize, sizeof(void *))
578 verify_linked_list_create(list);
579 }
581 void test_hl_linked_list_from_array(void) {
582 int data[] = {2, 4, 5, 7, 10, 15};
584 CxList *expected = cxLinkedListCreate(cxTestingAllocator, cmp_int, sizeof(int));
585 for (int i = 0; i < 5; i++) cxListAdd(expected, &data[i]);
587 CxList *list = cxLinkedListFromArray(cxTestingAllocator, cmp_int, sizeof(int), 5, data);
589 CU_ASSERT_TRUE(0 == cxListCompare(list, expected))
591 cxListDestroy(list);
592 cxListDestroy(expected);
593 }
595 static void verify_hl_linked_list_add(
596 CxList *list,
597 int data[],
598 size_t len,
599 bool write_through
600 ) {
601 for (size_t i = 0; i < len; i++) {
602 CU_ASSERT_EQUAL(cxListAdd(list, &data[i]), 0)
603 }
604 CU_ASSERT_EQUAL(list->size, len)
605 CU_ASSERT_TRUE(list->capacity >= list->size)
606 for (size_t i = 0; i < len; i++) {
607 CU_ASSERT_EQUAL(*(int *) cxListAt(list, i), data[i])
608 }
609 for (size_t i = 0; i < len; i++) {
610 ++data[i];
611 }
612 if (write_through) {
613 for (size_t i = 0; i < len; i++) {
614 CU_ASSERT_EQUAL(*(int *) cxListAt(list, i), data[i])
615 }
616 } else {
617 for (size_t i = 0; i < len; i++) {
618 CU_ASSERT_EQUAL(*(int *) cxListAt(list, i), data[i] - 1)
619 }
620 }
621 cxListDestroy(list);
622 }
624 void test_hl_linked_list_add(void) {
625 CxList *list = cxLinkedListCreate(cxTestingAllocator, cmp_int, sizeof(int));
626 int data[] = {5, 47, 13, 9, 18, 1, 42};
627 verify_hl_linked_list_add(list, data, sizeof(data) / sizeof(int), false);
628 }
630 void test_hl_ptr_linked_list_add(void) {
631 CxList *list = cxPointerLinkedListCreate(cxTestingAllocator, cmp_int);
632 int data[] = {5, 47, 13, 9, 18, 1, 42};
633 verify_hl_linked_list_add(list, data, sizeof(data) / sizeof(int), true);
634 }
636 void test_hl_linked_list_insert(void) {
637 int data;
638 CxList *list = cxLinkedListCreate(cxTestingAllocator, cmp_int, sizeof(int));
640 data = 5;
641 CU_ASSERT_NOT_EQUAL(cxListInsert(list, 1, &data), 0)
642 CU_ASSERT_EQUAL(list->size, 0)
643 CU_ASSERT_EQUAL(cxListInsert(list, 0, &data), 0)
644 CU_ASSERT_EQUAL(list->size, 1)
645 data = 47;
646 CU_ASSERT_EQUAL(cxListInsert(list, 0, &data), 0)
647 CU_ASSERT_EQUAL(list->size, 2)
648 data = 13;
649 CU_ASSERT_EQUAL(cxListInsert(list, 1, &data), 0)
650 CU_ASSERT_EQUAL(list->size, 3)
651 data = 42;
652 CU_ASSERT_EQUAL(cxListInsert(list, 3, &data), 0)
654 CU_ASSERT_EQUAL(list->size, 4)
655 CU_ASSERT_TRUE(list->capacity >= list->size)
657 int exp[] = {47, 13, 5, 42};
658 CxList *expected = cxLinkedListFromArray(cxTestingAllocator, cmp_int, sizeof(int), 4, exp);
659 CU_ASSERT_TRUE(0 == cxListCompare(list, expected))
661 cxListDestroy(list);
662 cxListDestroy(expected);
663 }
665 void test_hl_ptr_linked_list_insert(void) {
666 CxList *list = cxPointerLinkedListCreate(cxTestingAllocator, cmp_int);
668 int a = 5, b = 47, c = 13, d = 42;
670 CU_ASSERT_NOT_EQUAL(cxListInsert(list, 1, &a), 0)
671 CU_ASSERT_EQUAL(list->size, 0)
672 CU_ASSERT_EQUAL(cxListInsert(list, 0, &a), 0)
673 CU_ASSERT_EQUAL(list->size, 1)
674 CU_ASSERT_EQUAL(cxListInsert(list, 0, &b), 0)
675 CU_ASSERT_EQUAL(list->size, 2)
676 CU_ASSERT_EQUAL(cxListInsert(list, 1, &c), 0)
677 CU_ASSERT_EQUAL(list->size, 3)
678 CU_ASSERT_EQUAL(cxListInsert(list, 3, &d), 0)
680 CU_ASSERT_EQUAL(list->size, 4)
681 CU_ASSERT_TRUE(list->capacity >= list->size)
683 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 0), 47)
684 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 1), 13)
685 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 2), 5)
686 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 3), 42)
688 cxListDestroy(list);
689 }
691 void test_hl_linked_list_remove(void) {
692 int data[] = {5, 47, 42, 13};
693 CxList *list = cxLinkedListFromArray(cxTestingAllocator, cmp_int,
694 sizeof(int), 4, data);
696 CU_ASSERT_EQUAL(list->size, 4)
697 CU_ASSERT_TRUE(list->capacity >= list->size)
699 CU_ASSERT_NOT_EQUAL(cxListRemove(list, 4), 0)
701 CU_ASSERT_EQUAL(cxListRemove(list, 2), 0)
702 CU_ASSERT_EQUAL(list->size, 3)
703 CU_ASSERT_TRUE(list->capacity >= list->size)
704 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 0), 5)
705 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 1), 47)
706 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 2), 13)
708 CU_ASSERT_EQUAL(cxListRemove(list, 0), 0)
709 CU_ASSERT_EQUAL(list->size, 2)
710 CU_ASSERT_TRUE(list->capacity >= list->size)
711 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 0), 47)
712 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 1), 13)
714 CU_ASSERT_EQUAL(cxListRemove(list, 1), 0)
715 CU_ASSERT_EQUAL(list->size, 1)
716 CU_ASSERT_TRUE(list->capacity >= list->size)
717 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 0), 47)
719 CU_ASSERT_EQUAL(cxListRemove(list, 0), 0)
720 CU_ASSERT_EQUAL(list->size, 0)
721 CU_ASSERT_TRUE(list->capacity >= list->size)
723 CU_ASSERT_NOT_EQUAL(cxListRemove(list, 0), 0)
725 cxListDestroy(list);
726 }
728 void test_hl_ptr_linked_list_remove(void) {
729 int a = 5, b = 47, c = 42, d = 13;
730 CxList *list = cxPointerLinkedListCreate(cxTestingAllocator, cmp_int);
732 cxListAdd(list, &a);
733 cxListAdd(list, &b);
734 cxListAdd(list, &c);
735 cxListAdd(list, &d);
737 CU_ASSERT_EQUAL(list->size, 4)
738 CU_ASSERT_TRUE(list->capacity >= list->size)
740 CU_ASSERT_NOT_EQUAL(cxListRemove(list, 4), 0)
742 CU_ASSERT_EQUAL(cxListRemove(list, 2), 0)
743 CU_ASSERT_EQUAL(list->size, 3)
744 CU_ASSERT_TRUE(list->capacity >= list->size)
745 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 0), 5)
746 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 1), 47)
747 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 2), 13)
749 CU_ASSERT_EQUAL(cxListRemove(list, 0), 0)
750 CU_ASSERT_EQUAL(list->size, 2)
751 CU_ASSERT_TRUE(list->capacity >= list->size)
752 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 0), 47)
753 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 1), 13)
755 CU_ASSERT_EQUAL(cxListRemove(list, 1), 0)
756 CU_ASSERT_EQUAL(list->size, 1)
757 CU_ASSERT_TRUE(list->capacity >= list->size)
758 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 0), 47)
760 CU_ASSERT_EQUAL(cxListRemove(list, 0), 0)
761 CU_ASSERT_EQUAL(list->size, 0)
762 CU_ASSERT_TRUE(list->capacity >= list->size)
764 CU_ASSERT_NOT_EQUAL(cxListRemove(list, 0), 0)
766 cxListDestroy(list);
767 }
769 void test_hl_linked_list_at(void) {
770 int data[] = {5, 47, 13};
771 CxList *list = cxLinkedListFromArray(cxTestingAllocator, cmp_int,
772 sizeof(int), 3, data);
774 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 0), 5)
775 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 1), 47)
776 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 2), 13)
777 CU_ASSERT_PTR_NULL(cxListAt(list, 3))
779 cxListDestroy(list);
780 }
782 void test_hl_ptr_linked_list_at(void) {
783 CxList *list = cxPointerLinkedListCreate(cxTestingAllocator, cmp_int);
785 int a = 5, b = 47, c = 13;
786 cxListAdd(list, &a);
787 cxListAdd(list, &b);
788 cxListAdd(list, &c);
790 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 0), 5)
791 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 1), 47)
792 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 2), 13)
793 CU_ASSERT_PTR_NULL(cxListAt(list, 3))
795 cxListDestroy(list);
796 }
798 void test_hl_linked_list_find(void) {
799 int data[] = {5, 47, 13};
800 CxList *list = cxLinkedListFromArray(cxTestingAllocator, cmp_int,
801 sizeof(int), 3, data);
802 CU_ASSERT_EQUAL(list->size, 3)
803 CU_ASSERT_TRUE(list->capacity >= list->size)
805 int criteria;
807 criteria = 5;
808 CU_ASSERT_EQUAL(cxListFind(list, &criteria), 0)
809 criteria = 47;
810 CU_ASSERT_EQUAL(cxListFind(list, &criteria), 1)
811 criteria = 13;
812 CU_ASSERT_EQUAL(cxListFind(list, &criteria), 2)
813 criteria = 9000;
814 CU_ASSERT_EQUAL(cxListFind(list, &criteria), 3)
815 criteria = -5;
816 CU_ASSERT_EQUAL(cxListFind(list, &criteria), 3)
818 cxListDestroy(list);
819 }
821 void test_hl_ptr_linked_list_find(void) {
822 int a = 5, b = 47, c = 13, criteria;
823 CxList *list = cxPointerLinkedListCreate(cxTestingAllocator, cmp_int);
825 cxListAdd(list, &a);
826 cxListAdd(list, &b);
827 cxListAdd(list, &c);
829 CU_ASSERT_EQUAL(list->size, 3)
830 CU_ASSERT_TRUE(list->capacity >= list->size)
832 criteria = 5;
833 CU_ASSERT_EQUAL(cxListFind(list, &criteria), 0)
834 criteria = 47;
835 CU_ASSERT_EQUAL(cxListFind(list, &criteria), 1)
836 criteria = 13;
837 CU_ASSERT_EQUAL(cxListFind(list, &criteria), 2)
838 criteria = 9000;
839 CU_ASSERT_EQUAL(cxListFind(list, &criteria), 3)
840 criteria = -5;
841 CU_ASSERT_EQUAL(cxListFind(list, &criteria), 3)
842 b = -5;
843 CU_ASSERT_EQUAL(cxListFind(list, &criteria), 1)
845 cxListDestroy(list);
846 }
848 void test_hl_linked_list_sort(void) {
849 int expected[] = {
850 14, 30, 151, 163, 227, 300, 315, 317, 363, 398, 417, 424, 438, 446, 508, 555, 605, 713, 716, 759, 761, 880,
851 894, 1034, 1077, 1191, 1231, 1264, 1297, 1409, 1423, 1511, 1544, 1659, 1686, 1707, 1734, 1771, 1874, 1894,
852 1976, 2079, 2124, 2130, 2135, 2266, 2338, 2358, 2430, 2500, 2540, 2542, 2546, 2711, 2733, 2754, 2764, 2797,
853 2888, 2900, 3020, 3053, 3109, 3244, 3275, 3302, 3362, 3363, 3364, 3441, 3515, 3539, 3579, 3655, 3675, 3677,
854 3718, 3724, 3757, 3866, 3896, 3906, 3941, 3984, 3994, 4016, 4085, 4121, 4254, 4319, 4366, 4459, 4514, 4681,
855 4785, 4791, 4801, 4859, 4903, 4973
856 };
857 int scrambled[] = {
858 759, 716, 880, 761, 2358, 2542, 2500, 2540, 2546, 2711, 2430, 1707, 1874, 1771, 1894, 1734, 1976, 2079,
859 2124, 2130, 2135, 2266, 2338, 2733, 2754, 2764, 2797, 3362, 3363, 3364, 3441, 3515, 3539, 3579, 3655, 2888,
860 2900, 3020, 3053, 3109, 3244, 3275, 3302, 438, 446, 508, 555, 605, 713, 14, 30, 151, 163, 227, 300,
861 894, 1034, 1077, 1191, 1231, 1264, 1297, 1409, 1423, 1511, 1544, 1659, 1686, 315, 317, 363, 398, 417, 424,
862 3675, 3677, 3718, 3724, 3757, 3866, 3896, 3906, 3941, 3984, 3994, 4785, 4791, 4801, 4859, 4903, 4973,
863 4016, 4085, 4121, 4254, 4319, 4366, 4459, 4514, 4681
864 };
865 CxList *list = cxLinkedListFromArray(cxTestingAllocator, cmp_int, sizeof(int), 100, scrambled);
866 CxList *exp = cxLinkedListFromArray(cxTestingAllocator, cmp_int, sizeof(int), 100, expected);
868 cxListSort(list);
869 CU_ASSERT_TRUE(0 == cxListCompare(list, exp))
871 cxListDestroy(list);
872 cxListDestroy(exp);
873 }
875 void test_hl_ptr_linked_list_sort(void) {
876 int expected[] = {
877 14, 30, 151, 163, 227, 300, 315, 317, 363, 398, 417, 424, 438, 446, 508, 555, 605, 713, 716, 759, 761, 880,
878 894, 1034, 1077, 1191, 1231, 1264, 1297, 1409, 1423, 1511, 1544, 1659, 1686, 1707, 1734, 1771, 1874, 1894,
879 1976, 2079, 2124, 2130, 2135, 2266, 2338, 2358, 2430, 2500, 2540, 2542, 2546, 2711, 2733, 2754, 2764, 2797,
880 2888, 2900, 3020, 3053, 3109, 3244, 3275, 3302, 3362, 3363, 3364, 3441, 3515, 3539, 3579, 3655, 3675, 3677,
881 3718, 3724, 3757, 3866, 3896, 3906, 3941, 3984, 3994, 4016, 4085, 4121, 4254, 4319, 4366, 4459, 4514, 4681,
882 4785, 4791, 4801, 4859, 4903, 4973
883 };
884 int scrambled[] = {
885 759, 716, 880, 761, 2358, 2542, 2500, 2540, 2546, 2711, 2430, 1707, 1874, 1771, 1894, 1734, 1976, 2079,
886 2124, 2130, 2135, 2266, 2338, 2733, 2754, 2764, 2797, 3362, 3363, 3364, 3441, 3515, 3539, 3579, 3655, 2888,
887 2900, 3020, 3053, 3109, 3244, 3275, 3302, 438, 446, 508, 555, 605, 713, 14, 30, 151, 163, 227, 300,
888 894, 1034, 1077, 1191, 1231, 1264, 1297, 1409, 1423, 1511, 1544, 1659, 1686, 315, 317, 363, 398, 417, 424,
889 3675, 3677, 3718, 3724, 3757, 3866, 3896, 3906, 3941, 3984, 3994, 4785, 4791, 4801, 4859, 4903, 4973,
890 4016, 4085, 4121, 4254, 4319, 4366, 4459, 4514, 4681
891 };
893 CxList *list = cxPointerLinkedListCreate(cxTestingAllocator, cmp_int);
895 for (int i = 0; i < 100; i++) {
896 cxListAdd(list, &scrambled[i]);
897 }
899 cxListSort(list);
901 for (int i = 0; i < 100; i++) {
902 CU_ASSERT_EQUAL(*(int *) cxListAt(list, i), expected[i])
903 }
905 cxListDestroy(list);
906 }
908 void test_hl_linked_list_iterator_impl(CxList *list) {
909 int i = 0;
910 CxIterator iter = cxListBegin(list);
911 cx_foreach(int*, x, iter) {
912 CU_ASSERT_EQUAL(iter.index, (size_t) (i + 1) / 2)
913 CU_ASSERT_EQUAL(*x, i)
914 if (*x % 2 == 1) iter.remove = true;
915 i++;
916 }
917 CU_ASSERT_EQUAL(i, 10)
918 CU_ASSERT_EQUAL_FATAL(list->size, 5)
919 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 0), 0)
920 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 1), 2)
921 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 2), 4)
922 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 3), 6)
923 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 4), 8)
924 cxListDestroy(list);
925 }
927 void test_hl_linked_list_iterator(void) {
928 CxList *list = cxLinkedListCreate(cxTestingAllocator, cmp_int, sizeof(int));
929 for (int i = 0; i < 10; i++) {
930 cxListAdd(list, &i);
931 }
932 test_hl_linked_list_iterator_impl(list);
933 }
935 void test_hl_ptr_linked_list_iterator(void) {
936 CxList *list = cxPointerLinkedListCreate(cxTestingAllocator, cmp_int);
937 int data[10] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
938 for (int i = 0; i < 10; i++) {
939 cxListAdd(list, &data[i]);
940 }
941 test_hl_linked_list_iterator_impl(list);
942 }
944 void test_hl_linked_list_insert_via_iterator(void) {
945 CxList *list = cxLinkedListCreate(cxTestingAllocator, cmp_int, sizeof(int));
946 for (int i = 0; i < 5; i++) {
947 cxListAdd(list, &i);
948 }
949 CxIterator iter = cxListIterator(list, 2);
950 CU_ASSERT_EQUAL(iter.index, 2)
951 CU_ASSERT_EQUAL(*(int *) cxIteratorCurrent(&iter), 2)
953 int data = 10;
954 cxListInsertAfter(&iter, &data);
955 CU_ASSERT_EQUAL(iter.index, 2)
956 CU_ASSERT_EQUAL(*(int *) cxIteratorCurrent(&iter), 2)
957 data = 20;
958 cxListInsertBefore(&iter, &data);
959 CU_ASSERT_EQUAL(iter.index, 3)
960 CU_ASSERT_EQUAL(*(int *) cxIteratorCurrent(&iter), 2)
962 data = 30;
963 iter = cxListBegin(list);
964 cxListInsertBefore(&iter, &data);
965 CU_ASSERT_EQUAL(iter.index, 1)
966 CU_ASSERT_EQUAL(*(int *) cxIteratorCurrent(&iter), 0)
967 data = 40;
968 iter = cxListIterator(list, list->size);
969 cxListInsertBefore(&iter, &data);
970 CU_ASSERT_EQUAL(iter.index, 9)
971 CU_ASSERT_FALSE(cxIteratorValid(&iter))
972 data = 50;
973 iter = cxListIterator(list, list->size);
974 cxListInsertAfter(&iter, &data);
975 CU_ASSERT_EQUAL(iter.index, 10)
976 CU_ASSERT_FALSE(cxIteratorValid(&iter))
978 int expdata[] = {30, 0, 1, 20, 2, 10, 3, 4, 40, 50};
979 CxList *expected = cxLinkedListFromArray(cxTestingAllocator,
980 cmp_int, sizeof(int), 10, expdata);
982 CU_ASSERT_EQUAL(0, cxListCompare(list, expected))
983 cxListDestroy(list);
984 cxListDestroy(expected);
985 }
987 void test_hl_ptr_linked_list_insert_via_iterator(void) {
988 int testdata[] = {0, 1, 2, 3, 4, 10, 20, 30, 40, 50};
989 CxList *list = cxPointerLinkedListCreate(cxTestingAllocator, cmp_int);
990 int i;
991 for (i = 0; i < 5; i++) {
992 cxListAdd(list, &testdata[i]);
993 }
994 CxIterator iter = cxListIterator(list, 2);
995 CU_ASSERT_EQUAL(iter.index, 2)
996 CU_ASSERT_EQUAL(*(int *) cxIteratorCurrent(&iter), 2)
998 cxListInsertAfter(&iter, &testdata[i++]);
999 CU_ASSERT_EQUAL(iter.index, 2)
1000 CU_ASSERT_EQUAL(*(int *) cxIteratorCurrent(&iter), 2)
1001 cxListInsertBefore(&iter, &testdata[i++]);
1002 CU_ASSERT_EQUAL(iter.index, 3)
1003 CU_ASSERT_EQUAL(*(int *) cxIteratorCurrent(&iter), 2)
1005 iter = cxListBegin(list);
1006 cxListInsertBefore(&iter, &testdata[i++]);
1007 CU_ASSERT_EQUAL(iter.index, 1)
1008 CU_ASSERT_EQUAL(*(int *) cxIteratorCurrent(&iter), 0)
1009 iter = cxListIterator(list, list->size);
1010 cxListInsertBefore(&iter, &testdata[i++]);
1011 CU_ASSERT_EQUAL(iter.index, 9)
1012 CU_ASSERT_FALSE(cxIteratorValid(&iter))
1013 iter = cxListIterator(list, list->size);
1014 cxListInsertAfter(&iter, &testdata[i++]);
1015 CU_ASSERT_EQUAL(iter.index, 10)
1016 CU_ASSERT_FALSE(cxIteratorValid(&iter))
1018 int expdata[] = {30, 0, 1, 20, 2, 10, 3, 4, 40, 50};
1019 for (i = 0; i < 10; i++) {
1020 CU_ASSERT_EQUAL(*(int *) cxListAt(list, i), expdata[i])
1021 }
1023 cxListDestroy(list);
1024 }
1026 static void test_setup_allocator(void) {
1027 cxTestingAllocatorReset();
1028 }
1030 static void test_verify_allocator(void) {
1031 CU_ASSERT_TRUE(cxTestingAllocatorVerify())
1032 }
1034 int main() {
1035 CU_pSuite suite = NULL;
1037 if (CUE_SUCCESS != CU_initialize_registry()) {
1038 return CU_get_error();
1039 }
1041 suite = CU_add_suite("low level linked list", NULL, NULL);
1043 cu_add_test(suite, test_linked_list_link_unlink);
1044 cu_add_test(suite, test_linked_list_at);
1045 cu_add_test(suite, test_linked_list_find);
1046 cu_add_test(suite, test_linked_list_compare);
1047 cu_add_test(suite, test_linked_list_prepend);
1048 cu_add_test(suite, test_linked_list_add);
1049 cu_add_test(suite, test_linked_list_insert);
1050 cu_add_test(suite, test_linked_list_insert_chain);
1051 cu_add_test(suite, test_linked_list_first);
1052 cu_add_test(suite, test_linked_list_last);
1053 cu_add_test(suite, test_linked_list_prev);
1054 cu_add_test(suite, test_linked_list_remove);
1055 cu_add_test(suite, test_linked_list_size);
1056 cu_add_test(suite, test_linked_list_sort);
1057 cu_add_test(suite, test_linked_list_reverse);
1059 suite = CU_add_suite_with_setup_and_teardown(
1060 "high level linked list", NULL, NULL,
1061 test_setup_allocator, test_verify_allocator);
1063 cu_add_test(suite, test_hl_linked_list_create);
1064 cu_add_test(suite, test_hl_linked_list_from_array);
1065 cu_add_test(suite, test_hl_linked_list_add);
1066 cu_add_test(suite, test_hl_linked_list_insert);
1067 cu_add_test(suite, test_hl_linked_list_remove);
1068 cu_add_test(suite, test_hl_linked_list_at);
1069 cu_add_test(suite, test_hl_linked_list_find);
1070 cu_add_test(suite, test_hl_linked_list_sort);
1071 cu_add_test(suite, test_hl_linked_list_iterator);
1072 cu_add_test(suite, test_hl_linked_list_insert_via_iterator);
1074 suite = CU_add_suite_with_setup_and_teardown(
1075 "high level pointer linked list", NULL, NULL,
1076 test_setup_allocator, test_verify_allocator);
1078 cu_add_test(suite, test_hl_ptr_linked_list_create);
1079 cu_add_test(suite, test_hl_ptr_linked_list_add);
1080 cu_add_test(suite, test_hl_ptr_linked_list_insert);
1081 cu_add_test(suite, test_hl_ptr_linked_list_remove);
1082 cu_add_test(suite, test_hl_ptr_linked_list_at);
1083 cu_add_test(suite, test_hl_ptr_linked_list_find);
1084 cu_add_test(suite, test_hl_ptr_linked_list_sort);
1085 cu_add_test(suite, test_hl_ptr_linked_list_iterator);
1086 cu_add_test(suite, test_hl_ptr_linked_list_insert_via_iterator);
1088 CU_basic_set_mode(UCX_CU_BRM);
1090 int exitcode;
1091 if (CU_basic_run_tests()) {
1092 exitcode = CU_get_error();
1093 } else {
1094 exitcode = CU_get_number_of_failures() == 0 ? 0 : 1;
1095 }
1096 CU_cleanup_registry();
1097 return exitcode;
1098 }
