test/test_list.cpp@309e8b08c60e
test/test_list.cpp
Mon, 23 Jan 2023 20:34:18 +0100
- author
- Mike Becker <universe@uap-core.de>
- date
- Mon, 23 Jan 2023 20:34:18 +0100
- changeset 639
- 309e8b08c60e
- parent 638
- eafb45eefc51
- child 641
- d402fead3386
- permissions
- -rw-r--r--
temporarily remove pointer lists - see #234
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 arrayListFromTestData() const -> CxList * {
577 auto list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), testdata_len));
578 cxListAddArray(list, testdata.data.data(), testdata_len);
579 return list;
580 }
582 void verifyCreate(CxList *list) const {
583 EXPECT_EQ(list->content_destructor_type, CX_DESTRUCTOR_NONE);
584 EXPECT_EQ(list->size, 0);
585 EXPECT_EQ(list->allocator, &testingAllocator);
586 EXPECT_EQ(list->cmpfunc, cx_cmp_int);
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(list->size, len);
596 EXPECT_GE(list->capacity, list->size);
597 cx_for_n (i, len) EXPECT_EQ(*(int *) cxListAt(list, i), testdata.data[i]);
598 cx_for_n (i, len) ++testdata.data[i];
599 if (as_pointer) {
600 cx_for_n (i, len) EXPECT_EQ(*(int *) cxListAt(list, i), testdata.data[i]);
601 } else {
602 cx_for_n (i, len) EXPECT_EQ(*(int *) cxListAt(list, i), testdata.data[i] - 1);
603 }
604 }
606 static void verifyInsert(CxList *list) {
607 int a = 5, b = 47, c = 13, d = 42;
609 EXPECT_NE(cxListInsert(list, 1, &a), 0);
610 EXPECT_EQ(list->size, 0);
611 EXPECT_EQ(cxListInsert(list, 0, &a), 0);
612 EXPECT_EQ(list->size, 1);
613 EXPECT_EQ(cxListInsert(list, 0, &b), 0);
614 EXPECT_EQ(list->size, 2);
615 EXPECT_EQ(cxListInsert(list, 1, &c), 0);
616 EXPECT_EQ(list->size, 3);
617 EXPECT_EQ(cxListInsert(list, 3, &d), 0);
619 ASSERT_EQ(list->size, 4);
620 EXPECT_GE(list->capacity, list->size);
622 EXPECT_EQ(*(int *) cxListAt(list, 0), 47);
623 EXPECT_EQ(*(int *) cxListAt(list, 1), 13);
624 EXPECT_EQ(*(int *) cxListAt(list, 2), 5);
625 EXPECT_EQ(*(int *) cxListAt(list, 3), 42);
626 }
628 static void verifyInsertArray(CxList *list) {
629 int a[5] = {5, 47, 11, 13, 42};
630 int b[5] = {9, 18, 72, 50, 7};
632 size_t inserted;
634 inserted = cxListInsertArray(list, 0, a, 5);
635 EXPECT_EQ(inserted, 5);
636 EXPECT_EQ(*(int *) cxListAt(list, 0), 5);
637 EXPECT_EQ(*(int *) cxListAt(list, 1), 47);
638 EXPECT_EQ(*(int *) cxListAt(list, 2), 11);
639 EXPECT_EQ(*(int *) cxListAt(list, 3), 13);
640 EXPECT_EQ(*(int *) cxListAt(list, 4), 42);
642 inserted = cxListInsertArray(list, 3, b, 5);
643 EXPECT_EQ(inserted, 5);
644 EXPECT_EQ(*(int *) cxListAt(list, 0), 5);
645 EXPECT_EQ(*(int *) cxListAt(list, 1), 47);
646 EXPECT_EQ(*(int *) cxListAt(list, 2), 11);
647 EXPECT_EQ(*(int *) cxListAt(list, 3), 9);
648 EXPECT_EQ(*(int *) cxListAt(list, 4), 18);
649 EXPECT_EQ(*(int *) cxListAt(list, 5), 72);
650 EXPECT_EQ(*(int *) cxListAt(list, 6), 50);
651 EXPECT_EQ(*(int *) cxListAt(list, 7), 7);
652 EXPECT_EQ(*(int *) cxListAt(list, 8), 13);
653 EXPECT_EQ(*(int *) cxListAt(list, 9), 42);
654 }
656 void verifyRemove(CxList *list) const {
657 EXPECT_EQ(cxListRemove(list, 2), 0);
658 EXPECT_EQ(cxListRemove(list, 4), 0);
659 EXPECT_EQ(list->size, testdata_len - 2);
660 EXPECT_GE(list->capacity, list->size);
661 EXPECT_EQ(*(int *) cxListAt(list, 0), testdata.data[0]);
662 EXPECT_EQ(*(int *) cxListAt(list, 1), testdata.data[1]);
663 EXPECT_EQ(*(int *) cxListAt(list, 2), testdata.data[3]);
664 EXPECT_EQ(*(int *) cxListAt(list, 3), testdata.data[4]);
665 EXPECT_EQ(*(int *) cxListAt(list, 4), testdata.data[6]);
667 EXPECT_EQ(cxListRemove(list, 0), 0);
668 EXPECT_EQ(list->size, testdata_len - 3);
669 EXPECT_GE(list->capacity, list->size);
670 EXPECT_EQ(*(int *) cxListAt(list, 0), testdata.data[1]);
671 EXPECT_EQ(*(int *) cxListAt(list, 1), testdata.data[3]);
673 EXPECT_NE(cxListRemove(list, testdata_len), 0);
674 }
676 void verifyAt(CxList *list) const {
677 auto len = testdata_len;
678 EXPECT_EQ(list->size, len);
679 cx_for_n (i, len) {
680 EXPECT_EQ(*(int *) cxListAt(list, i), testdata.data[i]);
681 }
682 EXPECT_EQ(cxListAt(list, list->size), nullptr);
683 }
685 void verifyFind(CxList *list) const {
686 cx_for_n (attempt, 25) {
687 size_t exp = rand() % testdata_len; // NOLINT(cert-msc50-cpp)
688 int val = testdata.data[exp];
689 // randomly picked number could occur earlier in list - find first position
690 cx_for_n (i, exp) {
691 if (testdata.data[i] == val) {
692 exp = i;
693 break;
694 }
695 }
696 EXPECT_EQ(cxListFind(list, &val), exp);
697 }
698 }
700 void verifySort(CxList *list) const {
701 std::array<int, testdata_len> expected{};
702 std::partial_sort_copy(testdata.data.begin(), testdata.data.end(), expected.begin(), expected.end());
703 cxListSort(list);
704 cx_for_n (i, testdata_len) ASSERT_EQ(*(int *) cxListAt(list, i), expected[i]);
705 }
707 void verifyIterator(CxList *list) const {
708 int i = 0;
709 auto iter = cxListBeginMut(list);
710 cx_foreach(int*, x, iter) {
711 ASSERT_EQ(iter.index, (size_t) (i + 1) / 2);
712 ASSERT_EQ(*x, testdata.data[i]);
713 if (i % 2 == 1) cxIteratorFlagRemoval(iter);
714 i++;
715 }
716 auto len = testdata_len;
717 EXPECT_EQ(i, len);
718 ASSERT_EQ(list->size, len / 2);
719 cx_for_n(j, len / 2) ASSERT_EQ(*(int *) cxListAt(list, j), testdata.data[j * 2]);
720 }
722 static void verifyInsertViaIterator(CxList *list) {
723 int newdata[] = {10, 20, 30, 40, 50};
725 auto iter = cxListMutIterator(list, 2);
726 EXPECT_TRUE(cxIteratorValid(iter));
727 EXPECT_EQ(iter.index, 2);
728 EXPECT_EQ(*(int *) cxIteratorCurrent(iter), 2);
729 cxListInsertAfter(&iter, &newdata[0]);
730 EXPECT_TRUE(cxIteratorValid(iter));
731 EXPECT_EQ(iter.index, 2);
732 EXPECT_EQ(*(int *) cxIteratorCurrent(iter), 2);
733 cxListInsertBefore(&iter, &newdata[1]);
734 EXPECT_TRUE(cxIteratorValid(iter));
735 EXPECT_EQ(iter.index, 3);
736 EXPECT_EQ(*(int *) cxIteratorCurrent(iter), 2);
738 iter = cxListBeginMut(list);
739 cxListInsertBefore(&iter, &newdata[2]);
740 EXPECT_TRUE(cxIteratorValid(iter));
741 EXPECT_EQ(iter.index, 1);
742 EXPECT_EQ(*(int *) cxIteratorCurrent(iter), 0);
743 iter = cxListMutIterator(list, list->size);
744 cxListInsertBefore(&iter, &newdata[3]);
745 EXPECT_FALSE(cxIteratorValid(iter));
746 EXPECT_EQ(iter.index, 9);
747 iter = cxListMutIterator(list, list->size);
748 cxListInsertAfter(&iter, &newdata[4]);
749 EXPECT_FALSE(cxIteratorValid(iter));
750 EXPECT_EQ(iter.index, 10);
752 int expdata[] = {30, 0, 1, 20, 2, 10, 3, 4, 40, 50};
753 cx_for_n (j, 10) EXPECT_EQ(*(int *) cxListAt(list, j), expdata[j]);
754 }
756 void verifyReverse(CxList *list) const {
757 cxListReverse(list);
758 cx_for_n(i, testdata_len) {
759 ASSERT_EQ(*(int *) cxListAt(list, i), testdata.data[testdata_len - 1 - i]);
760 }
761 }
763 static void verifyCompare(
764 CxList *left,
765 CxList *right
766 ) {
767 EXPECT_EQ(cxListCompare(left, right), 0);
768 int x = 42;
769 cxListAdd(left, &x);
770 ASSERT_GT(left->size, right->size);
771 EXPECT_GT(cxListCompare(left, right), 0);
772 EXPECT_LT(cxListCompare(right, left), 0);
773 cxListAdd(right, &x);
774 ASSERT_EQ(left->size, right->size);
775 EXPECT_EQ(cxListCompare(left, right), 0);
776 int a = 5, b = 10;
777 cxListInsert(left, 15, &a);
778 cxListInsert(right, 15, &b);
779 ASSERT_EQ(left->size, right->size);
780 EXPECT_LT(cxListCompare(left, right), 0);
781 EXPECT_GT(cxListCompare(right, left), 0);
782 *(int *) cxListAt(left, 15) = 10;
783 EXPECT_EQ(cxListCompare(left, right), 0);
784 }
785 };
787 class LinkedList : public HighLevelTest {
788 };
790 class ArrayList : public HighLevelTest {
791 };
793 TEST_F(LinkedList, cxLinkedListCreate) {
794 CxList *list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int)));
795 ASSERT_NE(list, nullptr);
796 EXPECT_EQ(list->itemsize, sizeof(int));
797 EXPECT_EQ(list->capacity, (size_t) -1);
798 verifyCreate(list);
799 }
801 TEST_F(ArrayList, cxArrayListCreate) {
802 CxList *list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 8));
803 ASSERT_NE(list, nullptr);
804 EXPECT_EQ(list->itemsize, sizeof(int));
805 EXPECT_EQ(list->capacity, 8);
806 verifyCreate(list);
807 }
809 TEST_F(LinkedList, cxListAdd) {
810 CxList *list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int)));
811 verifyAdd(list, false);
812 }
814 TEST_F(ArrayList, cxListAdd) {
815 CxList *list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 8));
816 verifyAdd(list, false);
817 }
819 TEST_F(LinkedList, cxListInsert) {
820 verifyInsert(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int))));
821 }
823 TEST_F(ArrayList, cxListInsert) {
824 verifyInsert(autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 2)));
825 }
827 TEST_F(LinkedList, cxListInsertArray) {
828 verifyInsertArray(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int))));
829 }
831 TEST_F(ArrayList, cxListInsertArray) {
832 verifyInsertArray(autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 4)));
833 }
835 TEST_F(LinkedList, cxListRemove) {
836 verifyRemove(linkedListFromTestData());
837 }
839 TEST_F(ArrayList, cxListRemove) {
840 verifyRemove(arrayListFromTestData());
841 }
843 TEST_F(LinkedList, cxListAt) {
844 verifyAt(linkedListFromTestData());
845 }
847 TEST_F(ArrayList, cxListAt) {
848 verifyAt(arrayListFromTestData());
849 }
851 TEST_F(LinkedList, cxListFind) {
852 verifyFind(linkedListFromTestData());
853 }
855 TEST_F(ArrayList, cxListFind) {
856 verifyFind(arrayListFromTestData());
857 }
859 TEST_F(LinkedList, cxListSort) {
860 verifySort(linkedListFromTestData());
861 }
863 TEST_F(ArrayList, cxListSort) {
864 verifySort(arrayListFromTestData());
865 }
867 TEST_F(LinkedList, Iterator) {
868 verifyIterator(linkedListFromTestData());
869 }
871 TEST_F(ArrayList, Iterator) {
872 verifyIterator(arrayListFromTestData());
873 }
875 TEST_F(LinkedList, InsertViaIterator) {
876 int fivenums[] = {0, 1, 2, 3, 4, 5};
877 CxList *list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int)));
878 cxListAddArray(list, fivenums, 5);
879 verifyInsertViaIterator(list);
880 }
882 TEST_F(ArrayList, InsertViaIterator) {
883 int fivenums[] = {0, 1, 2, 3, 4, 5};
884 CxList *list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 4));
885 cxListAddArray(list, fivenums, 5);
886 verifyInsertViaIterator(list);
887 }
889 TEST_F(LinkedList, cxListReverse) {
890 verifyReverse(linkedListFromTestData());
891 }
893 TEST_F(ArrayList, cxListReverse) {
894 verifyReverse(arrayListFromTestData());
895 }
897 TEST_F(LinkedList, cxListCompare) {
898 auto left = linkedListFromTestData();
899 auto right = linkedListFromTestData();
900 verifyCompare(left, right);
901 }
903 TEST_F(LinkedList, cxListCompareWithArrayList) {
904 auto left = linkedListFromTestData();
905 auto right = arrayListFromTestData();
906 verifyCompare(left, right);
907 }
909 TEST_F(ArrayList, cxListCompare) {
910 auto left = arrayListFromTestData();
911 auto right = arrayListFromTestData();
912 verifyCompare(left, right);
913 }
915 TEST_F(ArrayList, cxListCompareWithLinkedList) {
916 auto left = arrayListFromTestData();
917 auto right = linkedListFromTestData();
918 verifyCompare(left, right);
919 }
