universe@390: /*
universe@390:  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
universe@390:  *
universe@390:  * Copyright 2021 Mike Becker, Olaf Wintermann All rights reserved.
universe@390:  *
universe@390:  * Redistribution and use in source and binary forms, with or without
universe@390:  * modification, are permitted provided that the following conditions are met:
universe@390:  *
universe@390:  *   1. Redistributions of source code must retain the above copyright
universe@390:  *      notice, this list of conditions and the following disclaimer.
universe@390:  *
universe@390:  *   2. Redistributions in binary form must reproduce the above copyright
universe@390:  *      notice, this list of conditions and the following disclaimer in the
universe@390:  *      documentation and/or other materials provided with the distribution.
universe@390:  *
universe@390:  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
universe@390:  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
universe@390:  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
universe@390:  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
universe@390:  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
universe@390:  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
universe@390:  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
universe@390:  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
universe@390:  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
universe@390:  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
universe@390:  * POSSIBILITY OF SUCH DAMAGE.
universe@390:  */
universe@390: 
universe@398: #include "cx/linked_list.h"
universe@606: #include "cx/array_list.h"
universe@509: #include "cx/utils.h"
universe@602: #include "cx/compare.h"
universe@422: #include "util_allocator.h"
universe@398: 
universe@517: #include <gtest/gtest.h>
universe@517: #include <array>
universe@517: #include <vector>
universe@517: #include <unordered_set>
universe@517: #include <algorithm>
universe@517: 
universe@486: struct node {
universe@517:     node *next = nullptr;
universe@517:     node *prev = nullptr;
universe@517:     int data = 0;
universe@486: };
universe@486: 
universe@486: const ptrdiff_t loc_prev = offsetof(struct node, prev);
universe@486: const ptrdiff_t loc_next = offsetof(struct node, next);
universe@486: const ptrdiff_t loc_data = offsetof(struct node, data);
universe@486: 
universe@517: struct node_test_data {
universe@520:     node *begin = nullptr;
universe@517: 
universe@520:     explicit node_test_data(node *begin) : begin(begin) {
universe@520:         auto n = begin;
universe@520:         while (n != nullptr) {
universe@520:             nodes.push_back(n);
universe@520:             n = n->next;
universe@520:         }
universe@520:     }
universe@520: 
universe@520:     node_test_data(node_test_data &) = delete;
universe@520: 
universe@520:     node_test_data(node_test_data &&) = default;
universe@517: 
universe@517:     ~node_test_data() {
universe@520:         for (auto &&n: nodes) delete n;
universe@486:     }
universe@520: 
universe@520: private:
universe@520:     std::vector<node *> nodes;
universe@517: };
universe@517: 
universe@517: static node_test_data create_nodes_test_data(size_t len) {
universe@517:     if (len == 0) return node_test_data{nullptr};
universe@517:     auto begin = new node;
universe@517:     auto prev = begin;
universe@517:     for (size_t i = 1; i < len; i++) {
universe@517:         auto n = new node;
universe@517:         cx_linked_list_link(prev, n, loc_prev, loc_next);
universe@517:         prev = n;
universe@517:     }
universe@517:     return node_test_data{begin};
universe@486: }
universe@486: 
universe@517: template<typename InputIter>
universe@528: static node_test_data create_nodes_test_data(
universe@528:         InputIter begin,
universe@528:         InputIter end
universe@528: ) {
universe@517:     if (begin == end) return node_test_data{nullptr};
universe@517:     node *first = new node;
universe@517:     first->data = *begin;
universe@517:     node *prev = first;
universe@517:     begin++;
universe@517:     for (; begin != end; begin++) {
universe@517:         auto n = new node;
universe@517:         n->data = *begin;
universe@517:         cx_linked_list_link(prev, n, loc_prev, loc_next);
universe@517:         prev = n;
universe@486:     }
universe@517:     return node_test_data{first};
universe@486: }
universe@486: 
universe@517: static node_test_data create_nodes_test_data(std::initializer_list<int> data) {
universe@517:     return create_nodes_test_data(data.begin(), data.end());
universe@509: }
universe@509: 
universe@517: template<size_t N>
universe@517: struct int_test_data {
universe@517:     std::array<int, N> data;
universe@482: 
universe@517:     int_test_data() {
universe@517:         cx_for_n (i, N) data[i] = ::rand(); // NOLINT(cert-msc50-cpp)
universe@517:     }
universe@517: };
universe@517: 
universe@517: TEST(LinkedList_LowLevel, link_unlink) {
universe@517:     node a, b, c;
universe@482: 
universe@482:     cx_linked_list_link(&a, &b, loc_prev, loc_next);
universe@517:     EXPECT_EQ(a.prev, nullptr);
universe@517:     EXPECT_EQ(a.next, &b);
universe@517:     EXPECT_EQ(b.prev, &a);
universe@517:     EXPECT_EQ(b.next, nullptr);
universe@482: 
universe@482:     cx_linked_list_unlink(&a, &b, loc_prev, loc_next);
universe@517:     EXPECT_EQ(a.prev, nullptr);
universe@517:     EXPECT_EQ(a.next, nullptr);
universe@517:     EXPECT_EQ(b.prev, nullptr);
universe@517:     EXPECT_EQ(b.next, nullptr);
universe@482: 
universe@482:     cx_linked_list_link(&b, &c, loc_prev, loc_next);
universe@482:     cx_linked_list_link(&a, &b, loc_prev, loc_next);
universe@482:     cx_linked_list_unlink(&b, &c, loc_prev, loc_next);
universe@517:     EXPECT_EQ(a.prev, nullptr);
universe@517:     EXPECT_EQ(a.next, &b);
universe@517:     EXPECT_EQ(b.prev, &a);
universe@517:     EXPECT_EQ(b.next, nullptr);
universe@517:     EXPECT_EQ(c.prev, nullptr);
universe@517:     EXPECT_EQ(c.next, nullptr);
universe@482: }
universe@482: 
universe@517: TEST(LinkedList_LowLevel, cx_linked_list_at) {
universe@517:     node a, b, c, d;
universe@486:     cx_linked_list_link(&a, &b, loc_prev, loc_next);
universe@486:     cx_linked_list_link(&b, &c, loc_prev, loc_next);
universe@486:     cx_linked_list_link(&c, &d, loc_prev, loc_next);
universe@438: 
universe@517:     EXPECT_EQ(cx_linked_list_at(&a, 0, loc_next, 0), &a);
universe@517:     EXPECT_EQ(cx_linked_list_at(&a, 0, loc_next, 1), &b);
universe@517:     EXPECT_EQ(cx_linked_list_at(&a, 0, loc_next, 2), &c);
universe@517:     EXPECT_EQ(cx_linked_list_at(&a, 0, loc_next, 3), &d);
universe@517:     EXPECT_EQ(cx_linked_list_at(&a, 0, loc_next, 4), nullptr);
universe@438: 
universe@517:     EXPECT_EQ(cx_linked_list_at(&b, 1, loc_prev, 0), &a);
universe@517:     EXPECT_EQ(cx_linked_list_at(&b, 1, loc_next, 1), &b);
universe@517:     EXPECT_EQ(cx_linked_list_at(&b, 1, loc_next, 2), &c);
universe@517:     EXPECT_EQ(cx_linked_list_at(&b, 1, loc_next, 3), &d);
universe@517:     EXPECT_EQ(cx_linked_list_at(&b, 1, loc_next, 4), nullptr);
universe@438: 
universe@517:     EXPECT_EQ(cx_linked_list_at(&d, 3, loc_prev, 0), &a);
universe@517:     EXPECT_EQ(cx_linked_list_at(&d, 3, loc_prev, 1), &b);
universe@438: }
universe@438: 
universe@517: TEST(LinkedList_LowLevel, cx_linked_list_find) {
universe@517:     auto testdata = create_nodes_test_data({2, 4, 6, 8});
universe@517:     auto list = testdata.begin;
universe@487:     int s;
universe@487: 
universe@487:     s = 2;
universe@639:     EXPECT_EQ(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s), 0);
universe@487:     s = 4;
universe@639:     EXPECT_EQ(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s), 1);
universe@487:     s = 6;
universe@639:     EXPECT_EQ(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s), 2);
universe@487:     s = 8;
universe@639:     EXPECT_EQ(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s), 3);
universe@487:     s = 10;
universe@699:     EXPECT_LT(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s), 0);
universe@487:     s = -2;
universe@699:     EXPECT_LT(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s), 0);
universe@487: }
universe@487: 
universe@517: TEST(LinkedList_LowLevel, cx_linked_list_compare) {
universe@517:     auto ta = create_nodes_test_data({2, 4, 6, 8});
universe@517:     auto tb = create_nodes_test_data({2, 4, 6});
universe@517:     auto tc = create_nodes_test_data({2, 4, 6, 9});
universe@517:     auto la = ta.begin, lb = tb.begin, lc = tc.begin;
universe@486: 
universe@639:     EXPECT_GT(cx_linked_list_compare(la, lb, loc_next, loc_data, cx_cmp_int), 0);
universe@639:     EXPECT_LT(cx_linked_list_compare(lb, la, loc_next, loc_data, cx_cmp_int), 0);
universe@639:     EXPECT_GT(cx_linked_list_compare(lc, la, loc_next, loc_data, cx_cmp_int), 0);
universe@639:     EXPECT_LT(cx_linked_list_compare(la, lc, loc_next, loc_data, cx_cmp_int), 0);
universe@639:     EXPECT_EQ(cx_linked_list_compare(la, la, loc_next, loc_data, cx_cmp_int), 0);
universe@486: }
universe@486: 
universe@517: TEST(LinkedList_LowLevel, cx_linked_list_add) {
universe@517:     // test with begin, end / prev, next
universe@517:     {
universe@517:         node nodes[4];
universe@517:         void *begin = nullptr, *end = nullptr;
universe@449: 
universe@517:         cx_linked_list_add(&begin, &end, loc_prev, loc_next, &nodes[0]);
universe@517:         EXPECT_EQ(begin, &nodes[0]);
universe@517:         EXPECT_EQ(end, &nodes[0]);
universe@517:         EXPECT_EQ(nodes[0].prev, nullptr);
universe@517:         EXPECT_EQ(nodes[0].next, nullptr);
universe@449: 
universe@517:         cx_linked_list_add(&begin, &end, loc_prev, loc_next, &nodes[1]);
universe@517:         EXPECT_EQ(begin, &nodes[0]);
universe@517:         EXPECT_EQ(end, &nodes[1]);
universe@517:         EXPECT_EQ(nodes[0].next, &nodes[1]);
universe@517:         EXPECT_EQ(nodes[1].prev, &nodes[0]);
universe@517:     }
universe@449: 
olaf@442:     // test with begin only / prev, next
universe@517:     {
universe@517:         node nodes[4];
universe@517:         void *begin = nullptr;
universe@449: 
universe@517:         cx_linked_list_add(&begin, nullptr, loc_prev, loc_next, &nodes[0]);
universe@517:         EXPECT_EQ(begin, &nodes[0]);
universe@517:         cx_linked_list_add(&begin, nullptr, loc_prev, loc_next, &nodes[1]);
universe@517:         EXPECT_EQ(begin, &nodes[0]);
universe@517:         EXPECT_EQ(nodes[0].next, &nodes[1]);
universe@517:         EXPECT_EQ(nodes[1].prev, &nodes[0]);
universe@449: 
universe@517:         cx_linked_list_add(&begin, nullptr, loc_prev, loc_next, &nodes[2]);
universe@517:         EXPECT_EQ(nodes[1].next, &nodes[2]);
universe@517:         EXPECT_EQ(nodes[2].prev, &nodes[1]);
universe@517:     }
universe@449: 
universe@475:     // test with end only / prev, next
universe@517:     {
universe@517:         node nodes[4];
universe@517:         void *end = nullptr;
universe@475: 
universe@517:         cx_linked_list_add(nullptr, &end, loc_prev, loc_next, &nodes[0]);
universe@517:         EXPECT_EQ(end, &nodes[0]);
universe@517:         cx_linked_list_add(nullptr, &end, loc_prev, loc_next, &nodes[1]);
universe@517:         EXPECT_EQ(end, &nodes[1]);
universe@517:         EXPECT_EQ(nodes[0].next, &nodes[1]);
universe@517:         EXPECT_EQ(nodes[1].prev, &nodes[0]);
universe@475: 
universe@517:         cx_linked_list_add(nullptr, &end, loc_prev, loc_next, &nodes[2]);
universe@517:         EXPECT_EQ(end, &nodes[2]);
universe@517:         EXPECT_EQ(nodes[1].next, &nodes[2]);
universe@517:         EXPECT_EQ(nodes[2].prev, &nodes[1]);
universe@517:     }
universe@475: 
olaf@442:     // test with begin, end / next
universe@517:     {
universe@517:         node nodes[4];
universe@517:         void *begin = nullptr, *end = nullptr;
universe@449: 
universe@517:         cx_linked_list_add(&begin, &end, -1, loc_next, &nodes[0]);
universe@517:         EXPECT_EQ(begin, &nodes[0]);
universe@517:         EXPECT_EQ(end, &nodes[0]);
universe@517:         cx_linked_list_add(&begin, &end, -1, loc_next, &nodes[1]);
universe@517:         EXPECT_EQ(end, &nodes[1]);
universe@517:         EXPECT_EQ(nodes[0].next, &nodes[1]);
universe@517:         EXPECT_EQ(nodes[1].prev, nullptr);
universe@517:     }
olaf@442: }
olaf@442: 
universe@517: TEST(LinkedList_LowLevel, cx_linked_list_prepend) {
universe@517:     // test with begin, end / prev, next
universe@517:     {
universe@517:         node nodes[4];
universe@517:         void *begin = nullptr, *end = nullptr;
universe@475: 
universe@517:         cx_linked_list_prepend(&begin, &end, loc_prev, loc_next, &nodes[0]);
universe@517:         EXPECT_EQ(begin, &nodes[0]);
universe@517:         EXPECT_EQ(end, &nodes[0]);
universe@517:         EXPECT_EQ(nodes[0].prev, nullptr);
universe@517:         EXPECT_EQ(nodes[0].next, nullptr);
universe@475: 
universe@517:         cx_linked_list_prepend(&begin, &end, loc_prev, loc_next, &nodes[1]);
universe@517:         EXPECT_EQ(begin, &nodes[1]);
universe@517:         EXPECT_EQ(end, &nodes[0]);
universe@517:         EXPECT_EQ(nodes[1].next, &nodes[0]);
universe@517:         EXPECT_EQ(nodes[0].prev, &nodes[1]);
universe@517:     }
universe@475: 
universe@475:     // test with begin only / prev, next
universe@517:     {
universe@517:         node nodes[4];
universe@517:         void *begin = nullptr;
universe@475: 
universe@517:         cx_linked_list_prepend(&begin, nullptr, loc_prev, loc_next, &nodes[0]);
universe@517:         EXPECT_EQ(begin, &nodes[0]);
universe@517:         cx_linked_list_prepend(&begin, nullptr, loc_prev, loc_next, &nodes[1]);
universe@517:         EXPECT_EQ(begin, &nodes[1]);
universe@517:         EXPECT_EQ(nodes[1].next, &nodes[0]);
universe@517:         EXPECT_EQ(nodes[0].prev, &nodes[1]);
universe@475: 
universe@517:         cx_linked_list_prepend(&begin, nullptr, loc_prev, loc_next, &nodes[2]);
universe@517:         EXPECT_EQ(begin, &nodes[2]);
universe@517:         EXPECT_EQ(nodes[2].next, &nodes[1]);
universe@517:         EXPECT_EQ(nodes[1].prev, &nodes[2]);
universe@517:     }
universe@475: 
universe@475:     // test with end only / prev, next
universe@517:     {
universe@517:         node nodes[4];
universe@517:         void *end = nullptr;
universe@475: 
universe@517:         cx_linked_list_prepend(nullptr, &end, loc_prev, loc_next, &nodes[0]);
universe@517:         EXPECT_EQ(end, &nodes[0]);
universe@517:         cx_linked_list_prepend(nullptr, &end, loc_prev, loc_next, &nodes[1]);
universe@517:         EXPECT_EQ(end, &nodes[0]);
universe@517:         EXPECT_EQ(nodes[1].next, &nodes[0]);
universe@517:         EXPECT_EQ(nodes[0].prev, &nodes[1]);
universe@475: 
universe@517:         cx_linked_list_prepend(nullptr, &end, loc_prev, loc_next, &nodes[2]);
universe@517:         EXPECT_EQ(end, &nodes[0]);
universe@517:         EXPECT_EQ(nodes[2].next, &nodes[1]);
universe@517:         EXPECT_EQ(nodes[1].prev, &nodes[2]);
universe@517:     }
universe@475: 
universe@475:     // test with begin, end / next
universe@517:     {
universe@517:         node nodes[4];
universe@517:         void *begin = nullptr, *end = nullptr;
universe@475: 
universe@517:         cx_linked_list_prepend(&begin, &end, -1, loc_next, &nodes[0]);
universe@517:         EXPECT_EQ(begin, &nodes[0]);
universe@517:         EXPECT_EQ(end, &nodes[0]);
universe@517:         cx_linked_list_prepend(&begin, &end, -1, loc_next, &nodes[1]);
universe@517:         cx_linked_list_prepend(&begin, &end, -1, loc_next, &nodes[2]);
universe@517:         EXPECT_EQ(begin, &nodes[2]);
universe@517:         EXPECT_EQ(end, &nodes[0]);
universe@517:         EXPECT_EQ(nodes[1].next, &nodes[0]);
universe@517:         EXPECT_EQ(nodes[2].next, &nodes[1]);
universe@517:         EXPECT_EQ(nodes[1].prev, nullptr);
universe@517:         EXPECT_EQ(nodes[0].prev, nullptr);
universe@517:     }
universe@475: }
universe@475: 
universe@517: TEST(LinkedList_LowLevel, cx_linked_list_insert) {
universe@517:     // insert mid list
universe@517:     {
universe@517:         node nodes[4];
universe@517:         void *begin = &nodes[0], *end = &nodes[2];
universe@482: 
universe@517:         cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
universe@517:         cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
universe@482: 
universe@517:         cx_linked_list_insert(&begin, &end, loc_prev, loc_next, &nodes[1], &nodes[3]);
universe@517:         EXPECT_EQ(begin, &nodes[0]);
universe@517:         EXPECT_EQ(end, &nodes[2]);
universe@517:         EXPECT_EQ(nodes[1].next, &nodes[3]);
universe@517:         EXPECT_EQ(nodes[2].prev, &nodes[3]);
universe@517:         EXPECT_EQ(nodes[3].prev, &nodes[1]);
universe@517:         EXPECT_EQ(nodes[3].next, &nodes[2]);
universe@517:     }
universe@482: 
universe@482:     // insert end
universe@517:     {
universe@517:         node nodes[4];
universe@517:         void *begin = &nodes[0], *end = &nodes[2];
universe@482: 
universe@517:         cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
universe@517:         cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
universe@482: 
universe@517:         cx_linked_list_insert(&begin, &end, loc_prev, loc_next, &nodes[2], &nodes[3]);
universe@517:         EXPECT_EQ(begin, &nodes[0]);
universe@517:         EXPECT_EQ(end, &nodes[3]);
universe@517:         EXPECT_EQ(nodes[2].next, &nodes[3]);
universe@517:         EXPECT_EQ(nodes[3].prev, &nodes[2]);
universe@517:         EXPECT_EQ(nodes[3].next, nullptr);
universe@517:     }
universe@482: 
universe@482:     // insert begin
universe@517:     {
universe@517:         node nodes[4];
universe@517:         void *begin = &nodes[0], *end = &nodes[2];
universe@482: 
universe@517:         cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
universe@517:         cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
universe@482: 
universe@517:         cx_linked_list_insert(&begin, &end, loc_prev, loc_next, nullptr, &nodes[3]);
universe@517:         EXPECT_EQ(begin, &nodes[3]);
universe@517:         EXPECT_EQ(end, &nodes[2]);
universe@517:         EXPECT_EQ(nodes[0].prev, &nodes[3]);
universe@517:         EXPECT_EQ(nodes[3].prev, nullptr);
universe@517:         EXPECT_EQ(nodes[3].next, &nodes[0]);
universe@517:     }
universe@482: }
universe@482: 
universe@517: TEST(LinkedList_LowLevel, cx_linked_list_insert_chain) {
universe@517:     // insert mid list
universe@517:     {
universe@517:         node nodes[5];
universe@517:         void *begin = &nodes[0], *end = &nodes[2];
universe@482: 
universe@517:         cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
universe@517:         cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
universe@517:         cx_linked_list_link(&nodes[3], &nodes[4], loc_prev, loc_next);
universe@482: 
universe@517:         cx_linked_list_insert_chain(&begin, &end, loc_prev, loc_next, &nodes[1], &nodes[3], nullptr);
universe@517:         EXPECT_EQ(begin, &nodes[0]);
universe@517:         EXPECT_EQ(end, &nodes[2]);
universe@517:         EXPECT_EQ(nodes[1].next, &nodes[3]);
universe@517:         EXPECT_EQ(nodes[2].prev, &nodes[4]);
universe@517:         EXPECT_EQ(nodes[3].prev, &nodes[1]);
universe@517:         EXPECT_EQ(nodes[4].next, &nodes[2]);
universe@517:     }
universe@482: 
universe@482:     // insert end
universe@517:     {
universe@517:         node nodes[5];
universe@517:         void *begin = &nodes[0], *end = &nodes[2];
universe@482: 
universe@517:         cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
universe@517:         cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
universe@517:         cx_linked_list_link(&nodes[3], &nodes[4], loc_prev, loc_next);
universe@482: 
universe@517:         cx_linked_list_insert_chain(&begin, &end, loc_prev, loc_next, &nodes[2], &nodes[3], nullptr);
universe@517:         EXPECT_EQ(begin, &nodes[0]);
universe@517:         EXPECT_EQ(end, &nodes[4]);
universe@517:         EXPECT_EQ(nodes[2].next, &nodes[3]);
universe@517:         EXPECT_EQ(nodes[3].prev, &nodes[2]);
universe@517:         EXPECT_EQ(nodes[4].next, nullptr);
universe@517:     }
universe@482: 
universe@482:     // insert begin
universe@517:     {
universe@517:         node nodes[5];
universe@517:         void *begin = &nodes[0], *end = &nodes[2];
universe@482: 
universe@517:         cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
universe@517:         cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
universe@517:         cx_linked_list_link(&nodes[3], &nodes[4], loc_prev, loc_next);
universe@482: 
universe@517:         cx_linked_list_insert_chain(&begin, &end, loc_prev, loc_next, nullptr, &nodes[3], nullptr);
universe@517:         EXPECT_EQ(begin, &nodes[3]);
universe@517:         EXPECT_EQ(end, &nodes[2]);
universe@517:         EXPECT_EQ(nodes[0].prev, &nodes[4]);
universe@517:         EXPECT_EQ(nodes[3].prev, nullptr);
universe@517:         EXPECT_EQ(nodes[4].next, &nodes[0]);
universe@517:     }
universe@482: }
universe@482: 
universe@517: TEST(LinkedList_LowLevel, cx_linked_list_first) {
universe@517:     auto testdata = create_nodes_test_data(3);
universe@517:     auto begin = testdata.begin;
universe@517:     EXPECT_EQ(cx_linked_list_first(begin, loc_prev), begin);
universe@517:     EXPECT_EQ(cx_linked_list_first(begin->next, loc_prev), begin);
universe@517:     EXPECT_EQ(cx_linked_list_first(begin->next->next, loc_prev), begin);
universe@475: }
universe@475: 
universe@517: TEST(LinkedList_LowLevel, cx_linked_list_last) {
universe@517:     auto testdata = create_nodes_test_data(3);
universe@517:     auto begin = testdata.begin;
universe@517:     auto end = begin->next->next;
universe@517:     EXPECT_EQ(cx_linked_list_last(begin, loc_next), end);
universe@517:     EXPECT_EQ(cx_linked_list_last(begin->next, loc_next), end);
universe@517:     EXPECT_EQ(cx_linked_list_last(begin->next->next, loc_next), end);
universe@456: }
universe@456: 
universe@517: TEST(LinkedList_LowLevel, cx_linked_list_prev) {
universe@517:     auto testdata = create_nodes_test_data(3);
universe@517:     auto begin = testdata.begin;
universe@517:     EXPECT_EQ(cx_linked_list_prev(begin, loc_next, begin), nullptr);
universe@517:     EXPECT_EQ(cx_linked_list_prev(begin, loc_next, begin->next), begin);
universe@517:     EXPECT_EQ(cx_linked_list_prev(begin, loc_next, begin->next->next), begin->next);
universe@473: }
universe@473: 
universe@517: TEST(LinkedList_LowLevel, cx_linked_list_remove) {
universe@517:     auto testdata = create_nodes_test_data({2, 4, 6});
universe@517:     auto begin = reinterpret_cast<void *>(testdata.begin);
universe@517:     auto first = testdata.begin;
universe@517:     auto second = first->next;
universe@517:     auto third = second->next;
universe@517:     auto end = reinterpret_cast<void *>(third);
universe@473: 
universe@486:     cx_linked_list_remove(&begin, &end, loc_prev, loc_next, second);
universe@517:     EXPECT_EQ(begin, first);
universe@517:     EXPECT_EQ(end, third);
universe@517:     EXPECT_EQ(first->prev, nullptr);
universe@517:     EXPECT_EQ(first->next, third);
universe@517:     EXPECT_EQ(third->prev, first);
universe@517:     EXPECT_EQ(third->next, nullptr);
universe@473: 
universe@486:     cx_linked_list_remove(&begin, &end, loc_prev, loc_next, third);
universe@517:     EXPECT_EQ(begin, first);
universe@517:     EXPECT_EQ(end, first);
universe@517:     EXPECT_EQ(first->prev, nullptr);
universe@517:     EXPECT_EQ(first->next, nullptr);
universe@473: 
universe@486:     cx_linked_list_remove(&begin, &end, loc_prev, loc_next, first);
universe@517:     EXPECT_EQ(begin, nullptr);
universe@517:     EXPECT_EQ(end, nullptr);
universe@473: }
universe@473: 
universe@517: TEST(LinkedList_LowLevel, cx_linked_list_size) {
universe@517:     EXPECT_EQ(cx_linked_list_size(nullptr, loc_next), 0);
universe@468: 
universe@517:     {
universe@517:         auto testdata = create_nodes_test_data(5);
universe@517:         EXPECT_EQ(cx_linked_list_size(testdata.begin, loc_next), 5);
universe@517:     }
universe@468: 
universe@517:     {
universe@517:         auto testdata = create_nodes_test_data(13);
universe@517:         EXPECT_EQ(cx_linked_list_size(testdata.begin, loc_next), 13);
universe@517:     }
universe@468: }
universe@468: 
universe@702: TEST(LinkedList_LowLevel, cx_linked_list_sort_empty) {
universe@702:     void *begin = nullptr;
universe@702:     EXPECT_NO_FATAL_FAILURE(
universe@702:         cx_linked_list_sort(&begin, nullptr, loc_prev, loc_next, loc_data, cx_cmp_int);
universe@702:     );
universe@702: }
universe@702: 
universe@517: TEST(LinkedList_LowLevel, cx_linked_list_sort) {
universe@521:     int_test_data<1500> testdata;
universe@521:     std::array<int, 1500> sorted{};
universe@517:     std::partial_sort_copy(testdata.data.begin(), testdata.data.end(), sorted.begin(), sorted.end());
universe@468: 
universe@517:     auto scrambled = create_nodes_test_data(testdata.data.begin(), testdata.data.end());
universe@517:     void *begin = scrambled.begin;
universe@486:     void *end = cx_linked_list_last(begin, loc_next);
universe@468: 
universe@639:     cx_linked_list_sort(&begin, &end, loc_prev, loc_next, loc_data, cx_cmp_int);
universe@468: 
universe@517:     node *check = reinterpret_cast<node *>(begin);
universe@517:     node *check_last = nullptr;
universe@517:     cx_for_n (i, sorted.size()) {
universe@517:         EXPECT_EQ(check->data, sorted[i]);
universe@517:         EXPECT_EQ(check->prev, check_last);
universe@517:         if (i < sorted.size() - 1) {
universe@517:             ASSERT_NE(check->next, nullptr);
universe@468:         }
universe@468:         check_last = check;
universe@468:         check = check->next;
universe@468:     }
universe@517:     EXPECT_EQ(check, nullptr);
universe@517:     EXPECT_EQ(end, check_last);
universe@468: }
universe@468: 
universe@517: TEST(LinkedList_LowLevel, cx_linked_list_reverse) {
universe@517:     auto testdata = create_nodes_test_data({2, 4, 6, 8});
universe@517:     auto expected = create_nodes_test_data({8, 6, 4, 2});
universe@473: 
universe@517:     auto begin = reinterpret_cast<void *>(testdata.begin);
universe@517:     auto end = cx_linked_list_last(begin, loc_next);
universe@517:     auto orig_begin = begin, orig_end = end;
universe@473: 
universe@486:     cx_linked_list_reverse(&begin, &end, loc_prev, loc_next);
universe@517:     EXPECT_EQ(end, orig_begin);
universe@517:     EXPECT_EQ(begin, orig_end);
universe@639:     EXPECT_EQ(cx_linked_list_compare(begin, expected.begin, loc_next, loc_data, cx_cmp_int), 0);
universe@473: }
universe@456: 
universe@517: class HighLevelTest : public ::testing::Test {
universe@517:     mutable std::unordered_set<CxList *> lists;
universe@517: protected:
universe@518:     CxTestingAllocator testingAllocator;
universe@455: 
universe@517:     void TearDown() override {
universe@517:         for (auto &&l: lists) cxListDestroy(l);
universe@518:         EXPECT_TRUE(testingAllocator.verify());
universe@517:     }
universe@517: 
universe@517:     static constexpr size_t testdata_len = 250;
universe@517:     int_test_data<testdata_len> testdata;
universe@517: 
universe@517:     auto autofree(CxList *list) const -> CxList * {
universe@606:         if (list != nullptr) lists.insert(list);
universe@517:         return list;
universe@517:     }
universe@517: 
universe@517:     auto linkedListFromTestData() const -> CxList * {
universe@629:         auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int)));
universe@629:         cxListAddArray(list, testdata.data.data(), testdata_len);
universe@629:         return list;
universe@517:     }
universe@517: 
universe@641:     auto pointerLinkedListFromTestData() const -> CxList * {
universe@667:         auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS));
universe@641:         // note: cannot use cxListAddArray() because we don't have a list of pointers
universe@641:         cx_for_n(i, testdata_len) cxListAdd(list, &testdata.data[i]);
universe@641:         return list;
universe@641:     }
universe@641: 
universe@606:     auto arrayListFromTestData() const -> CxList * {
universe@606:         auto list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), testdata_len));
universe@629:         cxListAddArray(list, testdata.data.data(), testdata_len);
universe@606:         return list;
universe@606:     }
universe@606: 
universe@679:     auto pointerArrayListFromTestData() const -> CxList * {
universe@679:         auto list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS, 256));
universe@679:         // note: cannot use cxListAddArray() because we don't have a list of pointers
universe@679:         cx_for_n(i, testdata_len) cxListAdd(list, &testdata.data[i]);
universe@679:         return list;
universe@679:     }
universe@679: 
universe@528:     void verifyAdd(
universe@528:             CxList *list,
universe@606:             bool as_pointer
universe@528:     ) {
universe@517:         auto len = testdata_len;
universe@517:         cx_for_n (i, len) EXPECT_EQ(cxListAdd(list, &testdata.data[i]), 0);
universe@677:         EXPECT_EQ(cxListSize(list), len);
universe@517:         cx_for_n (i, len) EXPECT_EQ(*(int *) cxListAt(list, i), testdata.data[i]);
universe@517:         cx_for_n (i, len) ++testdata.data[i];
universe@606:         if (as_pointer) {
universe@517:             cx_for_n (i, len) EXPECT_EQ(*(int *) cxListAt(list, i), testdata.data[i]);
universe@517:         } else {
universe@517:             cx_for_n (i, len) EXPECT_EQ(*(int *) cxListAt(list, i), testdata.data[i] - 1);
universe@517:         }
universe@517:     }
universe@517: 
universe@517:     static void verifyInsert(CxList *list) {
universe@517:         int a = 5, b = 47, c = 13, d = 42;
universe@517: 
universe@517:         EXPECT_NE(cxListInsert(list, 1, &a), 0);
universe@677:         EXPECT_EQ(cxListSize(list), 0);
universe@517:         EXPECT_EQ(cxListInsert(list, 0, &a), 0);
universe@677:         EXPECT_EQ(cxListSize(list), 1);
universe@517:         EXPECT_EQ(cxListInsert(list, 0, &b), 0);
universe@677:         EXPECT_EQ(cxListSize(list), 2);
universe@517:         EXPECT_EQ(cxListInsert(list, 1, &c), 0);
universe@677:         EXPECT_EQ(cxListSize(list), 3);
universe@517:         EXPECT_EQ(cxListInsert(list, 3, &d), 0);
universe@517: 
universe@677:         ASSERT_EQ(cxListSize(list), 4);
universe@517: 
universe@517:         EXPECT_EQ(*(int *) cxListAt(list, 0), 47);
universe@517:         EXPECT_EQ(*(int *) cxListAt(list, 1), 13);
universe@517:         EXPECT_EQ(*(int *) cxListAt(list, 2), 5);
universe@517:         EXPECT_EQ(*(int *) cxListAt(list, 3), 42);
universe@517:     }
universe@517: 
universe@641:     static void verifyInsertArray(
universe@641:             CxList *list,
universe@641:             bool pointers = false
universe@641:     ) {
universe@638:         int a[5] = {5, 47, 11, 13, 42};
universe@638:         int b[5] = {9, 18, 72, 50, 7};
universe@641:         int *aptr[5];
universe@641:         int *bptr[5];
universe@641:         cx_for_n(i, 5) {
universe@641:             aptr[i] = &a[i];
universe@641:             bptr[i] = &b[i];
universe@641:         }
universe@638: 
universe@638:         size_t inserted;
universe@638: 
universe@641:         if (pointers) {
universe@641:             inserted = cxListInsertArray(list, 0, aptr, 5);
universe@641:         } else {
universe@641:             inserted = cxListInsertArray(list, 0, a, 5);
universe@641:         }
universe@638:         EXPECT_EQ(inserted, 5);
universe@638:         EXPECT_EQ(*(int *) cxListAt(list, 0), 5);
universe@638:         EXPECT_EQ(*(int *) cxListAt(list, 1), 47);
universe@638:         EXPECT_EQ(*(int *) cxListAt(list, 2), 11);
universe@638:         EXPECT_EQ(*(int *) cxListAt(list, 3), 13);
universe@638:         EXPECT_EQ(*(int *) cxListAt(list, 4), 42);
universe@641:         if (pointers) {
universe@641:             inserted = cxListInsertArray(list, 3, bptr, 5);
universe@641:         } else {
universe@641:             inserted = cxListInsertArray(list, 3, b, 5);
universe@641:         }
universe@638:         EXPECT_EQ(inserted, 5);
universe@638:         EXPECT_EQ(*(int *) cxListAt(list, 0), 5);
universe@638:         EXPECT_EQ(*(int *) cxListAt(list, 1), 47);
universe@638:         EXPECT_EQ(*(int *) cxListAt(list, 2), 11);
universe@638:         EXPECT_EQ(*(int *) cxListAt(list, 3), 9);
universe@638:         EXPECT_EQ(*(int *) cxListAt(list, 4), 18);
universe@638:         EXPECT_EQ(*(int *) cxListAt(list, 5), 72);
universe@638:         EXPECT_EQ(*(int *) cxListAt(list, 6), 50);
universe@638:         EXPECT_EQ(*(int *) cxListAt(list, 7), 7);
universe@638:         EXPECT_EQ(*(int *) cxListAt(list, 8), 13);
universe@638:         EXPECT_EQ(*(int *) cxListAt(list, 9), 42);
universe@638:     }
universe@638: 
universe@517:     void verifyRemove(CxList *list) const {
universe@517:         EXPECT_EQ(cxListRemove(list, 2), 0);
universe@517:         EXPECT_EQ(cxListRemove(list, 4), 0);
universe@677:         EXPECT_EQ(cxListSize(list), testdata_len - 2);
universe@517:         EXPECT_EQ(*(int *) cxListAt(list, 0), testdata.data[0]);
universe@517:         EXPECT_EQ(*(int *) cxListAt(list, 1), testdata.data[1]);
universe@517:         EXPECT_EQ(*(int *) cxListAt(list, 2), testdata.data[3]);
universe@517:         EXPECT_EQ(*(int *) cxListAt(list, 3), testdata.data[4]);
universe@517:         EXPECT_EQ(*(int *) cxListAt(list, 4), testdata.data[6]);
universe@517: 
universe@517:         EXPECT_EQ(cxListRemove(list, 0), 0);
universe@677:         EXPECT_EQ(cxListSize(list), testdata_len - 3);
universe@517:         EXPECT_EQ(*(int *) cxListAt(list, 0), testdata.data[1]);
universe@517:         EXPECT_EQ(*(int *) cxListAt(list, 1), testdata.data[3]);
universe@517: 
universe@517:         EXPECT_NE(cxListRemove(list, testdata_len), 0);
universe@517:     }
universe@517: 
universe@672:     static void verifyClear(CxList *list) {
universe@672:         cxListClear(list);
universe@677:         EXPECT_EQ(0, cxListSize(list));
universe@672:     }
universe@666: 
universe@672:     static unsigned destr_test_ctr;
universe@672:     static int destr_last_value;
universe@672: 
universe@672:     static void simple_destr_test_fun(void *data) {
universe@672:         auto ptr = (int *) data;
universe@672:         destr_last_value = *ptr;
universe@672:         *ptr = destr_last_value + 1;
universe@672:         destr_test_ctr++;
universe@672:     }
universe@672: 
universe@672:     static void advanced_destr_test_fun(
universe@672:             [[maybe_unused]] void *u,
universe@672:             void *data
universe@672:     ) {
universe@672:         simple_destr_test_fun(data);
universe@672:     }
universe@672: 
universe@672:     void verifyAnyDestructor(CxList *list) {
universe@672:         int off = cxListIsStoringPointers(list) ? 1 : 0;
universe@672: 
universe@672:         cxListRemove(list, 15);
universe@672:         EXPECT_EQ(1, destr_test_ctr);
universe@672:         EXPECT_EQ(testdata.data[15], destr_last_value + off);
universe@677:         EXPECT_EQ(testdata_len - destr_test_ctr, cxListSize(list));
universe@672:         cxListRemove(list, 47);
universe@672:         EXPECT_EQ(2, destr_test_ctr);
universe@672:         EXPECT_EQ(testdata.data[48], destr_last_value + off);
universe@677:         EXPECT_EQ(testdata_len - destr_test_ctr, cxListSize(list));
universe@672: 
universe@672:         auto iter = cxListMutIteratorAt(list, 7);
universe@672:         cxIteratorNext(iter);
universe@672:         EXPECT_EQ(2, destr_test_ctr);
universe@672:         EXPECT_EQ(testdata.data[48], destr_last_value + off);
universe@677:         EXPECT_EQ(testdata_len - destr_test_ctr, cxListSize(list));
universe@672:         cxIteratorFlagRemoval(iter);
universe@672:         cxIteratorNext(iter);
universe@672:         EXPECT_EQ(3, destr_test_ctr);
universe@672:         EXPECT_EQ(testdata.data[8], destr_last_value + off);
universe@677:         EXPECT_EQ(testdata_len - destr_test_ctr, cxListSize(list));
universe@672: 
universe@672:         iter = cxListMutBackwardsIteratorAt(list, 5);
universe@672:         cxIteratorNext(iter);
universe@672:         EXPECT_EQ(3, destr_test_ctr);
universe@672:         EXPECT_EQ(testdata.data[8], destr_last_value + off);
universe@677:         EXPECT_EQ(testdata_len - destr_test_ctr, cxListSize(list));
universe@672:         cxIteratorFlagRemoval(iter);
universe@672:         cxIteratorNext(iter);
universe@672:         EXPECT_EQ(4, destr_test_ctr);
universe@672:         EXPECT_EQ(testdata.data[4], destr_last_value + off);
universe@677:         EXPECT_EQ(testdata_len - destr_test_ctr, cxListSize(list));
universe@666: 
universe@666:         cxListClear(list);
universe@672:         EXPECT_EQ(testdata_len, destr_test_ctr);
universe@672:         EXPECT_EQ(testdata.data[testdata_len - 1], destr_last_value + off);
universe@672:     }
universe@672: 
universe@672:     void verifySimpleDestructor(CxList *list) {
universe@672:         destr_test_ctr = 0;
universe@672:         list->simple_destructor = simple_destr_test_fun;
universe@672:         verifyAnyDestructor(list);
universe@672:     }
universe@672: 
universe@672:     void verifyAdvancedDestructor(CxList *list) {
universe@672:         destr_test_ctr = 0;
universe@677:         list->advanced_destructor = advanced_destr_test_fun;
universe@672:         verifyAnyDestructor(list);
universe@666:     }
universe@666: 
universe@647:     static void verifySwap(CxList *list) {
universe@677:         ASSERT_EQ(cxListSize(list), 0);
universe@647: 
universe@647:         int original[16] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15};
universe@647:         int swapped[16] = {8, 4, 14, 3, 1, 5, 9, 12, 0, 6, 11, 10, 7, 15, 2, 13};
universe@647: 
universe@647:         // we have to add the items one by one, because it could be a pointer list
universe@647:         cx_for_n(i, 16) {
universe@647:             cxListAdd(list, &original[i]);
universe@647:         }
universe@647: 
universe@647:         int result;
universe@647: 
universe@647:         // execute the test two times with different item sizes
universe@647:         result = cxListSwap(list, 1, 4);
universe@647:         EXPECT_EQ(0, result);
universe@647:         result = cxListSwap(list, 2, 14);
universe@647:         EXPECT_EQ(0, result);
universe@647:         result = cxListSwap(list, 9, 6);
universe@647:         EXPECT_EQ(0, result);
universe@647:         result = cxListSwap(list, 3, 3);
universe@647:         EXPECT_EQ(0, result);
universe@647:         result = cxListSwap(list, 10, 11);
universe@647:         EXPECT_EQ(0, result);
universe@647:         result = cxListSwap(list, 8, 0);
universe@647:         EXPECT_EQ(0, result);
universe@647:         result = cxListSwap(list, 7, 12);
universe@647:         EXPECT_EQ(0, result);
universe@647:         result = cxListSwap(list, 13, 15);
universe@647:         EXPECT_EQ(0, result);
universe@647: 
universe@647:         result = cxListSwap(list, 5, 16);
universe@647:         EXPECT_NE(0, result);
universe@647:         result = cxListSwap(list, 16, 6);
universe@647:         EXPECT_NE(0, result);
universe@647:         result = cxListSwap(list, 16, 17);
universe@647:         EXPECT_NE(0, result);
universe@647: 
universe@655:         auto iter = cxListIterator(list);
universe@647:         cx_foreach(int*, e, iter) {
universe@647:             EXPECT_EQ(*e, swapped[iter.index]);
universe@647:         }
universe@655:         iter = cxListBackwardsIterator(list);
universe@655:         cx_foreach(int*, e, iter) {
universe@655:             EXPECT_EQ(*e, swapped[iter.index]);
universe@647:         }
universe@647:     }
universe@647: 
universe@517:     void verifyAt(CxList *list) const {
universe@517:         auto len = testdata_len;
universe@677:         EXPECT_EQ(cxListSize(list), len);
universe@521:         cx_for_n (i, len) {
universe@521:             EXPECT_EQ(*(int *) cxListAt(list, i), testdata.data[i]);
universe@521:         }
universe@677:         EXPECT_EQ(cxListAt(list, cxListSize(list)), nullptr);
universe@517:     }
universe@517: 
universe@517:     void verifyFind(CxList *list) const {
universe@517:         cx_for_n (attempt, 25) {
universe@517:             size_t exp = rand() % testdata_len; // NOLINT(cert-msc50-cpp)
universe@517:             int val = testdata.data[exp];
universe@517:             // randomly picked number could occur earlier in list - find first position
universe@517:             cx_for_n (i, exp) {
universe@517:                 if (testdata.data[i] == val) {
universe@517:                     exp = i;
universe@517:                     break;
universe@517:                 }
universe@517:             }
universe@517:             EXPECT_EQ(cxListFind(list, &val), exp);
universe@517:         }
universe@672: 
universe@672:         int notinlist = -1;
universe@699:         EXPECT_LT(cxListFind(list, &notinlist), 0);
universe@517:     }
universe@517: 
universe@517:     void verifySort(CxList *list) const {
universe@517:         std::array<int, testdata_len> expected{};
universe@517:         std::partial_sort_copy(testdata.data.begin(), testdata.data.end(), expected.begin(), expected.end());
universe@517:         cxListSort(list);
universe@517:         cx_for_n (i, testdata_len) ASSERT_EQ(*(int *) cxListAt(list, i), expected[i]);
universe@517:     }
universe@517: 
universe@517:     void verifyIterator(CxList *list) const {
universe@655:         auto iter = cxListIterator(list);
universe@655:         size_t i = 0;
universe@517:         cx_foreach(int*, x, iter) {
universe@655:             ASSERT_EQ(i, iter.index);
universe@655:             EXPECT_EQ(*x, testdata.data[iter.index]);
universe@517:             i++;
universe@517:         }
universe@677:         ASSERT_EQ(i, cxListSize(list));
universe@655:         iter = cxListBackwardsIterator(list);
universe@655:         cx_foreach(int*, x, iter) {
universe@655:             ASSERT_EQ(i - 1, iter.index);
universe@655:             EXPECT_EQ(*x, testdata.data[iter.index]);
universe@655:             i--;
universe@655:         }
universe@655:         ASSERT_EQ(i, 0);
universe@517:         auto len = testdata_len;
universe@655:         i = len / 2;
universe@655:         auto mut_iter = cxListMutIteratorAt(list, i);
universe@655:         size_t j = 0;
universe@655:         cx_foreach(int*, x, mut_iter) {
universe@655:             ASSERT_EQ(mut_iter.index, len / 2 + j / 2);
universe@655:             ASSERT_EQ(*x, testdata.data[i]);
universe@655:             if (i % 2 == 1) cxIteratorFlagRemoval(mut_iter);
universe@655:             i++;
universe@655:             j++;
universe@655:         }
universe@655:         ASSERT_EQ(i, len);
universe@655:         i = len / 2;
universe@655:         j = 0;
universe@655:         mut_iter = cxListMutBackwardsIteratorAt(list, i - 1);
universe@655:         cx_foreach(int*, x, mut_iter) {
universe@655:             ASSERT_EQ(mut_iter.index, len / 2 - 1 - j);
universe@655:             ASSERT_EQ(*x, testdata.data[i - 1]);
universe@655:             if (i % 2 == 0) cxIteratorFlagRemoval(mut_iter);
universe@655:             i--;
universe@655:             j++;
universe@655:         }
universe@655:         ASSERT_EQ(i, 0);
universe@677:         ASSERT_EQ(cxListSize(list), len / 2);
universe@517:         cx_for_n(j, len / 2) ASSERT_EQ(*(int *) cxListAt(list, j), testdata.data[j * 2]);
universe@517:     }
universe@517: 
universe@517:     static void verifyInsertViaIterator(CxList *list) {
universe@517:         int newdata[] = {10, 20, 30, 40, 50};
universe@517: 
universe@655:         auto iter = cxListMutIteratorAt(list, 2);
universe@630:         EXPECT_TRUE(cxIteratorValid(iter));
universe@517:         EXPECT_EQ(iter.index, 2);
universe@630:         EXPECT_EQ(*(int *) cxIteratorCurrent(iter), 2);
universe@517:         cxListInsertAfter(&iter, &newdata[0]);
universe@630:         EXPECT_TRUE(cxIteratorValid(iter));
universe@517:         EXPECT_EQ(iter.index, 2);
universe@630:         EXPECT_EQ(*(int *) cxIteratorCurrent(iter), 2);
universe@517:         cxListInsertBefore(&iter, &newdata[1]);
universe@630:         EXPECT_TRUE(cxIteratorValid(iter));
universe@517:         EXPECT_EQ(iter.index, 3);
universe@630:         EXPECT_EQ(*(int *) cxIteratorCurrent(iter), 2);
universe@517: 
universe@655:         iter = cxListMutIterator(list);
universe@517:         cxListInsertBefore(&iter, &newdata[2]);
universe@630:         EXPECT_TRUE(cxIteratorValid(iter));
universe@517:         EXPECT_EQ(iter.index, 1);
universe@630:         EXPECT_EQ(*(int *) cxIteratorCurrent(iter), 0);
universe@677:         iter = cxListMutIteratorAt(list, cxListSize(list));
universe@517:         cxListInsertBefore(&iter, &newdata[3]);
universe@630:         EXPECT_FALSE(cxIteratorValid(iter));
universe@517:         EXPECT_EQ(iter.index, 9);
universe@677:         iter = cxListMutIteratorAt(list, cxListSize(list));
universe@517:         cxListInsertAfter(&iter, &newdata[4]);
universe@630:         EXPECT_FALSE(cxIteratorValid(iter));
universe@517:         EXPECT_EQ(iter.index, 10);
universe@517: 
universe@517:         int expdata[] = {30, 0, 1, 20, 2, 10, 3, 4, 40, 50};
universe@517:         cx_for_n (j, 10) EXPECT_EQ(*(int *) cxListAt(list, j), expdata[j]);
universe@517:     }
universe@521: 
universe@521:     void verifyReverse(CxList *list) const {
universe@521:         cxListReverse(list);
universe@521:         cx_for_n(i, testdata_len) {
universe@521:             ASSERT_EQ(*(int *) cxListAt(list, i), testdata.data[testdata_len - 1 - i]);
universe@521:         }
universe@521:     }
universe@521: 
universe@528:     static void verifyCompare(
universe@528:             CxList *left,
universe@528:             CxList *right
universe@528:     ) {
universe@521:         EXPECT_EQ(cxListCompare(left, right), 0);
universe@521:         int x = 42;
universe@521:         cxListAdd(left, &x);
universe@677:         ASSERT_GT(cxListSize(left), cxListSize(right));
universe@521:         EXPECT_GT(cxListCompare(left, right), 0);
universe@521:         EXPECT_LT(cxListCompare(right, left), 0);
universe@521:         cxListAdd(right, &x);
universe@677:         ASSERT_EQ(cxListSize(left), cxListSize(right));
universe@521:         EXPECT_EQ(cxListCompare(left, right), 0);
universe@521:         int a = 5, b = 10;
universe@521:         cxListInsert(left, 15, &a);
universe@521:         cxListInsert(right, 15, &b);
universe@677:         ASSERT_EQ(cxListSize(left), cxListSize(right));
universe@521:         EXPECT_LT(cxListCompare(left, right), 0);
universe@521:         EXPECT_GT(cxListCompare(right, left), 0);
universe@528:         *(int *) cxListAt(left, 15) = 10;
universe@521:         EXPECT_EQ(cxListCompare(left, right), 0);
universe@521:     }
universe@517: };
universe@517: 
universe@672: unsigned HighLevelTest::destr_test_ctr = 0;
universe@672: int HighLevelTest::destr_last_value = 0;
universe@672: 
universe@517: class LinkedList : public HighLevelTest {
universe@517: };
universe@517: 
universe@641: class PointerLinkedList : public HighLevelTest {
universe@641: };
universe@641: 
universe@606: class ArrayList : public HighLevelTest {
universe@606: };
universe@606: 
universe@679: class PointerArrayList : public HighLevelTest {
universe@679: };
universe@679: 
universe@641: TEST_F(PointerLinkedList, cxListStorePointers) {
universe@641:     auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, 47));
universe@641:     EXPECT_FALSE(cxListIsStoringPointers(list));
universe@641:     cxListStorePointers(list);
universe@677:     EXPECT_EQ(list->item_size, sizeof(void *));
universe@641:     EXPECT_NE(list->cl, nullptr);
universe@641:     EXPECT_NE(list->climpl, nullptr);
universe@641:     EXPECT_TRUE(cxListIsStoringPointers(list));
universe@641:     cxListStoreObjects(list);
universe@641:     EXPECT_NE(list->cl, nullptr);
universe@641:     EXPECT_EQ(list->climpl, nullptr);
universe@641:     EXPECT_FALSE(cxListIsStoringPointers(list));
universe@641: }
universe@641: 
universe@517: TEST_F(LinkedList, cxLinkedListCreate) {
universe@602:     CxList *list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int)));
universe@606:     ASSERT_NE(list, nullptr);
universe@677:     EXPECT_EQ(list->item_size, sizeof(int));
universe@677:     EXPECT_EQ(list->simple_destructor, nullptr);
universe@677:     EXPECT_EQ(list->advanced_destructor, nullptr);
universe@677:     EXPECT_EQ(list->destructor_data, nullptr);
universe@677:     EXPECT_EQ(cxListSize(list), 0);
universe@672:     EXPECT_EQ(list->allocator, &testingAllocator);
universe@672:     EXPECT_EQ(list->cmpfunc, cx_cmp_int);
universe@672:     EXPECT_FALSE(cxListIsStoringPointers(list));
universe@506: }
universe@506: 
universe@662: TEST_F(LinkedList, cxLinkedListCreateSimple) {
universe@662:     CxList *list = autofree(cxLinkedListCreateSimple(sizeof(int)));
universe@662:     ASSERT_NE(list, nullptr);
universe@677:     EXPECT_EQ(list->item_size, sizeof(int));
universe@662:     EXPECT_EQ(list->cmpfunc, nullptr);
universe@662:     EXPECT_EQ(list->allocator, cxDefaultAllocator);
universe@677:     EXPECT_EQ(list->simple_destructor, nullptr);
universe@677:     EXPECT_EQ(list->advanced_destructor, nullptr);
universe@677:     EXPECT_EQ(list->destructor_data, nullptr);
universe@677:     EXPECT_EQ(cxListSize(list), 0);
universe@672:     EXPECT_FALSE(cxListIsStoringPointers(list));
universe@672: }
universe@672: 
universe@679: TEST_F(PointerLinkedList, cxLinkedListCreateSimpleForPointers) {
universe@672:     CxList *list = autofree(cxLinkedListCreateSimple(CX_STORE_POINTERS));
universe@672:     ASSERT_NE(list, nullptr);
universe@677:     EXPECT_EQ(list->item_size, sizeof(void *));
universe@672:     EXPECT_EQ(list->cmpfunc, nullptr);
universe@672:     EXPECT_EQ(list->allocator, cxDefaultAllocator);
universe@677:     EXPECT_EQ(list->simple_destructor, nullptr);
universe@677:     EXPECT_EQ(list->advanced_destructor, nullptr);
universe@677:     EXPECT_EQ(list->destructor_data, nullptr);
universe@677:     EXPECT_EQ(cxListSize(list), 0);
universe@672:     EXPECT_TRUE(cxListIsStoringPointers(list));
universe@662: }
universe@662: 
universe@606: TEST_F(ArrayList, cxArrayListCreate) {
universe@606:     CxList *list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 8));
universe@606:     ASSERT_NE(list, nullptr);
universe@677:     EXPECT_EQ(list->item_size, sizeof(int));
universe@677:     EXPECT_EQ(list->simple_destructor, nullptr);
universe@677:     EXPECT_EQ(list->advanced_destructor, nullptr);
universe@677:     EXPECT_EQ(list->destructor_data, nullptr);
universe@677:     EXPECT_EQ(cxListSize(list), 0);
universe@672:     EXPECT_EQ(list->allocator, &testingAllocator);
universe@672:     EXPECT_EQ(list->cmpfunc, cx_cmp_int);
universe@672:     EXPECT_FALSE(cxListIsStoringPointers(list));
universe@606: }
universe@606: 
universe@662: TEST_F(ArrayList, cxArrayListCreateSimple) {
universe@662:     CxList *list = autofree(cxArrayListCreateSimple(sizeof(int), 8));
universe@662:     ASSERT_NE(list, nullptr);
universe@662:     EXPECT_EQ(list->cmpfunc, nullptr);
universe@662:     EXPECT_EQ(list->allocator, cxDefaultAllocator);
universe@677:     EXPECT_EQ(list->item_size, sizeof(int));
universe@677:     EXPECT_EQ(list->simple_destructor, nullptr);
universe@677:     EXPECT_EQ(list->advanced_destructor, nullptr);
universe@677:     EXPECT_EQ(list->destructor_data, nullptr);
universe@677:     EXPECT_EQ(cxListSize(list), 0);
universe@672:     EXPECT_FALSE(cxListIsStoringPointers(list));
universe@672: }
universe@672: 
universe@679: TEST_F(PointerArrayList, cxArrayListCreateSimpleForPointers) {
universe@672:     CxList *list = autofree(cxArrayListCreateSimple(CX_STORE_POINTERS, 8));
universe@672:     ASSERT_NE(list, nullptr);
universe@672:     EXPECT_EQ(list->cmpfunc, nullptr);
universe@672:     EXPECT_EQ(list->allocator, cxDefaultAllocator);
universe@677:     EXPECT_EQ(list->item_size, sizeof(void *));
universe@672:     EXPECT_TRUE(cxListIsStoringPointers(list));
universe@662: }
universe@662: 
universe@517: TEST_F(LinkedList, cxListAdd) {
universe@641:     auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int)));
universe@517:     verifyAdd(list, false);
universe@488: }
universe@488: 
universe@641: TEST_F(PointerLinkedList, cxListAdd) {
universe@667:     auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS));
universe@641:     verifyAdd(list, true);
universe@641: }
universe@641: 
universe@606: TEST_F(ArrayList, cxListAdd) {
universe@641:     auto list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 8));
universe@606:     verifyAdd(list, false);
universe@606: }
universe@606: 
universe@679: TEST_F(PointerArrayList, cxListAdd) {
universe@679:     auto list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS, 8));
universe@679:     verifyAdd(list, true);
universe@679: }
universe@679: 
universe@517: TEST_F(LinkedList, cxListInsert) {
universe@602:     verifyInsert(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int))));
universe@459: }
universe@459: 
universe@641: TEST_F(PointerLinkedList, cxListInsert) {
universe@667:     verifyInsert(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS)));
universe@641: }
universe@641: 
universe@606: TEST_F(ArrayList, cxListInsert) {
universe@606:     verifyInsert(autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 2)));
universe@606: }
universe@606: 
universe@679: TEST_F(PointerArrayList, cxListInsert) {
universe@679:     verifyInsert(autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS, 2)));
universe@679: }
universe@679: 
universe@638: TEST_F(LinkedList, cxListInsertArray) {
universe@638:     verifyInsertArray(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int))));
universe@638: }
universe@638: 
universe@641: TEST_F(PointerLinkedList, cxListInsertArray) {
universe@667:     verifyInsertArray(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS)), true);
universe@641: }
universe@641: 
universe@638: TEST_F(ArrayList, cxListInsertArray) {
universe@638:     verifyInsertArray(autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 4)));
universe@638: }
universe@638: 
universe@679: TEST_F(PointerArrayList, cxListInsertArray) {
universe@679:     verifyInsertArray(autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS, 4)), true);
universe@679: }
universe@679: 
universe@517: TEST_F(LinkedList, cxListRemove) {
universe@517:     verifyRemove(linkedListFromTestData());
universe@498: }
universe@498: 
universe@641: TEST_F(PointerLinkedList, cxListRemove) {
universe@641:     verifyRemove(pointerLinkedListFromTestData());
universe@641: }
universe@641: 
universe@606: TEST_F(ArrayList, cxListRemove) {
universe@606:     verifyRemove(arrayListFromTestData());
universe@606: }
universe@606: 
universe@679: TEST_F(PointerArrayList, cxListRemove) {
universe@679:     verifyRemove(pointerArrayListFromTestData());
universe@679: }
universe@679: 
universe@666: TEST_F(LinkedList, cxListClear) {
universe@672:     verifyClear(linkedListFromTestData());
universe@666: }
universe@666: 
universe@666: TEST_F(PointerLinkedList, cxListClear) {
universe@672:     verifyClear(pointerLinkedListFromTestData());
universe@666: }
universe@666: 
universe@666: TEST_F(ArrayList, cxListClear) {
universe@672:     verifyClear(arrayListFromTestData());
universe@666: }
universe@666: 
universe@679: TEST_F(PointerArrayList, cxListClear) {
universe@679:     verifyClear(pointerArrayListFromTestData());
universe@679: }
universe@679: 
universe@647: TEST_F(LinkedList, cxListSwap) {
universe@647:     verifySwap(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int))));
universe@647: }
universe@647: 
universe@647: TEST_F(PointerLinkedList, cxListSwap) {
universe@667:     verifySwap(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS)));
universe@647: }
universe@647: 
universe@647: TEST_F(ArrayList, cxListSwap) {
universe@647:     verifySwap(autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 16)));
universe@647: }
universe@647: 
universe@679: TEST_F(PointerArrayList, cxListSwap) {
universe@679:     verifySwap(autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS, 16)));
universe@679: }
universe@679: 
universe@647: TEST_F(LinkedList, cxListSwapNoSBO) {
universe@647:     CX_DISABLE_LINKED_LIST_SWAP_SBO = true;
universe@647:     verifySwap(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int))));
universe@647:     CX_DISABLE_LINKED_LIST_SWAP_SBO = false;
universe@647: }
universe@647: 
universe@647: TEST_F(PointerLinkedList, cxListSwapNoSBO) {
universe@647:     CX_DISABLE_LINKED_LIST_SWAP_SBO = true;
universe@667:     verifySwap(autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS)));
universe@647:     CX_DISABLE_LINKED_LIST_SWAP_SBO = false;
universe@647: }
universe@647: 
universe@517: TEST_F(LinkedList, cxListAt) {
universe@517:     verifyAt(linkedListFromTestData());
universe@509: }
universe@509: 
universe@641: TEST_F(PointerLinkedList, cxListAt) {
universe@641:     verifyAt(pointerLinkedListFromTestData());
universe@641: }
universe@641: 
universe@606: TEST_F(ArrayList, cxListAt) {
universe@606:     verifyAt(arrayListFromTestData());
universe@606: }
universe@606: 
universe@679: TEST_F(PointerArrayList, cxListAt) {
universe@679:     verifyAt(pointerArrayListFromTestData());
universe@679: }
universe@679: 
universe@517: TEST_F(LinkedList, cxListFind) {
universe@517:     verifyFind(linkedListFromTestData());
universe@509: }
universe@509: 
universe@641: TEST_F(PointerLinkedList, cxListFind) {
universe@641:     verifyFind(pointerLinkedListFromTestData());
universe@641: }
universe@641: 
universe@606: TEST_F(ArrayList, cxListFind) {
universe@606:     verifyFind(arrayListFromTestData());
universe@606: }
universe@606: 
universe@679: TEST_F(PointerArrayList, cxListFind) {
universe@679:     verifyFind(pointerArrayListFromTestData());
universe@679: }
universe@679: 
universe@517: TEST_F(LinkedList, cxListSort) {
universe@517:     verifySort(linkedListFromTestData());
universe@498: }
universe@498: 
universe@641: TEST_F(PointerLinkedList, cxListSort) {
universe@641:     verifySort(pointerLinkedListFromTestData());
universe@641: }
universe@641: 
universe@606: TEST_F(ArrayList, cxListSort) {
universe@606:     verifySort(arrayListFromTestData());
universe@606: }
universe@606: 
universe@679: TEST_F(PointerArrayList, cxListSort) {
universe@679:     verifySort(pointerArrayListFromTestData());
universe@679: }
universe@679: 
universe@517: TEST_F(LinkedList, Iterator) {
universe@517:     verifyIterator(linkedListFromTestData());
universe@509: }
universe@498: 
universe@641: TEST_F(PointerLinkedList, Iterator) {
universe@641:     verifyIterator(pointerLinkedListFromTestData());
universe@641: }
universe@641: 
universe@606: TEST_F(ArrayList, Iterator) {
universe@606:     verifyIterator(arrayListFromTestData());
universe@606: }
universe@606: 
universe@679: TEST_F(PointerArrayList, Iterator) {
universe@679:     verifyIterator(pointerArrayListFromTestData());
universe@679: }
universe@679: 
universe@517: TEST_F(LinkedList, InsertViaIterator) {
universe@517:     int fivenums[] = {0, 1, 2, 3, 4, 5};
universe@629:     CxList *list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, sizeof(int)));
universe@629:     cxListAddArray(list, fivenums, 5);
universe@517:     verifyInsertViaIterator(list);
universe@459: }
universe@459: 
universe@641: TEST_F(PointerLinkedList, InsertViaIterator) {
universe@641:     int fivenums[] = {0, 1, 2, 3, 4, 5};
universe@667:     auto list = autofree(cxLinkedListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS));
universe@641:     // note: cannot use cxListAddArray() because we don't have a list of pointers
universe@641:     cx_for_n(i, 5) cxListAdd(list, &fivenums[i]);
universe@641:     verifyInsertViaIterator(list);
universe@641: }
universe@641: 
universe@606: TEST_F(ArrayList, InsertViaIterator) {
universe@606:     int fivenums[] = {0, 1, 2, 3, 4, 5};
universe@667:     auto list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, sizeof(int), 4));
universe@629:     cxListAddArray(list, fivenums, 5);
universe@606:     verifyInsertViaIterator(list);
universe@606: }
universe@606: 
universe@679: TEST_F(PointerArrayList, InsertViaIterator) {
universe@679:     int fivenums[] = {0, 1, 2, 3, 4, 5};
universe@679:     auto list = autofree(cxArrayListCreate(&testingAllocator, cx_cmp_int, CX_STORE_POINTERS, 4));
universe@679:     // note: cannot use cxListAddArray() because we don't have a list of pointers
universe@679:     cx_for_n(i, 5) cxListAdd(list, &fivenums[i]);
universe@679:     verifyInsertViaIterator(list);
universe@679: }
universe@679: 
universe@521: TEST_F(LinkedList, cxListReverse) {
universe@521:     verifyReverse(linkedListFromTestData());
universe@521: }
universe@521: 
universe@641: TEST_F(PointerLinkedList, cxListReverse) {
universe@641:     verifyReverse(pointerLinkedListFromTestData());
universe@641: }
universe@641: 
universe@606: TEST_F(ArrayList, cxListReverse) {
universe@606:     verifyReverse(arrayListFromTestData());
universe@606: }
universe@606: 
universe@679: TEST_F(PointerArrayList, cxListReverse) {
universe@679:     verifyReverse(pointerArrayListFromTestData());
universe@679: }
universe@679: 
universe@521: TEST_F(LinkedList, cxListCompare) {
universe@521:     auto left = linkedListFromTestData();
universe@521:     auto right = linkedListFromTestData();
universe@521:     verifyCompare(left, right);
universe@521: }
universe@521: 
universe@641: TEST_F(LinkedList, cxListCompareWithPtrList) {
universe@641:     auto left = linkedListFromTestData();
universe@641:     auto right = pointerLinkedListFromTestData();
universe@641:     verifyCompare(left, right);
universe@641: }
universe@641: 
universe@606: TEST_F(LinkedList, cxListCompareWithArrayList) {
universe@606:     auto left = linkedListFromTestData();
universe@606:     auto right = arrayListFromTestData();
universe@606:     verifyCompare(left, right);
universe@606: }
universe@606: 
universe@679: TEST_F(LinkedList, cxListCompareWithPtrArrayList) {
universe@679:     auto left = linkedListFromTestData();
universe@679:     auto right = pointerArrayListFromTestData();
universe@679:     verifyCompare(left, right);
universe@679: }
universe@679: 
universe@641: TEST_F(PointerLinkedList, cxListCompare) {
universe@641:     auto left = pointerLinkedListFromTestData();
universe@641:     auto right = pointerLinkedListFromTestData();
universe@641:     verifyCompare(left, right);
universe@641: }
universe@641: 
universe@641: TEST_F(PointerLinkedList, cxListCompareWithNormalList) {
universe@641:     auto left = pointerLinkedListFromTestData();
universe@641:     auto right = linkedListFromTestData();
universe@641:     verifyCompare(left, right);
universe@641: }
universe@641: 
universe@641: TEST_F(PointerLinkedList, cxListCompareWithArrayList) {
universe@641:     auto left = pointerLinkedListFromTestData();
universe@641:     auto right = arrayListFromTestData();
universe@641:     verifyCompare(left, right);
universe@641: }
universe@641: 
universe@679: TEST_F(PointerLinkedList, cxListCompareWithPtrArrayList) {
universe@679:     auto left = pointerLinkedListFromTestData();
universe@679:     auto right = pointerArrayListFromTestData();
universe@679:     verifyCompare(left, right);
universe@679: }
universe@679: 
universe@606: TEST_F(ArrayList, cxListCompare) {
universe@606:     auto left = arrayListFromTestData();
universe@606:     auto right = arrayListFromTestData();
universe@606:     verifyCompare(left, right);
universe@606: }
universe@606: 
universe@641: TEST_F(ArrayList, cxListCompareWithPtrList) {
universe@641:     auto left = arrayListFromTestData();
universe@641:     auto right = pointerLinkedListFromTestData();
universe@641:     verifyCompare(left, right);
universe@641: }
universe@641: 
universe@641: TEST_F(ArrayList, cxListCompareWithNormalList) {
universe@606:     auto left = arrayListFromTestData();
universe@606:     auto right = linkedListFromTestData();
universe@606:     verifyCompare(left, right);
universe@606: }
universe@641: 
universe@679: TEST_F(ArrayList, cxListCompareWithPtrArrayList) {
universe@679:     auto left = arrayListFromTestData();
universe@679:     auto right = pointerArrayListFromTestData();
universe@679:     verifyCompare(left, right);
universe@679: }
universe@679: 
universe@679: TEST_F(PointerArrayList, cxListCompare) {
universe@679:     auto left = pointerArrayListFromTestData();
universe@679:     auto right = pointerArrayListFromTestData();
universe@679:     verifyCompare(left, right);
universe@679: }
universe@679: 
universe@679: TEST_F(PointerArrayList, cxListCompareWithPtrList) {
universe@679:     auto left = pointerArrayListFromTestData();
universe@679:     auto right = pointerLinkedListFromTestData();
universe@679:     verifyCompare(left, right);
universe@679: }
universe@679: 
universe@679: TEST_F(PointerArrayList, cxListCompareWithNormalList) {
universe@679:     auto left = pointerArrayListFromTestData();
universe@679:     auto right = linkedListFromTestData();
universe@679:     verifyCompare(left, right);
universe@679: }
universe@679: 
universe@679: TEST_F(PointerArrayList, cxListCompareWithNormalArrayList) {
universe@679:     auto left = pointerArrayListFromTestData();
universe@679:     auto right = arrayListFromTestData();
universe@679:     verifyCompare(left, right);
universe@679: }
universe@679: 
universe@672: TEST_F(LinkedList, SimpleDestructor) {
universe@672:     verifySimpleDestructor(linkedListFromTestData());
universe@672: }
universe@672: 
universe@672: TEST_F(PointerLinkedList, SimpleDestructor) {
universe@672:     verifySimpleDestructor(pointerLinkedListFromTestData());
universe@672: }
universe@672: 
universe@672: TEST_F(ArrayList, SimpleDestructor) {
universe@672:     verifySimpleDestructor(arrayListFromTestData());
universe@672: }
universe@672: 
universe@679: TEST_F(PointerArrayList, SimpleDestructor) {
universe@679:     verifySimpleDestructor(pointerArrayListFromTestData());
universe@679: }
universe@679: 
universe@672: TEST_F(LinkedList, AdvancedDestructor) {
universe@672:     verifyAdvancedDestructor(linkedListFromTestData());
universe@672: }
universe@672: 
universe@672: TEST_F(PointerLinkedList, AdvancedDestructor) {
universe@672:     verifyAdvancedDestructor(pointerLinkedListFromTestData());
universe@672: }
universe@672: 
universe@672: TEST_F(ArrayList, AdvancedDestructor) {
universe@672:     verifyAdvancedDestructor(arrayListFromTestData());
universe@672: }
universe@672: 
universe@679: TEST_F(PointerArrayList, AdvancedDestructor) {
universe@679:     verifyAdvancedDestructor(pointerArrayListFromTestData());
universe@679: }
universe@679: 
universe@672: TEST_F(PointerLinkedList, DestroyNoDestructor) {
universe@641:     void *item = cxMalloc(&testingAllocator, sizeof(int));
universe@667:     auto list = cxLinkedListCreate(cxDefaultAllocator, cx_cmp_int, CX_STORE_POINTERS);
universe@641:     cxListAdd(list, item);
universe@641:     ASSERT_FALSE(testingAllocator.verify());
universe@641:     cxListDestroy(list);
universe@641:     EXPECT_FALSE(testingAllocator.verify());
universe@641:     cxFree(&testingAllocator, item);
universe@641:     EXPECT_TRUE(testingAllocator.verify());
universe@641: }
universe@641: 
universe@672: TEST_F(PointerLinkedList, DestroySimpleDestructor) {
universe@641:     int item = 0;
universe@667:     auto list = cxLinkedListCreate(cxDefaultAllocator, cx_cmp_int, CX_STORE_POINTERS);
universe@641:     list->simple_destructor = [](void *elem) { *(int *) elem = 42; };
universe@641:     cxListAdd(list, &item);
universe@641:     cxListDestroy(list);
universe@641:     EXPECT_EQ(item, 42);
universe@641: }
universe@641: 
universe@672: TEST_F(PointerLinkedList, DestroyAdvancedDestructor) {
universe@641:     void *item = cxMalloc(&testingAllocator, sizeof(int));
universe@667:     auto list = cxLinkedListCreate(cxDefaultAllocator, cx_cmp_int, CX_STORE_POINTERS);
universe@677:     list->destructor_data = &testingAllocator;
universe@677:     list->advanced_destructor = (cx_destructor_func2) cxFree;
universe@641:     cxListAdd(list, item);
universe@641:     ASSERT_FALSE(testingAllocator.verify());
universe@641:     cxListDestroy(list);
universe@641:     EXPECT_TRUE(testingAllocator.verify());
universe@641: }
universe@679: 
universe@679: TEST_F(PointerArrayList, DestroyNoDestructor) {
universe@679:     void *item = cxMalloc(&testingAllocator, sizeof(int));
universe@679:     auto list = cxArrayListCreate(cxDefaultAllocator, cx_cmp_int, CX_STORE_POINTERS, 4);
universe@679:     cxListAdd(list, item);
universe@679:     ASSERT_FALSE(testingAllocator.verify());
universe@679:     cxListDestroy(list);
universe@679:     EXPECT_FALSE(testingAllocator.verify());
universe@679:     cxFree(&testingAllocator, item);
universe@679:     EXPECT_TRUE(testingAllocator.verify());
universe@679: }
universe@679: 
universe@679: TEST_F(PointerArrayList, DestroySimpleDestructor) {
universe@679:     int item = 0;
universe@679:     auto list = cxArrayListCreate(cxDefaultAllocator, cx_cmp_int, CX_STORE_POINTERS, 4);
universe@679:     list->simple_destructor = [](void *elem) { *(int *) elem = 42; };
universe@679:     cxListAdd(list, &item);
universe@679:     cxListDestroy(list);
universe@679:     EXPECT_EQ(item, 42);
universe@679: }
universe@679: 
universe@679: TEST_F(PointerArrayList, DestroyAdvancedDestructor) {
universe@679:     void *item = cxMalloc(&testingAllocator, sizeof(int));
universe@679:     auto list = cxArrayListCreate(cxDefaultAllocator, cx_cmp_int, CX_STORE_POINTERS, 4);
universe@679:     list->destructor_data = &testingAllocator;
universe@679:     list->advanced_destructor = (cx_destructor_func2) cxFree;
universe@679:     cxListAdd(list, item);
universe@679:     ASSERT_FALSE(testingAllocator.verify());
universe@679:     cxListDestroy(list);
universe@679:     EXPECT_TRUE(testingAllocator.verify());
universe@679: }
universe@679: