src/tree.c@9aa38cd4c992 (annotated)
src/tree.c
Sun, 26 Sep 2021 14:41:49 +0200
- author
- Olaf Wintermann <olaf.wintermann@gmail.com>
- date
- Sun, 26 Sep 2021 14:41:49 +0200
- changeset 426
- 9aa38cd4c992
- parent 425
- a75b808d653b
- child 431
- dcf01bb852f4
- permissions
- -rw-r--r--
implement cx_tree_add_node()
| olaf@424 | 1 | /* |
| olaf@424 | 2 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER. |
| olaf@424 | 3 | * |
| olaf@424 | 4 | * Copyright 2021 Mike Becker, Olaf Wintermann All rights reserved. |
| olaf@424 | 5 | * |
| olaf@424 | 6 | * Redistribution and use in source and binary forms, with or without |
| olaf@424 | 7 | * modification, are permitted provided that the following conditions are met: |
| olaf@424 | 8 | * |
| olaf@424 | 9 | * 1. Redistributions of source code must retain the above copyright |
| olaf@424 | 10 | * notice, this list of conditions and the following disclaimer. |
| olaf@424 | 11 | * |
| olaf@424 | 12 | * 2. Redistributions in binary form must reproduce the above copyright |
| olaf@424 | 13 | * notice, this list of conditions and the following disclaimer in the |
| olaf@424 | 14 | * documentation and/or other materials provided with the distribution. |
| olaf@424 | 15 | * |
| olaf@424 | 16 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
| olaf@424 | 17 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| olaf@424 | 18 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| olaf@424 | 19 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE |
| olaf@424 | 20 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| olaf@424 | 21 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| olaf@424 | 22 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| olaf@424 | 23 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| olaf@424 | 24 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
| olaf@424 | 25 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
| olaf@424 | 26 | * POSSIBILITY OF SUCH DAMAGE. |
| olaf@424 | 27 | */ |
| olaf@424 | 28 | |
| olaf@424 | 29 | #include "cx/tree.h" |
| olaf@425 | 30 | |
| olaf@426 | 31 | #define CX_TR_PTR(cur, off) ((void**)(((char*)cur)+off)) |
| olaf@426 | 32 | |
| olaf@426 | 33 | void* cx_tree_last(void *node, ptrdiff_t loc_next) { |
| olaf@426 | 34 | void *last; |
| olaf@426 | 35 | do { |
| olaf@426 | 36 | last = node; |
| olaf@426 | 37 | } while ((node = *CX_TR_PTR(node, loc_next)) != NULL); |
| olaf@426 | 38 | return last; |
| olaf@426 | 39 | } |
| olaf@425 | 40 | |
| olaf@425 | 41 | int cx_tree_add_node(void *node, ptrdiff_t loc_parent, ptrdiff_t loc_prev, ptrdiff_t loc_next, void *new_node) { |
| olaf@426 | 42 | void *last = cx_tree_last(node, loc_next); |
| olaf@426 | 43 | if(!last) |
| olaf@426 | 44 | return 1; |
| olaf@426 | 45 | |
| olaf@426 | 46 | // next pointer must be present |
| olaf@426 | 47 | *CX_TR_PTR(last, loc_next) = new_node; |
| olaf@426 | 48 | |
| olaf@426 | 49 | // optional fields |
| olaf@426 | 50 | if(loc_parent >= 0) { |
| olaf@426 | 51 | *CX_TR_PTR(new_node, loc_parent) = *CX_TR_PTR(node, loc_parent); |
| olaf@426 | 52 | } |
| olaf@426 | 53 | if(loc_prev >= 0) { |
| olaf@426 | 54 | *CX_TR_PTR(new_node, loc_prev) = last; |
| olaf@426 | 55 | } |
| olaf@426 | 56 | |
| olaf@426 | 57 | return 0; |
| olaf@425 | 58 | } |
| olaf@425 | 59 | |
| olaf@425 | 60 | int cx_tree_add_child_node( |
| olaf@425 | 61 | void *parent, |
| olaf@425 | 62 | ptrdiff_t loc_parent, |
| olaf@425 | 63 | ptrdiff_t loc_prev, |
| olaf@425 | 64 | ptrdiff_t loc_next, |
| olaf@425 | 65 | void **children_begin, |
| olaf@425 | 66 | void **children_end, |
| olaf@425 | 67 | void *new_node) |
| olaf@425 | 68 | { |
| olaf@425 | 69 | return 1; |
| olaf@425 | 70 | } |
