olaf@425: /*
olaf@425:  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
olaf@425:  *
olaf@425:  * Copyright 2021 Mike Becker, Olaf Wintermann All rights reserved.
olaf@425:  *
olaf@425:  * Redistribution and use in source and binary forms, with or without
olaf@425:  * modification, are permitted provided that the following conditions are met:
olaf@425:  *
olaf@425:  *   1. Redistributions of source code must retain the above copyright
olaf@425:  *      notice, this list of conditions and the following disclaimer.
olaf@425:  *
olaf@425:  *   2. Redistributions in binary form must reproduce the above copyright
olaf@425:  *      notice, this list of conditions and the following disclaimer in the
olaf@425:  *      documentation and/or other materials provided with the distribution.
olaf@425:  *
olaf@425:  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
olaf@425:  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
olaf@425:  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
olaf@425:  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
olaf@425:  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
olaf@425:  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
olaf@425:  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
olaf@425:  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
olaf@425:  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
olaf@425:  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
olaf@425:  * POSSIBILITY OF SUCH DAMAGE.
olaf@425:  */
olaf@425: 
olaf@425: #include "cx/tree.h"
universe@515: #include <gtest/gtest.h>
olaf@425: 
olaf@425: struct TestNode {
universe@515:     TestNode *parent = nullptr;
universe@515:     TestNode *prev = nullptr;
universe@515:     TestNode *next = nullptr;
universe@515: 
universe@515:     TestNode *children_begin = nullptr;
universe@515:     TestNode *children_end = nullptr;
olaf@425: };
olaf@425: 
universe@515: TEST(Tree, cx_tree_add_sibling) {
olaf@425:     // prepare test tree
universe@515:     TestNode root, a;
olaf@425:     root.children_begin = &a;
olaf@425:     root.children_end = &a;
olaf@425:     a.parent = &root;
universe@449: 
olaf@425:     // new test nodes
universe@515:     TestNode b, c;
universe@515: 
olaf@425:     // test
universe@453:     cx_tree_add_sibling(&a, offsetof(TestNode, prev), offsetof(TestNode, next), offsetof(TestNode, parent), &b);
universe@515:     EXPECT_EQ(b.parent, &root);
universe@515:     EXPECT_EQ(b.prev, &a);
universe@515:     EXPECT_EQ(b.next, nullptr);
universe@515:     EXPECT_EQ(a.next, &b);
universe@453: 
universe@453:     cx_tree_add_sibling(&a, -1, offsetof(TestNode, next), -1, &c);
universe@515:     EXPECT_EQ(c.parent, nullptr);
universe@515:     EXPECT_EQ(c.prev, nullptr);
universe@515:     EXPECT_EQ(c.next, nullptr);
universe@515:     EXPECT_EQ(b.next, &c);
olaf@425: }
olaf@425: 
universe@515: TEST(Tree, cx_tree_add_child) {
universe@515:     TestNode root, a, b, c, a1;
universe@515: 
universe@453:     cx_tree_add_child(
universe@453:             (void **) &root.children_begin,
universe@453:             (void **) &root.children_end,
olaf@430:             offsetof(TestNode, prev),
olaf@430:             offsetof(TestNode, next),
universe@453:             &a,
universe@453:             offsetof(TestNode, parent),
universe@453:             &root);
universe@515:     EXPECT_EQ(root.children_begin, &a);
universe@515:     EXPECT_EQ(root.children_end, &a);
universe@515:     EXPECT_EQ(a.parent, &root);
universe@515:     EXPECT_EQ(a.prev, nullptr);
universe@515:     EXPECT_EQ(a.next, nullptr);
universe@449: 
universe@453:     cx_tree_add_child(
universe@453:             (void **) &root.children_begin,
universe@453:             (void **) &root.children_end,
olaf@430:             offsetof(TestNode, prev),
olaf@430:             offsetof(TestNode, next),
universe@453:             &b,
universe@453:             offsetof(TestNode, parent),
universe@453:             &root);
universe@515:     EXPECT_EQ(root.children_begin, &a);
universe@515:     EXPECT_EQ(root.children_begin->next, &b);
universe@515:     EXPECT_EQ(root.children_end, &b);
universe@515:     EXPECT_EQ(b.parent, &root);
universe@515:     EXPECT_EQ(b.prev, &a);
universe@453: 
universe@453:     cx_tree_add_child(
universe@453:             (void **) &root.children_begin,
universe@515:             nullptr,
olaf@430:             -1,
olaf@430:             offsetof(TestNode, next),
universe@453:             &c,
universe@453:             -1,
universe@453:             &root);
universe@515:     EXPECT_EQ(root.children_end, &b); // children_end unchanged
universe@515:     EXPECT_EQ(b.next, &c);
universe@515:     EXPECT_EQ(c.prev, nullptr);
universe@515:     EXPECT_EQ(c.next, nullptr);
universe@515:     EXPECT_EQ(c.parent, nullptr);
universe@453: 
universe@453:     cx_tree_add_child(
universe@453:             (void **) &a.children_begin,
universe@453:             (void **) &a.children_end,
olaf@430:             offsetof(TestNode, prev),
olaf@430:             offsetof(TestNode, next),
universe@453:             &a1,
universe@453:             offsetof(TestNode, parent),
universe@453:             &a);
universe@515:     EXPECT_EQ(a.children_begin, &a1);
universe@515:     EXPECT_EQ(a1.parent, &a);
universe@515:     EXPECT_EQ(root.children_begin, &a);
universe@515:     EXPECT_EQ(root.children_begin->children_begin, &a1);
olaf@430: }