ucx: test/test_tree.c@8168e16cd1e9 (annotated)

test/test_tree.c@8168e16cd1e9 (annotated)

test/test_tree.c

Sun, 03 Oct 2021 16:02:53 +0200

author: Mike Becker <universe@uap-core.de>
date: Sun, 03 Oct 2021 16:02:53 +0200
changeset 455: 8168e16cd1e9
parent 453: bb144d08cd44
permissions: -rw-r--r--

change test names

 /*
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
  *
  * Copyright 2021 Mike Becker, Olaf Wintermann All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions are met:
  *
  *   1. Redistributions of source code must retain the above copyright
  *      notice, this list of conditions and the following disclaimer.
  *
  *   2. Redistributions in binary form must reproduce the above copyright
  *      notice, this list of conditions and the following disclaimer in the
  *      documentation and/or other materials provided with the distribution.
  *
  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  * POSSIBILITY OF SUCH DAMAGE.
  */
 #include "cx/tree.h"
 #include "test_config.h"
 #include <stddef.h>
 typedef struct TestNode TestNode;
 struct TestNode {
     TestNode *parent;
     TestNode *prev;
     TestNode *next;
     TestNode *children_begin;
     TestNode *children_end;
 };
 void test_tree_add_sibling(void) {
     // prepare test tree
     TestNode root;
     memset(&root, 0, sizeof(TestNode));
     TestNode a;
     memset(&a, 0, sizeof(TestNode));
     root.children_begin = &a;
     root.children_end = &a;
     a.parent = &root;
     // new test nodes
     TestNode b;
     memset(&b, 0, sizeof(TestNode));
     TestNode c;
     memset(&c, 0, sizeof(TestNode));
     // test
     cx_tree_add_sibling(&a, offsetof(TestNode, prev), offsetof(TestNode, next), offsetof(TestNode, parent), &b);
     CU_ASSERT_PTR_EQUAL(b.parent, &root)
     CU_ASSERT_PTR_EQUAL(b.prev, &a)
     CU_ASSERT_PTR_NULL(b.next)
     CU_ASSERT_PTR_EQUAL(a.next, &b)
     cx_tree_add_sibling(&a, -1, offsetof(TestNode, next), -1, &c);
     CU_ASSERT_PTR_NULL(c.parent)
     CU_ASSERT_PTR_NULL(c.prev)
     CU_ASSERT_PTR_NULL(c.next)
     CU_ASSERT_PTR_EQUAL(b.next, &c)
 }
 void test_tree_add_child(void) {
     // prepare test tree
     TestNode root;
     memset(&root, 0, sizeof(TestNode));
     TestNode a;
     memset(&a, 0, sizeof(TestNode));
     TestNode b;
     memset(&b, 0, sizeof(TestNode));
     TestNode c;
     memset(&c, 0, sizeof(TestNode));
     TestNode a1;
     memset(&a1, 0, sizeof(TestNode));
     // test
     cx_tree_add_child(
             (void **) &root.children_begin,
             (void **) &root.children_end,
             offsetof(TestNode, prev),
             offsetof(TestNode, next),
             &a,
             offsetof(TestNode, parent),
             &root);
     CU_ASSERT_PTR_EQUAL(root.children_begin, &a)
     CU_ASSERT_PTR_EQUAL(root.children_end, &a)
     CU_ASSERT_PTR_EQUAL(a.parent, &root)
     CU_ASSERT_PTR_NULL(a.prev)
     CU_ASSERT_PTR_NULL(a.next)
     cx_tree_add_child(
             (void **) &root.children_begin,
             (void **) &root.children_end,
             offsetof(TestNode, prev),
             offsetof(TestNode, next),
             &b,
             offsetof(TestNode, parent),
             &root);
     CU_ASSERT_PTR_NOT_NULL(root.children_begin)
     CU_ASSERT_PTR_EQUAL(root.children_begin->next, &b)
     CU_ASSERT_PTR_EQUAL(root.children_end, &b)
     CU_ASSERT_PTR_EQUAL(b.parent, &root)
     CU_ASSERT_PTR_EQUAL(b.prev, &a)
     cx_tree_add_child(
             (void **) &root.children_begin,
             NULL,
             -1,
             offsetof(TestNode, next),
             &c,
             -1,
             &root);
     CU_ASSERT_PTR_EQUAL(root.children_end, &b) // children_end unchanged
     CU_ASSERT_PTR_EQUAL(b.next, &c)
     CU_ASSERT_PTR_NULL(c.prev)
     CU_ASSERT_PTR_NULL(c.next)
     CU_ASSERT_PTR_NULL(c.parent)
     cx_tree_add_child(
             (void **) &a.children_begin,
             (void **) &a.children_end,
             offsetof(TestNode, prev),
             offsetof(TestNode, next),
             &a1,
             offsetof(TestNode, parent),
             &a);
     CU_ASSERT_PTR_EQUAL(a.children_begin, &a1);
     CU_ASSERT_PTR_EQUAL(a1.parent, &a);
     CU_ASSERT_PTR_NOT_NULL(root.children_begin)
     CU_ASSERT_PTR_EQUAL(root.children_begin->children_begin, &a1)
 }
 int main() {
     CU_pSuite suite = NULL;
     if (CUE_SUCCESS != CU_initialize_registry()) {
         return CU_get_error();
     }
     suite = CU_add_suite("tree suite", NULL, NULL);
     cu_add_test(suite, test_tree_add_sibling);
     cu_add_test(suite, test_tree_add_child);
     CU_basic_set_mode(UCX_CU_BRM);
     int exitcode;
     if (CU_basic_run_tests()) {
         exitcode = CU_get_error();
     } else {
         exitcode = CU_get_number_of_failures() == 0 ? 0 : 1;
     }
     CU_cleanup_registry();
     return exitcode;
 }

Mercurial > hg > ucx / annotate

test/test_tree.c@8168e16cd1e9 (annotated)

test/test_tree.c