1.1 --- a/test/test_tree.c Sat Apr 16 09:10:10 2022 +0200
1.2 +++ /dev/null Thu Jan 01 00:00:00 1970 +0000
1.3 @@ -1,169 +0,0 @@
1.4 -/*
1.5 - * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
1.6 - *
1.7 - * Copyright 2021 Mike Becker, Olaf Wintermann All rights reserved.
1.8 - *
1.9 - * Redistribution and use in source and binary forms, with or without
1.10 - * modification, are permitted provided that the following conditions are met:
1.11 - *
1.12 - * 1. Redistributions of source code must retain the above copyright
1.13 - * notice, this list of conditions and the following disclaimer.
1.14 - *
1.15 - * 2. Redistributions in binary form must reproduce the above copyright
1.16 - * notice, this list of conditions and the following disclaimer in the
1.17 - * documentation and/or other materials provided with the distribution.
1.18 - *
1.19 - * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
1.20 - * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
1.21 - * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
1.22 - * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
1.23 - * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
1.24 - * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
1.25 - * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
1.26 - * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
1.27 - * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
1.28 - * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
1.29 - * POSSIBILITY OF SUCH DAMAGE.
1.30 - */
1.31 -
1.32 -#include "cx/tree.h"
1.33 -#include "test_config.h"
1.34 -
1.35 -#include <stddef.h>
1.36 -
1.37 -typedef struct TestNode TestNode;
1.38 -
1.39 -struct TestNode {
1.40 - TestNode *parent;
1.41 - TestNode *prev;
1.42 - TestNode *next;
1.43 -
1.44 - TestNode *children_begin;
1.45 - TestNode *children_end;
1.46 -};
1.47 -
1.48 -void test_tree_add_sibling(void) {
1.49 - // prepare test tree
1.50 - TestNode root;
1.51 - memset(&root, 0, sizeof(TestNode));
1.52 -
1.53 - TestNode a;
1.54 - memset(&a, 0, sizeof(TestNode));
1.55 - root.children_begin = &a;
1.56 - root.children_end = &a;
1.57 - a.parent = &root;
1.58 -
1.59 - // new test nodes
1.60 - TestNode b;
1.61 - memset(&b, 0, sizeof(TestNode));
1.62 - TestNode c;
1.63 - memset(&c, 0, sizeof(TestNode));
1.64 -
1.65 - // test
1.66 - cx_tree_add_sibling(&a, offsetof(TestNode, prev), offsetof(TestNode, next), offsetof(TestNode, parent), &b);
1.67 - CU_ASSERT_PTR_EQUAL(b.parent, &root)
1.68 - CU_ASSERT_PTR_EQUAL(b.prev, &a)
1.69 - CU_ASSERT_PTR_NULL(b.next)
1.70 - CU_ASSERT_PTR_EQUAL(a.next, &b)
1.71 -
1.72 - cx_tree_add_sibling(&a, -1, offsetof(TestNode, next), -1, &c);
1.73 - CU_ASSERT_PTR_NULL(c.parent)
1.74 - CU_ASSERT_PTR_NULL(c.prev)
1.75 - CU_ASSERT_PTR_NULL(c.next)
1.76 - CU_ASSERT_PTR_EQUAL(b.next, &c)
1.77 -}
1.78 -
1.79 -void test_tree_add_child(void) {
1.80 - // prepare test tree
1.81 - TestNode root;
1.82 - memset(&root, 0, sizeof(TestNode));
1.83 -
1.84 - TestNode a;
1.85 - memset(&a, 0, sizeof(TestNode));
1.86 - TestNode b;
1.87 - memset(&b, 0, sizeof(TestNode));
1.88 - TestNode c;
1.89 - memset(&c, 0, sizeof(TestNode));
1.90 - TestNode a1;
1.91 - memset(&a1, 0, sizeof(TestNode));
1.92 -
1.93 - // test
1.94 - cx_tree_add_child(
1.95 - (void **) &root.children_begin,
1.96 - (void **) &root.children_end,
1.97 - offsetof(TestNode, prev),
1.98 - offsetof(TestNode, next),
1.99 - &a,
1.100 - offsetof(TestNode, parent),
1.101 - &root);
1.102 - CU_ASSERT_PTR_EQUAL(root.children_begin, &a)
1.103 - CU_ASSERT_PTR_EQUAL(root.children_end, &a)
1.104 - CU_ASSERT_PTR_EQUAL(a.parent, &root)
1.105 - CU_ASSERT_PTR_NULL(a.prev)
1.106 - CU_ASSERT_PTR_NULL(a.next)
1.107 -
1.108 - cx_tree_add_child(
1.109 - (void **) &root.children_begin,
1.110 - (void **) &root.children_end,
1.111 - offsetof(TestNode, prev),
1.112 - offsetof(TestNode, next),
1.113 - &b,
1.114 - offsetof(TestNode, parent),
1.115 - &root);
1.116 - CU_ASSERT_PTR_NOT_NULL(root.children_begin)
1.117 - CU_ASSERT_PTR_EQUAL(root.children_begin->next, &b)
1.118 - CU_ASSERT_PTR_EQUAL(root.children_end, &b)
1.119 - CU_ASSERT_PTR_EQUAL(b.parent, &root)
1.120 - CU_ASSERT_PTR_EQUAL(b.prev, &a)
1.121 -
1.122 - cx_tree_add_child(
1.123 - (void **) &root.children_begin,
1.124 - NULL,
1.125 - -1,
1.126 - offsetof(TestNode, next),
1.127 - &c,
1.128 - -1,
1.129 - &root);
1.130 - CU_ASSERT_PTR_EQUAL(root.children_end, &b) // children_end unchanged
1.131 - CU_ASSERT_PTR_EQUAL(b.next, &c)
1.132 - CU_ASSERT_PTR_NULL(c.prev)
1.133 - CU_ASSERT_PTR_NULL(c.next)
1.134 - CU_ASSERT_PTR_NULL(c.parent)
1.135 -
1.136 - cx_tree_add_child(
1.137 - (void **) &a.children_begin,
1.138 - (void **) &a.children_end,
1.139 - offsetof(TestNode, prev),
1.140 - offsetof(TestNode, next),
1.141 - &a1,
1.142 - offsetof(TestNode, parent),
1.143 - &a);
1.144 - CU_ASSERT_PTR_EQUAL(a.children_begin, &a1);
1.145 - CU_ASSERT_PTR_EQUAL(a1.parent, &a);
1.146 - CU_ASSERT_PTR_NOT_NULL(root.children_begin)
1.147 - CU_ASSERT_PTR_EQUAL(root.children_begin->children_begin, &a1)
1.148 -}
1.149 -
1.150 -int main() {
1.151 - CU_pSuite suite = NULL;
1.152 -
1.153 - if (CUE_SUCCESS != CU_initialize_registry()) {
1.154 - return CU_get_error();
1.155 - }
1.156 -
1.157 - suite = CU_add_suite("tree suite", NULL, NULL);
1.158 -
1.159 - cu_add_test(suite, test_tree_add_sibling);
1.160 - cu_add_test(suite, test_tree_add_child);
1.161 -
1.162 - CU_basic_set_mode(UCX_CU_BRM);
1.163 -
1.164 - int exitcode;
1.165 - if (CU_basic_run_tests()) {
1.166 - exitcode = CU_get_error();
1.167 - } else {
1.168 - exitcode = CU_get_number_of_failures() == 0 ? 0 : 1;
1.169 - }
1.170 - CU_cleanup_registry();
1.171 - return exitcode;
1.172 -}
