universe@798: /*
universe@798:  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
universe@798:  *
universe@798:  * Copyright 2023 Mike Becker, Olaf Wintermann All rights reserved.
universe@798:  *
universe@798:  * Redistribution and use in source and binary forms, with or without
universe@798:  * modification, are permitted provided that the following conditions are met:
universe@798:  *
universe@798:  *   1. Redistributions of source code must retain the above copyright
universe@798:  *      notice, this list of conditions and the following disclaimer.
universe@798:  *
universe@798:  *   2. Redistributions in binary form must reproduce the above copyright
universe@798:  *      notice, this list of conditions and the following disclaimer in the
universe@798:  *      documentation and/or other materials provided with the distribution.
universe@798:  *
universe@798:  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
universe@798:  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
universe@798:  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
universe@798:  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
universe@798:  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
universe@798:  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
universe@798:  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
universe@798:  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
universe@798:  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
universe@798:  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
universe@798:  * POSSIBILITY OF SUCH DAMAGE.
universe@798:  */
universe@798: 
universe@798: #include "cx/test.h"
universe@798: #include "util_allocator.h"
universe@798: #include "cx/compare.h"
universe@798: 
universe@798: #include "cx/array_list.h"
universe@798: #include "cx/linked_list.h"
universe@798: 
universe@798: #include <stdarg.h>
universe@798: 
universe@798: typedef struct node {
universe@798:     struct node *next;
universe@798:     struct node *prev;
universe@798:     int data;
universe@798: } node;
universe@798: 
universe@798: const ptrdiff_t loc_prev = offsetof(struct node, prev);
universe@798: const ptrdiff_t loc_next = offsetof(struct node, next);
universe@798: const ptrdiff_t loc_data = offsetof(struct node, data);
universe@798: 
universe@798: static node *create_nodes_test_data(size_t len) {
universe@798:     node *begin = calloc(1, sizeof(node));
universe@798:     void *prev = begin;
universe@798:     for (size_t i = 1; i < len; i++) {
universe@798:         node *n = calloc(1, sizeof(node));
universe@798:         cx_linked_list_link(prev, n, loc_prev, loc_next);
universe@798:         prev = n;
universe@798:     }
universe@798:     return begin;
universe@798: }
universe@798: 
universe@798: void assign_nodes_test_data(node *n, ...) {
universe@798:     va_list ap;
universe@798:     va_start(ap, n);
universe@798:     while (n != NULL) {
universe@798:         n->data = va_arg(ap, int);
universe@798:         n = n->next;
universe@798:     }
universe@798:     va_end(ap);
universe@798: }
universe@798: 
universe@798: static void destroy_nodes_test_data(node *n) {
universe@798:     while (n != NULL) {
universe@798:         void *next = n->next;
universe@798:         free(n);
universe@798:         n = next;
universe@798:     }
universe@798: }
universe@798: 
universe@798: static int *int_test_data(size_t len) {
universe@798:     int *data = malloc(len*sizeof(int));
universe@798:     for (size_t i = 0 ; i < len ; i++) {
universe@798:         data[i] = rand(); // NOLINT(*-msc50-cpp)
universe@798:     }
universe@798:     return data;
universe@798: }
universe@798: 
universe@798: CX_TEST(test_linked_list_link_unlink) {
universe@798:     node a = {0}, b = {0}, c = {0};
universe@798: 
universe@798:     CX_TEST_DO {
universe@798:         cx_linked_list_link(&a, &b, loc_prev, loc_next);
universe@798:         CX_TEST_ASSERT(a.prev == NULL);
universe@798:         CX_TEST_ASSERT(a.next == &b);
universe@798:         CX_TEST_ASSERT(b.prev == &a);
universe@798:         CX_TEST_ASSERT(b.next == NULL);
universe@798: 
universe@798:         cx_linked_list_unlink(&a, &b, loc_prev, loc_next);
universe@798:         CX_TEST_ASSERT(a.prev == NULL);
universe@798:         CX_TEST_ASSERT(a.next == NULL);
universe@798:         CX_TEST_ASSERT(b.prev == NULL);
universe@798:         CX_TEST_ASSERT(b.next == NULL);
universe@798: 
universe@798:         cx_linked_list_link(&b, &c, loc_prev, loc_next);
universe@798:         cx_linked_list_link(&a, &b, loc_prev, loc_next);
universe@798:         cx_linked_list_unlink(&b, &c, loc_prev, loc_next);
universe@798:         CX_TEST_ASSERT(a.prev == NULL);
universe@798:         CX_TEST_ASSERT(a.next == &b);
universe@798:         CX_TEST_ASSERT(b.prev == &a);
universe@798:         CX_TEST_ASSERT(b.next == NULL);
universe@798:         CX_TEST_ASSERT(c.prev == NULL);
universe@798:         CX_TEST_ASSERT(c.next == NULL);
universe@798:     }
universe@798: }
universe@798: 
universe@798: CX_TEST(test_linked_list_at) {
universe@798:     node a = {0}, b = {0}, c = {0}, d = {0};
universe@798: 
universe@798:     cx_linked_list_link(&a, &b, loc_prev, loc_next);
universe@798:     cx_linked_list_link(&b, &c, loc_prev, loc_next);
universe@798:     cx_linked_list_link(&c, &d, loc_prev, loc_next);
universe@798: 
universe@798:     CX_TEST_DO {
universe@798:         CX_TEST_ASSERT(cx_linked_list_at(&a, 0, loc_next, 0) == &a);
universe@798:         CX_TEST_ASSERT(cx_linked_list_at(&a, 0, loc_next, 1) == &b);
universe@798:         CX_TEST_ASSERT(cx_linked_list_at(&a, 0, loc_next, 2) == &c);
universe@798:         CX_TEST_ASSERT(cx_linked_list_at(&a, 0, loc_next, 3) == &d);
universe@798:         CX_TEST_ASSERT(cx_linked_list_at(&a, 0, loc_next, 4) == NULL);
universe@798:         CX_TEST_ASSERT(cx_linked_list_at(&b, 1, loc_prev, 0) == &a);
universe@798:         CX_TEST_ASSERT(cx_linked_list_at(&b, 1, loc_next, 1) == &b);
universe@798:         CX_TEST_ASSERT(cx_linked_list_at(&b, 1, loc_next, 2) == &c);
universe@798:         CX_TEST_ASSERT(cx_linked_list_at(&b, 1, loc_next, 3) == &d);
universe@798:         CX_TEST_ASSERT(cx_linked_list_at(&b, 1, loc_next, 4) == NULL);
universe@798:         CX_TEST_ASSERT(cx_linked_list_at(&d, 3, loc_prev, 0) == &a);
universe@798:         CX_TEST_ASSERT(cx_linked_list_at(&d, 3, loc_prev, 1) == &b);
universe@798:     }
universe@798: }
universe@798: 
universe@798: CX_TEST(test_linked_list_find) {
universe@798:     void *list = create_nodes_test_data(4);
universe@798:     assign_nodes_test_data(list, 2, 4, 6, 8);
universe@798:     CX_TEST_DO {
universe@798:         int s;
universe@798:         s = 2;
universe@798:         CX_TEST_ASSERT(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s) == 0);
universe@798:         s = 4;
universe@798:         CX_TEST_ASSERT(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s) == 1);
universe@798:         s = 6;
universe@798:         CX_TEST_ASSERT(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s) == 2);
universe@798:         s = 8;
universe@798:         CX_TEST_ASSERT(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s) == 3);
universe@798:         s = 10;
universe@798:         CX_TEST_ASSERT(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s) < 0);
universe@798:         s = -2;
universe@798:         CX_TEST_ASSERT(cx_linked_list_find(list, loc_next, loc_data, cx_cmp_int, &s) < 0);
universe@798:     }
universe@798:     destroy_nodes_test_data(list);
universe@798: }
universe@798: 
universe@798: CX_TEST(test_linked_list_compare) {
universe@798:     void *la = create_nodes_test_data(4);
universe@798:     void *lb = create_nodes_test_data(3);
universe@798:     void *lc = create_nodes_test_data(4);
universe@798:     assign_nodes_test_data(la, 2, 4, 6, 8);
universe@798:     assign_nodes_test_data(lb, 2, 4, 6);
universe@798:     assign_nodes_test_data(lc, 2, 4, 6, 9);
universe@798:     CX_TEST_DO {
universe@798:         CX_TEST_ASSERT(cx_linked_list_compare(la, lb, loc_next, loc_data, cx_cmp_int) > 0);
universe@798:         CX_TEST_ASSERT(cx_linked_list_compare(lb, la, loc_next, loc_data, cx_cmp_int) < 0);
universe@798:         CX_TEST_ASSERT(cx_linked_list_compare(lc, la, loc_next, loc_data, cx_cmp_int) > 0);
universe@798:         CX_TEST_ASSERT(cx_linked_list_compare(la, lc, loc_next, loc_data, cx_cmp_int) < 0);
universe@798:         CX_TEST_ASSERT(cx_linked_list_compare(la, la, loc_next, loc_data, cx_cmp_int) == 0);
universe@798:     }
universe@798:     destroy_nodes_test_data(la);
universe@798:     destroy_nodes_test_data(lb);
universe@798:     destroy_nodes_test_data(lc);
universe@798: }
universe@798: 
universe@798: CX_TEST(test_linked_list_add) {
universe@798:     node nodes[4];
universe@798:     void *begin, *end;
universe@798:     CX_TEST_DO {
universe@798:         // test with begin, end / prev, next
universe@798:         memset(nodes, 0, sizeof(node)*4);
universe@798:         end = begin = NULL;
universe@798: 
universe@798:         cx_linked_list_add(&begin, &end, loc_prev, loc_next, &nodes[0]);
universe@798:         CX_TEST_ASSERT(begin == &nodes[0]);
universe@798:         CX_TEST_ASSERT(end == &nodes[0]);
universe@798:         CX_TEST_ASSERT(nodes[0].prev == NULL);
universe@798:         CX_TEST_ASSERT(nodes[0].next == NULL);
universe@798: 
universe@798:         cx_linked_list_add(&begin, &end, loc_prev, loc_next, &nodes[1]);
universe@798:         CX_TEST_ASSERT(begin == &nodes[0]);
universe@798:         CX_TEST_ASSERT(end == &nodes[1]);
universe@798:         CX_TEST_ASSERT(nodes[0].next == &nodes[1]);
universe@798:         CX_TEST_ASSERT(nodes[1].prev == &nodes[0]);
universe@798: 
universe@798:         // test with begin only / prev, next
universe@798:         memset(nodes, 0, sizeof(node)*4);
universe@798:         end = begin = NULL;
universe@798: 
universe@798:         cx_linked_list_add(&begin, NULL, loc_prev, loc_next, &nodes[0]);
universe@798:         CX_TEST_ASSERT(begin == &nodes[0]);
universe@798:         cx_linked_list_add(&begin, NULL, loc_prev, loc_next, &nodes[1]);
universe@798:         CX_TEST_ASSERT(begin == &nodes[0]);
universe@798:         CX_TEST_ASSERT(nodes[0].next == &nodes[1]);
universe@798:         CX_TEST_ASSERT(nodes[1].prev == &nodes[0]);
universe@798: 
universe@798:         cx_linked_list_add(&begin, NULL, loc_prev, loc_next, &nodes[2]);
universe@798:         CX_TEST_ASSERT(nodes[1].next == &nodes[2]);
universe@798:         CX_TEST_ASSERT(nodes[2].prev == &nodes[1]);
universe@798: 
universe@798:         // test with end only / prev, next
universe@798:         memset(nodes, 0, sizeof(node)*4);
universe@798:         end = begin = NULL;
universe@798: 
universe@798:         cx_linked_list_add(NULL, &end, loc_prev, loc_next, &nodes[0]);
universe@798:         CX_TEST_ASSERT(end == &nodes[0]);
universe@798:         cx_linked_list_add(NULL, &end, loc_prev, loc_next, &nodes[1]);
universe@798:         CX_TEST_ASSERT(end == &nodes[1]);
universe@798:         CX_TEST_ASSERT(nodes[0].next == &nodes[1]);
universe@798:         CX_TEST_ASSERT(nodes[1].prev == &nodes[0]);
universe@798: 
universe@798:         cx_linked_list_add(NULL, &end, loc_prev, loc_next, &nodes[2]);
universe@798:         CX_TEST_ASSERT(end == &nodes[2]);
universe@798:         CX_TEST_ASSERT(nodes[1].next == &nodes[2]);
universe@798:         CX_TEST_ASSERT(nodes[2].prev == &nodes[1]);
universe@798: 
universe@798:         // test with begin, end / next
universe@798:         memset(nodes, 0, sizeof(node)*4);
universe@798:         end = begin = NULL;
universe@798: 
universe@798:         cx_linked_list_add(&begin, &end, -1, loc_next, &nodes[0]);
universe@798:         CX_TEST_ASSERT(begin == &nodes[0]);
universe@798:         CX_TEST_ASSERT(end == &nodes[0]);
universe@798:         cx_linked_list_add(&begin, &end, -1, loc_next, &nodes[1]);
universe@798:         CX_TEST_ASSERT(end == &nodes[1]);
universe@798:         CX_TEST_ASSERT(nodes[0].next == &nodes[1]);
universe@798:         CX_TEST_ASSERT(nodes[1].prev == NULL);
universe@798:     }
universe@798: }
universe@798: 
universe@798: CX_TEST(test_linked_list_prepend) {
universe@798:     node nodes[4];
universe@798:     void *begin, *end;
universe@798:     CX_TEST_DO {
universe@798:         // test with begin, end / prev, next
universe@798:         memset(nodes, 0, sizeof(node) * 4);
universe@798:         end = begin = NULL;
universe@798: 
universe@798:         cx_linked_list_prepend(&begin, &end, loc_prev, loc_next, &nodes[0]);
universe@798:         CX_TEST_ASSERT(begin == &nodes[0]);
universe@798:         CX_TEST_ASSERT(end == &nodes[0]);
universe@798:         CX_TEST_ASSERT(nodes[0].prev == NULL);
universe@798:         CX_TEST_ASSERT(nodes[0].next == NULL);
universe@798: 
universe@798:         cx_linked_list_prepend(&begin, &end, loc_prev, loc_next, &nodes[1]);
universe@798:         CX_TEST_ASSERT(begin == &nodes[1]);
universe@798:         CX_TEST_ASSERT(end == &nodes[0]);
universe@798:         CX_TEST_ASSERT(nodes[1].next == &nodes[0]);
universe@798:         CX_TEST_ASSERT(nodes[0].prev == &nodes[1]);
universe@798: 
universe@798:         // test with begin only / prev, next
universe@798:         memset(nodes, 0, sizeof(node) * 4);
universe@798:         end = begin = NULL;
universe@798: 
universe@798:         cx_linked_list_prepend(&begin, NULL, loc_prev, loc_next, &nodes[0]);
universe@798:         CX_TEST_ASSERT(begin == &nodes[0]);
universe@798:         cx_linked_list_prepend(&begin, NULL, loc_prev, loc_next, &nodes[1]);
universe@798:         CX_TEST_ASSERT(begin == &nodes[1]);
universe@798:         CX_TEST_ASSERT(nodes[1].next == &nodes[0]);
universe@798:         CX_TEST_ASSERT(nodes[0].prev == &nodes[1]);
universe@798: 
universe@798:         cx_linked_list_prepend(&begin, NULL, loc_prev, loc_next, &nodes[2]);
universe@798:         CX_TEST_ASSERT(begin == &nodes[2]);
universe@798:         CX_TEST_ASSERT(nodes[2].next == &nodes[1]);
universe@798:         CX_TEST_ASSERT(nodes[1].prev == &nodes[2]);
universe@798: 
universe@798:         // test with end only / prev, next
universe@798:         memset(nodes, 0, sizeof(node) * 4);
universe@798:         end = begin = NULL;
universe@798: 
universe@798:         cx_linked_list_prepend(NULL, &end, loc_prev, loc_next, &nodes[0]);
universe@798:         CX_TEST_ASSERT(end == &nodes[0]);
universe@798:         cx_linked_list_prepend(NULL, &end, loc_prev, loc_next, &nodes[1]);
universe@798:         CX_TEST_ASSERT(end == &nodes[0]);
universe@798:         CX_TEST_ASSERT(nodes[1].next == &nodes[0]);
universe@798:         CX_TEST_ASSERT(nodes[0].prev == &nodes[1]);
universe@798: 
universe@798:         cx_linked_list_prepend(NULL, &end, loc_prev, loc_next, &nodes[2]);
universe@798:         CX_TEST_ASSERT(end == &nodes[0]);
universe@798:         CX_TEST_ASSERT(nodes[2].next == &nodes[1]);
universe@798:         CX_TEST_ASSERT(nodes[1].prev == &nodes[2]);
universe@798: 
universe@798:         // test with begin, end / next
universe@798:         memset(nodes, 0, sizeof(node) * 4);
universe@798:         end = begin = NULL;
universe@798: 
universe@798:         cx_linked_list_prepend(&begin, &end, -1, loc_next, &nodes[0]);
universe@798:         CX_TEST_ASSERT(begin == &nodes[0]);
universe@798:         CX_TEST_ASSERT(end == &nodes[0]);
universe@798:         cx_linked_list_prepend(&begin, &end, -1, loc_next, &nodes[1]);
universe@798:         cx_linked_list_prepend(&begin, &end, -1, loc_next, &nodes[2]);
universe@798:         CX_TEST_ASSERT(begin == &nodes[2]);
universe@798:         CX_TEST_ASSERT(end == &nodes[0]);
universe@798:         CX_TEST_ASSERT(nodes[1].next == &nodes[0]);
universe@798:         CX_TEST_ASSERT(nodes[2].next == &nodes[1]);
universe@798:         CX_TEST_ASSERT(nodes[1].prev == NULL);
universe@798:         CX_TEST_ASSERT(nodes[0].prev == NULL);
universe@798:     }
universe@798: }
universe@798: 
universe@798: CX_TEST(test_linked_list_insert) {
universe@798:     node nodes[4];
universe@798:     void *begin, *end;
universe@798:     CX_TEST_DO {
universe@798:         // insert mid list
universe@798:         memset(nodes, 0, sizeof(node) * 4);
universe@798:         begin = &nodes[0];
universe@798:         end = &nodes[2];
universe@798: 
universe@798:         cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
universe@798:         cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
universe@798: 
universe@798:         cx_linked_list_insert(&begin, &end, loc_prev, loc_next, &nodes[1], &nodes[3]);
universe@798:         CX_TEST_ASSERT(begin == &nodes[0]);
universe@798:         CX_TEST_ASSERT(end == &nodes[2]);
universe@798:         CX_TEST_ASSERT(nodes[1].next == &nodes[3]);
universe@798:         CX_TEST_ASSERT(nodes[2].prev == &nodes[3]);
universe@798:         CX_TEST_ASSERT(nodes[3].prev == &nodes[1]);
universe@798:         CX_TEST_ASSERT(nodes[3].next == &nodes[2]);
universe@798: 
universe@798:         // insert end
universe@798:         memset(nodes, 0, sizeof(node) * 4);
universe@798:         begin = &nodes[0];
universe@798:         end = &nodes[2];
universe@798: 
universe@798:         cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
universe@798:         cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
universe@798: 
universe@798:         cx_linked_list_insert(&begin, &end, loc_prev, loc_next, &nodes[2], &nodes[3]);
universe@798:         CX_TEST_ASSERT(begin == &nodes[0]);
universe@798:         CX_TEST_ASSERT(end == &nodes[3]);
universe@798:         CX_TEST_ASSERT(nodes[2].next == &nodes[3]);
universe@798:         CX_TEST_ASSERT(nodes[3].prev == &nodes[2]);
universe@798:         CX_TEST_ASSERT(nodes[3].next == NULL);
universe@798: 
universe@798:         // insert begin
universe@798:         memset(nodes, 0, sizeof(node) * 4);
universe@798:         begin = &nodes[0];
universe@798:         end = &nodes[2];
universe@798: 
universe@798:         cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
universe@798:         cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
universe@798: 
universe@798:         cx_linked_list_insert(&begin, &end, loc_prev, loc_next, NULL, &nodes[3]);
universe@798:         CX_TEST_ASSERT(begin == &nodes[3]);
universe@798:         CX_TEST_ASSERT(end == &nodes[2]);
universe@798:         CX_TEST_ASSERT(nodes[0].prev == &nodes[3]);
universe@798:         CX_TEST_ASSERT(nodes[3].prev == NULL);
universe@798:         CX_TEST_ASSERT(nodes[3].next == &nodes[0]);
universe@798:     }
universe@798: }
universe@798: 
universe@798: CX_TEST(test_linked_list_insert_chain) {
universe@798:     node nodes[5];
universe@798:     void *begin, *end;
universe@798:     CX_TEST_DO {
universe@798:         // insert mid list
universe@798:         memset(nodes, 0, sizeof(node) * 5);
universe@798:         begin = &nodes[0]; end = &nodes[2];
universe@798: 
universe@798:         cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
universe@798:         cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
universe@798:         cx_linked_list_link(&nodes[3], &nodes[4], loc_prev, loc_next);
universe@798: 
universe@798:         cx_linked_list_insert_chain(&begin, &end, loc_prev, loc_next, &nodes[1], &nodes[3], NULL);
universe@798:         CX_TEST_ASSERT(begin == &nodes[0]);
universe@798:         CX_TEST_ASSERT(end == &nodes[2]);
universe@798:         CX_TEST_ASSERT(nodes[1].next == &nodes[3]);
universe@798:         CX_TEST_ASSERT(nodes[2].prev == &nodes[4]);
universe@798:         CX_TEST_ASSERT(nodes[3].prev == &nodes[1]);
universe@798:         CX_TEST_ASSERT(nodes[4].next == &nodes[2]);
universe@798: 
universe@798:         // insert end
universe@798:         memset(nodes, 0, sizeof(node) * 5);
universe@798:         begin = &nodes[0]; end = &nodes[2];
universe@798: 
universe@798:         cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
universe@798:         cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
universe@798:         cx_linked_list_link(&nodes[3], &nodes[4], loc_prev, loc_next);
universe@798: 
universe@798:         cx_linked_list_insert_chain(&begin, &end, loc_prev, loc_next, &nodes[2], &nodes[3], NULL);
universe@798:         CX_TEST_ASSERT(begin == &nodes[0]);
universe@798:         CX_TEST_ASSERT(end == &nodes[4]);
universe@798:         CX_TEST_ASSERT(nodes[2].next == &nodes[3]);
universe@798:         CX_TEST_ASSERT(nodes[3].prev == &nodes[2]);
universe@798:         CX_TEST_ASSERT(nodes[4].next == NULL);
universe@798: 
universe@798:         // insert begin
universe@798:         memset(nodes, 0, sizeof(node) * 5);
universe@798:         begin = &nodes[0]; end = &nodes[2];
universe@798: 
universe@798:         cx_linked_list_link(&nodes[0], &nodes[1], loc_prev, loc_next);
universe@798:         cx_linked_list_link(&nodes[1], &nodes[2], loc_prev, loc_next);
universe@798:         cx_linked_list_link(&nodes[3], &nodes[4], loc_prev, loc_next);
universe@798: 
universe@798:         cx_linked_list_insert_chain(&begin, &end, loc_prev, loc_next, NULL, &nodes[3], NULL);
universe@798:         CX_TEST_ASSERT(begin == &nodes[3]);
universe@798:         CX_TEST_ASSERT(end == &nodes[2]);
universe@798:         CX_TEST_ASSERT(nodes[0].prev == &nodes[4]);
universe@798:         CX_TEST_ASSERT(nodes[3].prev == NULL);
universe@798:         CX_TEST_ASSERT(nodes[4].next == &nodes[0]);
universe@798:     }
universe@798: }
universe@798: 
universe@798: CX_TEST(test_linked_list_first) {
universe@798:     node *testdata = create_nodes_test_data(3);
universe@798:     void *begin = testdata;
universe@798:     CX_TEST_DO {
universe@798:         CX_TEST_ASSERT(begin == cx_linked_list_first(testdata, loc_prev));
universe@798:         CX_TEST_ASSERT(begin == cx_linked_list_first(testdata->next, loc_prev));
universe@798:         CX_TEST_ASSERT(begin == cx_linked_list_first(testdata->next->next, loc_prev));
universe@798:     }
universe@798:     destroy_nodes_test_data(testdata);
universe@798: }
universe@798: 
universe@798: CX_TEST(test_linked_list_last) {
universe@798:     node *testdata = create_nodes_test_data(3);
universe@798:     void *end = testdata->next->next;
universe@798:     CX_TEST_DO {
universe@798:         CX_TEST_ASSERT(end == cx_linked_list_last(testdata, loc_next));
universe@798:         CX_TEST_ASSERT(end == cx_linked_list_last(testdata->next, loc_next));
universe@798:         CX_TEST_ASSERT(end == cx_linked_list_last(testdata->next->next, loc_next));
universe@798:     }
universe@798:     destroy_nodes_test_data(testdata);
universe@798: }
universe@798: 
universe@798: CX_TEST(test_linked_list_prev) {
universe@798:     node *testdata = create_nodes_test_data(3);
universe@798:     CX_TEST_DO {
universe@798:         CX_TEST_ASSERT(cx_linked_list_prev(testdata, loc_next, testdata) == NULL);
universe@798:         CX_TEST_ASSERT(cx_linked_list_prev(testdata, loc_next, testdata->next) == testdata);
universe@798:         CX_TEST_ASSERT(cx_linked_list_prev(testdata, loc_next, testdata->next->next) == testdata->next);
universe@798:     }
universe@798:     destroy_nodes_test_data(testdata);
universe@798: }
universe@798: 
universe@798: CX_TEST(test_linked_list_remove) {
universe@798:     node *testdata = create_nodes_test_data(3);
universe@798:     assign_nodes_test_data(testdata, 2, 4, 6);
universe@798:     node *first = testdata;
universe@798:     node *second = first->next;
universe@798:     node *third = second->next;
universe@798:     void *begin = testdata;
universe@798:     void *end = third;
universe@798: 
universe@798:     CX_TEST_DO {
universe@798:         cx_linked_list_remove(&begin, &end, loc_prev, loc_next, second);
universe@798:         CX_TEST_ASSERT(begin == first);
universe@798:         CX_TEST_ASSERT(end == third);
universe@798:         CX_TEST_ASSERT(first->prev == NULL);
universe@798:         CX_TEST_ASSERT(first->next == third);
universe@798:         CX_TEST_ASSERT(third->prev == first);
universe@798:         CX_TEST_ASSERT(third->next == NULL);
universe@798: 
universe@798:         cx_linked_list_remove(&begin, &end, loc_prev, loc_next, third);
universe@798:         CX_TEST_ASSERT(begin == first);
universe@798:         CX_TEST_ASSERT(end == first);
universe@798:         CX_TEST_ASSERT(first->prev == NULL);
universe@798:         CX_TEST_ASSERT(first->next == NULL);
universe@798: 
universe@798:         cx_linked_list_remove(&begin, &end, loc_prev, loc_next, first);
universe@798:         CX_TEST_ASSERT(begin == NULL);
universe@798:         CX_TEST_ASSERT(end == NULL);
universe@798:     }
universe@798:     // list is not intact anymore, we have to free nodes individually
universe@798:     free(first);
universe@798:     free(second);
universe@798:     free(third);
universe@798: }
universe@798: 
universe@798: CX_TEST(test_linked_list_size) {
universe@798:     node *td5 = create_nodes_test_data(5);
universe@798:     node *td13 = create_nodes_test_data(13);
universe@798:     CX_TEST_DO {
universe@798:         CX_TEST_ASSERT(cx_linked_list_size(NULL, loc_next) == 0);
universe@798:         CX_TEST_ASSERT(cx_linked_list_size(td5, loc_next) == 5);
universe@798:         CX_TEST_ASSERT(cx_linked_list_size(td13, loc_next) == 13);
universe@798:     }
universe@798:     destroy_nodes_test_data(td5);
universe@798:     destroy_nodes_test_data(td13);
universe@798: }
universe@798: 
universe@798: CX_TEST(test_linked_list_sort_empty) {
universe@798:     void *begin = NULL;
universe@799:     CX_TEST_DO {
universe@799:         // cannot assert something, we can just test that it does not crash
universe@799:         cx_linked_list_sort(&begin, NULL, loc_prev, loc_next, loc_data, cx_cmp_int);
universe@799:         CX_TEST_ASSERT(true);
universe@799:     }
universe@798: }
universe@798: 
universe@798: CX_TEST(test_linked_list_sort) {
universe@798:     const size_t len = 1500;
universe@798:     int *testdata = int_test_data(len);
universe@798:     void *scrambled = create_nodes_test_data(len);
universe@798:     node *n = scrambled;
universe@798:     for (size_t i = 0; i < len; i++) {
universe@798:         n->data = testdata[i];
universe@798:         n = n->next;
universe@798:     }
universe@798:     int *sorted = malloc(len*sizeof(int));
universe@798:     memcpy(sorted, testdata, len*sizeof(int));
universe@798:     qsort(sorted, len, sizeof(int), cx_cmp_int);
universe@798: 
universe@798:     void *begin = scrambled;
universe@798:     void *end = cx_linked_list_last(begin, loc_next);
universe@798: 
universe@798:     CX_TEST_DO {
universe@798:         cx_linked_list_sort(&begin, &end, loc_prev, loc_next, loc_data, cx_cmp_int);
universe@798:         node *check = begin;
universe@798:         node *check_last = NULL;
universe@798:         for (size_t i = 0; i < len; i++) {
universe@798:             CX_TEST_ASSERT(check->data == sorted[i]);
universe@798:             CX_TEST_ASSERT(check->prev == check_last);
universe@798:             if (i < len - 1) {
universe@798:                 CX_TEST_ASSERT(check->next != NULL);
universe@798:             }
universe@798:             check_last = check;
universe@798:             check = check->next;
universe@798:         }
universe@798:         CX_TEST_ASSERT(check == NULL);
universe@798:         CX_TEST_ASSERT(end == check_last);
universe@798:     }
universe@799:     destroy_nodes_test_data(begin);
universe@799:     free(sorted);
universe@798:     free(testdata);
universe@798: }
universe@798: 
universe@798: CX_TEST(test_linked_list_reverse) {
universe@798:     void *testdata = create_nodes_test_data(4);
universe@798:     void *expected = create_nodes_test_data(4);
universe@798:     assign_nodes_test_data(testdata, 2, 4, 6, 8);
universe@798:     assign_nodes_test_data(expected, 8, 6, 4, 2);
universe@799:     void *begin = testdata;
universe@798:     CX_TEST_DO {
universe@798:         void *end = cx_linked_list_last(begin, loc_next);
universe@798:         void *orig_begin = begin, *orig_end = end;
universe@798: 
universe@798:         cx_linked_list_reverse(&begin, &end, loc_prev, loc_next);
universe@798:         CX_TEST_ASSERT(end == orig_begin);
universe@798:         CX_TEST_ASSERT(begin == orig_end);
universe@798:         CX_TEST_ASSERT(0 == cx_linked_list_compare(begin, expected, loc_next, loc_data, cx_cmp_int));
universe@798:     }
universe@799:     destroy_nodes_test_data(begin);
universe@798:     destroy_nodes_test_data(expected);
universe@798: }
universe@798: 
universe@800: 
universe@800: CX_TEST(test_empty_list_size) {
universe@800:     CX_TEST_DO {
universe@800:         CX_TEST_ASSERT(cxEmptyList->size == 0);
universe@800:         CX_TEST_ASSERT(cxListSize(cxEmptyList) == 0);
universe@800:     }
universe@800: }
universe@800: 
universe@800: CX_TEST(test_empty_list_iterator) {
universe@800:     CxList *list = cxEmptyList;
universe@800: 
universe@800:     CxIterator it1 = cxListIterator(list);
universe@800:     CxIterator it2 = cxListBackwardsIterator(list);
universe@800:     CxMutIterator it3 = cxListMutIterator(list);
universe@800:     CxMutIterator it4 = cxListMutBackwardsIterator(list);
universe@800: 
universe@800:     CX_TEST_DO {
universe@800:         CX_TEST_ASSERT(!cxIteratorValid(it1));
universe@800:         CX_TEST_ASSERT(!cxIteratorValid(it2));
universe@800:         CX_TEST_ASSERT(!cxIteratorValid(it3));
universe@800:         CX_TEST_ASSERT(!cxIteratorValid(it4));
universe@800: 
universe@800:         int c = 0;
universe@800:         cx_foreach(void*, data, it1) c++;
universe@800:         cx_foreach(void*, data, it2) c++;
universe@800:         cx_foreach(void*, data, it3) c++;
universe@800:         cx_foreach(void*, data, it4) c++;
universe@800:         CX_TEST_ASSERT(c == 0);
universe@800:     }
universe@800: }
universe@800: 
universe@800: CX_TEST(test_empty_list_noops) {
universe@800:     CX_TEST_DO {
universe@800:         CxList copy = *cxEmptyList;
universe@800:         cxListSort(cxEmptyList);
universe@800:         cxListClear(cxEmptyList);
universe@800:         cxListDestroy(cxEmptyList);
universe@800:         CX_TEST_ASSERT(0 == memcmp(&copy, cxEmptyList, sizeof(CxList))); // NOLINT(*-suspicious-memory-comparison)
universe@800:     }
universe@800: }
universe@800: 
universe@800: CX_TEST(test_empty_list_at) {
universe@800:     CX_TEST_DO {
universe@800:         CX_TEST_ASSERT(cxListAt(cxEmptyList, 0) == NULL);
universe@800:         CX_TEST_ASSERT(cxListAt(cxEmptyList, 1) == NULL);
universe@800:     }
universe@800: }
universe@800: 
universe@800: CX_TEST(test_empty_list_find) {
universe@800:     int x = 42, y = 1337;
universe@800:     CX_TEST_DO {
universe@800:         CX_TEST_ASSERT(cxListFind(cxEmptyList, &x) < 0);
universe@800:         CX_TEST_ASSERT(cxListFind(cxEmptyList, &y) < 0);
universe@800:     }
universe@800: }
universe@800: 
universe@800: CX_TEST(test_empty_list_compare) {
universe@800:     CxList *empty = cxEmptyList;
universe@800:     CxList *ll = cxLinkedListCreateSimple(sizeof(int));
universe@800:     CxList *al = cxArrayListCreateSimple(sizeof(int), 8);
universe@800:     int x = 5;
universe@800:     CX_TEST_DO {
universe@800:         CX_TEST_ASSERT(0 == cxListCompare(empty, cxEmptyList));
universe@800:         CX_TEST_ASSERT(0 == cxListCompare(ll, cxEmptyList));
universe@800:         CX_TEST_ASSERT(0 == cxListCompare(al, cxEmptyList));
universe@800:         CX_TEST_ASSERT(0 == cxListCompare(cxEmptyList, ll));
universe@800:         CX_TEST_ASSERT(0 == cxListCompare(cxEmptyList, al));
universe@800: 
universe@800:         cxListAdd(ll, &x);
universe@800:         cxListAdd(al, &x);
universe@800: 
universe@800:         CX_TEST_ASSERT(0 < cxListCompare(ll, cxEmptyList));
universe@800:         CX_TEST_ASSERT(0 < cxListCompare(al, cxEmptyList));
universe@800:         CX_TEST_ASSERT(0 > cxListCompare(cxEmptyList, ll));
universe@800:         CX_TEST_ASSERT(0 > cxListCompare(cxEmptyList, al));
universe@800:     }
universe@800:     cxListDestroy(ll);
universe@800:     cxListDestroy(al);
universe@800: }
universe@800: 
universe@798: CxTestSuite *cx_test_suite_array_list(void) {
universe@798:     CxTestSuite *suite = cx_test_suite_new("array_list");
universe@798: 
universe@798:     return suite;
universe@798: }
universe@798: 
universe@798: CxTestSuite *cx_test_suite_linked_list(void) {
universe@798:     CxTestSuite *suite = cx_test_suite_new("linked_list");
universe@798: 
universe@798:     cx_test_register(suite, test_linked_list_link_unlink);
universe@798:     cx_test_register(suite, test_linked_list_at);
universe@798:     cx_test_register(suite, test_linked_list_find);
universe@798:     cx_test_register(suite, test_linked_list_compare);
universe@798:     cx_test_register(suite, test_linked_list_add);
universe@798:     cx_test_register(suite, test_linked_list_prepend);
universe@798:     cx_test_register(suite, test_linked_list_insert);
universe@798:     cx_test_register(suite, test_linked_list_insert_chain);
universe@798:     cx_test_register(suite, test_linked_list_first);
universe@798:     cx_test_register(suite, test_linked_list_last);
universe@798:     cx_test_register(suite, test_linked_list_prev);
universe@798:     cx_test_register(suite, test_linked_list_remove);
universe@798:     cx_test_register(suite, test_linked_list_size);
universe@798:     cx_test_register(suite, test_linked_list_sort_empty);
universe@798:     cx_test_register(suite, test_linked_list_sort);
universe@798:     cx_test_register(suite, test_linked_list_reverse);
universe@798: 
universe@798:     return suite;
universe@798: }
universe@798: 
universe@800: CxTestSuite *cx_test_suite_empty_list(void) {
universe@800:     CxTestSuite *suite = cx_test_suite_new("empty list dummy");
universe@800: 
universe@800:     cx_test_register(suite, test_empty_list_size);
universe@800:     cx_test_register(suite, test_empty_list_iterator);
universe@800:     cx_test_register(suite, test_empty_list_noops);
universe@800:     cx_test_register(suite, test_empty_list_at);
universe@800:     cx_test_register(suite, test_empty_list_find);
universe@800:     cx_test_register(suite, test_empty_list_compare);
universe@800: 
universe@800:     return suite;
universe@800: }