tests/test_list.cpp@b09aae58bba4
tests/test_list.cpp
Sun, 09 Apr 2023 19:03:58 +0200
- author
- Mike Becker <universe@uap-core.de>
- date
- Sun, 09 Apr 2023 19:03:58 +0200
- changeset 677
- b09aae58bba4
- parent 672
- 55d8fdd38ca4
- child 679
- 022fbd4bc057
- permissions
- -rw-r--r--
refactoring of collections to make use of destructors in map implementations
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 = nullptr;
43 node *prev = nullptr;
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 = nullptr;
54 explicit node_test_data(node *begin) : begin(begin) {
55 auto n = begin;
56 while (n != nullptr) {
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{nullptr};
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{nullptr};
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 EXPECT_EQ(a.prev, nullptr);
123 EXPECT_EQ(a.next, &b);
124 EXPECT_EQ(b.prev, &a);
125 EXPECT_EQ(b.next, nullptr);
127 cx_linked_list_unlink(&a, &b, loc_prev, loc_next);
128 EXPECT_EQ(a.prev, nullptr);
129 EXPECT_EQ(a.next, nullptr);
130 EXPECT_EQ(b.prev, nullptr);
131 EXPECT_EQ(b.next, nullptr);
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 EXPECT_EQ(a.prev, nullptr);
137 EXPECT_EQ(a.next, &b);
138 EXPECT_EQ(b.prev, &a);
139 EXPECT_EQ(b.next, nullptr);
140 EXPECT_EQ(c.prev, nullptr);
141 EXPECT_EQ(c.next, nullptr);
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), nullptr);
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), nullptr);
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_EQ(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s), 4);
181 s = -2;
182 EXPECT_EQ(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s), 4);
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 = nullptr, *end = nullptr;
204 cx_linked_list_add(&begin, &end, loc_prev, loc_next, &nodes[0]);
205 EXPECT_EQ(begin, &nodes[0]);
206 EXPECT_EQ(end, &nodes[0]);
207 EXPECT_EQ(nodes[0].prev, nullptr);
208 EXPECT_EQ(nodes[0].next, nullptr);
210 cx_linked_list_add(&begin, &end, loc_prev, loc_next, &nodes[1]);
211 EXPECT_EQ(begin, &nodes[0]);
212 EXPECT_EQ(end, &nodes[1]);
213 EXPECT_EQ(nodes[0].next, &nodes[1]);
214 EXPECT_EQ(nodes[1].prev, &nodes[0]);
215 }
217 // test with begin only / prev, next
218 {
219 node nodes[4];
220 void *begin = nullptr;
222 cx_linked_list_add(&begin, nullptr, loc_prev, loc_next, &nodes[0]);
223 EXPECT_EQ(begin, &nodes[0]);
224 cx_linked_list_add(&begin, nullptr, loc_prev, loc_next, &nodes[1]);
225 EXPECT_EQ(begin, &nodes[0]);
226 EXPECT_EQ(nodes[0].next, &nodes[1]);
227 EXPECT_EQ(nodes[1].prev, &nodes[0]);
229 cx_linked_list_add(&begin, nullptr, loc_prev, loc_next, &nodes[2]);
230 EXPECT_EQ(nodes[1].next, &nodes[2]);
231 EXPECT_EQ(nodes[2].prev, &nodes[1]);
232 }
234 // test with end only / prev, next
235 {
236 node nodes[4];
237 void *end = nullptr;
239 cx_linked_list_add(nullptr, &end, loc_prev, loc_next, &nodes[0]);
240 EXPECT_EQ(end, &nodes[0]);
241 cx_linked_list_add(nullptr, &end, loc_prev, loc_next, &nodes[1]);
242 EXPECT_EQ(end, &nodes[1]);
243 EXPECT_EQ(nodes[0].next, &nodes[1]);
244 EXPECT_EQ(nodes[1].prev, &nodes[0]);
246 cx_linked_list_add(nullptr, &end, loc_prev, loc_next, &nodes[2]);
247 EXPECT_EQ(end, &nodes[2]);
248 EXPECT_EQ(nodes[1].next, &nodes[2]);
249 EXPECT_EQ(nodes[2].prev, &nodes[1]);
250 }
252 // test with begin, end / next
253 {
254 node nodes[4];
255 void *begin = nullptr, *end = nullptr;
257 cx_linked_list_add(&begin, &end, -1, loc_next, &nodes[0]);
258 EXPECT_EQ(begin, &nodes[0]);
259 EXPECT_EQ(end, &nodes[0]);
260 cx_linked_list_add(&begin, &end, -1, loc_next, &nodes[1]);
261 EXPECT_EQ(end, &nodes[1]);
262 EXPECT_EQ(nodes[0].next, &nodes[1]);
263 EXPECT_EQ(nodes[1].prev, nullptr);
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 = nullptr, *end = nullptr;
273 cx_linked_list_prepend(&begin, &end, loc_prev, loc_next, &nodes[0]);
274 EXPECT_EQ(begin, &nodes[0]);
275 EXPECT_EQ(end, &nodes[0]);
276 EXPECT_EQ(nodes[0].prev, nullptr);
277 EXPECT_EQ(nodes[0].next, nullptr);
279 cx_linked_list_prepend(&begin, &end, loc_prev, loc_next, &nodes[1]);
280 EXPECT_EQ(begin, &nodes[1]);
281 EXPECT_EQ(end, &nodes[0]);
282 EXPECT_EQ(nodes[1].next, &nodes[0]);
283 EXPECT_EQ(nodes[0].prev, &nodes[1]);
284 }
286 // test with begin only / prev, next
287 {
288 node nodes[4];
289 void *begin = nullptr;
291 cx_linked_list_prepend(&begin, nullptr, loc_prev, loc_next, &nodes[0]);
292 EXPECT_EQ(begin, &nodes[0]);
293 cx_linked_list_prepend(&begin, nullptr, loc_prev, loc_next, &nodes[1]);
294 EXPECT_EQ(begin, &nodes[1]);
295 EXPECT_EQ(nodes[1].next, &nodes[0]);
296 EXPECT_EQ(nodes[0].prev, &nodes[1]);
298 cx_linked_list_prepend(&begin, nullptr, loc_prev, loc_next, &nodes[2]);
299 EXPECT_EQ(begin, &nodes[2]);
300 EXPECT_EQ(nodes[2].next, &nodes[1]);
301 EXPECT_EQ(nodes[1].prev, &nodes[2]);
302 }
304 // test with end only / prev, next
305 {
306 node nodes[4];
307 void *end = nullptr;
309 cx_linked_list_prepend(nullptr, &end, loc_prev, loc_next, &nodes[0]);
310 EXPECT_EQ(end, &nodes[0]);
311 cx_linked_list_prepend(nullptr, &end, loc_prev, loc_next, &nodes[1]);
312 EXPECT_EQ(end, &nodes[0]);
313 EXPECT_EQ(nodes[1].next, &nodes[0]);
314 EXPECT_EQ(nodes[0].prev, &nodes[1]);
316 cx_linked_list_prepend(nullptr, &end, loc_prev, loc_next, &nodes[2]);
317 EXPECT_EQ(end, &nodes[0]);
318 EXPECT_EQ(nodes[2].next, &nodes[1]);
319 EXPECT_EQ(nodes[1].prev, &nodes[2]);
320 }
322 // test with begin, end / next
323 {
324 node nodes[4];
325 void *begin = nullptr, *end = nullptr;
327 cx_linked_list_prepend(&begin, &end, -1, loc_next, &nodes[0]);
328 EXPECT_EQ(begin, &nodes[0]);
329 EXPECT_EQ(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 EXPECT_EQ(begin, &nodes[2]);
333 EXPECT_EQ(end, &nodes[0]);
334 EXPECT_EQ(nodes[1].next, &nodes[0]);
335 EXPECT_EQ(nodes[2].next, &nodes[1]);
336 EXPECT_EQ(nodes[1].prev, nullptr);
337 EXPECT_EQ(nodes[0].prev, nullptr);
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 EXPECT_EQ(begin, &nodes[0]);
352 EXPECT_EQ(end, &nodes[2]);
353 EXPECT_EQ(nodes[1].next, &nodes[3]);
354 EXPECT_EQ(nodes[2].prev, &nodes[3]);
355 EXPECT_EQ(nodes[3].prev, &nodes[1]);
356 EXPECT_EQ(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 EXPECT_EQ(begin, &nodes[0]);
369 EXPECT_EQ(end, &nodes[3]);
370 EXPECT_EQ(nodes[2].next, &nodes[3]);
371 EXPECT_EQ(nodes[3].prev, &nodes[2]);
372 EXPECT_EQ(nodes[3].next, nullptr);
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, nullptr, &nodes[3]);
384 EXPECT_EQ(begin, &nodes[3]);
385 EXPECT_EQ(end, &nodes[2]);
386 EXPECT_EQ(nodes[0].prev, &nodes[3]);
387 EXPECT_EQ(nodes[3].prev, nullptr);
388 EXPECT_EQ(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], nullptr);
403 EXPECT_EQ(begin, &nodes[0]);
404 EXPECT_EQ(end, &nodes[2]);
405 EXPECT_EQ(nodes[1].next, &nodes[3]);
406 EXPECT_EQ(nodes[2].prev, &nodes[4]);
407 EXPECT_EQ(nodes[3].prev, &nodes[1]);
408 EXPECT_EQ(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], nullptr);
421 EXPECT_EQ(begin, &nodes[0]);
422 EXPECT_EQ(end, &nodes[4]);
423 EXPECT_EQ(nodes[2].next, &nodes[3]);
424 EXPECT_EQ(nodes[3].prev, &nodes[2]);
425 EXPECT_EQ(nodes[4].next, nullptr);
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, nullptr, &nodes[3], nullptr);
438 EXPECT_EQ(begin, &nodes[3]);
439 EXPECT_EQ(end, &nodes[2]);
440 EXPECT_EQ(nodes[0].prev, &nodes[4]);
441 EXPECT_EQ(nodes[3].prev, nullptr);
442 EXPECT_EQ(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), nullptr);
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 EXPECT_EQ(begin, first);
481 EXPECT_EQ(end, third);
482 EXPECT_EQ(first->prev, nullptr);
483 EXPECT_EQ(first->next, third);
484 EXPECT_EQ(third->prev, first);
485 EXPECT_EQ(third->next, nullptr);
487 cx_linked_list_remove(&begin, &end, loc_prev, loc_next, third);
488 EXPECT_EQ(begin, first);
489 EXPECT_EQ(end, first);
490 EXPECT_EQ(first->prev, nullptr);
491 EXPECT_EQ(first->next, nullptr);
493 cx_linked_list_remove(&begin, &end, loc_prev, loc_next, first);
494 EXPECT_EQ(begin, nullptr);
495 EXPECT_EQ(end, nullptr);
496 }
498 TEST(LinkedList_LowLevel, cx_linked_list_size) {
499 EXPECT_EQ(cx_linked_list_size(nullptr, 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) {
513 int_test_data<1500> testdata;
514 std::array<int, 1500> sorted{};
515 std::partial_sort_copy(testdata.data.begin(), testdata.data.end(), sorted.begin(), sorted.end());
517 auto scrambled = create_nodes_test_data(testdata.data.begin(), testdata.data.end());
518 void *begin = scrambled.begin;
519 void *end = cx_linked_list_last(begin, loc_next);
521 cx_linked_list_sort(&begin, &end, loc_prev, loc_next, loc_data, cx_cmp_int);
523 node *check = reinterpret_cast<node *>(begin);
524 node *check_last = nullptr;
525 cx_for_n (i, sorted.size()) {
526 EXPECT_EQ(check->data, sorted[i]);
527 EXPECT_EQ(check->prev, check_last);
528 if (i < sorted.size() - 1) {
529 ASSERT_NE(check->next, nullptr);
530 }
531 check_last = check;
532 check = check->next;
533 }
534 EXPECT_EQ(check, nullptr);
535 EXPECT_EQ(end, check_last);
536 }
538 TEST(LinkedList_LowLevel, cx_linked_list_reverse) {
539 auto testdata = create_nodes_test_data({2, 4, 6, 8});
540 auto expected = create_nodes_test_data({8, 6, 4, 2});
542 auto begin = reinterpret_cast<void *>(testdata.begin);
543 auto end = cx_linked_list_last(begin, loc_next);
544 auto orig_begin = begin, orig_end = end;
546 cx_linked_list_reverse(&begin, &end, loc_prev, loc_next);
547 EXPECT_EQ(end, orig_begin);
548 EXPECT_EQ(begin, orig_end);
549 EXPECT_EQ(cx_linked_list_compare(begin, expected.begin, loc_next, loc_data, cx_cmp_int), 0);
550 }
552 class HighLevelTest : public ::testing::Test {
553 mutable std::unordered_set<CxList *> lists;
554 protected:
555 CxTestingAllocator testingAllocator;
557 void TearDown() override {
558 for (auto &&l: lists) cxListDestroy(l);
559 EXPECT_TRUE(testingAllocator.verify());
560 }
562 static constexpr size_t testdata_len = 250;
563 int_test_data<testdata_len> testdata;
565 auto autofree(CxList *list) const -> CxList * {
566 if (list != nullptr) lists.insert(list);
567 return list;
568 }
570 auto linkedListFromTestData() const -> CxList * {
571 auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int)));
572 cxListAddArray(list, testdata.data.data(), testdata_len);
573 return list;
574 }
576 auto pointerLinkedListFromTestData() const -> CxList * {
577 auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS));
578 // note: cannot use cxListAddArray() because we don't have a list of pointers
579 cx_for_n(i, testdata_len) cxListAdd(list, &testdata.data[i]);
580 return list;
581 }
583 auto arrayListFromTestData() const -> CxList * {
584 auto list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), testdata_len));
585 cxListAddArray(list, testdata.data.data(), testdata_len);
586 return list;
587 }
589 void verifyAdd(
590 CxList *list,
591 bool as_pointer
592 ) {
593 auto len = testdata_len;
594 cx_for_n (i, len) EXPECT_EQ(cxListAdd(list, &testdata.data[i]), 0);
595 EXPECT_EQ(cxListSize(list), len);
596 cx_for_n (i, len) EXPECT_EQ(*(int *) cxListAt(list, i), testdata.data[i]);
597 cx_for_n (i, len) ++testdata.data[i];
598 if (as_pointer) {
599 cx_for_n (i, len) EXPECT_EQ(*(int *) cxListAt(list, i), testdata.data[i]);
600 } else {
601 cx_for_n (i, len) EXPECT_EQ(*(int *) cxListAt(list, i), testdata.data[i] - 1);
602 }
603 }
605 static void verifyInsert(CxList *list) {
606 int a = 5, b = 47, c = 13, d = 42;
608 EXPECT_NE(cxListInsert(list, 1, &a), 0);
609 EXPECT_EQ(cxListSize(list), 0);
610 EXPECT_EQ(cxListInsert(list, 0, &a), 0);
611 EXPECT_EQ(cxListSize(list), 1);
612 EXPECT_EQ(cxListInsert(list, 0, &b), 0);
613 EXPECT_EQ(cxListSize(list), 2);
614 EXPECT_EQ(cxListInsert(list, 1, &c), 0);
615 EXPECT_EQ(cxListSize(list), 3);
616 EXPECT_EQ(cxListInsert(list, 3, &d), 0);
618 ASSERT_EQ(cxListSize(list), 4);
620 EXPECT_EQ(*(int *) cxListAt(list, 0), 47);
621 EXPECT_EQ(*(int *) cxListAt(list, 1), 13);
622 EXPECT_EQ(*(int *) cxListAt(list, 2), 5);
623 EXPECT_EQ(*(int *) cxListAt(list, 3), 42);
624 }
626 static void verifyInsertArray(
627 CxList *list,
628 bool pointers = false
629 ) {
630 int a[5] = {5, 47, 11, 13, 42};
631 int b[5] = {9, 18, 72, 50, 7};
632 int *aptr[5];
633 int *bptr[5];
634 cx_for_n(i, 5) {
635 aptr[i] = &a[i];
636 bptr[i] = &b[i];
637 }
639 size_t inserted;
641 if (pointers) {
642 inserted = cxListInsertArray(list, 0, aptr, 5);
643 } else {
644 inserted = cxListInsertArray(list, 0, a, 5);
645 }
646 EXPECT_EQ(inserted, 5);
647 EXPECT_EQ(*(int *) cxListAt(list, 0), 5);
648 EXPECT_EQ(*(int *) cxListAt(list, 1), 47);
649 EXPECT_EQ(*(int *) cxListAt(list, 2), 11);
650 EXPECT_EQ(*(int *) cxListAt(list, 3), 13);
651 EXPECT_EQ(*(int *) cxListAt(list, 4), 42);
652 if (pointers) {
653 inserted = cxListInsertArray(list, 3, bptr, 5);
654 } else {
655 inserted = cxListInsertArray(list, 3, b, 5);
656 }
657 EXPECT_EQ(inserted, 5);
658 EXPECT_EQ(*(int *) cxListAt(list, 0), 5);
659 EXPECT_EQ(*(int *) cxListAt(list, 1), 47);
660 EXPECT_EQ(*(int *) cxListAt(list, 2), 11);
661 EXPECT_EQ(*(int *) cxListAt(list, 3), 9);
662 EXPECT_EQ(*(int *) cxListAt(list, 4), 18);
663 EXPECT_EQ(*(int *) cxListAt(list, 5), 72);
664 EXPECT_EQ(*(int *) cxListAt(list, 6), 50);
665 EXPECT_EQ(*(int *) cxListAt(list, 7), 7);
666 EXPECT_EQ(*(int *) cxListAt(list, 8), 13);
667 EXPECT_EQ(*(int *) cxListAt(list, 9), 42);
668 }
670 void verifyRemove(CxList *list) const {
671 EXPECT_EQ(cxListRemove(list, 2), 0);
672 EXPECT_EQ(cxListRemove(list, 4), 0);
673 EXPECT_EQ(cxListSize(list), testdata_len - 2);
674 EXPECT_EQ(*(int *) cxListAt(list, 0), testdata.data[0]);
675 EXPECT_EQ(*(int *) cxListAt(list, 1), testdata.data[1]);
676 EXPECT_EQ(*(int *) cxListAt(list, 2), testdata.data[3]);
677 EXPECT_EQ(*(int *) cxListAt(list, 3), testdata.data[4]);
678 EXPECT_EQ(*(int *) cxListAt(list, 4), testdata.data[6]);
680 EXPECT_EQ(cxListRemove(list, 0), 0);
681 EXPECT_EQ(cxListSize(list), testdata_len - 3);
682 EXPECT_EQ(*(int *) cxListAt(list, 0), testdata.data[1]);
683 EXPECT_EQ(*(int *) cxListAt(list, 1), testdata.data[3]);
685 EXPECT_NE(cxListRemove(list, testdata_len), 0);
686 }
688 static void verifyClear(CxList *list) {
689 cxListClear(list);
690 EXPECT_EQ(0, cxListSize(list));
691 }
693 static unsigned destr_test_ctr;
694 static int destr_last_value;
696 static void simple_destr_test_fun(void *data) {
697 auto ptr = (int *) data;
698 destr_last_value = *ptr;
699 *ptr = destr_last_value + 1;
700 destr_test_ctr++;
701 }
703 static void advanced_destr_test_fun(
704 [[maybe_unused]] void *u,
705 void *data
706 ) {
707 simple_destr_test_fun(data);
708 }
710 void verifyAnyDestructor(CxList *list) {
711 int off = cxListIsStoringPointers(list) ? 1 : 0;
713 cxListRemove(list, 15);
714 EXPECT_EQ(1, destr_test_ctr);
715 EXPECT_EQ(testdata.data[15], destr_last_value + off);
716 EXPECT_EQ(testdata_len - destr_test_ctr, cxListSize(list));
717 cxListRemove(list, 47);
718 EXPECT_EQ(2, destr_test_ctr);
719 EXPECT_EQ(testdata.data[48], destr_last_value + off);
720 EXPECT_EQ(testdata_len - destr_test_ctr, cxListSize(list));
722 auto iter = cxListMutIteratorAt(list, 7);
723 cxIteratorNext(iter);
724 EXPECT_EQ(2, destr_test_ctr);
725 EXPECT_EQ(testdata.data[48], destr_last_value + off);
726 EXPECT_EQ(testdata_len - destr_test_ctr, cxListSize(list));
727 cxIteratorFlagRemoval(iter);
728 cxIteratorNext(iter);
729 EXPECT_EQ(3, destr_test_ctr);
730 EXPECT_EQ(testdata.data[8], destr_last_value + off);
731 EXPECT_EQ(testdata_len - destr_test_ctr, cxListSize(list));
733 iter = cxListMutBackwardsIteratorAt(list, 5);
734 cxIteratorNext(iter);
735 EXPECT_EQ(3, destr_test_ctr);
736 EXPECT_EQ(testdata.data[8], destr_last_value + off);
737 EXPECT_EQ(testdata_len - destr_test_ctr, cxListSize(list));
738 cxIteratorFlagRemoval(iter);
739 cxIteratorNext(iter);
740 EXPECT_EQ(4, destr_test_ctr);
741 EXPECT_EQ(testdata.data[4], destr_last_value + off);
742 EXPECT_EQ(testdata_len - destr_test_ctr, cxListSize(list));
744 cxListClear(list);
745 EXPECT_EQ(testdata_len, destr_test_ctr);
746 EXPECT_EQ(testdata.data[testdata_len - 1], destr_last_value + off);
749 }
751 void verifySimpleDestructor(CxList *list) {
752 destr_test_ctr = 0;
753 list->simple_destructor = simple_destr_test_fun;
754 verifyAnyDestructor(list);
755 }
757 void verifyAdvancedDestructor(CxList *list) {
758 destr_test_ctr = 0;
759 list->advanced_destructor = advanced_destr_test_fun;
760 verifyAnyDestructor(list);
761 }
763 static void verifySwap(CxList *list) {
764 ASSERT_EQ(cxListSize(list), 0);
766 int original[16] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15};
767 int swapped[16] = {8, 4, 14, 3, 1, 5, 9, 12, 0, 6, 11, 10, 7, 15, 2, 13};
769 // we have to add the items one by one, because it could be a pointer list
770 cx_for_n(i, 16) {
771 cxListAdd(list, &original[i]);
772 }
774 int result;
776 // execute the test two times with different item sizes
777 result = cxListSwap(list, 1, 4);
778 EXPECT_EQ(0, result);
779 result = cxListSwap(list, 2, 14);
780 EXPECT_EQ(0, result);
781 result = cxListSwap(list, 9, 6);
782 EXPECT_EQ(0, result);
783 result = cxListSwap(list, 3, 3);
784 EXPECT_EQ(0, result);
785 result = cxListSwap(list, 10, 11);
786 EXPECT_EQ(0, result);
787 result = cxListSwap(list, 8, 0);
788 EXPECT_EQ(0, result);
789 result = cxListSwap(list, 7, 12);
790 EXPECT_EQ(0, result);
791 result = cxListSwap(list, 13, 15);
792 EXPECT_EQ(0, result);
794 result = cxListSwap(list, 5, 16);
795 EXPECT_NE(0, result);
796 result = cxListSwap(list, 16, 6);
797 EXPECT_NE(0, result);
798 result = cxListSwap(list, 16, 17);
799 EXPECT_NE(0, result);
801 auto iter = cxListIterator(list);
802 cx_foreach(int*, e, iter) {
803 EXPECT_EQ(*e, swapped[iter.index]);
804 }
805 iter = cxListBackwardsIterator(list);
806 cx_foreach(int*, e, iter) {
807 EXPECT_EQ(*e, swapped[iter.index]);
808 }
809 }
811 void verifyAt(CxList *list) const {
812 auto len = testdata_len;
813 EXPECT_EQ(cxListSize(list), len);
814 cx_for_n (i, len) {
815 EXPECT_EQ(*(int *) cxListAt(list, i), testdata.data[i]);
816 }
817 EXPECT_EQ(cxListAt(list, cxListSize(list)), nullptr);
818 }
820 void verifyFind(CxList *list) const {
821 cx_for_n (attempt, 25) {
822 size_t exp = rand() % testdata_len; // NOLINT(cert-msc50-cpp)
823 int val = testdata.data[exp];
824 // randomly picked number could occur earlier in list - find first position
825 cx_for_n (i, exp) {
826 if (testdata.data[i] == val) {
827 exp = i;
828 break;
829 }
830 }
831 EXPECT_EQ(cxListFind(list, &val), exp);
832 }
834 int notinlist = -1;
835 EXPECT_EQ(cxListSize(list), cxListFind(list, ¬inlist));
836 }
838 void verifySort(CxList *list) const {
839 std::array<int, testdata_len> expected{};
840 std::partial_sort_copy(testdata.data.begin(), testdata.data.end(), expected.begin(), expected.end());
841 cxListSort(list);
842 cx_for_n (i, testdata_len) ASSERT_EQ(*(int *) cxListAt(list, i), expected[i]);
843 }
845 void verifyIterator(CxList *list) const {
846 auto iter = cxListIterator(list);
847 size_t i = 0;
848 cx_foreach(int*, x, iter) {
849 ASSERT_EQ(i, iter.index);
850 EXPECT_EQ(*x, testdata.data[iter.index]);
851 i++;
852 }
853 ASSERT_EQ(i, cxListSize(list));
854 iter = cxListBackwardsIterator(list);
855 cx_foreach(int*, x, iter) {
856 ASSERT_EQ(i - 1, iter.index);
857 EXPECT_EQ(*x, testdata.data[iter.index]);
858 i--;
859 }
860 ASSERT_EQ(i, 0);
861 auto len = testdata_len;
862 i = len / 2;
863 auto mut_iter = cxListMutIteratorAt(list, i);
864 size_t j = 0;
865 cx_foreach(int*, x, mut_iter) {
866 ASSERT_EQ(mut_iter.index, len / 2 + j / 2);
867 ASSERT_EQ(*x, testdata.data[i]);
868 if (i % 2 == 1) cxIteratorFlagRemoval(mut_iter);
869 i++;
870 j++;
871 }
872 ASSERT_EQ(i, len);
873 i = len / 2;
874 j = 0;
875 mut_iter = cxListMutBackwardsIteratorAt(list, i - 1);
876 cx_foreach(int*, x, mut_iter) {
877 ASSERT_EQ(mut_iter.index, len / 2 - 1 - j);
878 ASSERT_EQ(*x, testdata.data[i - 1]);
879 if (i % 2 == 0) cxIteratorFlagRemoval(mut_iter);
880 i--;
881 j++;
882 }
883 ASSERT_EQ(i, 0);
884 ASSERT_EQ(cxListSize(list), len / 2);
885 cx_for_n(j, len / 2) ASSERT_EQ(*(int *) cxListAt(list, j), testdata.data[j * 2]);
886 }
888 static void verifyInsertViaIterator(CxList *list) {
889 int newdata[] = {10, 20, 30, 40, 50};
891 auto iter = cxListMutIteratorAt(list, 2);
892 EXPECT_TRUE(cxIteratorValid(iter));
893 EXPECT_EQ(iter.index, 2);
894 EXPECT_EQ(*(int *) cxIteratorCurrent(iter), 2);
895 cxListInsertAfter(&iter, &newdata[0]);
896 EXPECT_TRUE(cxIteratorValid(iter));
897 EXPECT_EQ(iter.index, 2);
898 EXPECT_EQ(*(int *) cxIteratorCurrent(iter), 2);
899 cxListInsertBefore(&iter, &newdata[1]);
900 EXPECT_TRUE(cxIteratorValid(iter));
901 EXPECT_EQ(iter.index, 3);
902 EXPECT_EQ(*(int *) cxIteratorCurrent(iter), 2);
904 iter = cxListMutIterator(list);
905 cxListInsertBefore(&iter, &newdata[2]);
906 EXPECT_TRUE(cxIteratorValid(iter));
907 EXPECT_EQ(iter.index, 1);
908 EXPECT_EQ(*(int *) cxIteratorCurrent(iter), 0);
909 iter = cxListMutIteratorAt(list, cxListSize(list));
910 cxListInsertBefore(&iter, &newdata[3]);
911 EXPECT_FALSE(cxIteratorValid(iter));
912 EXPECT_EQ(iter.index, 9);
913 iter = cxListMutIteratorAt(list, cxListSize(list));
914 cxListInsertAfter(&iter, &newdata[4]);
915 EXPECT_FALSE(cxIteratorValid(iter));
916 EXPECT_EQ(iter.index, 10);
918 int expdata[] = {30, 0, 1, 20, 2, 10, 3, 4, 40, 50};
919 cx_for_n (j, 10) EXPECT_EQ(*(int *) cxListAt(list, j), expdata[j]);
920 }
922 void verifyReverse(CxList *list) const {
923 cxListReverse(list);
924 cx_for_n(i, testdata_len) {
925 ASSERT_EQ(*(int *) cxListAt(list, i), testdata.data[testdata_len - 1 - i]);
926 }
927 }
929 static void verifyCompare(
930 CxList *left,
931 CxList *right
932 ) {
933 EXPECT_EQ(cxListCompare(left, right), 0);
934 int x = 42;
935 cxListAdd(left, &x);
936 ASSERT_GT(cxListSize(left), cxListSize(right));
937 EXPECT_GT(cxListCompare(left, right), 0);
938 EXPECT_LT(cxListCompare(right, left), 0);
939 cxListAdd(right, &x);
940 ASSERT_EQ(cxListSize(left), cxListSize(right));
941 EXPECT_EQ(cxListCompare(left, right), 0);
942 int a = 5, b = 10;
943 cxListInsert(left, 15, &a);
944 cxListInsert(right, 15, &b);
945 ASSERT_EQ(cxListSize(left), cxListSize(right));
946 EXPECT_LT(cxListCompare(left, right), 0);
947 EXPECT_GT(cxListCompare(right, left), 0);
948 *(int *) cxListAt(left, 15) = 10;
949 EXPECT_EQ(cxListCompare(left, right), 0);
950 }
951 };
953 unsigned HighLevelTest::destr_test_ctr = 0;
954 int HighLevelTest::destr_last_value = 0;
956 class LinkedList : public HighLevelTest {
957 };
959 class PointerLinkedList : public HighLevelTest {
960 };
962 class ArrayList : public HighLevelTest {
963 };
965 TEST_F(PointerLinkedList, cxListStorePointers) {
966 auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, 47));
967 EXPECT_FALSE(cxListIsStoringPointers(list));
968 cxListStorePointers(list);
969 EXPECT_EQ(list->item_size, sizeof(void *));
970 EXPECT_NE(list->cl, nullptr);
971 EXPECT_NE(list->climpl, nullptr);
972 EXPECT_TRUE(cxListIsStoringPointers(list));
973 cxListStoreObjects(list);
974 EXPECT_NE(list->cl, nullptr);
975 EXPECT_EQ(list->climpl, nullptr);
976 EXPECT_FALSE(cxListIsStoringPointers(list));
977 }
979 TEST_F(LinkedList, cxLinkedListCreate) {
980 CxList *list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int)));
981 ASSERT_NE(list, nullptr);
982 EXPECT_EQ(list->item_size, sizeof(int));
983 EXPECT_EQ(list->simple_destructor, nullptr);
984 EXPECT_EQ(list->advanced_destructor, nullptr);
985 EXPECT_EQ(list->destructor_data, nullptr);
986 EXPECT_EQ(cxListSize(list), 0);
987 EXPECT_EQ(list->allocator, &testingAllocator);
988 EXPECT_EQ(list->cmpfunc, cx_cmp_int);
989 EXPECT_FALSE(cxListIsStoringPointers(list));
990 }
992 TEST_F(LinkedList, cxLinkedListCreateSimple) {
993 CxList *list = autofree(cxLinkedListCreateSimple(sizeof(int)));
994 ASSERT_NE(list, nullptr);
995 EXPECT_EQ(list->item_size, sizeof(int));
996 EXPECT_EQ(list->cmpfunc, nullptr);
997 EXPECT_EQ(list->allocator, cxDefaultAllocator);
998 EXPECT_EQ(list->simple_destructor, nullptr);
999 EXPECT_EQ(list->advanced_destructor, nullptr);
1000 EXPECT_EQ(list->destructor_data, nullptr);
1001 EXPECT_EQ(cxListSize(list), 0);
1002 EXPECT_FALSE(cxListIsStoringPointers(list));
1003 }
1005 TEST_F(LinkedList, cxLinkedListCreateSimpleForPointers) {
1006 CxList *list = autofree(cxLinkedListCreateSimple(CX_STORE_POINTERS));
1007 ASSERT_NE(list, nullptr);
1008 EXPECT_EQ(list->item_size, sizeof(void *));
1009 EXPECT_EQ(list->cmpfunc, nullptr);
1010 EXPECT_EQ(list->allocator, cxDefaultAllocator);
1011 EXPECT_EQ(list->simple_destructor, nullptr);
1012 EXPECT_EQ(list->advanced_destructor, nullptr);
1013 EXPECT_EQ(list->destructor_data, nullptr);
1014 EXPECT_EQ(cxListSize(list), 0);
1015 EXPECT_TRUE(cxListIsStoringPointers(list));
1016 }
1018 TEST_F(ArrayList, cxArrayListCreate) {
1019 CxList *list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 8));
1020 ASSERT_NE(list, nullptr);
1021 EXPECT_EQ(list->item_size, sizeof(int));
1022 EXPECT_EQ(list->simple_destructor, nullptr);
1023 EXPECT_EQ(list->advanced_destructor, nullptr);
1024 EXPECT_EQ(list->destructor_data, nullptr);
1025 EXPECT_EQ(cxListSize(list), 0);
1026 EXPECT_EQ(list->allocator, &testingAllocator);
1027 EXPECT_EQ(list->cmpfunc, cx_cmp_int);
1028 EXPECT_FALSE(cxListIsStoringPointers(list));
1029 }
1031 TEST_F(ArrayList, cxArrayListCreateSimple) {
1032 CxList *list = autofree(cxArrayListCreateSimple(sizeof(int), 8));
1033 ASSERT_NE(list, nullptr);
1034 EXPECT_EQ(list->cmpfunc, nullptr);
1035 EXPECT_EQ(list->allocator, cxDefaultAllocator);
1036 EXPECT_EQ(list->item_size, sizeof(int));
1037 EXPECT_EQ(list->simple_destructor, nullptr);
1038 EXPECT_EQ(list->advanced_destructor, nullptr);
1039 EXPECT_EQ(list->destructor_data, nullptr);
1040 EXPECT_EQ(cxListSize(list), 0);
1041 EXPECT_FALSE(cxListIsStoringPointers(list));
1042 }
1044 TEST_F(ArrayList, cxArrayListCreateSimpleForPointers) {
1045 CxList *list = autofree(cxArrayListCreateSimple(CX_STORE_POINTERS, 8));
1046 ASSERT_NE(list, nullptr);
1047 EXPECT_EQ(list->cmpfunc, nullptr);
1048 EXPECT_EQ(list->allocator, cxDefaultAllocator);
1049 EXPECT_EQ(list->item_size, sizeof(void *));
1050 EXPECT_TRUE(cxListIsStoringPointers(list));
1051 }
1053 TEST_F(LinkedList, cxListAdd) {
1054 auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int)));
1055 verifyAdd(list, false);
1056 }
1058 TEST_F(PointerLinkedList, cxListAdd) {
1059 auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS));
1060 verifyAdd(list, true);
1061 }
1063 TEST_F(ArrayList, cxListAdd) {
1064 auto list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 8));
1065 verifyAdd(list, false);
1066 }
1068 TEST_F(LinkedList, cxListInsert) {
1069 verifyInsert(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int))));
1070 }
1072 TEST_F(PointerLinkedList, cxListInsert) {
1073 verifyInsert(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS)));
1074 }
1076 TEST_F(ArrayList, cxListInsert) {
1077 verifyInsert(autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 2)));
1078 }
1080 TEST_F(LinkedList, cxListInsertArray) {
1081 verifyInsertArray(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int))));
1082 }
1084 TEST_F(PointerLinkedList, cxListInsertArray) {
1085 verifyInsertArray(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS)), true);
1086 }
1088 TEST_F(ArrayList, cxListInsertArray) {
1089 verifyInsertArray(autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 4)));
1090 }
1092 TEST_F(LinkedList, cxListRemove) {
1093 verifyRemove(linkedListFromTestData());
1094 }
1096 TEST_F(PointerLinkedList, cxListRemove) {
1097 verifyRemove(pointerLinkedListFromTestData());
1098 }
1100 TEST_F(ArrayList, cxListRemove) {
1101 verifyRemove(arrayListFromTestData());
1102 }
1104 TEST_F(LinkedList, cxListClear) {
1105 verifyClear(linkedListFromTestData());
1106 }
1108 TEST_F(PointerLinkedList, cxListClear) {
1109 verifyClear(pointerLinkedListFromTestData());
1110 }
1112 TEST_F(ArrayList, cxListClear) {
1113 verifyClear(arrayListFromTestData());
1114 }
1116 TEST_F(LinkedList, cxListSwap) {
1117 verifySwap(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int))));
1118 }
1120 TEST_F(PointerLinkedList, cxListSwap) {
1121 verifySwap(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS)));
1122 }
1124 TEST_F(ArrayList, cxListSwap) {
1125 verifySwap(autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 16)));
1126 }
1128 TEST_F(LinkedList, cxListSwapNoSBO) {
1129 CX_DISABLE_LINKED_LIST_SWAP_SBO = true;
1130 verifySwap(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int))));
1131 CX_DISABLE_LINKED_LIST_SWAP_SBO = false;
1132 }
1134 TEST_F(PointerLinkedList, cxListSwapNoSBO) {
1135 CX_DISABLE_LINKED_LIST_SWAP_SBO = true;
1136 verifySwap(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS)));
1137 CX_DISABLE_LINKED_LIST_SWAP_SBO = false;
1138 }
1140 TEST_F(ArrayList, cxListSwapNoSBO) {
1141 CX_DISABLE_LINKED_LIST_SWAP_SBO = true;
1142 verifySwap(autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 16)));
1143 CX_DISABLE_LINKED_LIST_SWAP_SBO = false;
1144 }
1146 TEST_F(LinkedList, cxListAt) {
1147 verifyAt(linkedListFromTestData());
1148 }
1150 TEST_F(PointerLinkedList, cxListAt) {
1151 verifyAt(pointerLinkedListFromTestData());
1152 }
1154 TEST_F(ArrayList, cxListAt) {
1155 verifyAt(arrayListFromTestData());
1156 }
1158 TEST_F(LinkedList, cxListFind) {
1159 verifyFind(linkedListFromTestData());
1160 }
1162 TEST_F(PointerLinkedList, cxListFind) {
1163 verifyFind(pointerLinkedListFromTestData());
1164 }
1166 TEST_F(ArrayList, cxListFind) {
1167 verifyFind(arrayListFromTestData());
1168 }
1170 TEST_F(LinkedList, cxListSort) {
1171 verifySort(linkedListFromTestData());
1172 }
1174 TEST_F(PointerLinkedList, cxListSort) {
1175 verifySort(pointerLinkedListFromTestData());
1176 }
1178 TEST_F(ArrayList, cxListSort) {
1179 verifySort(arrayListFromTestData());
1180 }
1182 TEST_F(LinkedList, Iterator) {
1183 verifyIterator(linkedListFromTestData());
1184 }
1186 TEST_F(PointerLinkedList, Iterator) {
1187 verifyIterator(pointerLinkedListFromTestData());
1188 }
1190 TEST_F(ArrayList, Iterator) {
1191 verifyIterator(arrayListFromTestData());
1192 }
1194 TEST_F(LinkedList, InsertViaIterator) {
1195 int fivenums[] = {0, 1, 2, 3, 4, 5};
1196 CxList *list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int)));
1197 cxListAddArray(list, fivenums, 5);
1198 verifyInsertViaIterator(list);
1199 }
1201 TEST_F(PointerLinkedList, InsertViaIterator) {
1202 int fivenums[] = {0, 1, 2, 3, 4, 5};
1203 auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS));
1204 // note: cannot use cxListAddArray() because we don't have a list of pointers
1205 cx_for_n(i, 5) cxListAdd(list, &fivenums[i]);
1206 verifyInsertViaIterator(list);
1207 }
1209 TEST_F(ArrayList, InsertViaIterator) {
1210 int fivenums[] = {0, 1, 2, 3, 4, 5};
1211 auto list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 4));
1212 cxListAddArray(list, fivenums, 5);
1213 verifyInsertViaIterator(list);
1214 }
1216 TEST_F(LinkedList, cxListReverse) {
1217 verifyReverse(linkedListFromTestData());
1218 }
1220 TEST_F(PointerLinkedList, cxListReverse) {
1221 verifyReverse(pointerLinkedListFromTestData());
1222 }
1224 TEST_F(ArrayList, cxListReverse) {
1225 verifyReverse(arrayListFromTestData());
1226 }
1228 TEST_F(LinkedList, cxListCompare) {
1229 auto left = linkedListFromTestData();
1230 auto right = linkedListFromTestData();
1231 verifyCompare(left, right);
1232 }
1234 TEST_F(LinkedList, cxListCompareWithPtrList) {
1235 auto left = linkedListFromTestData();
1236 auto right = pointerLinkedListFromTestData();
1237 verifyCompare(left, right);
1238 }
1240 TEST_F(LinkedList, cxListCompareWithArrayList) {
1241 auto left = linkedListFromTestData();
1242 auto right = arrayListFromTestData();
1243 verifyCompare(left, right);
1244 }
1246 TEST_F(PointerLinkedList, cxListCompare) {
1247 auto left = pointerLinkedListFromTestData();
1248 auto right = pointerLinkedListFromTestData();
1249 verifyCompare(left, right);
1250 }
1252 TEST_F(PointerLinkedList, cxListCompareWithNormalList) {
1253 auto left = pointerLinkedListFromTestData();
1254 auto right = linkedListFromTestData();
1255 verifyCompare(left, right);
1256 }
1258 TEST_F(PointerLinkedList, cxListCompareWithArrayList) {
1259 auto left = pointerLinkedListFromTestData();
1260 auto right = arrayListFromTestData();
1261 verifyCompare(left, right);
1262 }
1264 TEST_F(ArrayList, cxListCompare) {
1265 auto left = arrayListFromTestData();
1266 auto right = arrayListFromTestData();
1267 verifyCompare(left, right);
1268 }
1270 TEST_F(ArrayList, cxListCompareWithPtrList) {
1271 auto left = arrayListFromTestData();
1272 auto right = pointerLinkedListFromTestData();
1273 verifyCompare(left, right);
1274 }
1276 TEST_F(ArrayList, cxListCompareWithNormalList) {
1277 auto left = arrayListFromTestData();
1278 auto right = linkedListFromTestData();
1279 verifyCompare(left, right);
1280 }
1282 TEST_F(LinkedList, SimpleDestructor) {
1283 verifySimpleDestructor(linkedListFromTestData());
1284 }
1286 TEST_F(PointerLinkedList, SimpleDestructor) {
1287 verifySimpleDestructor(pointerLinkedListFromTestData());
1288 }
1290 TEST_F(ArrayList, SimpleDestructor) {
1291 verifySimpleDestructor(arrayListFromTestData());
1292 }
1294 TEST_F(LinkedList, AdvancedDestructor) {
1295 verifyAdvancedDestructor(linkedListFromTestData());
1296 }
1298 TEST_F(PointerLinkedList, AdvancedDestructor) {
1299 verifyAdvancedDestructor(pointerLinkedListFromTestData());
1300 }
1302 TEST_F(ArrayList, AdvancedDestructor) {
1303 verifyAdvancedDestructor(arrayListFromTestData());
1304 }
1306 TEST_F(PointerLinkedList, DestroyNoDestructor) {
1307 void *item = cxMalloc(&testingAllocator, sizeof(int));
1308 auto list = cxLinkedListCreate(cxDefaultAllocator, cx_cmp_int, CX_STORE_POINTERS);
1309 cxListAdd(list, item);
1310 ASSERT_FALSE(testingAllocator.verify());
1311 cxListDestroy(list);
1312 EXPECT_FALSE(testingAllocator.verify());
1313 cxFree(&testingAllocator, item);
1314 EXPECT_TRUE(testingAllocator.verify());
1315 }
1317 TEST_F(PointerLinkedList, DestroySimpleDestructor) {
1318 int item = 0;
1319 auto list = cxLinkedListCreate(cxDefaultAllocator, cx_cmp_int, CX_STORE_POINTERS);
1320 list->simple_destructor = [](void *elem) { *(int *) elem = 42; };
1321 cxListAdd(list, &item);
1322 cxListDestroy(list);
1323 EXPECT_EQ(item, 42);
1324 }
1326 TEST_F(PointerLinkedList, DestroyAdvancedDestructor) {
1327 void *item = cxMalloc(&testingAllocator, sizeof(int));
1328 auto list = cxLinkedListCreate(cxDefaultAllocator, cx_cmp_int, CX_STORE_POINTERS);
1329 list->destructor_data = &testingAllocator;
1330 list->advanced_destructor = (cx_destructor_func2) cxFree;
1331 cxListAdd(list, item);
1332 ASSERT_FALSE(testingAllocator.verify());
1333 cxListDestroy(list);
1334 EXPECT_TRUE(testingAllocator.verify());
1335 }
