tests/test_list.cpp@022fbd4bc057
tests/test_list.cpp
Sun, 09 Apr 2023 19:37:00 +0200
- author
- Mike Becker <universe@uap-core.de>
- date
- Sun, 09 Apr 2023 19:37:00 +0200
- changeset 679
- 022fbd4bc057
- parent 677
- b09aae58bba4
- child 680
- 19379743e5a0
- permissions
- -rw-r--r--
add pointer array 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 = 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 auto pointerArrayListFromTestData() const -> CxList * {
590 auto list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS, 256));
591 // note: cannot use cxListAddArray() because we don't have a list of pointers
592 cx_for_n(i, testdata_len) cxListAdd(list, &testdata.data[i]);
593 return list;
594 }
596 void verifyAdd(
597 CxList *list,
598 bool as_pointer
599 ) {
600 auto len = testdata_len;
601 cx_for_n (i, len) EXPECT_EQ(cxListAdd(list, &testdata.data[i]), 0);
602 EXPECT_EQ(cxListSize(list), len);
603 cx_for_n (i, len) EXPECT_EQ(*(int *) cxListAt(list, i), testdata.data[i]);
604 cx_for_n (i, len) ++testdata.data[i];
605 if (as_pointer) {
606 cx_for_n (i, len) EXPECT_EQ(*(int *) cxListAt(list, i), testdata.data[i]);
607 } else {
608 cx_for_n (i, len) EXPECT_EQ(*(int *) cxListAt(list, i), testdata.data[i] - 1);
609 }
610 }
612 static void verifyInsert(CxList *list) {
613 int a = 5, b = 47, c = 13, d = 42;
615 EXPECT_NE(cxListInsert(list, 1, &a), 0);
616 EXPECT_EQ(cxListSize(list), 0);
617 EXPECT_EQ(cxListInsert(list, 0, &a), 0);
618 EXPECT_EQ(cxListSize(list), 1);
619 EXPECT_EQ(cxListInsert(list, 0, &b), 0);
620 EXPECT_EQ(cxListSize(list), 2);
621 EXPECT_EQ(cxListInsert(list, 1, &c), 0);
622 EXPECT_EQ(cxListSize(list), 3);
623 EXPECT_EQ(cxListInsert(list, 3, &d), 0);
625 ASSERT_EQ(cxListSize(list), 4);
627 EXPECT_EQ(*(int *) cxListAt(list, 0), 47);
628 EXPECT_EQ(*(int *) cxListAt(list, 1), 13);
629 EXPECT_EQ(*(int *) cxListAt(list, 2), 5);
630 EXPECT_EQ(*(int *) cxListAt(list, 3), 42);
631 }
633 static void verifyInsertArray(
634 CxList *list,
635 bool pointers = false
636 ) {
637 int a[5] = {5, 47, 11, 13, 42};
638 int b[5] = {9, 18, 72, 50, 7};
639 int *aptr[5];
640 int *bptr[5];
641 cx_for_n(i, 5) {
642 aptr[i] = &a[i];
643 bptr[i] = &b[i];
644 }
646 size_t inserted;
648 if (pointers) {
649 inserted = cxListInsertArray(list, 0, aptr, 5);
650 } else {
651 inserted = cxListInsertArray(list, 0, a, 5);
652 }
653 EXPECT_EQ(inserted, 5);
654 EXPECT_EQ(*(int *) cxListAt(list, 0), 5);
655 EXPECT_EQ(*(int *) cxListAt(list, 1), 47);
656 EXPECT_EQ(*(int *) cxListAt(list, 2), 11);
657 EXPECT_EQ(*(int *) cxListAt(list, 3), 13);
658 EXPECT_EQ(*(int *) cxListAt(list, 4), 42);
659 if (pointers) {
660 inserted = cxListInsertArray(list, 3, bptr, 5);
661 } else {
662 inserted = cxListInsertArray(list, 3, b, 5);
663 }
664 EXPECT_EQ(inserted, 5);
665 EXPECT_EQ(*(int *) cxListAt(list, 0), 5);
666 EXPECT_EQ(*(int *) cxListAt(list, 1), 47);
667 EXPECT_EQ(*(int *) cxListAt(list, 2), 11);
668 EXPECT_EQ(*(int *) cxListAt(list, 3), 9);
669 EXPECT_EQ(*(int *) cxListAt(list, 4), 18);
670 EXPECT_EQ(*(int *) cxListAt(list, 5), 72);
671 EXPECT_EQ(*(int *) cxListAt(list, 6), 50);
672 EXPECT_EQ(*(int *) cxListAt(list, 7), 7);
673 EXPECT_EQ(*(int *) cxListAt(list, 8), 13);
674 EXPECT_EQ(*(int *) cxListAt(list, 9), 42);
675 }
677 void verifyRemove(CxList *list) const {
678 EXPECT_EQ(cxListRemove(list, 2), 0);
679 EXPECT_EQ(cxListRemove(list, 4), 0);
680 EXPECT_EQ(cxListSize(list), testdata_len - 2);
681 EXPECT_EQ(*(int *) cxListAt(list, 0), testdata.data[0]);
682 EXPECT_EQ(*(int *) cxListAt(list, 1), testdata.data[1]);
683 EXPECT_EQ(*(int *) cxListAt(list, 2), testdata.data[3]);
684 EXPECT_EQ(*(int *) cxListAt(list, 3), testdata.data[4]);
685 EXPECT_EQ(*(int *) cxListAt(list, 4), testdata.data[6]);
687 EXPECT_EQ(cxListRemove(list, 0), 0);
688 EXPECT_EQ(cxListSize(list), testdata_len - 3);
689 EXPECT_EQ(*(int *) cxListAt(list, 0), testdata.data[1]);
690 EXPECT_EQ(*(int *) cxListAt(list, 1), testdata.data[3]);
692 EXPECT_NE(cxListRemove(list, testdata_len), 0);
693 }
695 static void verifyClear(CxList *list) {
696 cxListClear(list);
697 EXPECT_EQ(0, cxListSize(list));
698 }
700 static unsigned destr_test_ctr;
701 static int destr_last_value;
703 static void simple_destr_test_fun(void *data) {
704 auto ptr = (int *) data;
705 destr_last_value = *ptr;
706 *ptr = destr_last_value + 1;
707 destr_test_ctr++;
708 }
710 static void advanced_destr_test_fun(
711 [[maybe_unused]] void *u,
712 void *data
713 ) {
714 simple_destr_test_fun(data);
715 }
717 void verifyAnyDestructor(CxList *list) {
718 int off = cxListIsStoringPointers(list) ? 1 : 0;
720 cxListRemove(list, 15);
721 EXPECT_EQ(1, destr_test_ctr);
722 EXPECT_EQ(testdata.data[15], destr_last_value + off);
723 EXPECT_EQ(testdata_len - destr_test_ctr, cxListSize(list));
724 cxListRemove(list, 47);
725 EXPECT_EQ(2, destr_test_ctr);
726 EXPECT_EQ(testdata.data[48], destr_last_value + off);
727 EXPECT_EQ(testdata_len - destr_test_ctr, cxListSize(list));
729 auto iter = cxListMutIteratorAt(list, 7);
730 cxIteratorNext(iter);
731 EXPECT_EQ(2, destr_test_ctr);
732 EXPECT_EQ(testdata.data[48], destr_last_value + off);
733 EXPECT_EQ(testdata_len - destr_test_ctr, cxListSize(list));
734 cxIteratorFlagRemoval(iter);
735 cxIteratorNext(iter);
736 EXPECT_EQ(3, destr_test_ctr);
737 EXPECT_EQ(testdata.data[8], destr_last_value + off);
738 EXPECT_EQ(testdata_len - destr_test_ctr, cxListSize(list));
740 iter = cxListMutBackwardsIteratorAt(list, 5);
741 cxIteratorNext(iter);
742 EXPECT_EQ(3, destr_test_ctr);
743 EXPECT_EQ(testdata.data[8], destr_last_value + off);
744 EXPECT_EQ(testdata_len - destr_test_ctr, cxListSize(list));
745 cxIteratorFlagRemoval(iter);
746 cxIteratorNext(iter);
747 EXPECT_EQ(4, destr_test_ctr);
748 EXPECT_EQ(testdata.data[4], destr_last_value + off);
749 EXPECT_EQ(testdata_len - destr_test_ctr, cxListSize(list));
751 cxListClear(list);
752 EXPECT_EQ(testdata_len, destr_test_ctr);
753 EXPECT_EQ(testdata.data[testdata_len - 1], destr_last_value + off);
756 }
758 void verifySimpleDestructor(CxList *list) {
759 destr_test_ctr = 0;
760 list->simple_destructor = simple_destr_test_fun;
761 verifyAnyDestructor(list);
762 }
764 void verifyAdvancedDestructor(CxList *list) {
765 destr_test_ctr = 0;
766 list->advanced_destructor = advanced_destr_test_fun;
767 verifyAnyDestructor(list);
768 }
770 static void verifySwap(CxList *list) {
771 ASSERT_EQ(cxListSize(list), 0);
773 int original[16] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15};
774 int swapped[16] = {8, 4, 14, 3, 1, 5, 9, 12, 0, 6, 11, 10, 7, 15, 2, 13};
776 // we have to add the items one by one, because it could be a pointer list
777 cx_for_n(i, 16) {
778 cxListAdd(list, &original[i]);
779 }
781 int result;
783 // execute the test two times with different item sizes
784 result = cxListSwap(list, 1, 4);
785 EXPECT_EQ(0, result);
786 result = cxListSwap(list, 2, 14);
787 EXPECT_EQ(0, result);
788 result = cxListSwap(list, 9, 6);
789 EXPECT_EQ(0, result);
790 result = cxListSwap(list, 3, 3);
791 EXPECT_EQ(0, result);
792 result = cxListSwap(list, 10, 11);
793 EXPECT_EQ(0, result);
794 result = cxListSwap(list, 8, 0);
795 EXPECT_EQ(0, result);
796 result = cxListSwap(list, 7, 12);
797 EXPECT_EQ(0, result);
798 result = cxListSwap(list, 13, 15);
799 EXPECT_EQ(0, result);
801 result = cxListSwap(list, 5, 16);
802 EXPECT_NE(0, result);
803 result = cxListSwap(list, 16, 6);
804 EXPECT_NE(0, result);
805 result = cxListSwap(list, 16, 17);
806 EXPECT_NE(0, result);
808 auto iter = cxListIterator(list);
809 cx_foreach(int*, e, iter) {
810 EXPECT_EQ(*e, swapped[iter.index]);
811 }
812 iter = cxListBackwardsIterator(list);
813 cx_foreach(int*, e, iter) {
814 EXPECT_EQ(*e, swapped[iter.index]);
815 }
816 }
818 void verifyAt(CxList *list) const {
819 auto len = testdata_len;
820 EXPECT_EQ(cxListSize(list), len);
821 cx_for_n (i, len) {
822 EXPECT_EQ(*(int *) cxListAt(list, i), testdata.data[i]);
823 }
824 EXPECT_EQ(cxListAt(list, cxListSize(list)), nullptr);
825 }
827 void verifyFind(CxList *list) const {
828 cx_for_n (attempt, 25) {
829 size_t exp = rand() % testdata_len; // NOLINT(cert-msc50-cpp)
830 int val = testdata.data[exp];
831 // randomly picked number could occur earlier in list - find first position
832 cx_for_n (i, exp) {
833 if (testdata.data[i] == val) {
834 exp = i;
835 break;
836 }
837 }
838 EXPECT_EQ(cxListFind(list, &val), exp);
839 }
841 int notinlist = -1;
842 EXPECT_EQ(cxListSize(list), cxListFind(list, ¬inlist));
843 }
845 void verifySort(CxList *list) const {
846 std::array<int, testdata_len> expected{};
847 std::partial_sort_copy(testdata.data.begin(), testdata.data.end(), expected.begin(), expected.end());
848 cxListSort(list);
849 cx_for_n (i, testdata_len) ASSERT_EQ(*(int *) cxListAt(list, i), expected[i]);
850 }
852 void verifyIterator(CxList *list) const {
853 auto iter = cxListIterator(list);
854 size_t i = 0;
855 cx_foreach(int*, x, iter) {
856 ASSERT_EQ(i, iter.index);
857 EXPECT_EQ(*x, testdata.data[iter.index]);
858 i++;
859 }
860 ASSERT_EQ(i, cxListSize(list));
861 iter = cxListBackwardsIterator(list);
862 cx_foreach(int*, x, iter) {
863 ASSERT_EQ(i - 1, iter.index);
864 EXPECT_EQ(*x, testdata.data[iter.index]);
865 i--;
866 }
867 ASSERT_EQ(i, 0);
868 auto len = testdata_len;
869 i = len / 2;
870 auto mut_iter = cxListMutIteratorAt(list, i);
871 size_t j = 0;
872 cx_foreach(int*, x, mut_iter) {
873 ASSERT_EQ(mut_iter.index, len / 2 + j / 2);
874 ASSERT_EQ(*x, testdata.data[i]);
875 if (i % 2 == 1) cxIteratorFlagRemoval(mut_iter);
876 i++;
877 j++;
878 }
879 ASSERT_EQ(i, len);
880 i = len / 2;
881 j = 0;
882 mut_iter = cxListMutBackwardsIteratorAt(list, i - 1);
883 cx_foreach(int*, x, mut_iter) {
884 ASSERT_EQ(mut_iter.index, len / 2 - 1 - j);
885 ASSERT_EQ(*x, testdata.data[i - 1]);
886 if (i % 2 == 0) cxIteratorFlagRemoval(mut_iter);
887 i--;
888 j++;
889 }
890 ASSERT_EQ(i, 0);
891 ASSERT_EQ(cxListSize(list), len / 2);
892 cx_for_n(j, len / 2) ASSERT_EQ(*(int *) cxListAt(list, j), testdata.data[j * 2]);
893 }
895 static void verifyInsertViaIterator(CxList *list) {
896 int newdata[] = {10, 20, 30, 40, 50};
898 auto iter = cxListMutIteratorAt(list, 2);
899 EXPECT_TRUE(cxIteratorValid(iter));
900 EXPECT_EQ(iter.index, 2);
901 EXPECT_EQ(*(int *) cxIteratorCurrent(iter), 2);
902 cxListInsertAfter(&iter, &newdata[0]);
903 EXPECT_TRUE(cxIteratorValid(iter));
904 EXPECT_EQ(iter.index, 2);
905 EXPECT_EQ(*(int *) cxIteratorCurrent(iter), 2);
906 cxListInsertBefore(&iter, &newdata[1]);
907 EXPECT_TRUE(cxIteratorValid(iter));
908 EXPECT_EQ(iter.index, 3);
909 EXPECT_EQ(*(int *) cxIteratorCurrent(iter), 2);
911 iter = cxListMutIterator(list);
912 cxListInsertBefore(&iter, &newdata[2]);
913 EXPECT_TRUE(cxIteratorValid(iter));
914 EXPECT_EQ(iter.index, 1);
915 EXPECT_EQ(*(int *) cxIteratorCurrent(iter), 0);
916 iter = cxListMutIteratorAt(list, cxListSize(list));
917 cxListInsertBefore(&iter, &newdata[3]);
918 EXPECT_FALSE(cxIteratorValid(iter));
919 EXPECT_EQ(iter.index, 9);
920 iter = cxListMutIteratorAt(list, cxListSize(list));
921 cxListInsertAfter(&iter, &newdata[4]);
922 EXPECT_FALSE(cxIteratorValid(iter));
923 EXPECT_EQ(iter.index, 10);
925 int expdata[] = {30, 0, 1, 20, 2, 10, 3, 4, 40, 50};
926 cx_for_n (j, 10) EXPECT_EQ(*(int *) cxListAt(list, j), expdata[j]);
927 }
929 void verifyReverse(CxList *list) const {
930 cxListReverse(list);
931 cx_for_n(i, testdata_len) {
932 ASSERT_EQ(*(int *) cxListAt(list, i), testdata.data[testdata_len - 1 - i]);
933 }
934 }
936 static void verifyCompare(
937 CxList *left,
938 CxList *right
939 ) {
940 EXPECT_EQ(cxListCompare(left, right), 0);
941 int x = 42;
942 cxListAdd(left, &x);
943 ASSERT_GT(cxListSize(left), cxListSize(right));
944 EXPECT_GT(cxListCompare(left, right), 0);
945 EXPECT_LT(cxListCompare(right, left), 0);
946 cxListAdd(right, &x);
947 ASSERT_EQ(cxListSize(left), cxListSize(right));
948 EXPECT_EQ(cxListCompare(left, right), 0);
949 int a = 5, b = 10;
950 cxListInsert(left, 15, &a);
951 cxListInsert(right, 15, &b);
952 ASSERT_EQ(cxListSize(left), cxListSize(right));
953 EXPECT_LT(cxListCompare(left, right), 0);
954 EXPECT_GT(cxListCompare(right, left), 0);
955 *(int *) cxListAt(left, 15) = 10;
956 EXPECT_EQ(cxListCompare(left, right), 0);
957 }
958 };
960 unsigned HighLevelTest::destr_test_ctr = 0;
961 int HighLevelTest::destr_last_value = 0;
963 class LinkedList : public HighLevelTest {
964 };
966 class PointerLinkedList : public HighLevelTest {
967 };
969 class ArrayList : public HighLevelTest {
970 };
972 class PointerArrayList : public HighLevelTest {
973 };
975 TEST_F(PointerLinkedList, cxListStorePointers) {
976 auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, 47));
977 EXPECT_FALSE(cxListIsStoringPointers(list));
978 cxListStorePointers(list);
979 EXPECT_EQ(list->item_size, sizeof(void *));
980 EXPECT_NE(list->cl, nullptr);
981 EXPECT_NE(list->climpl, nullptr);
982 EXPECT_TRUE(cxListIsStoringPointers(list));
983 cxListStoreObjects(list);
984 EXPECT_NE(list->cl, nullptr);
985 EXPECT_EQ(list->climpl, nullptr);
986 EXPECT_FALSE(cxListIsStoringPointers(list));
987 }
989 TEST_F(LinkedList, cxLinkedListCreate) {
990 CxList *list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int)));
991 ASSERT_NE(list, nullptr);
992 EXPECT_EQ(list->item_size, sizeof(int));
993 EXPECT_EQ(list->simple_destructor, nullptr);
994 EXPECT_EQ(list->advanced_destructor, nullptr);
995 EXPECT_EQ(list->destructor_data, nullptr);
996 EXPECT_EQ(cxListSize(list), 0);
997 EXPECT_EQ(list->allocator, &testingAllocator);
998 EXPECT_EQ(list->cmpfunc, cx_cmp_int);
999 EXPECT_FALSE(cxListIsStoringPointers(list));
1000 }
1002 TEST_F(LinkedList, cxLinkedListCreateSimple) {
1003 CxList *list = autofree(cxLinkedListCreateSimple(sizeof(int)));
1004 ASSERT_NE(list, nullptr);
1005 EXPECT_EQ(list->item_size, sizeof(int));
1006 EXPECT_EQ(list->cmpfunc, nullptr);
1007 EXPECT_EQ(list->allocator, cxDefaultAllocator);
1008 EXPECT_EQ(list->simple_destructor, nullptr);
1009 EXPECT_EQ(list->advanced_destructor, nullptr);
1010 EXPECT_EQ(list->destructor_data, nullptr);
1011 EXPECT_EQ(cxListSize(list), 0);
1012 EXPECT_FALSE(cxListIsStoringPointers(list));
1013 }
1015 TEST_F(PointerLinkedList, cxLinkedListCreateSimpleForPointers) {
1016 CxList *list = autofree(cxLinkedListCreateSimple(CX_STORE_POINTERS));
1017 ASSERT_NE(list, nullptr);
1018 EXPECT_EQ(list->item_size, sizeof(void *));
1019 EXPECT_EQ(list->cmpfunc, nullptr);
1020 EXPECT_EQ(list->allocator, cxDefaultAllocator);
1021 EXPECT_EQ(list->simple_destructor, nullptr);
1022 EXPECT_EQ(list->advanced_destructor, nullptr);
1023 EXPECT_EQ(list->destructor_data, nullptr);
1024 EXPECT_EQ(cxListSize(list), 0);
1025 EXPECT_TRUE(cxListIsStoringPointers(list));
1026 }
1028 TEST_F(ArrayList, cxArrayListCreate) {
1029 CxList *list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 8));
1030 ASSERT_NE(list, nullptr);
1031 EXPECT_EQ(list->item_size, sizeof(int));
1032 EXPECT_EQ(list->simple_destructor, nullptr);
1033 EXPECT_EQ(list->advanced_destructor, nullptr);
1034 EXPECT_EQ(list->destructor_data, nullptr);
1035 EXPECT_EQ(cxListSize(list), 0);
1036 EXPECT_EQ(list->allocator, &testingAllocator);
1037 EXPECT_EQ(list->cmpfunc, cx_cmp_int);
1038 EXPECT_FALSE(cxListIsStoringPointers(list));
1039 }
1041 TEST_F(ArrayList, cxArrayListCreateSimple) {
1042 CxList *list = autofree(cxArrayListCreateSimple(sizeof(int), 8));
1043 ASSERT_NE(list, nullptr);
1044 EXPECT_EQ(list->cmpfunc, nullptr);
1045 EXPECT_EQ(list->allocator, cxDefaultAllocator);
1046 EXPECT_EQ(list->item_size, sizeof(int));
1047 EXPECT_EQ(list->simple_destructor, nullptr);
1048 EXPECT_EQ(list->advanced_destructor, nullptr);
1049 EXPECT_EQ(list->destructor_data, nullptr);
1050 EXPECT_EQ(cxListSize(list), 0);
1051 EXPECT_FALSE(cxListIsStoringPointers(list));
1052 }
1054 TEST_F(PointerArrayList, cxArrayListCreateSimpleForPointers) {
1055 CxList *list = autofree(cxArrayListCreateSimple(CX_STORE_POINTERS, 8));
1056 ASSERT_NE(list, nullptr);
1057 EXPECT_EQ(list->cmpfunc, nullptr);
1058 EXPECT_EQ(list->allocator, cxDefaultAllocator);
1059 EXPECT_EQ(list->item_size, sizeof(void *));
1060 EXPECT_TRUE(cxListIsStoringPointers(list));
1061 }
1063 TEST_F(LinkedList, cxListAdd) {
1064 auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int)));
1065 verifyAdd(list, false);
1066 }
1068 TEST_F(PointerLinkedList, cxListAdd) {
1069 auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS));
1070 verifyAdd(list, true);
1071 }
1073 TEST_F(ArrayList, cxListAdd) {
1074 auto list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 8));
1075 verifyAdd(list, false);
1076 }
1078 TEST_F(PointerArrayList, cxListAdd) {
1079 auto list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS, 8));
1080 verifyAdd(list, true);
1081 }
1083 TEST_F(LinkedList, cxListInsert) {
1084 verifyInsert(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int))));
1085 }
1087 TEST_F(PointerLinkedList, cxListInsert) {
1088 verifyInsert(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS)));
1089 }
1091 TEST_F(ArrayList, cxListInsert) {
1092 verifyInsert(autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 2)));
1093 }
1095 TEST_F(PointerArrayList, cxListInsert) {
1096 verifyInsert(autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS, 2)));
1097 }
1099 TEST_F(LinkedList, cxListInsertArray) {
1100 verifyInsertArray(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int))));
1101 }
1103 TEST_F(PointerLinkedList, cxListInsertArray) {
1104 verifyInsertArray(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS)), true);
1105 }
1107 TEST_F(ArrayList, cxListInsertArray) {
1108 verifyInsertArray(autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 4)));
1109 }
1111 TEST_F(PointerArrayList, cxListInsertArray) {
1112 verifyInsertArray(autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS, 4)), true);
1113 }
1115 TEST_F(LinkedList, cxListRemove) {
1116 verifyRemove(linkedListFromTestData());
1117 }
1119 TEST_F(PointerLinkedList, cxListRemove) {
1120 verifyRemove(pointerLinkedListFromTestData());
1121 }
1123 TEST_F(ArrayList, cxListRemove) {
1124 verifyRemove(arrayListFromTestData());
1125 }
1127 TEST_F(PointerArrayList, cxListRemove) {
1128 verifyRemove(pointerArrayListFromTestData());
1129 }
1131 TEST_F(LinkedList, cxListClear) {
1132 verifyClear(linkedListFromTestData());
1133 }
1135 TEST_F(PointerLinkedList, cxListClear) {
1136 verifyClear(pointerLinkedListFromTestData());
1137 }
1139 TEST_F(ArrayList, cxListClear) {
1140 verifyClear(arrayListFromTestData());
1141 }
1143 TEST_F(PointerArrayList, cxListClear) {
1144 verifyClear(pointerArrayListFromTestData());
1145 }
1147 TEST_F(LinkedList, cxListSwap) {
1148 verifySwap(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int))));
1149 }
1151 TEST_F(PointerLinkedList, cxListSwap) {
1152 verifySwap(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS)));
1153 }
1155 TEST_F(ArrayList, cxListSwap) {
1156 verifySwap(autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 16)));
1157 }
1159 TEST_F(PointerArrayList, cxListSwap) {
1160 verifySwap(autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS, 16)));
1161 }
1163 TEST_F(LinkedList, cxListSwapNoSBO) {
1164 CX_DISABLE_LINKED_LIST_SWAP_SBO = true;
1165 verifySwap(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int))));
1166 CX_DISABLE_LINKED_LIST_SWAP_SBO = false;
1167 }
1169 TEST_F(PointerLinkedList, cxListSwapNoSBO) {
1170 CX_DISABLE_LINKED_LIST_SWAP_SBO = true;
1171 verifySwap(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS)));
1172 CX_DISABLE_LINKED_LIST_SWAP_SBO = false;
1173 }
1175 TEST_F(LinkedList, cxListAt) {
1176 verifyAt(linkedListFromTestData());
1177 }
1179 TEST_F(PointerLinkedList, cxListAt) {
1180 verifyAt(pointerLinkedListFromTestData());
1181 }
1183 TEST_F(ArrayList, cxListAt) {
1184 verifyAt(arrayListFromTestData());
1185 }
1187 TEST_F(PointerArrayList, cxListAt) {
1188 verifyAt(pointerArrayListFromTestData());
1189 }
1191 TEST_F(LinkedList, cxListFind) {
1192 verifyFind(linkedListFromTestData());
1193 }
1195 TEST_F(PointerLinkedList, cxListFind) {
1196 verifyFind(pointerLinkedListFromTestData());
1197 }
1199 TEST_F(ArrayList, cxListFind) {
1200 verifyFind(arrayListFromTestData());
1201 }
1203 TEST_F(PointerArrayList, cxListFind) {
1204 verifyFind(pointerArrayListFromTestData());
1205 }
1207 TEST_F(LinkedList, cxListSort) {
1208 verifySort(linkedListFromTestData());
1209 }
1211 TEST_F(PointerLinkedList, cxListSort) {
1212 verifySort(pointerLinkedListFromTestData());
1213 }
1215 TEST_F(ArrayList, cxListSort) {
1216 verifySort(arrayListFromTestData());
1217 }
1219 TEST_F(PointerArrayList, cxListSort) {
1220 verifySort(pointerArrayListFromTestData());
1221 }
1223 TEST_F(LinkedList, Iterator) {
1224 verifyIterator(linkedListFromTestData());
1225 }
1227 TEST_F(PointerLinkedList, Iterator) {
1228 verifyIterator(pointerLinkedListFromTestData());
1229 }
1231 TEST_F(ArrayList, Iterator) {
1232 verifyIterator(arrayListFromTestData());
1233 }
1235 TEST_F(PointerArrayList, Iterator) {
1236 verifyIterator(pointerArrayListFromTestData());
1237 }
1239 TEST_F(LinkedList, InsertViaIterator) {
1240 int fivenums[] = {0, 1, 2, 3, 4, 5};
1241 CxList *list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int)));
1242 cxListAddArray(list, fivenums, 5);
1243 verifyInsertViaIterator(list);
1244 }
1246 TEST_F(PointerLinkedList, InsertViaIterator) {
1247 int fivenums[] = {0, 1, 2, 3, 4, 5};
1248 auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS));
1249 // note: cannot use cxListAddArray() because we don't have a list of pointers
1250 cx_for_n(i, 5) cxListAdd(list, &fivenums[i]);
1251 verifyInsertViaIterator(list);
1252 }
1254 TEST_F(ArrayList, InsertViaIterator) {
1255 int fivenums[] = {0, 1, 2, 3, 4, 5};
1256 auto list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 4));
1257 cxListAddArray(list, fivenums, 5);
1258 verifyInsertViaIterator(list);
1259 }
1261 TEST_F(PointerArrayList, InsertViaIterator) {
1262 int fivenums[] = {0, 1, 2, 3, 4, 5};
1263 auto list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS, 4));
1264 // note: cannot use cxListAddArray() because we don't have a list of pointers
1265 cx_for_n(i, 5) cxListAdd(list, &fivenums[i]);
1266 verifyInsertViaIterator(list);
1267 }
1269 TEST_F(LinkedList, cxListReverse) {
1270 verifyReverse(linkedListFromTestData());
1271 }
1273 TEST_F(PointerLinkedList, cxListReverse) {
1274 verifyReverse(pointerLinkedListFromTestData());
1275 }
1277 TEST_F(ArrayList, cxListReverse) {
1278 verifyReverse(arrayListFromTestData());
1279 }
1281 TEST_F(PointerArrayList, cxListReverse) {
1282 verifyReverse(pointerArrayListFromTestData());
1283 }
1285 TEST_F(LinkedList, cxListCompare) {
1286 auto left = linkedListFromTestData();
1287 auto right = linkedListFromTestData();
1288 verifyCompare(left, right);
1289 }
1291 TEST_F(LinkedList, cxListCompareWithPtrList) {
1292 auto left = linkedListFromTestData();
1293 auto right = pointerLinkedListFromTestData();
1294 verifyCompare(left, right);
1295 }
1297 TEST_F(LinkedList, cxListCompareWithArrayList) {
1298 auto left = linkedListFromTestData();
1299 auto right = arrayListFromTestData();
1300 verifyCompare(left, right);
1301 }
1303 TEST_F(LinkedList, cxListCompareWithPtrArrayList) {
1304 auto left = linkedListFromTestData();
1305 auto right = pointerArrayListFromTestData();
1306 verifyCompare(left, right);
1307 }
1309 TEST_F(PointerLinkedList, cxListCompare) {
1310 auto left = pointerLinkedListFromTestData();
1311 auto right = pointerLinkedListFromTestData();
1312 verifyCompare(left, right);
1313 }
1315 TEST_F(PointerLinkedList, cxListCompareWithNormalList) {
1316 auto left = pointerLinkedListFromTestData();
1317 auto right = linkedListFromTestData();
1318 verifyCompare(left, right);
1319 }
1321 TEST_F(PointerLinkedList, cxListCompareWithArrayList) {
1322 auto left = pointerLinkedListFromTestData();
1323 auto right = arrayListFromTestData();
1324 verifyCompare(left, right);
1325 }
1327 TEST_F(PointerLinkedList, cxListCompareWithPtrArrayList) {
1328 auto left = pointerLinkedListFromTestData();
1329 auto right = pointerArrayListFromTestData();
1330 verifyCompare(left, right);
1331 }
1333 TEST_F(ArrayList, cxListCompare) {
1334 auto left = arrayListFromTestData();
1335 auto right = arrayListFromTestData();
1336 verifyCompare(left, right);
1337 }
1339 TEST_F(ArrayList, cxListCompareWithPtrList) {
1340 auto left = arrayListFromTestData();
1341 auto right = pointerLinkedListFromTestData();
1342 verifyCompare(left, right);
1343 }
1345 TEST_F(ArrayList, cxListCompareWithNormalList) {
1346 auto left = arrayListFromTestData();
1347 auto right = linkedListFromTestData();
1348 verifyCompare(left, right);
1349 }
1351 TEST_F(ArrayList, cxListCompareWithPtrArrayList) {
1352 auto left = arrayListFromTestData();
1353 auto right = pointerArrayListFromTestData();
1354 verifyCompare(left, right);
1355 }
1357 TEST_F(PointerArrayList, cxListCompare) {
1358 auto left = pointerArrayListFromTestData();
1359 auto right = pointerArrayListFromTestData();
1360 verifyCompare(left, right);
1361 }
1363 TEST_F(PointerArrayList, cxListCompareWithPtrList) {
1364 auto left = pointerArrayListFromTestData();
1365 auto right = pointerLinkedListFromTestData();
1366 verifyCompare(left, right);
1367 }
1369 TEST_F(PointerArrayList, cxListCompareWithNormalList) {
1370 auto left = pointerArrayListFromTestData();
1371 auto right = linkedListFromTestData();
1372 verifyCompare(left, right);
1373 }
1375 TEST_F(PointerArrayList, cxListCompareWithNormalArrayList) {
1376 auto left = pointerArrayListFromTestData();
1377 auto right = arrayListFromTestData();
1378 verifyCompare(left, right);
1379 }
1381 TEST_F(LinkedList, SimpleDestructor) {
1382 verifySimpleDestructor(linkedListFromTestData());
1383 }
1385 TEST_F(PointerLinkedList, SimpleDestructor) {
1386 verifySimpleDestructor(pointerLinkedListFromTestData());
1387 }
1389 TEST_F(ArrayList, SimpleDestructor) {
1390 verifySimpleDestructor(arrayListFromTestData());
1391 }
1393 TEST_F(PointerArrayList, SimpleDestructor) {
1394 verifySimpleDestructor(pointerArrayListFromTestData());
1395 }
1397 TEST_F(LinkedList, AdvancedDestructor) {
1398 verifyAdvancedDestructor(linkedListFromTestData());
1399 }
1401 TEST_F(PointerLinkedList, AdvancedDestructor) {
1402 verifyAdvancedDestructor(pointerLinkedListFromTestData());
1403 }
1405 TEST_F(ArrayList, AdvancedDestructor) {
1406 verifyAdvancedDestructor(arrayListFromTestData());
1407 }
1409 TEST_F(PointerArrayList, AdvancedDestructor) {
1410 verifyAdvancedDestructor(pointerArrayListFromTestData());
1411 }
1413 TEST_F(PointerLinkedList, DestroyNoDestructor) {
1414 void *item = cxMalloc(&testingAllocator, sizeof(int));
1415 auto list = cxLinkedListCreate(cxDefaultAllocator, cx_cmp_int, CX_STORE_POINTERS);
1416 cxListAdd(list, item);
1417 ASSERT_FALSE(testingAllocator.verify());
1418 cxListDestroy(list);
1419 EXPECT_FALSE(testingAllocator.verify());
1420 cxFree(&testingAllocator, item);
1421 EXPECT_TRUE(testingAllocator.verify());
1422 }
1424 TEST_F(PointerLinkedList, DestroySimpleDestructor) {
1425 int item = 0;
1426 auto list = cxLinkedListCreate(cxDefaultAllocator, cx_cmp_int, CX_STORE_POINTERS);
1427 list->simple_destructor = [](void *elem) { *(int *) elem = 42; };
1428 cxListAdd(list, &item);
1429 cxListDestroy(list);
1430 EXPECT_EQ(item, 42);
1431 }
1433 TEST_F(PointerLinkedList, DestroyAdvancedDestructor) {
1434 void *item = cxMalloc(&testingAllocator, sizeof(int));
1435 auto list = cxLinkedListCreate(cxDefaultAllocator, cx_cmp_int, CX_STORE_POINTERS);
1436 list->destructor_data = &testingAllocator;
1437 list->advanced_destructor = (cx_destructor_func2) cxFree;
1438 cxListAdd(list, item);
1439 ASSERT_FALSE(testingAllocator.verify());
1440 cxListDestroy(list);
1441 EXPECT_TRUE(testingAllocator.verify());
1442 }
1444 TEST_F(PointerArrayList, DestroyNoDestructor) {
1445 void *item = cxMalloc(&testingAllocator, sizeof(int));
1446 auto list = cxArrayListCreate(cxDefaultAllocator, cx_cmp_int, CX_STORE_POINTERS, 4);
1447 cxListAdd(list, item);
1448 ASSERT_FALSE(testingAllocator.verify());
1449 cxListDestroy(list);
1450 EXPECT_FALSE(testingAllocator.verify());
1451 cxFree(&testingAllocator, item);
1452 EXPECT_TRUE(testingAllocator.verify());
1453 }
1455 TEST_F(PointerArrayList, DestroySimpleDestructor) {
1456 int item = 0;
1457 auto list = cxArrayListCreate(cxDefaultAllocator, cx_cmp_int, CX_STORE_POINTERS, 4);
1458 list->simple_destructor = [](void *elem) { *(int *) elem = 42; };
1459 cxListAdd(list, &item);
1460 cxListDestroy(list);
1461 EXPECT_EQ(item, 42);
1462 }
1464 TEST_F(PointerArrayList, DestroyAdvancedDestructor) {
1465 void *item = cxMalloc(&testingAllocator, sizeof(int));
1466 auto list = cxArrayListCreate(cxDefaultAllocator, cx_cmp_int, CX_STORE_POINTERS, 4);
1467 list->destructor_data = &testingAllocator;
1468 list->advanced_destructor = (cx_destructor_func2) cxFree;
1469 cxListAdd(list, item);
1470 ASSERT_FALSE(testingAllocator.verify());
1471 cxListDestroy(list);
1472 EXPECT_TRUE(testingAllocator.verify());
1473 }
