test/test_list.c@188942a7308b
test/test_list.c
Tue, 28 Dec 2021 18:05:14 +0100
- author
- Mike Becker <universe@uap-core.de>
- date
- Tue, 28 Dec 2021 18:05:14 +0100
- changeset 492
- 188942a7308b
- parent 491
- 6d538177f746
- child 494
- 6ce8cfa10a96
- permissions
- -rw-r--r--
simplifies some linked list tests
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 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 void test_hl_linked_list_create(void) {
561 cxTestingAllocatorReset();
563 CxList list = cxLinkedListCreate(cxTestingAllocator, cmp_int, sizeof(int));
565 CU_ASSERT_EQUAL(list->size, 0)
566 CU_ASSERT_EQUAL(list->capacity, (size_t) -1)
567 CU_ASSERT_PTR_EQUAL(list->allocator, cxTestingAllocator)
568 CU_ASSERT_EQUAL(list->itemsize, sizeof(int))
569 CU_ASSERT_PTR_EQUAL(list->cmpfunc, cmp_int)
571 cxLinkedListDestroy(list);
572 CU_ASSERT_TRUE(cxTestingAllocatorVerify())
573 }
575 void test_hl_linked_list_from_array(void) {
576 cxTestingAllocatorReset();
578 int data[] = {2, 4, 5, 7, 10, 15};
580 CxList expected = cxLinkedListCreate(cxTestingAllocator, cmp_int, sizeof(int));
581 for (int i = 0; i < 5; i++) cxListAdd(expected, &data[i]);
583 CxList list = cxLinkedListFromArray(cxTestingAllocator, cmp_int, sizeof(int), 5, data);
585 CU_ASSERT_TRUE(0 == cxListCompare(list, expected))
587 cxLinkedListDestroy(list);
588 cxLinkedListDestroy(expected);
589 CU_ASSERT_TRUE(cxTestingAllocatorVerify())
590 }
592 void test_hl_linked_list_add(void) {
593 cxTestingAllocatorReset();
595 int data;
596 CxList list = cxLinkedListCreate(cxTestingAllocator, cmp_int, sizeof(int));
598 data = 5;
599 CU_ASSERT_EQUAL(cxListAdd(list, &data), 0)
600 data = 47;
601 CU_ASSERT_EQUAL(cxListAdd(list, &data), 0)
602 data = 13;
603 CU_ASSERT_EQUAL(cxListAdd(list, &data), 0)
605 CU_ASSERT_EQUAL(list->size, 3)
606 CU_ASSERT_TRUE(list->capacity >= list->size)
608 int exp[] = {5, 47, 13};
609 CxList expected = cxLinkedListFromArray(cxTestingAllocator, cmp_int, sizeof(int), 3, exp);
610 CU_ASSERT_TRUE(0 == cxListCompare(list, expected))
612 cxLinkedListDestroy(list);
613 cxLinkedListDestroy(expected);
614 CU_ASSERT_TRUE(cxTestingAllocatorVerify())
615 }
617 void test_hl_linked_list_insert(void) {
618 cxTestingAllocatorReset();
620 int data;
621 CxList list = cxLinkedListCreate(cxTestingAllocator, cmp_int, sizeof(int));
623 data = 5;
624 CU_ASSERT_NOT_EQUAL(cxListInsert(list, 1, &data), 0)
625 CU_ASSERT_EQUAL(list->size, 0)
626 CU_ASSERT_EQUAL(cxListInsert(list, 0, &data), 0)
627 CU_ASSERT_EQUAL(list->size, 1)
628 data = 47;
629 CU_ASSERT_EQUAL(cxListInsert(list, 0, &data), 0)
630 CU_ASSERT_EQUAL(list->size, 2)
631 data = 13;
632 CU_ASSERT_EQUAL(cxListInsert(list, 1, &data), 0)
633 CU_ASSERT_EQUAL(list->size, 3)
634 data = 42;
635 CU_ASSERT_EQUAL(cxListInsert(list, 3, &data), 0)
637 CU_ASSERT_EQUAL(list->size, 4)
638 CU_ASSERT_TRUE(list->capacity >= list->size)
640 int exp[] = {47, 13, 5, 42};
641 CxList expected = cxLinkedListFromArray(cxTestingAllocator, cmp_int, sizeof(int), 4, exp);
642 CU_ASSERT_TRUE(0 == cxListCompare(list, expected))
644 cxLinkedListDestroy(list);
645 cxLinkedListDestroy(expected);
646 CU_ASSERT_TRUE(cxTestingAllocatorVerify())
647 }
649 void test_hl_linked_list_remove(void) {
650 cxTestingAllocatorReset();
652 int data[] = {5, 47, 42, 13};
653 CxList list = cxLinkedListFromArray(cxTestingAllocator, cmp_int,
654 sizeof(int), 4, data);
656 CU_ASSERT_EQUAL(list->size, 4)
657 CU_ASSERT_TRUE(list->capacity >= list->size)
659 CU_ASSERT_NOT_EQUAL(cxListRemove(list, 4), 0)
661 CU_ASSERT_EQUAL(cxListRemove(list, 2), 0)
662 CU_ASSERT_EQUAL(list->size, 3)
663 CU_ASSERT_TRUE(list->capacity >= list->size)
664 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 0), 5)
665 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 1), 47)
666 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 2), 13)
668 CU_ASSERT_EQUAL(cxListRemove(list, 0), 0)
669 CU_ASSERT_EQUAL(list->size, 2)
670 CU_ASSERT_TRUE(list->capacity >= list->size)
671 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 0), 47)
672 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 1), 13)
674 CU_ASSERT_EQUAL(cxListRemove(list, 1), 0)
675 CU_ASSERT_EQUAL(list->size, 1)
676 CU_ASSERT_TRUE(list->capacity >= list->size)
677 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 0), 47)
679 CU_ASSERT_EQUAL(cxListRemove(list, 0), 0)
680 CU_ASSERT_EQUAL(list->size, 0)
681 CU_ASSERT_TRUE(list->capacity >= list->size)
683 CU_ASSERT_NOT_EQUAL(cxListRemove(list, 0), 0)
685 cxLinkedListDestroy(list);
686 CU_ASSERT_TRUE(cxTestingAllocatorVerify())
687 }
689 void test_hl_linked_list_at(void) {
690 cxTestingAllocatorReset();
692 int data[] = {5, 47, 13};
693 CxList list = cxLinkedListFromArray(cxTestingAllocator, cmp_int,
694 sizeof(int), 3, data);
696 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 0), 5)
697 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 1), 47)
698 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 2), 13)
699 CU_ASSERT_PTR_NULL(cxListAt(list, 3))
701 cxLinkedListDestroy(list);
702 CU_ASSERT_TRUE(cxTestingAllocatorVerify())
703 }
705 void test_hl_linked_list_find(void) {
706 cxTestingAllocatorReset();
708 int data[] = {5, 47, 13};
709 CxList list = cxLinkedListFromArray(cxTestingAllocator, cmp_int,
710 sizeof(int), 3, data);
711 CU_ASSERT_EQUAL(list->size, 3)
712 CU_ASSERT_TRUE(list->capacity >= list->size)
714 int criteria;
716 criteria = 5;
717 CU_ASSERT_EQUAL(cxListFind(list, &criteria), 0)
718 criteria = 47;
719 CU_ASSERT_EQUAL(cxListFind(list, &criteria), 1)
720 criteria = 13;
721 CU_ASSERT_EQUAL(cxListFind(list, &criteria), 2)
722 criteria = 9000;
723 CU_ASSERT_EQUAL(cxListFind(list, &criteria), 3)
724 criteria = -5;
725 CU_ASSERT_EQUAL(cxListFind(list, &criteria), 3)
727 cxLinkedListDestroy(list);
728 CU_ASSERT_TRUE(cxTestingAllocatorVerify())
729 }
731 void test_hl_linked_list_sort(void) {
732 int expected[] = {
733 14, 30, 151, 163, 227, 300, 315, 317, 363, 398, 417, 424, 438, 446, 508, 555, 605, 713, 716, 759, 761, 880,
734 894, 1034, 1077, 1191, 1231, 1264, 1297, 1409, 1423, 1511, 1544, 1659, 1686, 1707, 1734, 1771, 1874, 1894,
735 1976, 2079, 2124, 2130, 2135, 2266, 2338, 2358, 2430, 2500, 2540, 2542, 2546, 2711, 2733, 2754, 2764, 2797,
736 2888, 2900, 3020, 3053, 3109, 3244, 3275, 3302, 3362, 3363, 3364, 3441, 3515, 3539, 3579, 3655, 3675, 3677,
737 3718, 3724, 3757, 3866, 3896, 3906, 3941, 3984, 3994, 4016, 4085, 4121, 4254, 4319, 4366, 4459, 4514, 4681,
738 4785, 4791, 4801, 4859, 4903, 4973
739 };
740 int scrambled[] = {
741 759, 716, 880, 761, 2358, 2542, 2500, 2540, 2546, 2711, 2430, 1707, 1874, 1771, 1894, 1734, 1976, 2079,
742 2124, 2130, 2135, 2266, 2338, 2733, 2754, 2764, 2797, 3362, 3363, 3364, 3441, 3515, 3539, 3579, 3655, 2888,
743 2900, 3020, 3053, 3109, 3244, 3275, 3302, 438, 446, 508, 555, 605, 713, 14, 30, 151, 163, 227, 300,
744 894, 1034, 1077, 1191, 1231, 1264, 1297, 1409, 1423, 1511, 1544, 1659, 1686, 315, 317, 363, 398, 417, 424,
745 3675, 3677, 3718, 3724, 3757, 3866, 3896, 3906, 3941, 3984, 3994, 4785, 4791, 4801, 4859, 4903, 4973,
746 4016, 4085, 4121, 4254, 4319, 4366, 4459, 4514, 4681
747 };
749 cxTestingAllocatorReset();
751 CxList list = cxLinkedListFromArray(cxTestingAllocator, cmp_int, sizeof(int), 100, scrambled);
752 CxList exp = cxLinkedListFromArray(cxTestingAllocator, cmp_int, sizeof(int), 100, expected);
754 cxListSort(list);
755 CU_ASSERT_TRUE(0 == cxListCompare(list, exp))
757 cxLinkedListDestroy(list);
758 cxLinkedListDestroy(exp);
759 CU_ASSERT_TRUE(cxTestingAllocatorVerify())
760 }
762 void test_hl_ptr_linked_list_create(void) {
763 cxTestingAllocatorReset();
765 CxList list = cxPointerLinkedListCreate(cxTestingAllocator, cmp_int);
767 CU_ASSERT_EQUAL(list->size, 0)
768 CU_ASSERT_EQUAL(list->capacity, (size_t) -1)
769 CU_ASSERT_PTR_EQUAL(list->allocator, cxTestingAllocator)
770 CU_ASSERT_EQUAL(list->itemsize, sizeof(void *))
771 CU_ASSERT_PTR_EQUAL(list->cmpfunc, cmp_int)
773 cxLinkedListDestroy(list);
774 CU_ASSERT_TRUE(cxTestingAllocatorVerify())
775 }
777 void test_hl_ptr_linked_list_add(void) {
778 cxTestingAllocatorReset();
780 CxList list = cxPointerLinkedListCreate(cxTestingAllocator, cmp_int);
782 int a = 5, b = 47, c = 13;
784 CU_ASSERT_EQUAL(cxListAdd(list, &a), 0)
785 CU_ASSERT_EQUAL(cxListAdd(list, &b), 0)
786 CU_ASSERT_EQUAL(cxListAdd(list, &c), 0)
788 CU_ASSERT_EQUAL(list->size, 3)
789 CU_ASSERT_TRUE(list->capacity >= list->size)
791 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 0), 5)
792 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 1), 47)
793 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 2), 13)
795 a = 9;
796 b = 10;
797 c = 11;
799 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 0), 9)
800 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 1), 10)
801 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 2), 11)
803 cxLinkedListDestroy(list);
804 CU_ASSERT_TRUE(cxTestingAllocatorVerify())
805 }
807 void test_hl_ptr_linked_list_insert(void) {
808 cxTestingAllocatorReset();
810 CxList list = cxPointerLinkedListCreate(cxTestingAllocator, cmp_int);
812 int a = 5, b = 47, c = 13, d = 42;
814 CU_ASSERT_NOT_EQUAL(cxListInsert(list, 1, &a), 0)
815 CU_ASSERT_EQUAL(list->size, 0)
816 CU_ASSERT_EQUAL(cxListInsert(list, 0, &a), 0)
817 CU_ASSERT_EQUAL(list->size, 1)
818 CU_ASSERT_EQUAL(cxListInsert(list, 0, &b), 0)
819 CU_ASSERT_EQUAL(list->size, 2)
820 CU_ASSERT_EQUAL(cxListInsert(list, 1, &c), 0)
821 CU_ASSERT_EQUAL(list->size, 3)
822 CU_ASSERT_EQUAL(cxListInsert(list, 3, &d), 0)
824 CU_ASSERT_EQUAL(list->size, 4)
825 CU_ASSERT_TRUE(list->capacity >= list->size)
827 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 0), 47)
828 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 1), 13)
829 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 2), 5)
830 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 3), 42)
832 cxLinkedListDestroy(list);
833 CU_ASSERT_TRUE(cxTestingAllocatorVerify())
834 }
836 void test_hl_ptr_linked_list_remove(void) {
837 cxTestingAllocatorReset();
839 int a = 5, b = 47, c = 42, d = 13;
840 CxList list = cxPointerLinkedListCreate(cxTestingAllocator, cmp_int);
842 cxListAdd(list, &a);
843 cxListAdd(list, &b);
844 cxListAdd(list, &c);
845 cxListAdd(list, &d);
847 CU_ASSERT_EQUAL(list->size, 4)
848 CU_ASSERT_TRUE(list->capacity >= list->size)
850 CU_ASSERT_NOT_EQUAL(cxListRemove(list, 4), 0)
852 CU_ASSERT_EQUAL(cxListRemove(list, 2), 0)
853 CU_ASSERT_EQUAL(list->size, 3)
854 CU_ASSERT_TRUE(list->capacity >= list->size)
855 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 0), 5)
856 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 1), 47)
857 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 2), 13)
859 CU_ASSERT_EQUAL(cxListRemove(list, 0), 0)
860 CU_ASSERT_EQUAL(list->size, 2)
861 CU_ASSERT_TRUE(list->capacity >= list->size)
862 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 0), 47)
863 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 1), 13)
865 CU_ASSERT_EQUAL(cxListRemove(list, 1), 0)
866 CU_ASSERT_EQUAL(list->size, 1)
867 CU_ASSERT_TRUE(list->capacity >= list->size)
868 CU_ASSERT_EQUAL(*(int *) cxListAt(list, 0), 47)
870 CU_ASSERT_EQUAL(cxListRemove(list, 0), 0)
871 CU_ASSERT_EQUAL(list->size, 0)
872 CU_ASSERT_TRUE(list->capacity >= list->size)
874 CU_ASSERT_NOT_EQUAL(cxListRemove(list, 0), 0)
876 cxLinkedListDestroy(list);
877 CU_ASSERT_TRUE(cxTestingAllocatorVerify())
878 }
880 void test_hl_ptr_linked_list_at(void) {
881 cxTestingAllocatorReset();
883 CxList list = cxPointerLinkedListCreate(cxTestingAllocator, cmp_int);
885 int a = 5, b = 47, c = 13;
886 cxListAdd(list, &a);
887 cxListAdd(list, &b);
888 cxListAdd(list, &c);
890 CU_ASSERT_EQUAL(*(int*)cxListAt(list, 0), 5)
891 CU_ASSERT_EQUAL(*(int*)cxListAt(list, 1), 47)
892 CU_ASSERT_EQUAL(*(int*)cxListAt(list, 2), 13)
893 CU_ASSERT_PTR_NULL(cxListAt(list, 3))
895 cxLinkedListDestroy(list);
896 CU_ASSERT_TRUE(cxTestingAllocatorVerify())
897 }
899 void test_hl_ptr_linked_list_find(void) {
900 cxTestingAllocatorReset();
902 int a = 5, b = 47, c = 13, criteria;
903 CxList list = cxPointerLinkedListCreate(cxTestingAllocator, cmp_int);
905 cxListAdd(list, &a);
906 cxListAdd(list, &b);
907 cxListAdd(list, &c);
909 CU_ASSERT_EQUAL(list->size, 3)
910 CU_ASSERT_TRUE(list->capacity >= list->size)
912 criteria = 5;
913 CU_ASSERT_EQUAL(cxListFind(list, &criteria), 0)
914 criteria = 47;
915 CU_ASSERT_EQUAL(cxListFind(list, &criteria), 1)
916 criteria = 13;
917 CU_ASSERT_EQUAL(cxListFind(list, &criteria), 2)
918 criteria = 9000;
919 CU_ASSERT_EQUAL(cxListFind(list, &criteria), 3)
920 criteria = -5;
921 CU_ASSERT_EQUAL(cxListFind(list, &criteria), 3)
922 b = -5;
923 CU_ASSERT_EQUAL(cxListFind(list, &criteria), 1)
925 cxLinkedListDestroy(list);
926 CU_ASSERT_TRUE(cxTestingAllocatorVerify())
927 }
929 void test_hl_ptr_linked_list_sort(void) {
930 int expected[] = {
931 14, 30, 151, 163, 227, 300, 315, 317, 363, 398, 417, 424, 438, 446, 508, 555, 605, 713, 716, 759, 761, 880,
932 894, 1034, 1077, 1191, 1231, 1264, 1297, 1409, 1423, 1511, 1544, 1659, 1686, 1707, 1734, 1771, 1874, 1894,
933 1976, 2079, 2124, 2130, 2135, 2266, 2338, 2358, 2430, 2500, 2540, 2542, 2546, 2711, 2733, 2754, 2764, 2797,
934 2888, 2900, 3020, 3053, 3109, 3244, 3275, 3302, 3362, 3363, 3364, 3441, 3515, 3539, 3579, 3655, 3675, 3677,
935 3718, 3724, 3757, 3866, 3896, 3906, 3941, 3984, 3994, 4016, 4085, 4121, 4254, 4319, 4366, 4459, 4514, 4681,
936 4785, 4791, 4801, 4859, 4903, 4973
937 };
938 int scrambled[] = {
939 759, 716, 880, 761, 2358, 2542, 2500, 2540, 2546, 2711, 2430, 1707, 1874, 1771, 1894, 1734, 1976, 2079,
940 2124, 2130, 2135, 2266, 2338, 2733, 2754, 2764, 2797, 3362, 3363, 3364, 3441, 3515, 3539, 3579, 3655, 2888,
941 2900, 3020, 3053, 3109, 3244, 3275, 3302, 438, 446, 508, 555, 605, 713, 14, 30, 151, 163, 227, 300,
942 894, 1034, 1077, 1191, 1231, 1264, 1297, 1409, 1423, 1511, 1544, 1659, 1686, 315, 317, 363, 398, 417, 424,
943 3675, 3677, 3718, 3724, 3757, 3866, 3896, 3906, 3941, 3984, 3994, 4785, 4791, 4801, 4859, 4903, 4973,
944 4016, 4085, 4121, 4254, 4319, 4366, 4459, 4514, 4681
945 };
947 cxTestingAllocatorReset();
949 CxList list = cxPointerLinkedListCreate(cxTestingAllocator, cmp_int);
951 for (int i = 0; i < 100; i++) {
952 cxListAdd(list, &scrambled[i]);
953 }
955 cxListSort(list);
957 for (int i = 0; i < 100; i++) {
958 CU_ASSERT_EQUAL(*(int *) cxListAt(list, i), expected[i])
959 }
961 cxLinkedListDestroy(list);
962 CU_ASSERT_TRUE(cxTestingAllocatorVerify())
963 }
965 int main() {
966 CU_pSuite suite = NULL;
968 if (CUE_SUCCESS != CU_initialize_registry()) {
969 return CU_get_error();
970 }
972 suite = CU_add_suite("low level linked list", NULL, NULL);
974 cu_add_test(suite, test_linked_list_link_unlink);
975 cu_add_test(suite, test_linked_list_at);
976 cu_add_test(suite, test_linked_list_find);
977 cu_add_test(suite, test_linked_list_compare);
978 cu_add_test(suite, test_linked_list_prepend);
979 cu_add_test(suite, test_linked_list_add);
980 cu_add_test(suite, test_linked_list_insert);
981 cu_add_test(suite, test_linked_list_insert_chain);
982 cu_add_test(suite, test_linked_list_first);
983 cu_add_test(suite, test_linked_list_last);
984 cu_add_test(suite, test_linked_list_prev);
985 cu_add_test(suite, test_linked_list_remove);
986 cu_add_test(suite, test_linked_list_size);
987 cu_add_test(suite, test_linked_list_sort);
988 cu_add_test(suite, test_linked_list_reverse);
990 suite = CU_add_suite("high level linked list", NULL, NULL);
992 cu_add_test(suite, test_hl_linked_list_create);
993 cu_add_test(suite, test_hl_linked_list_from_array);
994 cu_add_test(suite, test_hl_linked_list_add);
995 cu_add_test(suite, test_hl_linked_list_insert);
996 cu_add_test(suite, test_hl_linked_list_remove);
997 cu_add_test(suite, test_hl_linked_list_at);
998 cu_add_test(suite, test_hl_linked_list_find);
999 cu_add_test(suite, test_hl_linked_list_sort);
1001 suite = CU_add_suite("high level pointer linked list", NULL, NULL);
1003 cu_add_test(suite, test_hl_ptr_linked_list_create);
1004 cu_add_test(suite, test_hl_ptr_linked_list_add);
1005 cu_add_test(suite, test_hl_ptr_linked_list_insert);
1006 cu_add_test(suite, test_hl_ptr_linked_list_remove);
1007 cu_add_test(suite, test_hl_ptr_linked_list_at);
1008 cu_add_test(suite, test_hl_ptr_linked_list_find);
1009 cu_add_test(suite, test_hl_ptr_linked_list_sort);
1011 CU_basic_set_mode(UCX_CU_BRM);
1013 int exitcode;
1014 if (CU_basic_run_tests()) {
1015 exitcode = CU_get_error();
1016 } else {
1017 exitcode = CU_get_number_of_failures() == 0 ? 0 : 1;
1018 }
1019 CU_cleanup_registry();
1020 return exitcode;
1021 }
