1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/tests/test_tree.cpp Tue Feb 07 21:55:37 2023 +0100
1.3 @@ -0,0 +1,122 @@
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 <gtest/gtest.h>
1.34 +
1.35 +struct TestNode {
1.36 + TestNode *parent = nullptr;
1.37 + TestNode *prev = nullptr;
1.38 + TestNode *next = nullptr;
1.39 +
1.40 + TestNode *children_begin = nullptr;
1.41 + TestNode *children_end = nullptr;
1.42 +};
1.43 +
1.44 +TEST(Tree, cx_tree_add_sibling) {
1.45 + // prepare test tree
1.46 + TestNode root, a;
1.47 + root.children_begin = &a;
1.48 + root.children_end = &a;
1.49 + a.parent = &root;
1.50 +
1.51 + // new test nodes
1.52 + TestNode b, c;
1.53 +
1.54 + // test
1.55 + cx_tree_add_sibling(&a, offsetof(TestNode, prev), offsetof(TestNode, next), offsetof(TestNode, parent), &b);
1.56 + EXPECT_EQ(b.parent, &root);
1.57 + EXPECT_EQ(b.prev, &a);
1.58 + EXPECT_EQ(b.next, nullptr);
1.59 + EXPECT_EQ(a.next, &b);
1.60 +
1.61 + cx_tree_add_sibling(&a, -1, offsetof(TestNode, next), -1, &c);
1.62 + EXPECT_EQ(c.parent, nullptr);
1.63 + EXPECT_EQ(c.prev, nullptr);
1.64 + EXPECT_EQ(c.next, nullptr);
1.65 + EXPECT_EQ(b.next, &c);
1.66 +}
1.67 +
1.68 +TEST(Tree, cx_tree_add_child) {
1.69 + TestNode root, a, b, c, a1;
1.70 +
1.71 + cx_tree_add_child(
1.72 + (void **) &root.children_begin,
1.73 + (void **) &root.children_end,
1.74 + offsetof(TestNode, prev),
1.75 + offsetof(TestNode, next),
1.76 + &a,
1.77 + offsetof(TestNode, parent),
1.78 + &root);
1.79 + EXPECT_EQ(root.children_begin, &a);
1.80 + EXPECT_EQ(root.children_end, &a);
1.81 + EXPECT_EQ(a.parent, &root);
1.82 + EXPECT_EQ(a.prev, nullptr);
1.83 + EXPECT_EQ(a.next, nullptr);
1.84 +
1.85 + cx_tree_add_child(
1.86 + (void **) &root.children_begin,
1.87 + (void **) &root.children_end,
1.88 + offsetof(TestNode, prev),
1.89 + offsetof(TestNode, next),
1.90 + &b,
1.91 + offsetof(TestNode, parent),
1.92 + &root);
1.93 + EXPECT_EQ(root.children_begin, &a);
1.94 + EXPECT_EQ(root.children_begin->next, &b);
1.95 + EXPECT_EQ(root.children_end, &b);
1.96 + EXPECT_EQ(b.parent, &root);
1.97 + EXPECT_EQ(b.prev, &a);
1.98 +
1.99 + cx_tree_add_child(
1.100 + (void **) &root.children_begin,
1.101 + nullptr,
1.102 + -1,
1.103 + offsetof(TestNode, next),
1.104 + &c,
1.105 + -1,
1.106 + &root);
1.107 + EXPECT_EQ(root.children_end, &b); // children_end unchanged
1.108 + EXPECT_EQ(b.next, &c);
1.109 + EXPECT_EQ(c.prev, nullptr);
1.110 + EXPECT_EQ(c.next, nullptr);
1.111 + EXPECT_EQ(c.parent, nullptr);
1.112 +
1.113 + cx_tree_add_child(
1.114 + (void **) &a.children_begin,
1.115 + (void **) &a.children_end,
1.116 + offsetof(TestNode, prev),
1.117 + offsetof(TestNode, next),
1.118 + &a1,
1.119 + offsetof(TestNode, parent),
1.120 + &a);
1.121 + EXPECT_EQ(a.children_begin, &a1);
1.122 + EXPECT_EQ(a1.parent, &a);
1.123 + EXPECT_EQ(root.children_begin, &a);
1.124 + EXPECT_EQ(root.children_begin->children_begin, &a1);
1.125 +}
