tests/test_list.cpp@42877968260c
tests/test_list.cpp
Mon, 01 Jan 2024 16:43:18 +0100
- author
- Mike Becker <universe@uap-core.de>
- date
- Mon, 01 Jan 2024 16:43:18 +0100
- changeset 790
- 42877968260c
- parent 764
- ccbdbd088455
- child 798
- 7644da6e2d35
- permissions
- -rw-r--r--
some text replacements to prepare migration of 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 "cx/array_list.h"
31 #include "cx/utils.h"
32 #include "cx/compare.h"
33 #include "util_allocator.h"
35 #include <gtest/gtest.h>
36 #include <array>
37 #include <vector>
38 #include <unordered_set>
39 #include <algorithm>
41 struct node {
42 node *next = NULL;
43 node *prev = NULL;
44 int data = 0;
45 };
47 const ptrdiff_t loc_prev = offsetof(struct node, prev);
48 const ptrdiff_t loc_next = offsetof(struct node, next);
49 const ptrdiff_t loc_data = offsetof(struct node, data);
51 struct node_test_data {
52 node *begin = NULL;
54 explicit node_test_data(node *begin) : begin(begin) {
55 auto n = begin;
56 while (n != NULL) {
57 nodes.push_back(n);
58 n = n->next;
59 }
60 }
62 node_test_data(node_test_data &) = delete;
64 node_test_data(node_test_data &&) = default;
66 ~node_test_data() {
67 for (auto &&n: nodes) delete n;
68 }
70 private:
71 std::vector<node *> nodes;
72 };
74 static node_test_data create_nodes_test_data(size_t len) {
75 if (len == 0) return node_test_data{NULL};
76 auto begin = new node;
77 auto prev = begin;
78 for (size_t i = 1; i < len; i++) {
79 auto n = new node;
80 cx_linked_list_link(prev, n, loc_prev, loc_next);
81 prev = n;
82 }
83 return node_test_data{begin};
84 }
86 template<typename InputIter>
87 static node_test_data create_nodes_test_data(
88 InputIter begin,
89 InputIter end
90 ) {
91 if (begin == end) return node_test_data{NULL};
92 node *first = new node;
93 first->data = *begin;
94 node *prev = first;
95 begin++;
96 for (; begin != end; begin++) {
97 auto n = new node;
98 n->data = *begin;
99 cx_linked_list_link(prev, n, loc_prev, loc_next);
100 prev = n;
101 }
102 return node_test_data{first};
103 }
105 static node_test_data create_nodes_test_data(std::initializer_list<int> data) {
106 return create_nodes_test_data(data.begin(), data.end());
107 }
109 template<size_t N>
110 struct int_test_data {
111 std::array<int, N> data;
113 int_test_data() {
114 cx_for_n (i, N) data[i] = ::rand(); // NOLINT(cert-msc50-cpp)
115 }
116 };
118 TEST(LinkedList_LowLevel, link_unlink) {
119 node a, b, c;
121 cx_linked_list_link(&a, &b, loc_prev, loc_next);
122 CX_TEST_ASSERT(a.prev == NULL);
123 CX_TEST_ASSERT(a.next == &b);
124 CX_TEST_ASSERT(b.prev == &a);
125 CX_TEST_ASSERT(b.next == NULL);
127 cx_linked_list_unlink(&a, &b, loc_prev, loc_next);
128 CX_TEST_ASSERT(a.prev == NULL);
129 CX_TEST_ASSERT(a.next == NULL);
130 CX_TEST_ASSERT(b.prev == NULL);
131 CX_TEST_ASSERT(b.next == NULL);
133 cx_linked_list_link(&b, &c, loc_prev, loc_next);
134 cx_linked_list_link(&a, &b, loc_prev, loc_next);
135 cx_linked_list_unlink(&b, &c, loc_prev, loc_next);
136 CX_TEST_ASSERT(a.prev == NULL);
137 CX_TEST_ASSERT(a.next == &b);
138 CX_TEST_ASSERT(b.prev == &a);
139 CX_TEST_ASSERT(b.next == NULL);
140 CX_TEST_ASSERT(c.prev == NULL);
141 CX_TEST_ASSERT(c.next == NULL);
142 }
144 TEST(LinkedList_LowLevel, cx_linked_list_at) {
145 node a, b, c, d;
146 cx_linked_list_link(&a, &b, loc_prev, loc_next);
147 cx_linked_list_link(&b, &c, loc_prev, loc_next);
148 cx_linked_list_link(&c, &d, loc_prev, loc_next);
150 EXPECT_EQ(cx_linked_list_at(&a, 0, loc_next, 0), &a);
151 EXPECT_EQ(cx_linked_list_at(&a, 0, loc_next, 1), &b);
152 EXPECT_EQ(cx_linked_list_at(&a, 0, loc_next, 2), &c);
153 EXPECT_EQ(cx_linked_list_at(&a, 0, loc_next, 3), &d);
154 EXPECT_EQ(cx_linked_list_at(&a, 0, loc_next, 4), NULL);
156 EXPECT_EQ(cx_linked_list_at(&b, 1, loc_prev, 0), &a);
157 EXPECT_EQ(cx_linked_list_at(&b, 1, loc_next, 1), &b);
158 EXPECT_EQ(cx_linked_list_at(&b, 1, loc_next, 2), &c);
159 EXPECT_EQ(cx_linked_list_at(&b, 1, loc_next, 3), &d);
160 EXPECT_EQ(cx_linked_list_at(&b, 1, loc_next, 4), NULL);
162 EXPECT_EQ(cx_linked_list_at(&d, 3, loc_prev, 0), &a);
163 EXPECT_EQ(cx_linked_list_at(&d, 3, loc_prev, 1), &b);
164 }
166 TEST(LinkedList_LowLevel, cx_linked_list_find) {
167 auto testdata = create_nodes_test_data({2, 4, 6, 8});
168 auto list = testdata.begin;
169 int s;
171 s = 2;
172 EXPECT_EQ(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s), 0);
173 s = 4;
174 EXPECT_EQ(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s), 1);
175 s = 6;
176 EXPECT_EQ(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s), 2);
177 s = 8;
178 EXPECT_EQ(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s), 3);
179 s = 10;
180 EXPECT_LT(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s), 0);
181 s = -2;
182 EXPECT_LT(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s), 0);
183 }
185 TEST(LinkedList_LowLevel, cx_linked_list_compare) {
186 auto ta = create_nodes_test_data({2, 4, 6, 8});
187 auto tb = create_nodes_test_data({2, 4, 6});
188 auto tc = create_nodes_test_data({2, 4, 6, 9});
189 auto la = ta.begin, lb = tb.begin, lc = tc.begin;
191 EXPECT_GT(cx_linked_list_compare(la, lb, loc_next, loc_data, cx_cmp_int), 0);
192 EXPECT_LT(cx_linked_list_compare(lb, la, loc_next, loc_data, cx_cmp_int), 0);
193 EXPECT_GT(cx_linked_list_compare(lc, la, loc_next, loc_data, cx_cmp_int), 0);
194 EXPECT_LT(cx_linked_list_compare(la, lc, loc_next, loc_data, cx_cmp_int), 0);
195 EXPECT_EQ(cx_linked_list_compare(la, la, loc_next, loc_data, cx_cmp_int), 0);
196 }
198 TEST(LinkedList_LowLevel, cx_linked_list_add) {
199 // test with begin, end / prev, next
200 {
201 node nodes[4];
202 void *begin = NULL, *end = NULL;
204 cx_linked_list_add(&begin, &end, loc_prev, loc_next, &nodes[0]);
205 CX_TEST_ASSERT(begin == &nodes[0]);
206 CX_TEST_ASSERT(end == &nodes[0]);
207 CX_TEST_ASSERT(nodes[0].prev == NULL);
208 CX_TEST_ASSERT(nodes[0].next == NULL);
210 cx_linked_list_add(&begin, &end, loc_prev, loc_next, &nodes[1]);
211 CX_TEST_ASSERT(begin == &nodes[0]);
212 CX_TEST_ASSERT(end == &nodes[1]);
213 CX_TEST_ASSERT(nodes[0].next == &nodes[1]);
214 CX_TEST_ASSERT(nodes[1].prev == &nodes[0]);
215 }
217 // test with begin only / prev, next
218 {
219 node nodes[4];
220 void *begin = NULL;
222 cx_linked_list_add(&begin, NULL, loc_prev, loc_next, &nodes[0]);
223 CX_TEST_ASSERT(begin == &nodes[0]);
224 cx_linked_list_add(&begin, NULL, loc_prev, loc_next, &nodes[1]);
225 CX_TEST_ASSERT(begin == &nodes[0]);
226 CX_TEST_ASSERT(nodes[0].next == &nodes[1]);
227 CX_TEST_ASSERT(nodes[1].prev == &nodes[0]);
229 cx_linked_list_add(&begin, NULL, loc_prev, loc_next, &nodes[2]);
230 CX_TEST_ASSERT(nodes[1].next == &nodes[2]);
231 CX_TEST_ASSERT(nodes[2].prev == &nodes[1]);
232 }
234 // test with end only / prev, next
235 {
236 node nodes[4];
237 void *end = NULL;
239 cx_linked_list_add(NULL, &end, loc_prev, loc_next, &nodes[0]);
240 CX_TEST_ASSERT(end == &nodes[0]);
241 cx_linked_list_add(NULL, &end, loc_prev, loc_next, &nodes[1]);
242 CX_TEST_ASSERT(end == &nodes[1]);
243 CX_TEST_ASSERT(nodes[0].next == &nodes[1]);
244 CX_TEST_ASSERT(nodes[1].prev == &nodes[0]);
246 cx_linked_list_add(NULL, &end, loc_prev, loc_next, &nodes[2]);
247 CX_TEST_ASSERT(end == &nodes[2]);
248 CX_TEST_ASSERT(nodes[1].next == &nodes[2]);
249 CX_TEST_ASSERT(nodes[2].prev == &nodes[1]);
250 }
252 // test with begin, end / next
253 {
254 node nodes[4];
255 void *begin = NULL, *end = NULL;
257 cx_linked_list_add(&begin, &end, -1, loc_next, &nodes[0]);
258 CX_TEST_ASSERT(begin == &nodes[0]);
259 CX_TEST_ASSERT(end == &nodes[0]);
260 cx_linked_list_add(&begin, &end, -1, loc_next, &nodes[1]);
261 CX_TEST_ASSERT(end == &nodes[1]);
262 CX_TEST_ASSERT(nodes[0].next == &nodes[1]);
263 CX_TEST_ASSERT(nodes[1].prev == NULL);
264 }
265 }
267 TEST(LinkedList_LowLevel, cx_linked_list_prepend) {
268 // test with begin, end / prev, next
269 {
270 node nodes[4];
271 void *begin = NULL, *end = NULL;
273 cx_linked_list_prepend(&begin, &end, loc_prev, loc_next, &nodes[0]);
274 CX_TEST_ASSERT(begin == &nodes[0]);
275 CX_TEST_ASSERT(end == &nodes[0]);
276 CX_TEST_ASSERT(nodes[0].prev == NULL);
277 CX_TEST_ASSERT(nodes[0].next == NULL);
279 cx_linked_list_prepend(&begin, &end, loc_prev, loc_next, &nodes[1]);
280 CX_TEST_ASSERT(begin == &nodes[1]);
281 CX_TEST_ASSERT(end == &nodes[0]);
282 CX_TEST_ASSERT(nodes[1].next == &nodes[0]);
283 CX_TEST_ASSERT(nodes[0].prev == &nodes[1]);
284 }
286 // test with begin only / prev, next
287 {
288 node nodes[4];
289 void *begin = NULL;
291 cx_linked_list_prepend(&begin, NULL, loc_prev, loc_next, &nodes[0]);
292 CX_TEST_ASSERT(begin == &nodes[0]);
293 cx_linked_list_prepend(&begin, NULL, loc_prev, loc_next, &nodes[1]);
294 CX_TEST_ASSERT(begin == &nodes[1]);
295 CX_TEST_ASSERT(nodes[1].next == &nodes[0]);
296 CX_TEST_ASSERT(nodes[0].prev == &nodes[1]);
298 cx_linked_list_prepend(&begin, NULL, loc_prev, loc_next, &nodes[2]);
299 CX_TEST_ASSERT(begin == &nodes[2]);
300 CX_TEST_ASSERT(nodes[2].next == &nodes[1]);
301 CX_TEST_ASSERT(nodes[1].prev == &nodes[2]);
302 }
304 // test with end only / prev, next
305 {
306 node nodes[4];
307 void *end = NULL;
309 cx_linked_list_prepend(NULL, &end, loc_prev, loc_next, &nodes[0]);
310 CX_TEST_ASSERT(end == &nodes[0]);
311 cx_linked_list_prepend(NULL, &end, loc_prev, loc_next, &nodes[1]);
312 CX_TEST_ASSERT(end == &nodes[0]);
313 CX_TEST_ASSERT(nodes[1].next == &nodes[0]);
314 CX_TEST_ASSERT(nodes[0].prev == &nodes[1]);
316 cx_linked_list_prepend(NULL, &end, loc_prev, loc_next, &nodes[2]);
317 CX_TEST_ASSERT(end == &nodes[0]);
318 CX_TEST_ASSERT(nodes[2].next == &nodes[1]);
319 CX_TEST_ASSERT(nodes[1].prev == &nodes[2]);
320 }
322 // test with begin, end / next
323 {
324 node nodes[4];
325 void *begin = NULL, *end = NULL;
327 cx_linked_list_prepend(&begin, &end, -1, loc_next, &nodes[0]);
328 CX_TEST_ASSERT(begin == &nodes[0]);
329 CX_TEST_ASSERT(end == &nodes[0]);
330 cx_linked_list_prepend(&begin, &end, -1, loc_next, &nodes[1]);
331 cx_linked_list_prepend(&begin, &end, -1, loc_next, &nodes[2]);
332 CX_TEST_ASSERT(begin == &nodes[2]);
333 CX_TEST_ASSERT(end == &nodes[0]);
334 CX_TEST_ASSERT(nodes[1].next == &nodes[0]);
335 CX_TEST_ASSERT(nodes[2].next == &nodes[1]);
336 CX_TEST_ASSERT(nodes[1].prev == NULL);
337 CX_TEST_ASSERT(nodes[0].prev == NULL);
338 }
339 }
341 TEST(LinkedList_LowLevel, cx_linked_list_insert) {
342 // insert mid list
343 {
344 node nodes[4];
345 void *begin = &nodes[0], *end = &nodes[2];
347 cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
348 cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
350 cx_linked_list_insert(&begin, &end, loc_prev, loc_next, &nodes[1], &nodes[3]);
351 CX_TEST_ASSERT(begin == &nodes[0]);
352 CX_TEST_ASSERT(end == &nodes[2]);
353 CX_TEST_ASSERT(nodes[1].next == &nodes[3]);
354 CX_TEST_ASSERT(nodes[2].prev == &nodes[3]);
355 CX_TEST_ASSERT(nodes[3].prev == &nodes[1]);
356 CX_TEST_ASSERT(nodes[3].next == &nodes[2]);
357 }
359 // insert end
360 {
361 node nodes[4];
362 void *begin = &nodes[0], *end = &nodes[2];
364 cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
365 cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
367 cx_linked_list_insert(&begin, &end, loc_prev, loc_next, &nodes[2], &nodes[3]);
368 CX_TEST_ASSERT(begin == &nodes[0]);
369 CX_TEST_ASSERT(end == &nodes[3]);
370 CX_TEST_ASSERT(nodes[2].next == &nodes[3]);
371 CX_TEST_ASSERT(nodes[3].prev == &nodes[2]);
372 CX_TEST_ASSERT(nodes[3].next == NULL);
373 }
375 // insert begin
376 {
377 node nodes[4];
378 void *begin = &nodes[0], *end = &nodes[2];
380 cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
381 cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
383 cx_linked_list_insert(&begin, &end, loc_prev, loc_next, NULL, &nodes[3]);
384 CX_TEST_ASSERT(begin == &nodes[3]);
385 CX_TEST_ASSERT(end == &nodes[2]);
386 CX_TEST_ASSERT(nodes[0].prev == &nodes[3]);
387 CX_TEST_ASSERT(nodes[3].prev == NULL);
388 CX_TEST_ASSERT(nodes[3].next == &nodes[0]);
389 }
390 }
392 TEST(LinkedList_LowLevel, cx_linked_list_insert_chain) {
393 // insert mid list
394 {
395 node nodes[5];
396 void *begin = &nodes[0], *end = &nodes[2];
398 cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
399 cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
400 cx_linked_list_link(&nodes[3], &nodes[4], loc_prev, loc_next);
402 cx_linked_list_insert_chain(&begin, &end, loc_prev, loc_next, &nodes[1], &nodes[3], NULL);
403 CX_TEST_ASSERT(begin == &nodes[0]);
404 CX_TEST_ASSERT(end == &nodes[2]);
405 CX_TEST_ASSERT(nodes[1].next == &nodes[3]);
406 CX_TEST_ASSERT(nodes[2].prev == &nodes[4]);
407 CX_TEST_ASSERT(nodes[3].prev == &nodes[1]);
408 CX_TEST_ASSERT(nodes[4].next == &nodes[2]);
409 }
411 // insert end
412 {
413 node nodes[5];
414 void *begin = &nodes[0], *end = &nodes[2];
416 cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
417 cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
418 cx_linked_list_link(&nodes[3], &nodes[4], loc_prev, loc_next);
420 cx_linked_list_insert_chain(&begin, &end, loc_prev, loc_next, &nodes[2], &nodes[3], NULL);
421 CX_TEST_ASSERT(begin == &nodes[0]);
422 CX_TEST_ASSERT(end == &nodes[4]);
423 CX_TEST_ASSERT(nodes[2].next == &nodes[3]);
424 CX_TEST_ASSERT(nodes[3].prev == &nodes[2]);
425 CX_TEST_ASSERT(nodes[4].next == NULL);
426 }
428 // insert begin
429 {
430 node nodes[5];
431 void *begin = &nodes[0], *end = &nodes[2];
433 cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
434 cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
435 cx_linked_list_link(&nodes[3], &nodes[4], loc_prev, loc_next);
437 cx_linked_list_insert_chain(&begin, &end, loc_prev, loc_next, NULL, &nodes[3], NULL);
438 CX_TEST_ASSERT(begin == &nodes[3]);
439 CX_TEST_ASSERT(end == &nodes[2]);
440 CX_TEST_ASSERT(nodes[0].prev == &nodes[4]);
441 CX_TEST_ASSERT(nodes[3].prev == NULL);
442 CX_TEST_ASSERT(nodes[4].next == &nodes[0]);
443 }
444 }
446 TEST(LinkedList_LowLevel, cx_linked_list_first) {
447 auto testdata = create_nodes_test_data(3);
448 auto begin = testdata.begin;
449 EXPECT_EQ(cx_linked_list_first(begin, loc_prev), begin);
450 EXPECT_EQ(cx_linked_list_first(begin->next, loc_prev), begin);
451 EXPECT_EQ(cx_linked_list_first(begin->next->next, loc_prev), begin);
452 }
454 TEST(LinkedList_LowLevel, cx_linked_list_last) {
455 auto testdata = create_nodes_test_data(3);
456 auto begin = testdata.begin;
457 auto end = begin->next->next;
458 EXPECT_EQ(cx_linked_list_last(begin, loc_next), end);
459 EXPECT_EQ(cx_linked_list_last(begin->next, loc_next), end);
460 EXPECT_EQ(cx_linked_list_last(begin->next->next, loc_next), end);
461 }
463 TEST(LinkedList_LowLevel, cx_linked_list_prev) {
464 auto testdata = create_nodes_test_data(3);
465 auto begin = testdata.begin;
466 EXPECT_EQ(cx_linked_list_prev(begin, loc_next, begin), NULL);
467 EXPECT_EQ(cx_linked_list_prev(begin, loc_next, begin->next), begin);
468 EXPECT_EQ(cx_linked_list_prev(begin, loc_next, begin->next->next), begin->next);
469 }
471 TEST(LinkedList_LowLevel, cx_linked_list_remove) {
472 auto testdata = create_nodes_test_data({2, 4, 6});
473 auto begin = reinterpret_cast<void *>(testdata.begin);
474 auto first = testdata.begin;
475 auto second = first->next;
476 auto third = second->next;
477 auto end = reinterpret_cast<void *>(third);
479 cx_linked_list_remove(&begin, &end, loc_prev, loc_next, second);
480 CX_TEST_ASSERT(begin == first);
481 CX_TEST_ASSERT(end == third);
482 CX_TEST_ASSERT(first->prev == NULL);
483 CX_TEST_ASSERT(first->next == third);
484 CX_TEST_ASSERT(third->prev == first);
485 CX_TEST_ASSERT(third->next == NULL);
487 cx_linked_list_remove(&begin, &end, loc_prev, loc_next, third);
488 CX_TEST_ASSERT(begin == first);
489 CX_TEST_ASSERT(end == first);
490 CX_TEST_ASSERT(first->prev == NULL);
491 CX_TEST_ASSERT(first->next == NULL);
493 cx_linked_list_remove(&begin, &end, loc_prev, loc_next, first);
494 CX_TEST_ASSERT(begin == NULL);
495 CX_TEST_ASSERT(end == NULL);
496 }
498 TEST(LinkedList_LowLevel, cx_linked_list_size) {
499 EXPECT_EQ(cx_linked_list_size(NULL, loc_next), 0);
501 {
502 auto testdata = create_nodes_test_data(5);
503 EXPECT_EQ(cx_linked_list_size(testdata.begin, loc_next), 5);
504 }
506 {
507 auto testdata = create_nodes_test_data(13);
508 EXPECT_EQ(cx_linked_list_size(testdata.begin, loc_next), 13);
509 }
510 }
512 TEST(LinkedList_LowLevel, cx_linked_list_sort_empty) {
513 void *begin = NULL;
514 EXPECT_NO_FATAL_FAILURE(
515 cx_linked_list_sort(&begin, NULL, loc_prev, loc_next, loc_data, cx_cmp_int);
516 );
517 }
519 TEST(LinkedList_LowLevel, cx_linked_list_sort) {
520 int_test_data<1500> testdata;
521 std::array<int, 1500> sorted{};
522 std::partial_sort_copy(testdata.data.begin(), testdata.data.end(), sorted.begin(), sorted.end());
524 auto scrambled = create_nodes_test_data(testdata.data.begin(), testdata.data.end());
525 void *begin = scrambled.begin;
526 void *end = cx_linked_list_last(begin, loc_next);
528 cx_linked_list_sort(&begin, &end, loc_prev, loc_next, loc_data, cx_cmp_int);
530 node *check = reinterpret_cast<node *>(begin);
531 node *check_last = NULL;
532 cx_for_n (i, sorted.size()) {
533 CX_TEST_ASSERT(check->data == sorted[i]);
534 CX_TEST_ASSERT(check->prev == check_last);
535 if (i < sorted.size() - 1) {
536 ASSERT_NE(check->next, NULL);
537 }
538 check_last = check;
539 check = check->next;
540 }
541 CX_TEST_ASSERT(check == NULL);
542 CX_TEST_ASSERT(end == check_last);
543 }
545 TEST(LinkedList_LowLevel, cx_linked_list_reverse) {
546 auto testdata = create_nodes_test_data({2, 4, 6, 8});
547 auto expected = create_nodes_test_data({8, 6, 4, 2});
549 auto begin = reinterpret_cast<void *>(testdata.begin);
550 auto end = cx_linked_list_last(begin, loc_next);
551 auto orig_begin = begin, orig_end = end;
553 cx_linked_list_reverse(&begin, &end, loc_prev, loc_next);
554 CX_TEST_ASSERT(end == orig_begin);
555 CX_TEST_ASSERT(begin == orig_end);
556 EXPECT_EQ(cx_linked_list_compare(begin, expected.begin, loc_next, loc_data, cx_cmp_int), 0);
557 }
559 class HighLevelTest : public ::testing::Test {
560 mutable std::unordered_set<CxList *> lists;
561 protected:
562 CxTestingAllocator testingAllocator;
564 void TearDown() override {
565 for (auto &&l: lists) cxListDestroy(l);
566 CX_TEST_ASSERT(testingAllocator.verify());
567 }
569 static constexpr size_t testdata_len = 250;
570 int_test_data<testdata_len> testdata;
572 auto autofree(CxList *list) const -> CxList * {
573 if (list != NULL) lists.insert(list);
574 return list;
575 }
577 auto linkedListFromTestData() const -> CxList * {
578 auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int)));
579 cxListAddArray(list, testdata.data.data(), testdata_len);
580 return list;
581 }
583 auto pointerLinkedListFromTestData() const -> CxList * {
584 auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS));
585 // note: cannot use cxListAddArray() because we don't have a list of pointers
586 cx_for_n(i, testdata_len) cxListAdd(list, &testdata.data[i]);
587 return list;
588 }
590 auto arrayListFromTestData() const -> CxList * {
591 auto list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), testdata_len));
592 cxListAddArray(list, testdata.data.data(), testdata_len);
593 return list;
594 }
596 auto pointerArrayListFromTestData() const -> CxList * {
597 auto list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS, 256));
598 // note: cannot use cxListAddArray() because we don't have a list of pointers
599 cx_for_n(i, testdata_len) cxListAdd(list, &testdata.data[i]);
600 return list;
601 }
603 void verifyAdd(
604 CxList *list,
605 bool as_pointer
606 ) {
607 auto len = testdata_len;
608 cx_for_n (i, len) EXPECT_EQ(cxListAdd(list, &testdata.data[i]), 0);
609 CX_TEST_ASSERT(cxListSize(list) == len);
610 cx_for_n (i, len) EXPECT_EQ(*(int *) cxListAt(list, i), testdata.data[i]);
611 cx_for_n (i, len) ++testdata.data[i];
612 if (as_pointer) {
613 cx_for_n (i, len) EXPECT_EQ(*(int *) cxListAt(list, i), testdata.data[i]);
614 } else {
615 cx_for_n (i, len) EXPECT_EQ(*(int *) cxListAt(list, i), testdata.data[i] - 1);
616 }
617 }
619 static void verifyInsert(CxList *list) {
620 int a = 5, b = 47, c = 13, d = 42;
622 EXPECT_NE(cxListInsert(list, 1, &a), 0);
623 EXPECT_EQ(cxListSize(list), 0);
624 EXPECT_EQ(cxListInsert(list, 0, &a), 0);
625 EXPECT_EQ(cxListSize(list), 1);
626 EXPECT_EQ(cxListInsert(list, 0, &b), 0);
627 EXPECT_EQ(cxListSize(list), 2);
628 EXPECT_EQ(cxListInsert(list, 1, &c), 0);
629 EXPECT_EQ(cxListSize(list), 3);
630 EXPECT_EQ(cxListInsert(list, 3, &d), 0);
632 CX_TEST_ASSERT(cxListSize(list) == 4);
634 EXPECT_EQ(*(int *) cxListAt(list, 0), 47);
635 EXPECT_EQ(*(int *) cxListAt(list, 1), 13);
636 EXPECT_EQ(*(int *) cxListAt(list, 2), 5);
637 EXPECT_EQ(*(int *) cxListAt(list, 3), 42);
638 }
640 static void verifyInsertArray(
641 CxList *list,
642 bool pointers = false
643 ) {
644 int a[5] = {5, 47, 11, 13, 42};
645 int b[5] = {9, 18, 72, 50, 7};
646 int *aptr[5];
647 int *bptr[5];
648 cx_for_n(i, 5) {
649 aptr[i] = &a[i];
650 bptr[i] = &b[i];
651 }
653 size_t inserted;
655 if (pointers) {
656 inserted = cxListInsertArray(list, 0, aptr, 5);
657 } else {
658 inserted = cxListInsertArray(list, 0, a, 5);
659 }
660 CX_TEST_ASSERT(inserted == 5);
661 EXPECT_EQ(*(int *) cxListAt(list, 0), 5);
662 EXPECT_EQ(*(int *) cxListAt(list, 1), 47);
663 EXPECT_EQ(*(int *) cxListAt(list, 2), 11);
664 EXPECT_EQ(*(int *) cxListAt(list, 3), 13);
665 EXPECT_EQ(*(int *) cxListAt(list, 4), 42);
666 if (pointers) {
667 inserted = cxListInsertArray(list, 3, bptr, 5);
668 } else {
669 inserted = cxListInsertArray(list, 3, b, 5);
670 }
671 CX_TEST_ASSERT(inserted == 5);
672 EXPECT_EQ(*(int *) cxListAt(list, 0), 5);
673 EXPECT_EQ(*(int *) cxListAt(list, 1), 47);
674 EXPECT_EQ(*(int *) cxListAt(list, 2), 11);
675 EXPECT_EQ(*(int *) cxListAt(list, 3), 9);
676 EXPECT_EQ(*(int *) cxListAt(list, 4), 18);
677 EXPECT_EQ(*(int *) cxListAt(list, 5), 72);
678 EXPECT_EQ(*(int *) cxListAt(list, 6), 50);
679 EXPECT_EQ(*(int *) cxListAt(list, 7), 7);
680 EXPECT_EQ(*(int *) cxListAt(list, 8), 13);
681 EXPECT_EQ(*(int *) cxListAt(list, 9), 42);
682 }
684 void verifyRemove(CxList *list) const {
685 EXPECT_EQ(cxListRemove(list, 2), 0);
686 EXPECT_EQ(cxListRemove(list, 4), 0);
687 EXPECT_EQ(cxListSize(list), testdata_len - 2);
688 EXPECT_EQ(*(int *) cxListAt(list, 0), testdata.data[0]);
689 EXPECT_EQ(*(int *) cxListAt(list, 1), testdata.data[1]);
690 EXPECT_EQ(*(int *) cxListAt(list, 2), testdata.data[3]);
691 EXPECT_EQ(*(int *) cxListAt(list, 3), testdata.data[4]);
692 EXPECT_EQ(*(int *) cxListAt(list, 4), testdata.data[6]);
694 EXPECT_EQ(cxListRemove(list, 0), 0);
695 EXPECT_EQ(cxListSize(list), testdata_len - 3);
696 EXPECT_EQ(*(int *) cxListAt(list, 0), testdata.data[1]);
697 EXPECT_EQ(*(int *) cxListAt(list, 1), testdata.data[3]);
699 EXPECT_NE(cxListRemove(list, testdata_len), 0);
700 }
702 void verifyFindRemove(CxList *list) const {
703 size_t exp = rand() % testdata_len; // NOLINT(cert-msc50-cpp)
704 int val = testdata.data[exp];
705 // randomly picked number could occur earlier in list - find first position
706 cx_for_n (i, exp) {
707 if (testdata.data[i] == val) {
708 exp = i;
709 break;
710 }
711 }
712 EXPECT_EQ(cxListSize(list), testdata_len);
713 EXPECT_EQ(cxListFind(list, &val), exp);
714 EXPECT_EQ(cxListFindRemove(list, &val), exp);
715 EXPECT_EQ(cxListSize(list), testdata_len - 1);
716 EXPECT_NE(cxListFind(list, &val), exp);
718 int notinlist = -1;
719 EXPECT_LT(cxListFindRemove(list, ¬inlist), 0);
720 EXPECT_EQ(cxListSize(list), testdata_len - 1);
721 }
723 static void verifyClear(CxList *list) {
724 cxListClear(list);
725 EXPECT_EQ(0, cxListSize(list));
726 }
728 static unsigned destr_test_ctr;
729 static int destr_last_value;
731 static void simple_destr_test_fun(void *data) {
732 auto ptr = (int *) data;
733 destr_last_value = *ptr;
734 *ptr = destr_last_value + 1;
735 destr_test_ctr++;
736 }
738 static void advanced_destr_test_fun(
739 [[maybe_unused]] void *u,
740 void *data
741 ) {
742 simple_destr_test_fun(data);
743 }
745 void verifyAnyDestructor(CxList *list) {
746 int off = cxListIsStoringPointers(list) ? 1 : 0;
748 cxListRemove(list, 15);
749 EXPECT_EQ(1, destr_test_ctr);
750 EXPECT_EQ(testdata.data[15], destr_last_value + off);
751 EXPECT_EQ(testdata_len - destr_test_ctr, cxListSize(list));
752 cxListRemove(list, 47);
753 EXPECT_EQ(2, destr_test_ctr);
754 EXPECT_EQ(testdata.data[48], destr_last_value + off);
755 EXPECT_EQ(testdata_len - destr_test_ctr, cxListSize(list));
757 auto iter = cxListMutIteratorAt(list, 7);
758 cxIteratorNext(iter);
759 EXPECT_EQ(2, destr_test_ctr);
760 EXPECT_EQ(testdata.data[48], destr_last_value + off);
761 EXPECT_EQ(testdata_len - destr_test_ctr, cxListSize(list));
762 cxIteratorFlagRemoval(iter);
763 cxIteratorNext(iter);
764 EXPECT_EQ(3, destr_test_ctr);
765 EXPECT_EQ(testdata.data[8], destr_last_value + off);
766 EXPECT_EQ(testdata_len - destr_test_ctr, cxListSize(list));
768 iter = cxListMutBackwardsIteratorAt(list, 5);
769 cxIteratorNext(iter);
770 EXPECT_EQ(3, destr_test_ctr);
771 EXPECT_EQ(testdata.data[8], destr_last_value + off);
772 EXPECT_EQ(testdata_len - destr_test_ctr, cxListSize(list));
773 cxIteratorFlagRemoval(iter);
774 cxIteratorNext(iter);
775 EXPECT_EQ(4, destr_test_ctr);
776 EXPECT_EQ(testdata.data[4], destr_last_value + off);
777 EXPECT_EQ(testdata_len - destr_test_ctr, cxListSize(list));
779 cxListClear(list);
780 EXPECT_EQ(testdata_len, destr_test_ctr);
781 EXPECT_EQ(testdata.data[testdata_len - 1], destr_last_value + off);
782 }
784 void verifySimpleDestructor(CxList *list) {
785 destr_test_ctr = 0;
786 list->simple_destructor = simple_destr_test_fun;
787 verifyAnyDestructor(list);
788 }
790 void verifyAdvancedDestructor(CxList *list) {
791 destr_test_ctr = 0;
792 list->advanced_destructor = advanced_destr_test_fun;
793 verifyAnyDestructor(list);
794 }
796 static void verifySwap(CxList *list) {
797 CX_TEST_ASSERT(cxListSize(list) == 0);
799 int original[16] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15};
800 int swapped[16] = {8, 4, 14, 3, 1, 5, 9, 12, 0, 6, 11, 10, 7, 15, 2, 13};
802 // we have to add the items one by one, because it could be a pointer list
803 cx_for_n(i, 16) {
804 cxListAdd(list, &original[i]);
805 }
807 int result;
809 // execute the test two times with different item sizes
810 result = cxListSwap(list, 1, 4);
811 EXPECT_EQ(0, result);
812 result = cxListSwap(list, 2, 14);
813 EXPECT_EQ(0, result);
814 result = cxListSwap(list, 9, 6);
815 EXPECT_EQ(0, result);
816 result = cxListSwap(list, 3, 3);
817 EXPECT_EQ(0, result);
818 result = cxListSwap(list, 10, 11);
819 EXPECT_EQ(0, result);
820 result = cxListSwap(list, 8, 0);
821 EXPECT_EQ(0, result);
822 result = cxListSwap(list, 7, 12);
823 EXPECT_EQ(0, result);
824 result = cxListSwap(list, 13, 15);
825 EXPECT_EQ(0, result);
827 result = cxListSwap(list, 5, 16);
828 CX_TEST_ASSERT(0 != result);
829 result = cxListSwap(list, 16, 6);
830 CX_TEST_ASSERT(0 != result);
831 result = cxListSwap(list, 16, 17);
832 CX_TEST_ASSERT(0 != result);
834 auto iter = cxListIterator(list);
835 cx_foreach(int*, e, iter) {
836 EXPECT_EQ(*e, swapped[iter.index]);
837 }
838 iter = cxListBackwardsIterator(list);
839 cx_foreach(int*, e, iter) {
840 EXPECT_EQ(*e, swapped[iter.index]);
841 }
842 }
844 void verifyAt(CxList *list) const {
845 auto len = testdata_len;
846 EXPECT_EQ(cxListSize(list), len);
847 cx_for_n (i, len) {
848 EXPECT_EQ(*(int *) cxListAt(list, i), testdata.data[i]);
849 }
850 EXPECT_EQ(cxListAt(list, cxListSize(list)), NULL);
851 }
853 void verifyFind(CxList *list) const {
854 cx_for_n (attempt, 25) {
855 size_t exp = rand() % testdata_len; // NOLINT(cert-msc50-cpp)
856 int val = testdata.data[exp];
857 // randomly picked number could occur earlier in list - find first position
858 cx_for_n (i, exp) {
859 if (testdata.data[i] == val) {
860 exp = i;
861 break;
862 }
863 }
864 EXPECT_EQ(cxListFind(list, &val), exp);
865 }
867 int notinlist = -1;
868 EXPECT_LT(cxListFind(list, ¬inlist), 0);
869 }
871 void verifySort(CxList *list) const {
872 std::array<int, testdata_len> expected{};
873 std::partial_sort_copy(testdata.data.begin(), testdata.data.end(), expected.begin(), expected.end());
874 cxListSort(list);
875 cx_for_n (i, testdata_len) CX_TEST_ASSERT(*(int *) cxListAt(list, i) == expected[i]);
876 }
878 void verifyIterator(CxList *list) const {
879 auto iter = cxListIterator(list);
880 size_t i = 0;
881 cx_foreach(int*, x, iter) {
882 CX_TEST_ASSERT(i == iter.index);
883 EXPECT_EQ(*x, testdata.data[iter.index]);
884 i++;
885 }
886 CX_TEST_ASSERT(i == cxListSize(list));
887 iter = cxListBackwardsIterator(list);
888 cx_foreach(int*, x, iter) {
889 CX_TEST_ASSERT(i - 1 == iter.index);
890 EXPECT_EQ(*x, testdata.data[iter.index]);
891 i--;
892 }
893 CX_TEST_ASSERT(i == 0);
894 auto len = testdata_len;
895 i = len / 2;
896 auto mut_iter = cxListMutIteratorAt(list, i);
897 size_t j = 0;
898 cx_foreach(int*, x, mut_iter) {
899 CX_TEST_ASSERT(mut_iter.index == len / 2 + j / 2);
900 CX_TEST_ASSERT(*x == testdata.data[i]);
901 if (i % 2 == 1) cxIteratorFlagRemoval(mut_iter);
902 i++;
903 j++;
904 }
905 CX_TEST_ASSERT(i == len);
906 i = len / 2;
907 j = 0;
908 mut_iter = cxListMutBackwardsIteratorAt(list, i - 1);
909 cx_foreach(int*, x, mut_iter) {
910 CX_TEST_ASSERT(mut_iter.index == len / 2 - 1 - j);
911 CX_TEST_ASSERT(*x == testdata.data[i - 1]);
912 if (i % 2 == 0) cxIteratorFlagRemoval(mut_iter);
913 i--;
914 j++;
915 }
916 CX_TEST_ASSERT(i == 0);
917 CX_TEST_ASSERT(cxListSize(list) == len / 2);
918 cx_for_n(j, len / 2) ASSERT_EQ(*(int *) cxListAt(list, j), testdata.data[j * 2]);
919 }
921 static void verifyInsertViaIterator(CxList *list) {
922 int newdata[] = {10, 20, 30, 40, 50};
924 auto iter = cxListMutIteratorAt(list, 2);
925 CX_TEST_ASSERT(cxIteratorValid(iter));
926 EXPECT_EQ(iter.index, 2);
927 EXPECT_EQ(*(int *) cxIteratorCurrent(iter), 2);
928 cxListInsertAfter(&iter, &newdata[0]);
929 CX_TEST_ASSERT(cxIteratorValid(iter));
930 EXPECT_EQ(iter.index, 2);
931 EXPECT_EQ(*(int *) cxIteratorCurrent(iter), 2);
932 cxListInsertBefore(&iter, &newdata[1]);
933 CX_TEST_ASSERT(cxIteratorValid(iter));
934 EXPECT_EQ(iter.index, 3);
935 EXPECT_EQ(*(int *) cxIteratorCurrent(iter), 2);
937 iter = cxListMutIterator(list);
938 cxListInsertBefore(&iter, &newdata[2]);
939 CX_TEST_ASSERT(cxIteratorValid(iter));
940 EXPECT_EQ(iter.index, 1);
941 EXPECT_EQ(*(int *) cxIteratorCurrent(iter), 0);
942 iter = cxListMutIteratorAt(list, cxListSize(list));
943 cxListInsertBefore(&iter, &newdata[3]);
944 CX_TEST_ASSERT(!cxIteratorValid(iter));
945 EXPECT_EQ(iter.index, 9);
946 iter = cxListMutIteratorAt(list, cxListSize(list));
947 cxListInsertAfter(&iter, &newdata[4]);
948 CX_TEST_ASSERT(!cxIteratorValid(iter));
949 EXPECT_EQ(iter.index, 10);
951 int expdata[] = {30, 0, 1, 20, 2, 10, 3, 4, 40, 50};
952 cx_for_n (j, 10) EXPECT_EQ(*(int *) cxListAt(list, j), expdata[j]);
953 }
955 void verifyReverse(CxList *list) const {
956 cxListReverse(list);
957 cx_for_n(i, testdata_len) {
958 ASSERT_EQ(*(int *) cxListAt(list, i), testdata.data[testdata_len - 1 - i]);
959 }
960 }
962 static void verifyCompare(
963 CxList *left,
964 CxList *right
965 ) {
966 EXPECT_EQ(cxListCompare(left, right), 0);
967 int x = 42;
968 cxListAdd(left, &x);
969 ASSERT_GT(cxListSize(left), cxListSize(right));
970 EXPECT_GT(cxListCompare(left, right), 0);
971 EXPECT_LT(cxListCompare(right, left), 0);
972 cxListAdd(right, &x);
973 CX_TEST_ASSERT(cxListSize(left) == cxListSize(right));
974 EXPECT_EQ(cxListCompare(left, right), 0);
975 int a = 5, b = 10;
976 cxListInsert(left, 15, &a);
977 cxListInsert(right, 15, &b);
978 CX_TEST_ASSERT(cxListSize(left) == cxListSize(right));
979 EXPECT_LT(cxListCompare(left, right), 0);
980 EXPECT_GT(cxListCompare(right, left), 0);
981 *(int *) cxListAt(left, 15) = 10;
982 EXPECT_EQ(cxListCompare(left, right), 0);
983 }
984 };
986 unsigned HighLevelTest::destr_test_ctr = 0;
987 int HighLevelTest::destr_last_value = 0;
989 class LinkedList : public HighLevelTest {
990 };
992 class PointerLinkedList : public HighLevelTest {
993 };
995 class ArrayList : public HighLevelTest {
996 };
998 class PointerArrayList : public HighLevelTest {
999 };
1001 TEST_F(PointerLinkedList, cxListStorePointers) {
1002 auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, 47));
1003 CX_TEST_ASSERT(!cxListIsStoringPointers(list));
1004 cxListStorePointers(list);
1005 EXPECT_EQ(list->item_size, sizeof(void *));
1006 CX_TEST_ASSERT(list->cl != NULL);
1007 CX_TEST_ASSERT(list->climpl != NULL);
1008 CX_TEST_ASSERT(cxListIsStoringPointers(list));
1009 cxListStoreObjects(list);
1010 CX_TEST_ASSERT(list->cl != NULL);
1011 EXPECT_EQ(list->climpl, NULL);
1012 CX_TEST_ASSERT(!cxListIsStoringPointers(list));
1013 }
1015 TEST_F(LinkedList, cxLinkedListCreate) {
1016 CxList *list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int)));
1017 ASSERT_NE(list, NULL);
1018 EXPECT_EQ(list->item_size, sizeof(int));
1019 EXPECT_EQ(list->simple_destructor, NULL);
1020 EXPECT_EQ(list->advanced_destructor, NULL);
1021 EXPECT_EQ(list->destructor_data, NULL);
1022 EXPECT_EQ(cxListSize(list), 0);
1023 EXPECT_EQ(list->allocator, &testingAllocator);
1024 EXPECT_EQ(list->cmpfunc, cx_cmp_int);
1025 CX_TEST_ASSERT(!cxListIsStoringPointers(list));
1026 }
1028 TEST_F(LinkedList, cxLinkedListCreateSimple) {
1029 CxList *list = autofree(cxLinkedListCreateSimple(sizeof(int)));
1030 ASSERT_NE(list, NULL);
1031 EXPECT_EQ(list->item_size, sizeof(int));
1032 EXPECT_EQ(list->cmpfunc, NULL);
1033 EXPECT_EQ(list->allocator, cxDefaultAllocator);
1034 EXPECT_EQ(list->simple_destructor, NULL);
1035 EXPECT_EQ(list->advanced_destructor, NULL);
1036 EXPECT_EQ(list->destructor_data, NULL);
1037 EXPECT_EQ(cxListSize(list), 0);
1038 CX_TEST_ASSERT(!cxListIsStoringPointers(list));
1039 }
1041 TEST_F(PointerLinkedList, cxLinkedListCreateSimpleForPointers) {
1042 CxList *list = autofree(cxLinkedListCreateSimple(CX_STORE_POINTERS));
1043 ASSERT_NE(list, NULL);
1044 EXPECT_EQ(list->item_size, sizeof(void *));
1045 EXPECT_EQ(list->cmpfunc, cx_cmp_ptr);
1046 EXPECT_EQ(list->allocator, cxDefaultAllocator);
1047 EXPECT_EQ(list->simple_destructor, NULL);
1048 EXPECT_EQ(list->advanced_destructor, NULL);
1049 EXPECT_EQ(list->destructor_data, NULL);
1050 EXPECT_EQ(cxListSize(list), 0);
1051 CX_TEST_ASSERT(cxListIsStoringPointers(list));
1052 }
1054 TEST_F(ArrayList, cxArrayListCreate) {
1055 CxList *list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 8));
1056 ASSERT_NE(list, NULL);
1057 EXPECT_EQ(list->item_size, sizeof(int));
1058 EXPECT_EQ(list->simple_destructor, NULL);
1059 EXPECT_EQ(list->advanced_destructor, NULL);
1060 EXPECT_EQ(list->destructor_data, NULL);
1061 EXPECT_EQ(cxListSize(list), 0);
1062 EXPECT_EQ(list->allocator, &testingAllocator);
1063 EXPECT_EQ(list->cmpfunc, cx_cmp_int);
1064 CX_TEST_ASSERT(!cxListIsStoringPointers(list));
1065 }
1067 TEST_F(ArrayList, cxArrayListCreateSimple) {
1068 CxList *list = autofree(cxArrayListCreateSimple(sizeof(int), 8));
1069 ASSERT_NE(list, NULL);
1070 EXPECT_EQ(list->cmpfunc, NULL);
1071 EXPECT_EQ(list->allocator, cxDefaultAllocator);
1072 EXPECT_EQ(list->item_size, sizeof(int));
1073 EXPECT_EQ(list->simple_destructor, NULL);
1074 EXPECT_EQ(list->advanced_destructor, NULL);
1075 EXPECT_EQ(list->destructor_data, NULL);
1076 EXPECT_EQ(cxListSize(list), 0);
1077 CX_TEST_ASSERT(!cxListIsStoringPointers(list));
1078 }
1080 TEST_F(PointerArrayList, cxArrayListCreateSimpleForPointers) {
1081 CxList *list = autofree(cxArrayListCreateSimple(CX_STORE_POINTERS, 8));
1082 ASSERT_NE(list, NULL);
1083 EXPECT_EQ(list->cmpfunc, cx_cmp_ptr);
1084 EXPECT_EQ(list->allocator, cxDefaultAllocator);
1085 EXPECT_EQ(list->item_size, sizeof(void *));
1086 CX_TEST_ASSERT(cxListIsStoringPointers(list));
1087 }
1089 TEST_F(LinkedList, cxListAdd) {
1090 auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int)));
1091 verifyAdd(list, false);
1092 }
1094 TEST_F(PointerLinkedList, cxListAdd) {
1095 auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS));
1096 verifyAdd(list, true);
1097 }
1099 TEST_F(ArrayList, cxListAdd) {
1100 auto list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 8));
1101 verifyAdd(list, false);
1102 }
1104 TEST_F(PointerArrayList, cxListAdd) {
1105 auto list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS, 8));
1106 verifyAdd(list, true);
1107 }
1109 TEST_F(LinkedList, cxListInsert) {
1110 verifyInsert(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int))));
1111 }
1113 TEST_F(PointerLinkedList, cxListInsert) {
1114 verifyInsert(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS)));
1115 }
1117 TEST_F(ArrayList, cxListInsert) {
1118 verifyInsert(autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 2)));
1119 }
1121 TEST_F(PointerArrayList, cxListInsert) {
1122 verifyInsert(autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS, 2)));
1123 }
1125 TEST_F(LinkedList, cxListInsertArray) {
1126 verifyInsertArray(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int))));
1127 }
1129 TEST_F(PointerLinkedList, cxListInsertArray) {
1130 verifyInsertArray(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS)), true);
1131 }
1133 TEST_F(ArrayList, cxListInsertArray) {
1134 verifyInsertArray(autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 4)));
1135 }
1137 TEST_F(PointerArrayList, cxListInsertArray) {
1138 verifyInsertArray(autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS, 4)), true);
1139 }
1141 TEST_F(LinkedList, cxListRemove) {
1142 verifyRemove(linkedListFromTestData());
1143 }
1145 TEST_F(PointerLinkedList, cxListRemove) {
1146 verifyRemove(pointerLinkedListFromTestData());
1147 }
1149 TEST_F(ArrayList, cxListRemove) {
1150 verifyRemove(arrayListFromTestData());
1151 }
1153 TEST_F(PointerArrayList, cxListRemove) {
1154 verifyRemove(pointerArrayListFromTestData());
1155 }
1157 TEST_F(LinkedList, cxListFindRemove) {
1158 verifyFindRemove(linkedListFromTestData());
1159 }
1161 TEST_F(PointerLinkedList, cxListFindRemove) {
1162 verifyFindRemove(pointerLinkedListFromTestData());
1163 }
1165 TEST_F(ArrayList, cxListFindRemove) {
1166 verifyFindRemove(arrayListFromTestData());
1167 }
1169 TEST_F(PointerArrayList, cxListFindRemove) {
1170 verifyFindRemove(pointerArrayListFromTestData());
1171 }
1173 TEST_F(LinkedList, cxListClear) {
1174 verifyClear(linkedListFromTestData());
1175 }
1177 TEST_F(PointerLinkedList, cxListClear) {
1178 verifyClear(pointerLinkedListFromTestData());
1179 }
1181 TEST_F(ArrayList, cxListClear) {
1182 verifyClear(arrayListFromTestData());
1183 }
1185 TEST_F(PointerArrayList, cxListClear) {
1186 verifyClear(pointerArrayListFromTestData());
1187 }
1189 TEST_F(LinkedList, cxListSwap) {
1190 verifySwap(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int))));
1191 }
1193 TEST_F(PointerLinkedList, cxListSwap) {
1194 verifySwap(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS)));
1195 }
1197 TEST_F(ArrayList, cxListSwap) {
1198 verifySwap(autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 16)));
1199 }
1201 TEST_F(PointerArrayList, cxListSwap) {
1202 verifySwap(autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS, 16)));
1203 }
1205 TEST_F(LinkedList, cxListSwapNoSBO) {
1206 CX_DISABLE_LINKED_LIST_SWAP_SBO = true;
1207 verifySwap(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int))));
1208 CX_DISABLE_LINKED_LIST_SWAP_SBO = false;
1209 }
1211 TEST_F(PointerLinkedList, cxListSwapNoSBO) {
1212 CX_DISABLE_LINKED_LIST_SWAP_SBO = true;
1213 verifySwap(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS)));
1214 CX_DISABLE_LINKED_LIST_SWAP_SBO = false;
1215 }
1217 TEST_F(LinkedList, cxListAt) {
1218 verifyAt(linkedListFromTestData());
1219 }
1221 TEST_F(PointerLinkedList, cxListAt) {
1222 verifyAt(pointerLinkedListFromTestData());
1223 }
1225 TEST_F(ArrayList, cxListAt) {
1226 verifyAt(arrayListFromTestData());
1227 }
1229 TEST_F(PointerArrayList, cxListAt) {
1230 verifyAt(pointerArrayListFromTestData());
1231 }
1233 TEST_F(LinkedList, cxListFind) {
1234 verifyFind(linkedListFromTestData());
1235 }
1237 TEST_F(PointerLinkedList, cxListFind) {
1238 verifyFind(pointerLinkedListFromTestData());
1239 }
1241 TEST_F(ArrayList, cxListFind) {
1242 verifyFind(arrayListFromTestData());
1243 }
1245 TEST_F(PointerArrayList, cxListFind) {
1246 verifyFind(pointerArrayListFromTestData());
1247 }
1249 TEST_F(LinkedList, cxListSort) {
1250 verifySort(linkedListFromTestData());
1251 }
1253 TEST_F(PointerLinkedList, cxListSort) {
1254 verifySort(pointerLinkedListFromTestData());
1255 }
1257 TEST_F(ArrayList, cxListSort) {
1258 verifySort(arrayListFromTestData());
1259 }
1261 TEST_F(PointerArrayList, cxListSort) {
1262 verifySort(pointerArrayListFromTestData());
1263 }
1265 TEST_F(LinkedList, Iterator) {
1266 verifyIterator(linkedListFromTestData());
1267 }
1269 TEST_F(PointerLinkedList, Iterator) {
1270 verifyIterator(pointerLinkedListFromTestData());
1271 }
1273 TEST_F(ArrayList, Iterator) {
1274 verifyIterator(arrayListFromTestData());
1275 }
1277 TEST_F(PointerArrayList, Iterator) {
1278 verifyIterator(pointerArrayListFromTestData());
1279 }
1281 TEST_F(LinkedList, InsertViaIterator) {
1282 int fivenums[] = {0, 1, 2, 3, 4, 5};
1283 CxList *list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int)));
1284 cxListAddArray(list, fivenums, 5);
1285 verifyInsertViaIterator(list);
1286 }
1288 TEST_F(PointerLinkedList, InsertViaIterator) {
1289 int fivenums[] = {0, 1, 2, 3, 4, 5};
1290 auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS));
1291 // note: cannot use cxListAddArray() because we don't have a list of pointers
1292 cx_for_n(i, 5) cxListAdd(list, &fivenums[i]);
1293 verifyInsertViaIterator(list);
1294 }
1296 TEST_F(ArrayList, InsertViaIterator) {
1297 int fivenums[] = {0, 1, 2, 3, 4, 5};
1298 auto list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 4));
1299 cxListAddArray(list, fivenums, 5);
1300 verifyInsertViaIterator(list);
1301 }
1303 TEST_F(PointerArrayList, InsertViaIterator) {
1304 int fivenums[] = {0, 1, 2, 3, 4, 5};
1305 auto list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS, 4));
1306 // note: cannot use cxListAddArray() because we don't have a list of pointers
1307 cx_for_n(i, 5) cxListAdd(list, &fivenums[i]);
1308 verifyInsertViaIterator(list);
1309 }
1311 TEST_F(LinkedList, cxListReverse) {
1312 verifyReverse(linkedListFromTestData());
1313 }
1315 TEST_F(PointerLinkedList, cxListReverse) {
1316 verifyReverse(pointerLinkedListFromTestData());
1317 }
1319 TEST_F(ArrayList, cxListReverse) {
1320 verifyReverse(arrayListFromTestData());
1321 }
1323 TEST_F(PointerArrayList, cxListReverse) {
1324 verifyReverse(pointerArrayListFromTestData());
1325 }
1327 TEST_F(LinkedList, cxListCompare) {
1328 auto left = linkedListFromTestData();
1329 auto right = linkedListFromTestData();
1330 verifyCompare(left, right);
1331 }
1333 TEST_F(LinkedList, cxListCompareWithPtrList) {
1334 auto left = linkedListFromTestData();
1335 auto right = pointerLinkedListFromTestData();
1336 verifyCompare(left, right);
1337 }
1339 TEST_F(LinkedList, cxListCompareWithArrayList) {
1340 auto left = linkedListFromTestData();
1341 auto right = arrayListFromTestData();
1342 verifyCompare(left, right);
1343 }
1345 TEST_F(LinkedList, cxListCompareWithPtrArrayList) {
1346 auto left = linkedListFromTestData();
1347 auto right = pointerArrayListFromTestData();
1348 verifyCompare(left, right);
1349 }
1351 TEST_F(PointerLinkedList, cxListCompare) {
1352 auto left = pointerLinkedListFromTestData();
1353 auto right = pointerLinkedListFromTestData();
1354 verifyCompare(left, right);
1355 }
1357 TEST_F(PointerLinkedList, cxListCompareWithNormalList) {
1358 auto left = pointerLinkedListFromTestData();
1359 auto right = linkedListFromTestData();
1360 verifyCompare(left, right);
1361 }
1363 TEST_F(PointerLinkedList, cxListCompareWithArrayList) {
1364 auto left = pointerLinkedListFromTestData();
1365 auto right = arrayListFromTestData();
1366 verifyCompare(left, right);
1367 }
1369 TEST_F(PointerLinkedList, cxListCompareWithPtrArrayList) {
1370 auto left = pointerLinkedListFromTestData();
1371 auto right = pointerArrayListFromTestData();
1372 verifyCompare(left, right);
1373 }
1375 TEST_F(ArrayList, cxListCompare) {
1376 auto left = arrayListFromTestData();
1377 auto right = arrayListFromTestData();
1378 verifyCompare(left, right);
1379 }
1381 TEST_F(ArrayList, cxListCompareWithPtrList) {
1382 auto left = arrayListFromTestData();
1383 auto right = pointerLinkedListFromTestData();
1384 verifyCompare(left, right);
1385 }
1387 TEST_F(ArrayList, cxListCompareWithNormalList) {
1388 auto left = arrayListFromTestData();
1389 auto right = linkedListFromTestData();
1390 verifyCompare(left, right);
1391 }
1393 TEST_F(ArrayList, cxListCompareWithPtrArrayList) {
1394 auto left = arrayListFromTestData();
1395 auto right = pointerArrayListFromTestData();
1396 verifyCompare(left, right);
1397 }
1399 TEST_F(PointerArrayList, cxListCompare) {
1400 auto left = pointerArrayListFromTestData();
1401 auto right = pointerArrayListFromTestData();
1402 verifyCompare(left, right);
1403 }
1405 TEST_F(PointerArrayList, cxListCompareWithPtrList) {
1406 auto left = pointerArrayListFromTestData();
1407 auto right = pointerLinkedListFromTestData();
1408 verifyCompare(left, right);
1409 }
1411 TEST_F(PointerArrayList, cxListCompareWithNormalList) {
1412 auto left = pointerArrayListFromTestData();
1413 auto right = linkedListFromTestData();
1414 verifyCompare(left, right);
1415 }
1417 TEST_F(PointerArrayList, cxListCompareWithNormalArrayList) {
1418 auto left = pointerArrayListFromTestData();
1419 auto right = arrayListFromTestData();
1420 verifyCompare(left, right);
1421 }
1423 TEST_F(LinkedList, SimpleDestructor) {
1424 verifySimpleDestructor(linkedListFromTestData());
1425 }
1427 TEST_F(PointerLinkedList, SimpleDestructor) {
1428 verifySimpleDestructor(pointerLinkedListFromTestData());
1429 }
1431 TEST_F(ArrayList, SimpleDestructor) {
1432 verifySimpleDestructor(arrayListFromTestData());
1433 }
1435 TEST_F(PointerArrayList, SimpleDestructor) {
1436 verifySimpleDestructor(pointerArrayListFromTestData());
1437 }
1439 TEST_F(LinkedList, AdvancedDestructor) {
1440 verifyAdvancedDestructor(linkedListFromTestData());
1441 }
1443 TEST_F(PointerLinkedList, AdvancedDestructor) {
1444 verifyAdvancedDestructor(pointerLinkedListFromTestData());
1445 }
1447 TEST_F(ArrayList, AdvancedDestructor) {
1448 verifyAdvancedDestructor(arrayListFromTestData());
1449 }
1451 TEST_F(PointerArrayList, AdvancedDestructor) {
1452 verifyAdvancedDestructor(pointerArrayListFromTestData());
1453 }
1455 TEST_F(PointerLinkedList, DestroyNoDestructor) {
1456 void *item = cxMalloc(&testingAllocator, sizeof(int));
1457 auto list = cxLinkedListCreate(cxDefaultAllocator, cx_cmp_int, CX_STORE_POINTERS);
1458 cxListAdd(list, item);
1459 CX_TEST_ASSERT(!testingAllocator.verify());
1460 cxListDestroy(list);
1461 CX_TEST_ASSERT(!testingAllocator.verify());
1462 cxFree(&testingAllocator, item);
1463 CX_TEST_ASSERT(testingAllocator.verify());
1464 }
1466 TEST_F(PointerLinkedList, DestroySimpleDestructor) {
1467 int item = 0;
1468 auto list = cxLinkedListCreate(cxDefaultAllocator, cx_cmp_int, CX_STORE_POINTERS);
1469 list->simple_destructor = [](void *elem) { *(int *) elem = 42; };
1470 cxListAdd(list, &item);
1471 cxListDestroy(list);
1472 EXPECT_EQ(item, 42);
1473 }
1475 TEST_F(PointerLinkedList, DestroyAdvancedDestructor) {
1476 void *item = cxMalloc(&testingAllocator, sizeof(int));
1477 auto list = cxLinkedListCreate(cxDefaultAllocator, cx_cmp_int, CX_STORE_POINTERS);
1478 list->destructor_data = &testingAllocator;
1479 list->advanced_destructor = (cx_destructor_func2) cxFree;
1480 cxListAdd(list, item);
1481 CX_TEST_ASSERT(!testingAllocator.verify());
1482 cxListDestroy(list);
1483 CX_TEST_ASSERT(testingAllocator.verify());
1484 }
1486 TEST_F(PointerArrayList, DestroyNoDestructor) {
1487 void *item = cxMalloc(&testingAllocator, sizeof(int));
1488 auto list = cxArrayListCreate(cxDefaultAllocator, cx_cmp_int, CX_STORE_POINTERS, 4);
1489 cxListAdd(list, item);
1490 CX_TEST_ASSERT(!testingAllocator.verify());
1491 cxListDestroy(list);
1492 CX_TEST_ASSERT(!testingAllocator.verify());
1493 cxFree(&testingAllocator, item);
1494 CX_TEST_ASSERT(testingAllocator.verify());
1495 }
1497 TEST_F(PointerArrayList, DestroySimpleDestructor) {
1498 int item = 0;
1499 auto list = cxArrayListCreate(cxDefaultAllocator, cx_cmp_int, CX_STORE_POINTERS, 4);
1500 list->simple_destructor = [](void *elem) { *(int *) elem = 42; };
1501 cxListAdd(list, &item);
1502 cxListDestroy(list);
1503 EXPECT_EQ(item, 42);
1504 }
1506 TEST_F(PointerArrayList, DestroyAdvancedDestructor) {
1507 void *item = cxMalloc(&testingAllocator, sizeof(int));
1508 auto list = cxArrayListCreate(cxDefaultAllocator, cx_cmp_int, CX_STORE_POINTERS, 4);
1509 list->destructor_data = &testingAllocator;
1510 list->advanced_destructor = (cx_destructor_func2) cxFree;
1511 cxListAdd(list, item);
1512 CX_TEST_ASSERT(!testingAllocator.verify());
1513 cxListDestroy(list);
1514 CX_TEST_ASSERT(testingAllocator.verify());
1515 }
1517 TEST(EmptyList, Size) {
1518 auto list = cxEmptyList;
1520 EXPECT_EQ(list->size, 0);
1521 EXPECT_EQ(cxListSize(list), 0);
1522 }
1524 TEST(EmptyList, Iterator) {
1525 auto list = cxEmptyList;
1527 auto it1 = cxListIterator(list);
1528 auto it2 = cxListBackwardsIterator(list);
1529 auto it3 = cxListMutIterator(list);
1530 auto it4 = cxListMutBackwardsIterator(list);
1532 CX_TEST_ASSERT(!cxIteratorValid(it1));
1533 CX_TEST_ASSERT(!cxIteratorValid(it2));
1534 CX_TEST_ASSERT(!cxIteratorValid(it3));
1535 CX_TEST_ASSERT(!cxIteratorValid(it4));
1537 int c = 0;
1538 cx_foreach(void*, data, it1) c++;
1539 cx_foreach(void*, data, it2) c++;
1540 cx_foreach(void*, data, it3) c++;
1541 cx_foreach(void*, data, it4) c++;
1542 EXPECT_EQ(c, 0);
1543 }
1545 TEST(EmptyList, NoOps) {
1546 auto list = cxEmptyList;
1548 ASSERT_NO_FATAL_FAILURE(cxListSort(list));
1549 ASSERT_NO_FATAL_FAILURE(cxListClear(list));
1550 ASSERT_NO_FATAL_FAILURE(cxListDestroy(list));
1551 }
1553 TEST(EmptyList, At) {
1554 auto list = cxEmptyList;
1556 EXPECT_EQ(cxListAt(list, 0), NULL);
1557 EXPECT_EQ(cxListAt(list, 1), NULL);
1558 }
1560 TEST(EmptyList, Find) {
1561 auto list = cxEmptyList;
1563 int x = 42, y = 1337;
1565 EXPECT_LT(cxListFind(list, &x), 0);
1566 EXPECT_LT(cxListFind(list, &y), 0);
1567 }
1569 TEST(EmptyList, Compare) {
1570 auto empty = cxEmptyList;
1572 auto ll = cxLinkedListCreateSimple(sizeof(int));
1573 auto al = cxArrayListCreateSimple(sizeof(int), 8);
1575 int x = 5;
1577 EXPECT_EQ(cxListCompare(empty, cxEmptyList), 0);
1578 EXPECT_EQ(cxListCompare(ll, cxEmptyList), 0);
1579 EXPECT_EQ(cxListCompare(al, cxEmptyList), 0);
1580 EXPECT_EQ(cxListCompare(cxEmptyList, ll), 0);
1581 EXPECT_EQ(cxListCompare(cxEmptyList, al), 0);
1583 cxListAdd(ll, &x);
1584 cxListAdd(al, &x);
1586 EXPECT_GT(cxListCompare(ll, cxEmptyList), 0);
1587 EXPECT_GT(cxListCompare(al, cxEmptyList), 0);
1588 EXPECT_LT(cxListCompare(cxEmptyList, ll), 0);
1589 EXPECT_LT(cxListCompare(cxEmptyList, al), 0);
1591 cxListDestroy(ll);
1592 cxListDestroy(al);
1593 }
