1.1 --- a/src/tree.c Tue Jun 20 19:13:31 2023 +0200
1.2 +++ /dev/null Thu Jan 01 00:00:00 1970 +0000
1.3 @@ -1,52 +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 "cx/linked_list.h"
1.34 -
1.35 -#define CX_TR_PTR(cur, off) *((void**)(((char*)(cur))+(off)))
1.36 -
1.37 -void cx_tree_add_sibling(void *node, ptrdiff_t loc_prev, ptrdiff_t loc_next, ptrdiff_t loc_parent, void *new_node) {
1.38 - cx_linked_list_add(&node, NULL, loc_prev, loc_next, new_node);
1.39 -
1.40 - // optional parent link
1.41 - if (loc_parent >= 0) {
1.42 - CX_TR_PTR(new_node, loc_parent) = CX_TR_PTR(node, loc_parent);
1.43 - }
1.44 -}
1.45 -
1.46 -void cx_tree_add_child(void **children_begin, void **children_end,
1.47 - ptrdiff_t loc_prev, ptrdiff_t loc_next, void *new_node,
1.48 - ptrdiff_t loc_parent, void *parent) {
1.49 - cx_linked_list_add(children_begin, children_end, loc_prev, loc_next, new_node);
1.50 -
1.51 - // optional parent link
1.52 - if (loc_parent >= 0) {
1.53 - CX_TR_PTR(new_node, loc_parent) = parent;
1.54 - }
1.55 -}
