tests/test_list.cpp@2f88a7c13a28
tests/test_list.cpp
Tue, 21 Mar 2023 17:18:29 +0100
- author
- Mike Becker <universe@uap-core.de>
- date
- Tue, 21 Mar 2023 17:18:29 +0100
- changeset 667
- 2f88a7c13a28
- parent 666
- b5dd654deb3b
- child 672
- 55d8fdd38ca4
- permissions
- -rw-r--r--
add CX_STORE_POINTERS special "item size" for lists
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 testdatastruct {
42 int x;
43 void *ptr;
44 };
46 static void free_testdatastruct(
47 void *a,
48 void *s
49 ) {
50 auto al = reinterpret_cast<CxTestingAllocator *>(a);
51 cxFree(al, reinterpret_cast<testdatastruct *>(s)->ptr);
52 }
54 struct node {
55 node *next = nullptr;
56 node *prev = nullptr;
57 int data = 0;
58 };
60 const ptrdiff_t loc_prev = offsetof(struct node, prev);
61 const ptrdiff_t loc_next = offsetof(struct node, next);
62 const ptrdiff_t loc_data = offsetof(struct node, data);
64 struct node_test_data {
65 node *begin = nullptr;
67 explicit node_test_data(node *begin) : begin(begin) {
68 auto n = begin;
69 while (n != nullptr) {
70 nodes.push_back(n);
71 n = n->next;
72 }
73 }
75 node_test_data(node_test_data &) = delete;
77 node_test_data(node_test_data &&) = default;
79 ~node_test_data() {
80 for (auto &&n: nodes) delete n;
81 }
83 private:
84 std::vector<node *> nodes;
85 };
87 static node_test_data create_nodes_test_data(size_t len) {
88 if (len == 0) return node_test_data{nullptr};
89 auto begin = new node;
90 auto prev = begin;
91 for (size_t i = 1; i < len; i++) {
92 auto n = new node;
93 cx_linked_list_link(prev, n, loc_prev, loc_next);
94 prev = n;
95 }
96 return node_test_data{begin};
97 }
99 template<typename InputIter>
100 static node_test_data create_nodes_test_data(
101 InputIter begin,
102 InputIter end
103 ) {
104 if (begin == end) return node_test_data{nullptr};
105 node *first = new node;
106 first->data = *begin;
107 node *prev = first;
108 begin++;
109 for (; begin != end; begin++) {
110 auto n = new node;
111 n->data = *begin;
112 cx_linked_list_link(prev, n, loc_prev, loc_next);
113 prev = n;
114 }
115 return node_test_data{first};
116 }
118 static node_test_data create_nodes_test_data(std::initializer_list<int> data) {
119 return create_nodes_test_data(data.begin(), data.end());
120 }
122 template<size_t N>
123 struct int_test_data {
124 std::array<int, N> data;
126 int_test_data() {
127 cx_for_n (i, N) data[i] = ::rand(); // NOLINT(cert-msc50-cpp)
128 }
129 };
131 TEST(LinkedList_LowLevel, link_unlink) {
132 node a, b, c;
134 cx_linked_list_link(&a, &b, loc_prev, loc_next);
135 EXPECT_EQ(a.prev, nullptr);
136 EXPECT_EQ(a.next, &b);
137 EXPECT_EQ(b.prev, &a);
138 EXPECT_EQ(b.next, nullptr);
140 cx_linked_list_unlink(&a, &b, loc_prev, loc_next);
141 EXPECT_EQ(a.prev, nullptr);
142 EXPECT_EQ(a.next, nullptr);
143 EXPECT_EQ(b.prev, nullptr);
144 EXPECT_EQ(b.next, nullptr);
146 cx_linked_list_link(&b, &c, loc_prev, loc_next);
147 cx_linked_list_link(&a, &b, loc_prev, loc_next);
148 cx_linked_list_unlink(&b, &c, loc_prev, loc_next);
149 EXPECT_EQ(a.prev, nullptr);
150 EXPECT_EQ(a.next, &b);
151 EXPECT_EQ(b.prev, &a);
152 EXPECT_EQ(b.next, nullptr);
153 EXPECT_EQ(c.prev, nullptr);
154 EXPECT_EQ(c.next, nullptr);
155 }
157 TEST(LinkedList_LowLevel, cx_linked_list_at) {
158 node a, b, c, d;
159 cx_linked_list_link(&a, &b, loc_prev, loc_next);
160 cx_linked_list_link(&b, &c, loc_prev, loc_next);
161 cx_linked_list_link(&c, &d, loc_prev, loc_next);
163 EXPECT_EQ(cx_linked_list_at(&a, 0, loc_next, 0), &a);
164 EXPECT_EQ(cx_linked_list_at(&a, 0, loc_next, 1), &b);
165 EXPECT_EQ(cx_linked_list_at(&a, 0, loc_next, 2), &c);
166 EXPECT_EQ(cx_linked_list_at(&a, 0, loc_next, 3), &d);
167 EXPECT_EQ(cx_linked_list_at(&a, 0, loc_next, 4), nullptr);
169 EXPECT_EQ(cx_linked_list_at(&b, 1, loc_prev, 0), &a);
170 EXPECT_EQ(cx_linked_list_at(&b, 1, loc_next, 1), &b);
171 EXPECT_EQ(cx_linked_list_at(&b, 1, loc_next, 2), &c);
172 EXPECT_EQ(cx_linked_list_at(&b, 1, loc_next, 3), &d);
173 EXPECT_EQ(cx_linked_list_at(&b, 1, loc_next, 4), nullptr);
175 EXPECT_EQ(cx_linked_list_at(&d, 3, loc_prev, 0), &a);
176 EXPECT_EQ(cx_linked_list_at(&d, 3, loc_prev, 1), &b);
177 }
179 TEST(LinkedList_LowLevel, cx_linked_list_find) {
180 auto testdata = create_nodes_test_data({2, 4, 6, 8});
181 auto list = testdata.begin;
182 int s;
184 s = 2;
185 EXPECT_EQ(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s), 0);
186 s = 4;
187 EXPECT_EQ(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s), 1);
188 s = 6;
189 EXPECT_EQ(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s), 2);
190 s = 8;
191 EXPECT_EQ(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s), 3);
192 s = 10;
193 EXPECT_EQ(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s), 4);
194 s = -2;
195 EXPECT_EQ(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s), 4);
196 }
198 TEST(LinkedList_LowLevel, cx_linked_list_compare) {
199 auto ta = create_nodes_test_data({2, 4, 6, 8});
200 auto tb = create_nodes_test_data({2, 4, 6});
201 auto tc = create_nodes_test_data({2, 4, 6, 9});
202 auto la = ta.begin, lb = tb.begin, lc = tc.begin;
204 EXPECT_GT(cx_linked_list_compare(la, lb, loc_next, loc_data, cx_cmp_int), 0);
205 EXPECT_LT(cx_linked_list_compare(lb, la, loc_next, loc_data, cx_cmp_int), 0);
206 EXPECT_GT(cx_linked_list_compare(lc, la, loc_next, loc_data, cx_cmp_int), 0);
207 EXPECT_LT(cx_linked_list_compare(la, lc, loc_next, loc_data, cx_cmp_int), 0);
208 EXPECT_EQ(cx_linked_list_compare(la, la, loc_next, loc_data, cx_cmp_int), 0);
209 }
211 TEST(LinkedList_LowLevel, cx_linked_list_add) {
212 // test with begin, end / prev, next
213 {
214 node nodes[4];
215 void *begin = nullptr, *end = nullptr;
217 cx_linked_list_add(&begin, &end, loc_prev, loc_next, &nodes[0]);
218 EXPECT_EQ(begin, &nodes[0]);
219 EXPECT_EQ(end, &nodes[0]);
220 EXPECT_EQ(nodes[0].prev, nullptr);
221 EXPECT_EQ(nodes[0].next, nullptr);
223 cx_linked_list_add(&begin, &end, loc_prev, loc_next, &nodes[1]);
224 EXPECT_EQ(begin, &nodes[0]);
225 EXPECT_EQ(end, &nodes[1]);
226 EXPECT_EQ(nodes[0].next, &nodes[1]);
227 EXPECT_EQ(nodes[1].prev, &nodes[0]);
228 }
230 // test with begin only / prev, next
231 {
232 node nodes[4];
233 void *begin = nullptr;
235 cx_linked_list_add(&begin, nullptr, loc_prev, loc_next, &nodes[0]);
236 EXPECT_EQ(begin, &nodes[0]);
237 cx_linked_list_add(&begin, nullptr, loc_prev, loc_next, &nodes[1]);
238 EXPECT_EQ(begin, &nodes[0]);
239 EXPECT_EQ(nodes[0].next, &nodes[1]);
240 EXPECT_EQ(nodes[1].prev, &nodes[0]);
242 cx_linked_list_add(&begin, nullptr, loc_prev, loc_next, &nodes[2]);
243 EXPECT_EQ(nodes[1].next, &nodes[2]);
244 EXPECT_EQ(nodes[2].prev, &nodes[1]);
245 }
247 // test with end only / prev, next
248 {
249 node nodes[4];
250 void *end = nullptr;
252 cx_linked_list_add(nullptr, &end, loc_prev, loc_next, &nodes[0]);
253 EXPECT_EQ(end, &nodes[0]);
254 cx_linked_list_add(nullptr, &end, loc_prev, loc_next, &nodes[1]);
255 EXPECT_EQ(end, &nodes[1]);
256 EXPECT_EQ(nodes[0].next, &nodes[1]);
257 EXPECT_EQ(nodes[1].prev, &nodes[0]);
259 cx_linked_list_add(nullptr, &end, loc_prev, loc_next, &nodes[2]);
260 EXPECT_EQ(end, &nodes[2]);
261 EXPECT_EQ(nodes[1].next, &nodes[2]);
262 EXPECT_EQ(nodes[2].prev, &nodes[1]);
263 }
265 // test with begin, end / next
266 {
267 node nodes[4];
268 void *begin = nullptr, *end = nullptr;
270 cx_linked_list_add(&begin, &end, -1, loc_next, &nodes[0]);
271 EXPECT_EQ(begin, &nodes[0]);
272 EXPECT_EQ(end, &nodes[0]);
273 cx_linked_list_add(&begin, &end, -1, loc_next, &nodes[1]);
274 EXPECT_EQ(end, &nodes[1]);
275 EXPECT_EQ(nodes[0].next, &nodes[1]);
276 EXPECT_EQ(nodes[1].prev, nullptr);
277 }
278 }
280 TEST(LinkedList_LowLevel, cx_linked_list_prepend) {
281 // test with begin, end / prev, next
282 {
283 node nodes[4];
284 void *begin = nullptr, *end = nullptr;
286 cx_linked_list_prepend(&begin, &end, loc_prev, loc_next, &nodes[0]);
287 EXPECT_EQ(begin, &nodes[0]);
288 EXPECT_EQ(end, &nodes[0]);
289 EXPECT_EQ(nodes[0].prev, nullptr);
290 EXPECT_EQ(nodes[0].next, nullptr);
292 cx_linked_list_prepend(&begin, &end, loc_prev, loc_next, &nodes[1]);
293 EXPECT_EQ(begin, &nodes[1]);
294 EXPECT_EQ(end, &nodes[0]);
295 EXPECT_EQ(nodes[1].next, &nodes[0]);
296 EXPECT_EQ(nodes[0].prev, &nodes[1]);
297 }
299 // test with begin only / prev, next
300 {
301 node nodes[4];
302 void *begin = nullptr;
304 cx_linked_list_prepend(&begin, nullptr, loc_prev, loc_next, &nodes[0]);
305 EXPECT_EQ(begin, &nodes[0]);
306 cx_linked_list_prepend(&begin, nullptr, loc_prev, loc_next, &nodes[1]);
307 EXPECT_EQ(begin, &nodes[1]);
308 EXPECT_EQ(nodes[1].next, &nodes[0]);
309 EXPECT_EQ(nodes[0].prev, &nodes[1]);
311 cx_linked_list_prepend(&begin, nullptr, loc_prev, loc_next, &nodes[2]);
312 EXPECT_EQ(begin, &nodes[2]);
313 EXPECT_EQ(nodes[2].next, &nodes[1]);
314 EXPECT_EQ(nodes[1].prev, &nodes[2]);
315 }
317 // test with end only / prev, next
318 {
319 node nodes[4];
320 void *end = nullptr;
322 cx_linked_list_prepend(nullptr, &end, loc_prev, loc_next, &nodes[0]);
323 EXPECT_EQ(end, &nodes[0]);
324 cx_linked_list_prepend(nullptr, &end, loc_prev, loc_next, &nodes[1]);
325 EXPECT_EQ(end, &nodes[0]);
326 EXPECT_EQ(nodes[1].next, &nodes[0]);
327 EXPECT_EQ(nodes[0].prev, &nodes[1]);
329 cx_linked_list_prepend(nullptr, &end, loc_prev, loc_next, &nodes[2]);
330 EXPECT_EQ(end, &nodes[0]);
331 EXPECT_EQ(nodes[2].next, &nodes[1]);
332 EXPECT_EQ(nodes[1].prev, &nodes[2]);
333 }
335 // test with begin, end / next
336 {
337 node nodes[4];
338 void *begin = nullptr, *end = nullptr;
340 cx_linked_list_prepend(&begin, &end, -1, loc_next, &nodes[0]);
341 EXPECT_EQ(begin, &nodes[0]);
342 EXPECT_EQ(end, &nodes[0]);
343 cx_linked_list_prepend(&begin, &end, -1, loc_next, &nodes[1]);
344 cx_linked_list_prepend(&begin, &end, -1, loc_next, &nodes[2]);
345 EXPECT_EQ(begin, &nodes[2]);
346 EXPECT_EQ(end, &nodes[0]);
347 EXPECT_EQ(nodes[1].next, &nodes[0]);
348 EXPECT_EQ(nodes[2].next, &nodes[1]);
349 EXPECT_EQ(nodes[1].prev, nullptr);
350 EXPECT_EQ(nodes[0].prev, nullptr);
351 }
352 }
354 TEST(LinkedList_LowLevel, cx_linked_list_insert) {
355 // insert mid list
356 {
357 node nodes[4];
358 void *begin = &nodes[0], *end = &nodes[2];
360 cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
361 cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
363 cx_linked_list_insert(&begin, &end, loc_prev, loc_next, &nodes[1], &nodes[3]);
364 EXPECT_EQ(begin, &nodes[0]);
365 EXPECT_EQ(end, &nodes[2]);
366 EXPECT_EQ(nodes[1].next, &nodes[3]);
367 EXPECT_EQ(nodes[2].prev, &nodes[3]);
368 EXPECT_EQ(nodes[3].prev, &nodes[1]);
369 EXPECT_EQ(nodes[3].next, &nodes[2]);
370 }
372 // insert end
373 {
374 node nodes[4];
375 void *begin = &nodes[0], *end = &nodes[2];
377 cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
378 cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
380 cx_linked_list_insert(&begin, &end, loc_prev, loc_next, &nodes[2], &nodes[3]);
381 EXPECT_EQ(begin, &nodes[0]);
382 EXPECT_EQ(end, &nodes[3]);
383 EXPECT_EQ(nodes[2].next, &nodes[3]);
384 EXPECT_EQ(nodes[3].prev, &nodes[2]);
385 EXPECT_EQ(nodes[3].next, nullptr);
386 }
388 // insert begin
389 {
390 node nodes[4];
391 void *begin = &nodes[0], *end = &nodes[2];
393 cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
394 cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
396 cx_linked_list_insert(&begin, &end, loc_prev, loc_next, nullptr, &nodes[3]);
397 EXPECT_EQ(begin, &nodes[3]);
398 EXPECT_EQ(end, &nodes[2]);
399 EXPECT_EQ(nodes[0].prev, &nodes[3]);
400 EXPECT_EQ(nodes[3].prev, nullptr);
401 EXPECT_EQ(nodes[3].next, &nodes[0]);
402 }
403 }
405 TEST(LinkedList_LowLevel, cx_linked_list_insert_chain) {
406 // insert mid list
407 {
408 node nodes[5];
409 void *begin = &nodes[0], *end = &nodes[2];
411 cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
412 cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
413 cx_linked_list_link(&nodes[3], &nodes[4], loc_prev, loc_next);
415 cx_linked_list_insert_chain(&begin, &end, loc_prev, loc_next, &nodes[1], &nodes[3], nullptr);
416 EXPECT_EQ(begin, &nodes[0]);
417 EXPECT_EQ(end, &nodes[2]);
418 EXPECT_EQ(nodes[1].next, &nodes[3]);
419 EXPECT_EQ(nodes[2].prev, &nodes[4]);
420 EXPECT_EQ(nodes[3].prev, &nodes[1]);
421 EXPECT_EQ(nodes[4].next, &nodes[2]);
422 }
424 // insert end
425 {
426 node nodes[5];
427 void *begin = &nodes[0], *end = &nodes[2];
429 cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
430 cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
431 cx_linked_list_link(&nodes[3], &nodes[4], loc_prev, loc_next);
433 cx_linked_list_insert_chain(&begin, &end, loc_prev, loc_next, &nodes[2], &nodes[3], nullptr);
434 EXPECT_EQ(begin, &nodes[0]);
435 EXPECT_EQ(end, &nodes[4]);
436 EXPECT_EQ(nodes[2].next, &nodes[3]);
437 EXPECT_EQ(nodes[3].prev, &nodes[2]);
438 EXPECT_EQ(nodes[4].next, nullptr);
439 }
441 // insert begin
442 {
443 node nodes[5];
444 void *begin = &nodes[0], *end = &nodes[2];
446 cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
447 cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
448 cx_linked_list_link(&nodes[3], &nodes[4], loc_prev, loc_next);
450 cx_linked_list_insert_chain(&begin, &end, loc_prev, loc_next, nullptr, &nodes[3], nullptr);
451 EXPECT_EQ(begin, &nodes[3]);
452 EXPECT_EQ(end, &nodes[2]);
453 EXPECT_EQ(nodes[0].prev, &nodes[4]);
454 EXPECT_EQ(nodes[3].prev, nullptr);
455 EXPECT_EQ(nodes[4].next, &nodes[0]);
456 }
457 }
459 TEST(LinkedList_LowLevel, cx_linked_list_first) {
460 auto testdata = create_nodes_test_data(3);
461 auto begin = testdata.begin;
462 EXPECT_EQ(cx_linked_list_first(begin, loc_prev), begin);
463 EXPECT_EQ(cx_linked_list_first(begin->next, loc_prev), begin);
464 EXPECT_EQ(cx_linked_list_first(begin->next->next, loc_prev), begin);
465 }
467 TEST(LinkedList_LowLevel, cx_linked_list_last) {
468 auto testdata = create_nodes_test_data(3);
469 auto begin = testdata.begin;
470 auto end = begin->next->next;
471 EXPECT_EQ(cx_linked_list_last(begin, loc_next), end);
472 EXPECT_EQ(cx_linked_list_last(begin->next, loc_next), end);
473 EXPECT_EQ(cx_linked_list_last(begin->next->next, loc_next), end);
474 }
476 TEST(LinkedList_LowLevel, cx_linked_list_prev) {
477 auto testdata = create_nodes_test_data(3);
478 auto begin = testdata.begin;
479 EXPECT_EQ(cx_linked_list_prev(begin, loc_next, begin), nullptr);
480 EXPECT_EQ(cx_linked_list_prev(begin, loc_next, begin->next), begin);
481 EXPECT_EQ(cx_linked_list_prev(begin, loc_next, begin->next->next), begin->next);
482 }
484 TEST(LinkedList_LowLevel, cx_linked_list_remove) {
485 auto testdata = create_nodes_test_data({2, 4, 6});
486 auto begin = reinterpret_cast<void *>(testdata.begin);
487 auto first = testdata.begin;
488 auto second = first->next;
489 auto third = second->next;
490 auto end = reinterpret_cast<void *>(third);
492 cx_linked_list_remove(&begin, &end, loc_prev, loc_next, second);
493 EXPECT_EQ(begin, first);
494 EXPECT_EQ(end, third);
495 EXPECT_EQ(first->prev, nullptr);
496 EXPECT_EQ(first->next, third);
497 EXPECT_EQ(third->prev, first);
498 EXPECT_EQ(third->next, nullptr);
500 cx_linked_list_remove(&begin, &end, loc_prev, loc_next, third);
501 EXPECT_EQ(begin, first);
502 EXPECT_EQ(end, first);
503 EXPECT_EQ(first->prev, nullptr);
504 EXPECT_EQ(first->next, nullptr);
506 cx_linked_list_remove(&begin, &end, loc_prev, loc_next, first);
507 EXPECT_EQ(begin, nullptr);
508 EXPECT_EQ(end, nullptr);
509 }
511 TEST(LinkedList_LowLevel, cx_linked_list_size) {
512 EXPECT_EQ(cx_linked_list_size(nullptr, loc_next), 0);
514 {
515 auto testdata = create_nodes_test_data(5);
516 EXPECT_EQ(cx_linked_list_size(testdata.begin, loc_next), 5);
517 }
519 {
520 auto testdata = create_nodes_test_data(13);
521 EXPECT_EQ(cx_linked_list_size(testdata.begin, loc_next), 13);
522 }
523 }
525 TEST(LinkedList_LowLevel, cx_linked_list_sort) {
526 int_test_data<1500> testdata;
527 std::array<int, 1500> sorted{};
528 std::partial_sort_copy(testdata.data.begin(), testdata.data.end(), sorted.begin(), sorted.end());
530 auto scrambled = create_nodes_test_data(testdata.data.begin(), testdata.data.end());
531 void *begin = scrambled.begin;
532 void *end = cx_linked_list_last(begin, loc_next);
534 cx_linked_list_sort(&begin, &end, loc_prev, loc_next, loc_data, cx_cmp_int);
536 node *check = reinterpret_cast<node *>(begin);
537 node *check_last = nullptr;
538 cx_for_n (i, sorted.size()) {
539 EXPECT_EQ(check->data, sorted[i]);
540 EXPECT_EQ(check->prev, check_last);
541 if (i < sorted.size() - 1) {
542 ASSERT_NE(check->next, nullptr);
543 }
544 check_last = check;
545 check = check->next;
546 }
547 EXPECT_EQ(check, nullptr);
548 EXPECT_EQ(end, check_last);
549 }
551 TEST(LinkedList_LowLevel, cx_linked_list_reverse) {
552 auto testdata = create_nodes_test_data({2, 4, 6, 8});
553 auto expected = create_nodes_test_data({8, 6, 4, 2});
555 auto begin = reinterpret_cast<void *>(testdata.begin);
556 auto end = cx_linked_list_last(begin, loc_next);
557 auto orig_begin = begin, orig_end = end;
559 cx_linked_list_reverse(&begin, &end, loc_prev, loc_next);
560 EXPECT_EQ(end, orig_begin);
561 EXPECT_EQ(begin, orig_end);
562 EXPECT_EQ(cx_linked_list_compare(begin, expected.begin, loc_next, loc_data, cx_cmp_int), 0);
563 }
565 class HighLevelTest : public ::testing::Test {
566 mutable std::unordered_set<CxList *> lists;
567 protected:
568 CxTestingAllocator testingAllocator;
570 void TearDown() override {
571 for (auto &&l: lists) cxListDestroy(l);
572 EXPECT_TRUE(testingAllocator.verify());
573 }
575 static constexpr size_t testdata_len = 250;
576 int_test_data<testdata_len> testdata;
578 auto autofree(CxList *list) const -> CxList * {
579 if (list != nullptr) lists.insert(list);
580 return list;
581 }
583 auto linkedListFromTestData() const -> CxList * {
584 auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int)));
585 cxListAddArray(list, testdata.data.data(), testdata_len);
586 return list;
587 }
589 auto pointerLinkedListFromTestData() const -> CxList * {
590 auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS));
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 auto arrayListFromTestData() const -> CxList * {
597 auto list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), testdata_len));
598 cxListAddArray(list, testdata.data.data(), testdata_len);
599 return list;
600 }
602 void verifyCreate(CxList *list) const {
603 EXPECT_EQ(list->content_destructor_type, CX_DESTRUCTOR_NONE);
604 EXPECT_EQ(list->size, 0);
605 EXPECT_EQ(list->allocator, &testingAllocator);
606 EXPECT_EQ(list->cmpfunc, cx_cmp_int);
607 }
609 void verifyAdd(
610 CxList *list,
611 bool as_pointer
612 ) {
613 auto len = testdata_len;
614 cx_for_n (i, len) EXPECT_EQ(cxListAdd(list, &testdata.data[i]), 0);
615 EXPECT_EQ(list->size, len);
616 EXPECT_GE(list->capacity, list->size);
617 cx_for_n (i, len) EXPECT_EQ(*(int *) cxListAt(list, i), testdata.data[i]);
618 cx_for_n (i, len) ++testdata.data[i];
619 if (as_pointer) {
620 cx_for_n (i, len) EXPECT_EQ(*(int *) cxListAt(list, i), testdata.data[i]);
621 } else {
622 cx_for_n (i, len) EXPECT_EQ(*(int *) cxListAt(list, i), testdata.data[i] - 1);
623 }
624 }
626 static void verifyInsert(CxList *list) {
627 int a = 5, b = 47, c = 13, d = 42;
629 EXPECT_NE(cxListInsert(list, 1, &a), 0);
630 EXPECT_EQ(list->size, 0);
631 EXPECT_EQ(cxListInsert(list, 0, &a), 0);
632 EXPECT_EQ(list->size, 1);
633 EXPECT_EQ(cxListInsert(list, 0, &b), 0);
634 EXPECT_EQ(list->size, 2);
635 EXPECT_EQ(cxListInsert(list, 1, &c), 0);
636 EXPECT_EQ(list->size, 3);
637 EXPECT_EQ(cxListInsert(list, 3, &d), 0);
639 ASSERT_EQ(list->size, 4);
640 EXPECT_GE(list->capacity, list->size);
642 EXPECT_EQ(*(int *) cxListAt(list, 0), 47);
643 EXPECT_EQ(*(int *) cxListAt(list, 1), 13);
644 EXPECT_EQ(*(int *) cxListAt(list, 2), 5);
645 EXPECT_EQ(*(int *) cxListAt(list, 3), 42);
646 }
648 static void verifyInsertArray(
649 CxList *list,
650 bool pointers = false
651 ) {
652 int a[5] = {5, 47, 11, 13, 42};
653 int b[5] = {9, 18, 72, 50, 7};
654 int *aptr[5];
655 int *bptr[5];
656 cx_for_n(i, 5) {
657 aptr[i] = &a[i];
658 bptr[i] = &b[i];
659 }
661 size_t inserted;
663 if (pointers) {
664 inserted = cxListInsertArray(list, 0, aptr, 5);
665 } else {
666 inserted = cxListInsertArray(list, 0, a, 5);
667 }
668 EXPECT_EQ(inserted, 5);
669 EXPECT_EQ(*(int *) cxListAt(list, 0), 5);
670 EXPECT_EQ(*(int *) cxListAt(list, 1), 47);
671 EXPECT_EQ(*(int *) cxListAt(list, 2), 11);
672 EXPECT_EQ(*(int *) cxListAt(list, 3), 13);
673 EXPECT_EQ(*(int *) cxListAt(list, 4), 42);
674 if (pointers) {
675 inserted = cxListInsertArray(list, 3, bptr, 5);
676 } else {
677 inserted = cxListInsertArray(list, 3, b, 5);
678 }
679 EXPECT_EQ(inserted, 5);
680 EXPECT_EQ(*(int *) cxListAt(list, 0), 5);
681 EXPECT_EQ(*(int *) cxListAt(list, 1), 47);
682 EXPECT_EQ(*(int *) cxListAt(list, 2), 11);
683 EXPECT_EQ(*(int *) cxListAt(list, 3), 9);
684 EXPECT_EQ(*(int *) cxListAt(list, 4), 18);
685 EXPECT_EQ(*(int *) cxListAt(list, 5), 72);
686 EXPECT_EQ(*(int *) cxListAt(list, 6), 50);
687 EXPECT_EQ(*(int *) cxListAt(list, 7), 7);
688 EXPECT_EQ(*(int *) cxListAt(list, 8), 13);
689 EXPECT_EQ(*(int *) cxListAt(list, 9), 42);
690 }
692 void verifyRemove(CxList *list) const {
693 EXPECT_EQ(cxListRemove(list, 2), 0);
694 EXPECT_EQ(cxListRemove(list, 4), 0);
695 EXPECT_EQ(list->size, testdata_len - 2);
696 EXPECT_GE(list->capacity, list->size);
697 EXPECT_EQ(*(int *) cxListAt(list, 0), testdata.data[0]);
698 EXPECT_EQ(*(int *) cxListAt(list, 1), testdata.data[1]);
699 EXPECT_EQ(*(int *) cxListAt(list, 2), testdata.data[3]);
700 EXPECT_EQ(*(int *) cxListAt(list, 3), testdata.data[4]);
701 EXPECT_EQ(*(int *) cxListAt(list, 4), testdata.data[6]);
703 EXPECT_EQ(cxListRemove(list, 0), 0);
704 EXPECT_EQ(list->size, testdata_len - 3);
705 EXPECT_GE(list->capacity, list->size);
706 EXPECT_EQ(*(int *) cxListAt(list, 0), testdata.data[1]);
707 EXPECT_EQ(*(int *) cxListAt(list, 1), testdata.data[3]);
709 EXPECT_NE(cxListRemove(list, testdata_len), 0);
710 }
712 void verifyClear(CxList *list) {
713 // use the testing allocator for testing the destructor function
714 list->content_destructor_type = CX_DESTRUCTOR_ADVANCED;
715 list->advanced_destructor.func = free_testdatastruct;
716 list->advanced_destructor.data = &testingAllocator;
718 testdatastruct s[10];
719 for (auto &t: s) {
720 t.ptr = cxMalloc(&testingAllocator, 16);
721 cxListAdd(list, &t);
722 }
724 cxListClear(list);
725 }
727 static void verifySwap(CxList *list) {
728 ASSERT_EQ(list->size, 0);
730 int original[16] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15};
731 int swapped[16] = {8, 4, 14, 3, 1, 5, 9, 12, 0, 6, 11, 10, 7, 15, 2, 13};
733 // we have to add the items one by one, because it could be a pointer list
734 cx_for_n(i, 16) {
735 cxListAdd(list, &original[i]);
736 }
738 int result;
740 // execute the test two times with different item sizes
741 result = cxListSwap(list, 1, 4);
742 EXPECT_EQ(0, result);
743 result = cxListSwap(list, 2, 14);
744 EXPECT_EQ(0, result);
745 result = cxListSwap(list, 9, 6);
746 EXPECT_EQ(0, result);
747 result = cxListSwap(list, 3, 3);
748 EXPECT_EQ(0, result);
749 result = cxListSwap(list, 10, 11);
750 EXPECT_EQ(0, result);
751 result = cxListSwap(list, 8, 0);
752 EXPECT_EQ(0, result);
753 result = cxListSwap(list, 7, 12);
754 EXPECT_EQ(0, result);
755 result = cxListSwap(list, 13, 15);
756 EXPECT_EQ(0, result);
758 result = cxListSwap(list, 5, 16);
759 EXPECT_NE(0, result);
760 result = cxListSwap(list, 16, 6);
761 EXPECT_NE(0, result);
762 result = cxListSwap(list, 16, 17);
763 EXPECT_NE(0, result);
765 auto iter = cxListIterator(list);
766 cx_foreach(int*, e, iter) {
767 EXPECT_EQ(*e, swapped[iter.index]);
768 }
769 iter = cxListBackwardsIterator(list);
770 cx_foreach(int*, e, iter) {
771 EXPECT_EQ(*e, swapped[iter.index]);
772 }
773 }
775 void verifyAt(CxList *list) const {
776 auto len = testdata_len;
777 EXPECT_EQ(list->size, len);
778 cx_for_n (i, len) {
779 EXPECT_EQ(*(int *) cxListAt(list, i), testdata.data[i]);
780 }
781 EXPECT_EQ(cxListAt(list, list->size), nullptr);
782 }
784 void verifyFind(CxList *list) const {
785 cx_for_n (attempt, 25) {
786 size_t exp = rand() % testdata_len; // NOLINT(cert-msc50-cpp)
787 int val = testdata.data[exp];
788 // randomly picked number could occur earlier in list - find first position
789 cx_for_n (i, exp) {
790 if (testdata.data[i] == val) {
791 exp = i;
792 break;
793 }
794 }
795 EXPECT_EQ(cxListFind(list, &val), exp);
796 }
797 }
799 void verifySort(CxList *list) const {
800 std::array<int, testdata_len> expected{};
801 std::partial_sort_copy(testdata.data.begin(), testdata.data.end(), expected.begin(), expected.end());
802 cxListSort(list);
803 cx_for_n (i, testdata_len) ASSERT_EQ(*(int *) cxListAt(list, i), expected[i]);
804 }
806 void verifyIterator(CxList *list) const {
807 auto iter = cxListIterator(list);
808 size_t i = 0;
809 cx_foreach(int*, x, iter) {
810 ASSERT_EQ(i, iter.index);
811 EXPECT_EQ(*x, testdata.data[iter.index]);
812 i++;
813 }
814 ASSERT_EQ(i, list->size);
815 iter = cxListBackwardsIterator(list);
816 cx_foreach(int*, x, iter) {
817 ASSERT_EQ(i - 1, iter.index);
818 EXPECT_EQ(*x, testdata.data[iter.index]);
819 i--;
820 }
821 ASSERT_EQ(i, 0);
822 auto len = testdata_len;
823 i = len / 2;
824 auto mut_iter = cxListMutIteratorAt(list, i);
825 size_t j = 0;
826 cx_foreach(int*, x, mut_iter) {
827 ASSERT_EQ(mut_iter.index, len / 2 + j / 2);
828 ASSERT_EQ(*x, testdata.data[i]);
829 if (i % 2 == 1) cxIteratorFlagRemoval(mut_iter);
830 i++;
831 j++;
832 }
833 ASSERT_EQ(i, len);
834 i = len / 2;
835 j = 0;
836 mut_iter = cxListMutBackwardsIteratorAt(list, i - 1);
837 cx_foreach(int*, x, mut_iter) {
838 ASSERT_EQ(mut_iter.index, len / 2 - 1 - j);
839 ASSERT_EQ(*x, testdata.data[i - 1]);
840 if (i % 2 == 0) cxIteratorFlagRemoval(mut_iter);
841 i--;
842 j++;
843 }
844 ASSERT_EQ(i, 0);
845 ASSERT_EQ(list->size, len / 2);
846 cx_for_n(j, len / 2) ASSERT_EQ(*(int *) cxListAt(list, j), testdata.data[j * 2]);
847 }
849 static void verifyInsertViaIterator(CxList *list) {
850 int newdata[] = {10, 20, 30, 40, 50};
852 auto iter = cxListMutIteratorAt(list, 2);
853 EXPECT_TRUE(cxIteratorValid(iter));
854 EXPECT_EQ(iter.index, 2);
855 EXPECT_EQ(*(int *) cxIteratorCurrent(iter), 2);
856 cxListInsertAfter(&iter, &newdata[0]);
857 EXPECT_TRUE(cxIteratorValid(iter));
858 EXPECT_EQ(iter.index, 2);
859 EXPECT_EQ(*(int *) cxIteratorCurrent(iter), 2);
860 cxListInsertBefore(&iter, &newdata[1]);
861 EXPECT_TRUE(cxIteratorValid(iter));
862 EXPECT_EQ(iter.index, 3);
863 EXPECT_EQ(*(int *) cxIteratorCurrent(iter), 2);
865 iter = cxListMutIterator(list);
866 cxListInsertBefore(&iter, &newdata[2]);
867 EXPECT_TRUE(cxIteratorValid(iter));
868 EXPECT_EQ(iter.index, 1);
869 EXPECT_EQ(*(int *) cxIteratorCurrent(iter), 0);
870 iter = cxListMutIteratorAt(list, list->size);
871 cxListInsertBefore(&iter, &newdata[3]);
872 EXPECT_FALSE(cxIteratorValid(iter));
873 EXPECT_EQ(iter.index, 9);
874 iter = cxListMutIteratorAt(list, list->size);
875 cxListInsertAfter(&iter, &newdata[4]);
876 EXPECT_FALSE(cxIteratorValid(iter));
877 EXPECT_EQ(iter.index, 10);
879 int expdata[] = {30, 0, 1, 20, 2, 10, 3, 4, 40, 50};
880 cx_for_n (j, 10) EXPECT_EQ(*(int *) cxListAt(list, j), expdata[j]);
881 }
883 void verifyReverse(CxList *list) const {
884 cxListReverse(list);
885 cx_for_n(i, testdata_len) {
886 ASSERT_EQ(*(int *) cxListAt(list, i), testdata.data[testdata_len - 1 - i]);
887 }
888 }
890 static void verifyCompare(
891 CxList *left,
892 CxList *right
893 ) {
894 EXPECT_EQ(cxListCompare(left, right), 0);
895 int x = 42;
896 cxListAdd(left, &x);
897 ASSERT_GT(left->size, right->size);
898 EXPECT_GT(cxListCompare(left, right), 0);
899 EXPECT_LT(cxListCompare(right, left), 0);
900 cxListAdd(right, &x);
901 ASSERT_EQ(left->size, right->size);
902 EXPECT_EQ(cxListCompare(left, right), 0);
903 int a = 5, b = 10;
904 cxListInsert(left, 15, &a);
905 cxListInsert(right, 15, &b);
906 ASSERT_EQ(left->size, right->size);
907 EXPECT_LT(cxListCompare(left, right), 0);
908 EXPECT_GT(cxListCompare(right, left), 0);
909 *(int *) cxListAt(left, 15) = 10;
910 EXPECT_EQ(cxListCompare(left, right), 0);
911 }
912 };
914 class LinkedList : public HighLevelTest {
915 };
917 class PointerLinkedList : public HighLevelTest {
918 };
920 class ArrayList : public HighLevelTest {
921 };
923 TEST_F(PointerLinkedList, cxListStorePointers) {
924 auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, 47));
925 EXPECT_FALSE(cxListIsStoringPointers(list));
926 cxListStorePointers(list);
927 EXPECT_EQ(list->itemsize, sizeof(void *));
928 EXPECT_NE(list->cl, nullptr);
929 EXPECT_NE(list->climpl, nullptr);
930 EXPECT_TRUE(cxListIsStoringPointers(list));
931 cxListStoreObjects(list);
932 EXPECT_NE(list->cl, nullptr);
933 EXPECT_EQ(list->climpl, nullptr);
934 EXPECT_FALSE(cxListIsStoringPointers(list));
936 list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS));
937 EXPECT_EQ(list->itemsize, sizeof(void *));
938 EXPECT_NE(list->cl, nullptr);
939 EXPECT_NE(list->climpl, nullptr);
940 EXPECT_TRUE(cxListIsStoringPointers(list));
941 }
943 TEST_F(LinkedList, cxLinkedListCreate) {
944 CxList *list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int)));
945 ASSERT_NE(list, nullptr);
946 EXPECT_EQ(list->itemsize, sizeof(int));
947 EXPECT_EQ(list->capacity, (size_t) -1);
948 verifyCreate(list);
949 }
951 TEST_F(LinkedList, cxLinkedListCreateSimple) {
952 CxList *list = autofree(cxLinkedListCreateSimple(sizeof(int)));
953 ASSERT_NE(list, nullptr);
954 EXPECT_EQ(list->itemsize, sizeof(int));
955 EXPECT_EQ(list->capacity, (size_t) -1);
956 EXPECT_EQ(list->cmpfunc, nullptr);
957 EXPECT_EQ(list->allocator, cxDefaultAllocator);
958 }
960 TEST_F(ArrayList, cxArrayListCreate) {
961 CxList *list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 8));
962 ASSERT_NE(list, nullptr);
963 EXPECT_EQ(list->itemsize, sizeof(int));
964 EXPECT_EQ(list->capacity, 8);
965 verifyCreate(list);
966 }
968 TEST_F(ArrayList, cxArrayListCreateSimple) {
969 CxList *list = autofree(cxArrayListCreateSimple(sizeof(int), 8));
970 ASSERT_NE(list, nullptr);
971 EXPECT_EQ(list->cmpfunc, nullptr);
972 EXPECT_EQ(list->allocator, cxDefaultAllocator);
973 EXPECT_EQ(list->itemsize, sizeof(int));
974 EXPECT_EQ(list->capacity, 8);
975 }
977 TEST_F(LinkedList, cxListAdd) {
978 auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int)));
979 verifyAdd(list, false);
980 }
982 TEST_F(PointerLinkedList, cxListAdd) {
983 auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS));
984 verifyAdd(list, true);
985 }
987 TEST_F(ArrayList, cxListAdd) {
988 auto list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 8));
989 verifyAdd(list, false);
990 }
992 TEST_F(LinkedList, cxListInsert) {
993 verifyInsert(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int))));
994 }
996 TEST_F(PointerLinkedList, cxListInsert) {
997 verifyInsert(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS)));
998 }
1000 TEST_F(ArrayList, cxListInsert) {
1001 verifyInsert(autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 2)));
1002 }
1004 TEST_F(LinkedList, cxListInsertArray) {
1005 verifyInsertArray(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int))));
1006 }
1008 TEST_F(PointerLinkedList, cxListInsertArray) {
1009 verifyInsertArray(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS)), true);
1010 }
1012 TEST_F(ArrayList, cxListInsertArray) {
1013 verifyInsertArray(autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 4)));
1014 }
1016 TEST_F(LinkedList, cxListRemove) {
1017 verifyRemove(linkedListFromTestData());
1018 }
1020 TEST_F(PointerLinkedList, cxListRemove) {
1021 verifyRemove(pointerLinkedListFromTestData());
1022 }
1024 TEST_F(ArrayList, cxListRemove) {
1025 verifyRemove(arrayListFromTestData());
1026 }
1028 TEST_F(LinkedList, cxListClear) {
1029 verifyClear(autofree(cxLinkedListCreateSimple(sizeof(testdatastruct))));
1030 }
1032 TEST_F(PointerLinkedList, cxListClear) {
1033 verifyClear(cxLinkedListCreateSimple(CX_STORE_POINTERS));
1034 }
1036 TEST_F(ArrayList, cxListClear) {
1037 verifyClear(autofree(cxArrayListCreateSimple(sizeof(testdatastruct), 8)));
1038 }
1040 TEST_F(LinkedList, cxListSwap) {
1041 verifySwap(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int))));
1042 }
1044 TEST_F(PointerLinkedList, cxListSwap) {
1045 verifySwap(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS)));
1046 }
1048 TEST_F(ArrayList, cxListSwap) {
1049 verifySwap(autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 16)));
1050 }
1052 TEST_F(LinkedList, cxListSwapNoSBO) {
1053 CX_DISABLE_LINKED_LIST_SWAP_SBO = true;
1054 verifySwap(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int))));
1055 CX_DISABLE_LINKED_LIST_SWAP_SBO = false;
1056 }
1058 TEST_F(PointerLinkedList, cxListSwapNoSBO) {
1059 CX_DISABLE_LINKED_LIST_SWAP_SBO = true;
1060 verifySwap(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS)));
1061 CX_DISABLE_LINKED_LIST_SWAP_SBO = false;
1062 }
1064 TEST_F(ArrayList, cxListSwapNoSBO) {
1065 CX_DISABLE_LINKED_LIST_SWAP_SBO = true;
1066 verifySwap(autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 16)));
1067 CX_DISABLE_LINKED_LIST_SWAP_SBO = false;
1068 }
1070 TEST_F(LinkedList, cxListAt) {
1071 verifyAt(linkedListFromTestData());
1072 }
1074 TEST_F(PointerLinkedList, cxListAt) {
1075 verifyAt(pointerLinkedListFromTestData());
1076 }
1078 TEST_F(ArrayList, cxListAt) {
1079 verifyAt(arrayListFromTestData());
1080 }
1082 TEST_F(LinkedList, cxListFind) {
1083 verifyFind(linkedListFromTestData());
1084 }
1086 TEST_F(PointerLinkedList, cxListFind) {
1087 verifyFind(pointerLinkedListFromTestData());
1088 }
1090 TEST_F(ArrayList, cxListFind) {
1091 verifyFind(arrayListFromTestData());
1092 }
1094 TEST_F(LinkedList, cxListSort) {
1095 verifySort(linkedListFromTestData());
1096 }
1098 TEST_F(PointerLinkedList, cxListSort) {
1099 verifySort(pointerLinkedListFromTestData());
1100 }
1102 TEST_F(ArrayList, cxListSort) {
1103 verifySort(arrayListFromTestData());
1104 }
1106 TEST_F(LinkedList, Iterator) {
1107 verifyIterator(linkedListFromTestData());
1108 }
1110 TEST_F(PointerLinkedList, Iterator) {
1111 verifyIterator(pointerLinkedListFromTestData());
1112 }
1114 TEST_F(ArrayList, Iterator) {
1115 verifyIterator(arrayListFromTestData());
1116 }
1118 TEST_F(LinkedList, InsertViaIterator) {
1119 int fivenums[] = {0, 1, 2, 3, 4, 5};
1120 CxList *list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int)));
1121 cxListAddArray(list, fivenums, 5);
1122 verifyInsertViaIterator(list);
1123 }
1125 TEST_F(PointerLinkedList, InsertViaIterator) {
1126 int fivenums[] = {0, 1, 2, 3, 4, 5};
1127 auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS));
1128 // note: cannot use cxListAddArray() because we don't have a list of pointers
1129 cx_for_n(i, 5) cxListAdd(list, &fivenums[i]);
1130 verifyInsertViaIterator(list);
1131 }
1133 TEST_F(ArrayList, InsertViaIterator) {
1134 int fivenums[] = {0, 1, 2, 3, 4, 5};
1135 auto list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 4));
1136 cxListAddArray(list, fivenums, 5);
1137 verifyInsertViaIterator(list);
1138 }
1140 TEST_F(LinkedList, cxListReverse) {
1141 verifyReverse(linkedListFromTestData());
1142 }
1144 TEST_F(PointerLinkedList, cxListReverse) {
1145 verifyReverse(pointerLinkedListFromTestData());
1146 }
1148 TEST_F(ArrayList, cxListReverse) {
1149 verifyReverse(arrayListFromTestData());
1150 }
1152 TEST_F(LinkedList, cxListCompare) {
1153 auto left = linkedListFromTestData();
1154 auto right = linkedListFromTestData();
1155 verifyCompare(left, right);
1156 }
1158 TEST_F(LinkedList, cxListCompareWithPtrList) {
1159 auto left = linkedListFromTestData();
1160 auto right = pointerLinkedListFromTestData();
1161 verifyCompare(left, right);
1162 }
1164 TEST_F(LinkedList, cxListCompareWithArrayList) {
1165 auto left = linkedListFromTestData();
1166 auto right = arrayListFromTestData();
1167 verifyCompare(left, right);
1168 }
1170 TEST_F(PointerLinkedList, cxListCompare) {
1171 auto left = pointerLinkedListFromTestData();
1172 auto right = pointerLinkedListFromTestData();
1173 verifyCompare(left, right);
1174 }
1176 TEST_F(PointerLinkedList, cxListCompareWithNormalList) {
1177 auto left = pointerLinkedListFromTestData();
1178 auto right = linkedListFromTestData();
1179 verifyCompare(left, right);
1180 }
1182 TEST_F(PointerLinkedList, cxListCompareWithArrayList) {
1183 auto left = pointerLinkedListFromTestData();
1184 auto right = arrayListFromTestData();
1185 verifyCompare(left, right);
1186 }
1188 TEST_F(ArrayList, cxListCompare) {
1189 auto left = arrayListFromTestData();
1190 auto right = arrayListFromTestData();
1191 verifyCompare(left, right);
1192 }
1194 TEST_F(ArrayList, cxListCompareWithPtrList) {
1195 auto left = arrayListFromTestData();
1196 auto right = pointerLinkedListFromTestData();
1197 verifyCompare(left, right);
1198 }
1200 TEST_F(ArrayList, cxListCompareWithNormalList) {
1201 auto left = arrayListFromTestData();
1202 auto right = linkedListFromTestData();
1203 verifyCompare(left, right);
1204 }
1206 TEST_F(PointerLinkedList, NoDestructor) {
1207 void *item = cxMalloc(&testingAllocator, sizeof(int));
1208 auto list = cxLinkedListCreate(cxDefaultAllocator, cx_cmp_int, CX_STORE_POINTERS);
1209 cxListAdd(list, item);
1210 ASSERT_FALSE(testingAllocator.verify());
1211 cxListDestroy(list);
1212 EXPECT_FALSE(testingAllocator.verify());
1213 cxFree(&testingAllocator, item);
1214 EXPECT_TRUE(testingAllocator.verify());
1215 }
1217 TEST_F(PointerLinkedList, SimpleDestructor) {
1218 int item = 0;
1219 auto list = cxLinkedListCreate(cxDefaultAllocator, cx_cmp_int, CX_STORE_POINTERS);
1220 list->content_destructor_type = CX_DESTRUCTOR_SIMPLE;
1221 list->simple_destructor = [](void *elem) { *(int *) elem = 42; };
1222 cxListAdd(list, &item);
1223 cxListDestroy(list);
1224 EXPECT_EQ(item, 42);
1225 }
1227 TEST_F(PointerLinkedList, AdvancedDestructor) {
1228 void *item = cxMalloc(&testingAllocator, sizeof(int));
1229 auto list = cxLinkedListCreate(cxDefaultAllocator, cx_cmp_int, CX_STORE_POINTERS);
1230 list->content_destructor_type = CX_DESTRUCTOR_ADVANCED;
1231 list->advanced_destructor.data = &testingAllocator;
1232 list->advanced_destructor.func = (cx_destructor_func2) cxFree;
1233 cxListAdd(list, item);
1234 ASSERT_FALSE(testingAllocator.verify());
1235 cxListDestroy(list);
1236 EXPECT_TRUE(testingAllocator.verify());
1237 }
