1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/test/test_tree.c Sun Sep 26 14:21:20 2021 +0200
1.3 @@ -0,0 +1,114 @@
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 + int content;
1.48 +};
1.49 +
1.50 +void test_cx_tree_add_node() {
1.51 + // prepare test tree
1.52 + TestNode root;
1.53 + memset(&root, 0, sizeof(TestNode));
1.54 +
1.55 + TestNode a;
1.56 + memset(&a, 0, sizeof(TestNode));
1.57 + root.children_begin = &a;
1.58 + root.children_end = &a;
1.59 + a.parent = &root;
1.60 + a.content = 1;
1.61 +
1.62 + // new test nodes
1.63 + TestNode b;
1.64 + memset(&b, 0, sizeof(TestNode));
1.65 + TestNode c;
1.66 + memset(&c, 0, sizeof(TestNode));
1.67 +
1.68 + // test
1.69 + b.content = 2;
1.70 + int ret = cx_tree_add_node(&a, offsetof(TestNode, parent), offsetof(TestNode, prev), offsetof(TestNode, next), &b);
1.71 + CU_ASSERT_EQUAL(ret, 0);
1.72 + CU_ASSERT_PTR_EQUAL(b.parent, &root);
1.73 + CU_ASSERT_PTR_EQUAL(b.prev, &a);
1.74 + CU_ASSERT_PTR_EQUAL(b.next, NULL);
1.75 + CU_ASSERT_PTR_EQUAL(a.next, &b);
1.76 +
1.77 + c.content = 3;
1.78 + ret = cx_tree_add_node(&a, -1, -1, offsetof(TestNode, next), &c);
1.79 + CU_ASSERT_EQUAL(ret, 0);
1.80 + CU_ASSERT_PTR_EQUAL(c.parent, NULL);
1.81 + CU_ASSERT_PTR_EQUAL(c.prev, NULL);
1.82 + CU_ASSERT_PTR_EQUAL(c.next, NULL);
1.83 + CU_ASSERT_PTR_EQUAL(b.next, &c);
1.84 +}
1.85 +
1.86 +int main() {
1.87 + CU_pSuite suite = NULL;
1.88 +
1.89 + if (CUE_SUCCESS != CU_initialize_registry()) {
1.90 + return CU_get_error();
1.91 + }
1.92 +
1.93 + suite = CU_add_suite("tree suite", NULL, NULL);
1.94 + if (NULL == suite) {
1.95 + CU_cleanup_registry();
1.96 + return CU_get_error();
1.97 + }
1.98 +
1.99 + if (
1.100 + !CU_add_test(suite, "ll add tree node", test_cx_tree_add_node)
1.101 + ) {
1.102 + CU_cleanup_registry();
1.103 + return CU_get_error();
1.104 + }
1.105 +
1.106 +
1.107 + CU_basic_set_mode(UCX_CU_BRM);
1.108 +
1.109 + int exitcode;
1.110 + if (CU_basic_run_tests()) {
1.111 + exitcode = CU_get_error();
1.112 + } else {
1.113 + exitcode = CU_get_number_of_failures() == 0 ? 0 : 1;
1.114 + }
1.115 + CU_cleanup_registry();
1.116 + return exitcode;
1.117 +}
