Mercurial > hg > ucx / file comparison

comparison: test/test_list.cpp

test/test_list.cpp

changeset 517
b3baaf9b7e3c
parent 509
0d3c6075f82c
child 518
74d0372f5c6f
equal deleted inserted replaced
516:7bcea73303ce 517:b3baaf9b7e3c
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 */
28
29 #include "cx/linked_list.h"
30 #include "cx/utils.h"
31 #include "util_allocator.h"
32
33 #include <gtest/gtest.h>
34 #include <array>
35 #include <vector>
36 #include <unordered_set>
37 #include <algorithm>
38
39 static int cmp_int_impl(
40 int const *l,
41 int const *r
42 ) {
43 int left = *l, right = *r;
44 return left == right ? 0 : (left < right ? -1 : 1);
45 }
46
47 #define cmp_int ((CxListComparator) cmp_int_impl)
48
49 struct node {
50 node *next = nullptr;
51 node *prev = nullptr;
52 int data = 0;
53 };
54
55 const ptrdiff_t loc_prev = offsetof(struct node, prev);
56 const ptrdiff_t loc_next = offsetof(struct node, next);
57 const ptrdiff_t loc_data = offsetof(struct node, data);
58
59 struct node_test_data {
60 node *begin;
61
62 explicit node_test_data(node *begin) : begin(begin) {}
63 node_test_data(node_test_data&) = delete;
64 node_test_data(node_test_data&&) = default;
65
66 ~node_test_data() {
67 auto n = begin;
68 while (n != nullptr) {
69 auto next = n->next;
70 delete n;
71 n = next;
72 }
73 }
74 };
75
76 static node_test_data create_nodes_test_data(size_t len) {
77 if (len == 0) return node_test_data{nullptr};
78 auto begin = new node;
79 auto prev = begin;
80 for (size_t i = 1; i < len; i++) {
81 auto n = new node;
82 cx_linked_list_link(prev, n, loc_prev, loc_next);
83 prev = n;
84 }
85 return node_test_data{begin};
86 }
87
88 template<typename InputIter>
89 static node_test_data create_nodes_test_data(InputIter begin, InputIter end) {
90 if (begin == end) return node_test_data{nullptr};
91 node *first = new node;
92 first->data = *begin;
93 node *prev = first;
94 begin++;
95 for (; begin != end; begin++) {
96 auto n = new node;
97 n->data = *begin;
98 cx_linked_list_link(prev, n, loc_prev, loc_next);
99 prev = n;
100 }
101 return node_test_data{first};
102 }
103
104 static node_test_data create_nodes_test_data(std::initializer_list<int> data) {
105 return create_nodes_test_data(data.begin(), data.end());
106 }
107
108 template<size_t N>
109 struct int_test_data {
110 std::array<int, N> data;
111
112 int_test_data() {
113 cx_for_n (i, N) data[i] = ::rand(); // NOLINT(cert-msc50-cpp)
114 }
115 };
116
117 TEST(LinkedList_LowLevel, link_unlink) {
118 node a, b, c;
119
120 cx_linked_list_link(&a, &b, loc_prev, loc_next);
121 EXPECT_EQ(a.prev, nullptr);
122 EXPECT_EQ(a.next, &b);
123 EXPECT_EQ(b.prev, &a);
124 EXPECT_EQ(b.next, nullptr);
125
126 cx_linked_list_unlink(&a, &b, loc_prev, loc_next);
127 EXPECT_EQ(a.prev, nullptr);
128 EXPECT_EQ(a.next, nullptr);
129 EXPECT_EQ(b.prev, nullptr);
130 EXPECT_EQ(b.next, nullptr);
131
132 cx_linked_list_link(&b, &c, loc_prev, loc_next);
133 cx_linked_list_link(&a, &b, loc_prev, loc_next);
134 cx_linked_list_unlink(&b, &c, 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);
139 EXPECT_EQ(c.prev, nullptr);
140 EXPECT_EQ(c.next, nullptr);
141 }
142
143 TEST(LinkedList_LowLevel, cx_linked_list_at) {
144 node a, b, c, d;
145 cx_linked_list_link(&a, &b, loc_prev, loc_next);
146 cx_linked_list_link(&b, &c, loc_prev, loc_next);
147 cx_linked_list_link(&c, &d, loc_prev, loc_next);
148
149 EXPECT_EQ(cx_linked_list_at(&a, 0, loc_next, 0), &a);
150 EXPECT_EQ(cx_linked_list_at(&a, 0, loc_next, 1), &b);
151 EXPECT_EQ(cx_linked_list_at(&a, 0, loc_next, 2), &c);
152 EXPECT_EQ(cx_linked_list_at(&a, 0, loc_next, 3), &d);
153 EXPECT_EQ(cx_linked_list_at(&a, 0, loc_next, 4), nullptr);
154
155 EXPECT_EQ(cx_linked_list_at(&b, 1, loc_prev, 0), &a);
156 EXPECT_EQ(cx_linked_list_at(&b, 1, loc_next, 1), &b);
157 EXPECT_EQ(cx_linked_list_at(&b, 1, loc_next, 2), &c);
158 EXPECT_EQ(cx_linked_list_at(&b, 1, loc_next, 3), &d);
159 EXPECT_EQ(cx_linked_list_at(&b, 1, loc_next, 4), nullptr);
160
161 EXPECT_EQ(cx_linked_list_at(&d, 3, loc_prev, 0), &a);
162 EXPECT_EQ(cx_linked_list_at(&d, 3, loc_prev, 1), &b);
163 }
164
165 TEST(LinkedList_LowLevel, cx_linked_list_find) {
166 auto testdata = create_nodes_test_data({2, 4, 6, 8});
167 auto list = testdata.begin;
168 int s;
169
170 s = 2;
171 EXPECT_EQ(cx_linked_list_find(list, loc_next, loc_data, false, cmp_int, &s), 0);
172 s = 4;
173 EXPECT_EQ(cx_linked_list_find(list, loc_next, loc_data, false, cmp_int, &s), 1);
174 s = 6;
175 EXPECT_EQ(cx_linked_list_find(list, loc_next, loc_data, false, cmp_int, &s), 2);
176 s = 8;
177 EXPECT_EQ(cx_linked_list_find(list, loc_next, loc_data, false, cmp_int, &s), 3);
178 s = 10;
179 EXPECT_EQ(cx_linked_list_find(list, loc_next, loc_data, false, cmp_int, &s), 4);
180 s = -2;
181 EXPECT_EQ(cx_linked_list_find(list, loc_next, loc_data, false, cmp_int, &s), 4);
182 }
183
184 TEST(LinkedList_LowLevel, cx_linked_list_compare) {
185 auto ta = create_nodes_test_data({2, 4, 6, 8});
186 auto tb = create_nodes_test_data({2, 4, 6});
187 auto tc = create_nodes_test_data({2, 4, 6, 9});
188 auto la = ta.begin, lb = tb.begin, lc = tc.begin;
189
190 EXPECT_GT(cx_linked_list_compare(la, lb, loc_next, loc_data, false, cmp_int), 0);
191 EXPECT_LT(cx_linked_list_compare(lb, la, loc_next, loc_data, false, cmp_int), 0);
192 EXPECT_GT(cx_linked_list_compare(lc, la, loc_next, loc_data, false, cmp_int), 0);
193 EXPECT_LT(cx_linked_list_compare(la, lc, loc_next, loc_data, false, cmp_int), 0);
194 EXPECT_EQ(cx_linked_list_compare(la, la, loc_next, loc_data, false, cmp_int), 0);
195 }
196
197 TEST(LinkedList_LowLevel, cx_linked_list_add) {
198 // test with begin, end / prev, next
199 {
200 node nodes[4];
201 void *begin = nullptr, *end = nullptr;
202
203 cx_linked_list_add(&begin, &end, loc_prev, loc_next, &nodes[0]);
204 EXPECT_EQ(begin, &nodes[0]);
205 EXPECT_EQ(end, &nodes[0]);
206 EXPECT_EQ(nodes[0].prev, nullptr);
207 EXPECT_EQ(nodes[0].next, nullptr);
208
209 cx_linked_list_add(&begin, &end, loc_prev, loc_next, &nodes[1]);
210 EXPECT_EQ(begin, &nodes[0]);
211 EXPECT_EQ(end, &nodes[1]);
212 EXPECT_EQ(nodes[0].next, &nodes[1]);
213 EXPECT_EQ(nodes[1].prev, &nodes[0]);
214 }
215
216 // test with begin only / prev, next
217 {
218 node nodes[4];
219 void *begin = nullptr;
220
221 cx_linked_list_add(&begin, nullptr, loc_prev, loc_next, &nodes[0]);
222 EXPECT_EQ(begin, &nodes[0]);
223 cx_linked_list_add(&begin, nullptr, loc_prev, loc_next, &nodes[1]);
224 EXPECT_EQ(begin, &nodes[0]);
225 EXPECT_EQ(nodes[0].next, &nodes[1]);
226 EXPECT_EQ(nodes[1].prev, &nodes[0]);
227
228 cx_linked_list_add(&begin, nullptr, loc_prev, loc_next, &nodes[2]);
229 EXPECT_EQ(nodes[1].next, &nodes[2]);
230 EXPECT_EQ(nodes[2].prev, &nodes[1]);
231 }
232
233 // test with end only / prev, next
234 {
235 node nodes[4];
236 void *end = nullptr;
237
238 cx_linked_list_add(nullptr, &end, loc_prev, loc_next, &nodes[0]);
239 EXPECT_EQ(end, &nodes[0]);
240 cx_linked_list_add(nullptr, &end, loc_prev, loc_next, &nodes[1]);
241 EXPECT_EQ(end, &nodes[1]);
242 EXPECT_EQ(nodes[0].next, &nodes[1]);
243 EXPECT_EQ(nodes[1].prev, &nodes[0]);
244
245 cx_linked_list_add(nullptr, &end, loc_prev, loc_next, &nodes[2]);
246 EXPECT_EQ(end, &nodes[2]);
247 EXPECT_EQ(nodes[1].next, &nodes[2]);
248 EXPECT_EQ(nodes[2].prev, &nodes[1]);
249 }
250
251 // test with begin, end / next
252 {
253 node nodes[4];
254 void *begin = nullptr, *end = nullptr;
255
256 cx_linked_list_add(&begin, &end, -1, loc_next, &nodes[0]);
257 EXPECT_EQ(begin, &nodes[0]);
258 EXPECT_EQ(end, &nodes[0]);
259 cx_linked_list_add(&begin, &end, -1, loc_next, &nodes[1]);
260 EXPECT_EQ(end, &nodes[1]);
261 EXPECT_EQ(nodes[0].next, &nodes[1]);
262 EXPECT_EQ(nodes[1].prev, nullptr);
263 }
264 }
265
266 TEST(LinkedList_LowLevel, cx_linked_list_prepend) {
267 // test with begin, end / prev, next
268 {
269 node nodes[4];
270 void *begin = nullptr, *end = nullptr;
271
272 cx_linked_list_prepend(&begin, &end, loc_prev, loc_next, &nodes[0]);
273 EXPECT_EQ(begin, &nodes[0]);
274 EXPECT_EQ(end, &nodes[0]);
275 EXPECT_EQ(nodes[0].prev, nullptr);
276 EXPECT_EQ(nodes[0].next, nullptr);
277
278 cx_linked_list_prepend(&begin, &end, loc_prev, loc_next, &nodes[1]);
279 EXPECT_EQ(begin, &nodes[1]);
280 EXPECT_EQ(end, &nodes[0]);
281 EXPECT_EQ(nodes[1].next, &nodes[0]);
282 EXPECT_EQ(nodes[0].prev, &nodes[1]);
283 }
284
285 // test with begin only / prev, next
286 {
287 node nodes[4];
288 void *begin = nullptr;
289
290 cx_linked_list_prepend(&begin, nullptr, loc_prev, loc_next, &nodes[0]);
291 EXPECT_EQ(begin, &nodes[0]);
292 cx_linked_list_prepend(&begin, nullptr, loc_prev, loc_next, &nodes[1]);
293 EXPECT_EQ(begin, &nodes[1]);
294 EXPECT_EQ(nodes[1].next, &nodes[0]);
295 EXPECT_EQ(nodes[0].prev, &nodes[1]);
296
297 cx_linked_list_prepend(&begin, nullptr, loc_prev, loc_next, &nodes[2]);
298 EXPECT_EQ(begin, &nodes[2]);
299 EXPECT_EQ(nodes[2].next, &nodes[1]);
300 EXPECT_EQ(nodes[1].prev, &nodes[2]);
301 }
302
303 // test with end only / prev, next
304 {
305 node nodes[4];
306 void *end = nullptr;
307
308 cx_linked_list_prepend(nullptr, &end, loc_prev, loc_next, &nodes[0]);
309 EXPECT_EQ(end, &nodes[0]);
310 cx_linked_list_prepend(nullptr, &end, loc_prev, loc_next, &nodes[1]);
311 EXPECT_EQ(end, &nodes[0]);
312 EXPECT_EQ(nodes[1].next, &nodes[0]);
313 EXPECT_EQ(nodes[0].prev, &nodes[1]);
314
315 cx_linked_list_prepend(nullptr, &end, loc_prev, loc_next, &nodes[2]);
316 EXPECT_EQ(end, &nodes[0]);
317 EXPECT_EQ(nodes[2].next, &nodes[1]);
318 EXPECT_EQ(nodes[1].prev, &nodes[2]);
319 }
320
321 // test with begin, end / next
322 {
323 node nodes[4];
324 void *begin = nullptr, *end = nullptr;
325
326 cx_linked_list_prepend(&begin, &end, -1, loc_next, &nodes[0]);
327 EXPECT_EQ(begin, &nodes[0]);
328 EXPECT_EQ(end, &nodes[0]);
329 cx_linked_list_prepend(&begin, &end, -1, loc_next, &nodes[1]);
330 cx_linked_list_prepend(&begin, &end, -1, loc_next, &nodes[2]);
331 EXPECT_EQ(begin, &nodes[2]);
332 EXPECT_EQ(end, &nodes[0]);
333 EXPECT_EQ(nodes[1].next, &nodes[0]);
334 EXPECT_EQ(nodes[2].next, &nodes[1]);
335 EXPECT_EQ(nodes[1].prev, nullptr);
336 EXPECT_EQ(nodes[0].prev, nullptr);
337 }
338 }
339
340 TEST(LinkedList_LowLevel, cx_linked_list_insert) {
341 // insert mid list
342 {
343 node nodes[4];
344 void *begin = &nodes[0], *end = &nodes[2];
345
346 cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
347 cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
348
349 cx_linked_list_insert(&begin, &end, loc_prev, loc_next, &nodes[1], &nodes[3]);
350 EXPECT_EQ(begin, &nodes[0]);
351 EXPECT_EQ(end, &nodes[2]);
352 EXPECT_EQ(nodes[1].next, &nodes[3]);
353 EXPECT_EQ(nodes[2].prev, &nodes[3]);
354 EXPECT_EQ(nodes[3].prev, &nodes[1]);
355 EXPECT_EQ(nodes[3].next, &nodes[2]);
356 }
357
358 // insert end
359 {
360 node nodes[4];
361 void *begin = &nodes[0], *end = &nodes[2];
362
363 cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
364 cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
365
366 cx_linked_list_insert(&begin, &end, loc_prev, loc_next, &nodes[2], &nodes[3]);
367 EXPECT_EQ(begin, &nodes[0]);
368 EXPECT_EQ(end, &nodes[3]);
369 EXPECT_EQ(nodes[2].next, &nodes[3]);
370 EXPECT_EQ(nodes[3].prev, &nodes[2]);
371 EXPECT_EQ(nodes[3].next, nullptr);
372 }
373
374 // insert begin
375 {
376 node nodes[4];
377 void *begin = &nodes[0], *end = &nodes[2];
378
379 cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
380 cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
381
382 cx_linked_list_insert(&begin, &end, loc_prev, loc_next, nullptr, &nodes[3]);
383 EXPECT_EQ(begin, &nodes[3]);
384 EXPECT_EQ(end, &nodes[2]);
385 EXPECT_EQ(nodes[0].prev, &nodes[3]);
386 EXPECT_EQ(nodes[3].prev, nullptr);
387 EXPECT_EQ(nodes[3].next, &nodes[0]);
388 }
389 }
390
391 TEST(LinkedList_LowLevel, cx_linked_list_insert_chain) {
392 // insert mid list
393 {
394 node nodes[5];
395 void *begin = &nodes[0], *end = &nodes[2];
396
397 cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
398 cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
399 cx_linked_list_link(&nodes[3], &nodes[4], loc_prev, loc_next);
400
401 cx_linked_list_insert_chain(&begin, &end, loc_prev, loc_next, &nodes[1], &nodes[3], nullptr);
402 EXPECT_EQ(begin, &nodes[0]);
403 EXPECT_EQ(end, &nodes[2]);
404 EXPECT_EQ(nodes[1].next, &nodes[3]);
405 EXPECT_EQ(nodes[2].prev, &nodes[4]);
406 EXPECT_EQ(nodes[3].prev, &nodes[1]);
407 EXPECT_EQ(nodes[4].next, &nodes[2]);
408 }
409
410 // insert end
411 {
412 node nodes[5];
413 void *begin = &nodes[0], *end = &nodes[2];
414
415 cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
416 cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
417 cx_linked_list_link(&nodes[3], &nodes[4], loc_prev, loc_next);
418
419 cx_linked_list_insert_chain(&begin, &end, loc_prev, loc_next, &nodes[2], &nodes[3], nullptr);
420 EXPECT_EQ(begin, &nodes[0]);
421 EXPECT_EQ(end, &nodes[4]);
422 EXPECT_EQ(nodes[2].next, &nodes[3]);
423 EXPECT_EQ(nodes[3].prev, &nodes[2]);
424 EXPECT_EQ(nodes[4].next, nullptr);
425 }
426
427 // insert begin
428 {
429 node nodes[5];
430 void *begin = &nodes[0], *end = &nodes[2];
431
432 cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
433 cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
434 cx_linked_list_link(&nodes[3], &nodes[4], loc_prev, loc_next);
435
436 cx_linked_list_insert_chain(&begin, &end, loc_prev, loc_next, nullptr, &nodes[3], nullptr);
437 EXPECT_EQ(begin, &nodes[3]);
438 EXPECT_EQ(end, &nodes[2]);
439 EXPECT_EQ(nodes[0].prev, &nodes[4]);
440 EXPECT_EQ(nodes[3].prev, nullptr);
441 EXPECT_EQ(nodes[4].next, &nodes[0]);
442 }
443 }
444
445 TEST(LinkedList_LowLevel, cx_linked_list_first) {
446 auto testdata = create_nodes_test_data(3);
447 auto begin = testdata.begin;
448 EXPECT_EQ(cx_linked_list_first(begin, loc_prev), begin);
449 EXPECT_EQ(cx_linked_list_first(begin->next, loc_prev), begin);
450 EXPECT_EQ(cx_linked_list_first(begin->next->next, loc_prev), begin);
451 }
452
453 TEST(LinkedList_LowLevel, cx_linked_list_last) {
454 auto testdata = create_nodes_test_data(3);
455 auto begin = testdata.begin;
456 auto end = begin->next->next;
457 EXPECT_EQ(cx_linked_list_last(begin, loc_next), end);
458 EXPECT_EQ(cx_linked_list_last(begin->next, loc_next), end);
459 EXPECT_EQ(cx_linked_list_last(begin->next->next, loc_next), end);
460 }
461
462 TEST(LinkedList_LowLevel, cx_linked_list_prev) {
463 auto testdata = create_nodes_test_data(3);
464 auto begin = testdata.begin;
465 EXPECT_EQ(cx_linked_list_prev(begin, loc_next, begin), nullptr);
466 EXPECT_EQ(cx_linked_list_prev(begin, loc_next, begin->next), begin);
467 EXPECT_EQ(cx_linked_list_prev(begin, loc_next, begin->next->next), begin->next);
468 }
469
470 TEST(LinkedList_LowLevel, cx_linked_list_remove) {
471 auto testdata = create_nodes_test_data({2, 4, 6});
472 auto begin = reinterpret_cast<void *>(testdata.begin);
473 auto first = testdata.begin;
474 auto second = first->next;
475 auto third = second->next;
476 auto end = reinterpret_cast<void *>(third);
477
478 cx_linked_list_remove(&begin, &end, loc_prev, loc_next, second);
479 EXPECT_EQ(begin, first);
480 EXPECT_EQ(end, third);
481 EXPECT_EQ(first->prev, nullptr);
482 EXPECT_EQ(first->next, third);
483 EXPECT_EQ(third->prev, first);
484 EXPECT_EQ(third->next, nullptr);
485
486 cx_linked_list_remove(&begin, &end, loc_prev, loc_next, third);
487 EXPECT_EQ(begin, first);
488 EXPECT_EQ(end, first);
489 EXPECT_EQ(first->prev, nullptr);
490 EXPECT_EQ(first->next, nullptr);
491
492 cx_linked_list_remove(&begin, &end, loc_prev, loc_next, first);
493 EXPECT_EQ(begin, nullptr);
494 EXPECT_EQ(end, nullptr);
495 }
496
497 TEST(LinkedList_LowLevel, cx_linked_list_size) {
498 EXPECT_EQ(cx_linked_list_size(nullptr, loc_next), 0);
499
500 {
501 auto testdata = create_nodes_test_data(5);
502 EXPECT_EQ(cx_linked_list_size(testdata.begin, loc_next), 5);
503 }
504
505 {
506 auto testdata = create_nodes_test_data(13);
507 EXPECT_EQ(cx_linked_list_size(testdata.begin, loc_next), 13);
508 }
509 }
510
511 TEST(LinkedList_LowLevel, cx_linked_list_sort) {
512 int_test_data<1000> testdata;
513 std::array<int, 1000> sorted{};
514 std::partial_sort_copy(testdata.data.begin(), testdata.data.end(), sorted.begin(), sorted.end());
515
516 auto scrambled = create_nodes_test_data(testdata.data.begin(), testdata.data.end());
517 void *begin = scrambled.begin;
518 void *end = cx_linked_list_last(begin, loc_next);
519
520 cx_linked_list_sort(&begin, &end, loc_prev, loc_next, loc_data,
521 false, cmp_int);
522
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 }
537
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});
541
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;
545
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, 0, cmp_int), 0);
550 }
551
552 class HighLevelTest : public ::testing::Test {
553 mutable std::unordered_set<CxList *> lists;
554 protected:
555 void SetUp() override {
556 cxTestingAllocatorReset();
557 }
558
559 void TearDown() override {
560 for (auto &&l: lists) cxListDestroy(l);
561 EXPECT_TRUE(cxTestingAllocatorVerify());
562 }
563
564 static constexpr size_t testdata_len = 250;
565 int_test_data<testdata_len> testdata;
566
567 auto autofree(CxList *list) const -> CxList * {
568 lists.insert(list);
569 return list;
570 }
571
572 auto linkedListFromTestData() const -> CxList * {
573 return autofree(
574 cxLinkedListFromArray(
575 cxTestingAllocator,
576 cmp_int,
577 sizeof(int),
578 testdata_len,
579 testdata.data.data()
580 )
581 );
582 }
583
584 auto pointerLinkedListFromTestData() const -> CxList * {
585 auto list = autofree(cxPointerLinkedListCreate(cxTestingAllocator, cmp_int));
586 cx_for_n(i, testdata_len) cxListAdd(list, &testdata.data[i]);
587 return list;
588 }
589
590 static void verifyCreate(CxList *list) {
591 EXPECT_EQ(list->size, 0);
592 EXPECT_EQ(list->capacity, (size_t) -1);
593 EXPECT_EQ(list->allocator, cxTestingAllocator);
594 EXPECT_EQ(list->cmpfunc, cmp_int);
595 }
596
597 void verifyAdd(CxList *list, bool write_through) {
598 auto len = testdata_len;
599 cx_for_n (i, len) EXPECT_EQ(cxListAdd(list, &testdata.data[i]), 0);
600 EXPECT_EQ(list->size, len);
601 EXPECT_GE(list->capacity, list->size);
602 cx_for_n (i, len) EXPECT_EQ(*(int *) cxListAt(list, i), testdata.data[i]);
603 cx_for_n (i, len) ++testdata.data[i];
604 if (write_through) {
605 cx_for_n (i, len) EXPECT_EQ(*(int *) cxListAt(list, i), testdata.data[i]);
606 } else {
607 cx_for_n (i, len) EXPECT_EQ(*(int *) cxListAt(list, i), testdata.data[i] - 1);
608 }
609 }
610
611 static void verifyInsert(CxList *list) {
612 int a = 5, b = 47, c = 13, d = 42;
613
614 EXPECT_NE(cxListInsert(list, 1, &a), 0);
615 EXPECT_EQ(list->size, 0);
616 EXPECT_EQ(cxListInsert(list, 0, &a), 0);
617 EXPECT_EQ(list->size, 1);
618 EXPECT_EQ(cxListInsert(list, 0, &b), 0);
619 EXPECT_EQ(list->size, 2);
620 EXPECT_EQ(cxListInsert(list, 1, &c), 0);
621 EXPECT_EQ(list->size, 3);
622 EXPECT_EQ(cxListInsert(list, 3, &d), 0);
623
624 EXPECT_EQ(list->size, 4);
625 EXPECT_GE(list->capacity, list->size);
626
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 }
632
633 void verifyRemove(CxList *list) const {
634 EXPECT_EQ(cxListRemove(list, 2), 0);
635 EXPECT_EQ(cxListRemove(list, 4), 0);
636 EXPECT_EQ(list->size, testdata_len - 2);
637 EXPECT_GE(list->capacity, list->size);
638 EXPECT_EQ(*(int *) cxListAt(list, 0), testdata.data[0]);
639 EXPECT_EQ(*(int *) cxListAt(list, 1), testdata.data[1]);
640 EXPECT_EQ(*(int *) cxListAt(list, 2), testdata.data[3]);
641 EXPECT_EQ(*(int *) cxListAt(list, 3), testdata.data[4]);
642 EXPECT_EQ(*(int *) cxListAt(list, 4), testdata.data[6]);
643
644 EXPECT_EQ(cxListRemove(list, 0), 0);
645 EXPECT_EQ(list->size, testdata_len - 3);
646 EXPECT_GE(list->capacity, list->size);
647 EXPECT_EQ(*(int *) cxListAt(list, 0), testdata.data[1]);
648 EXPECT_EQ(*(int *) cxListAt(list, 1), testdata.data[3]);
649
650 EXPECT_NE(cxListRemove(list, testdata_len), 0);
651 }
652
653 void verifyAt(CxList *list) const {
654 auto len = testdata_len;
655 EXPECT_EQ(list->size, len);
656 cx_for_n (i, list->size) EXPECT_EQ(*(int *) cxListAt(list, i), testdata.data[i]);
657 EXPECT_EQ(cxListAt(list, list->size), nullptr);
658 }
659
660 void verifyFind(CxList *list) const {
661 cx_for_n (attempt, 25) {
662 size_t exp = rand() % testdata_len; // NOLINT(cert-msc50-cpp)
663 int val = testdata.data[exp];
664 // randomly picked number could occur earlier in list - find first position
665 cx_for_n (i, exp) {
666 if (testdata.data[i] == val) {
667 exp = i;
668 break;
669 }
670 }
671 EXPECT_EQ(cxListFind(list, &val), exp);
672 }
673 }
674
675 void verifySort(CxList *list) const {
676 std::array<int, testdata_len> expected{};
677 std::partial_sort_copy(testdata.data.begin(), testdata.data.end(), expected.begin(), expected.end());
678 cxListSort(list);
679 cx_for_n (i, testdata_len) ASSERT_EQ(*(int *) cxListAt(list, i), expected[i]);
680 }
681
682 void verifyIterator(CxList *list) const {
683 int i = 0;
684 CxIterator iter = cxListBegin(list);
685 cx_foreach(int*, x, iter) {
686 ASSERT_EQ(iter.index, (size_t) (i + 1) / 2);
687 ASSERT_EQ(*x, testdata.data[i]);
688 if (i % 2 == 1) iter.remove = true;
689 i++;
690 }
691 auto len = testdata_len;
692 EXPECT_EQ(i, len);
693 ASSERT_EQ(list->size, len / 2);
694 cx_for_n(j, len / 2) ASSERT_EQ(*(int *) cxListAt(list, j), testdata.data[j * 2]);
695 }
696
697 static void verifyInsertViaIterator(CxList *list) {
698 int newdata[] = {10, 20, 30, 40, 50};
699
700 CxIterator iter = cxListIterator(list, 2);
701 EXPECT_TRUE(cxIteratorValid(&iter));
702 EXPECT_EQ(iter.index, 2);
703 EXPECT_EQ(*(int *) cxIteratorCurrent(&iter), 2);
704 cxListInsertAfter(&iter, &newdata[0]);
705 EXPECT_TRUE(cxIteratorValid(&iter));
706 EXPECT_EQ(iter.index, 2);
707 EXPECT_EQ(*(int *) cxIteratorCurrent(&iter), 2);
708 cxListInsertBefore(&iter, &newdata[1]);
709 EXPECT_TRUE(cxIteratorValid(&iter));
710 EXPECT_EQ(iter.index, 3);
711 EXPECT_EQ(*(int *) cxIteratorCurrent(&iter), 2);
712
713 iter = cxListBegin(list);
714 cxListInsertBefore(&iter, &newdata[2]);
715 EXPECT_TRUE(cxIteratorValid(&iter));
716 EXPECT_EQ(iter.index, 1);
717 EXPECT_EQ(*(int *) cxIteratorCurrent(&iter), 0);
718 iter = cxListIterator(list, list->size);
719 cxListInsertBefore(&iter, &newdata[3]);
720 EXPECT_FALSE(cxIteratorValid(&iter));
721 EXPECT_EQ(iter.index, 9);
722 iter = cxListIterator(list, list->size);
723 cxListInsertAfter(&iter, &newdata[4]);
724 EXPECT_FALSE(cxIteratorValid(&iter));
725 EXPECT_EQ(iter.index, 10);
726
727 int expdata[] = {30, 0, 1, 20, 2, 10, 3, 4, 40, 50};
728 cx_for_n (j, 10) EXPECT_EQ(*(int *) cxListAt(list, j), expdata[j]);
729 }
730 };
731
732 class LinkedList : public HighLevelTest {
733 };
734
735 class PointerLinkedList : public HighLevelTest {
736 };
737
738 TEST_F(LinkedList, cxLinkedListCreate) {
739 CxList *list = autofree(cxLinkedListCreate(cxTestingAllocator, cmp_int, sizeof(int)));
740 EXPECT_EQ(list->itemsize, sizeof(int));
741 verifyCreate(list);
742 }
743
744 TEST_F(PointerLinkedList, cxPointerLinkedListCreate) {
745 CxList *list = autofree(cxPointerLinkedListCreate(cxTestingAllocator, cmp_int));
746 EXPECT_EQ(list->itemsize, sizeof(void *));
747 verifyCreate(list);
748 }
749
750 TEST_F(LinkedList, cxLinkedListFromArray) {
751 CxList *expected = autofree(cxLinkedListCreate(cxTestingAllocator, cmp_int, sizeof(int)));
752 cx_for_n (i, testdata_len) cxListAdd(expected, &testdata.data[i]);
753 CxList *list = autofree(cxLinkedListFromArray(cxTestingAllocator, cmp_int, sizeof(int),
754 testdata_len, testdata.data.data()));
755 EXPECT_EQ(cxListCompare(list, expected), 0);
756 }
757
758 TEST_F(LinkedList, cxListAdd) {
759 CxList *list = autofree(cxLinkedListCreate(cxTestingAllocator, cmp_int, sizeof(int)));
760 verifyAdd(list, false);
761 }
762
763 TEST_F(PointerLinkedList, cxListAdd) {
764 CxList *list = autofree(cxPointerLinkedListCreate(cxTestingAllocator, cmp_int));
765 verifyAdd(list, true);
766 }
767
768 TEST_F(LinkedList, cxListInsert) {
769 verifyInsert(autofree(cxLinkedListCreate(cxTestingAllocator, cmp_int, sizeof(int))));
770 }
771
772 TEST_F(PointerLinkedList, cxListInsert) {
773 verifyInsert(autofree(cxPointerLinkedListCreate(cxTestingAllocator, cmp_int)));
774 }
775
776 TEST_F(LinkedList, cxListRemove) {
777 verifyRemove(linkedListFromTestData());
778 }
779
780 TEST_F(PointerLinkedList, cxListRemove) {
781 verifyRemove(pointerLinkedListFromTestData());
782 }
783
784 TEST_F(LinkedList, cxListAt) {
785 verifyAt(linkedListFromTestData());
786 }
787
788 TEST_F(PointerLinkedList, cxListAt) {
789 verifyAt(pointerLinkedListFromTestData());
790 }
791
792 TEST_F(LinkedList, cxListFind) {
793 verifyFind(linkedListFromTestData());
794 }
795
796 TEST_F(PointerLinkedList, cxListFind) {
797 verifyFind(pointerLinkedListFromTestData());
798 }
799
800 TEST_F(LinkedList, cxListSort) {
801 verifySort(linkedListFromTestData());
802 }
803
804 TEST_F(PointerLinkedList, cxListSort) {
805 verifySort(pointerLinkedListFromTestData());
806 }
807
808 TEST_F(LinkedList, Iterator) {
809 verifyIterator(linkedListFromTestData());
810 }
811
812 TEST_F(PointerLinkedList, Iterator) {
813 verifyIterator(pointerLinkedListFromTestData());
814 }
815
816 TEST_F(LinkedList, InsertViaIterator) {
817 int fivenums[] = {0, 1, 2, 3, 4, 5};
818 CxList *list = autofree(cxLinkedListFromArray(cxTestingAllocator, cmp_int, sizeof(int), 5, fivenums));
819 verifyInsertViaIterator(list);
820 }
821
822 TEST_F(PointerLinkedList, InsertViaIterator) {
823 int fivenums[] = {0, 1, 2, 3, 4, 5};
824 CxList *list = autofree(cxPointerLinkedListCreate(cxTestingAllocator, cmp_int));
825 cx_for_n (i, 5) cxListAdd(list, &fivenums[i]);
826 verifyInsertViaIterator(list);
827 }

Mercurial Repository: ucx

mercurial