ucx/avl.h

Sun, 17 May 2015 17:59:07 +0200

author
Mike Becker <universe@uap-core.de>
date
Sun, 17 May 2015 17:59:07 +0200
changeset 193
fb05d315a0ba
parent 192
1e51558b9d09
child 194
0c1b7676e74c
permissions
-rw-r--r--

defined AVL tree functional interface

universe@192 1 /*
universe@192 2 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
universe@192 3 *
universe@192 4 * Copyright 2015 Olaf Wintermann. All rights reserved.
universe@192 5 *
universe@192 6 * Redistribution and use in source and binary forms, with or without
universe@192 7 * modification, are permitted provided that the following conditions are met:
universe@192 8 *
universe@192 9 * 1. Redistributions of source code must retain the above copyright
universe@192 10 * notice, this list of conditions and the following disclaimer.
universe@192 11 *
universe@192 12 * 2. Redistributions in binary form must reproduce the above copyright
universe@192 13 * notice, this list of conditions and the following disclaimer in the
universe@192 14 * documentation and/or other materials provided with the distribution.
universe@192 15 *
universe@192 16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
universe@192 17 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
universe@192 18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
universe@192 19 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
universe@192 20 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
universe@192 21 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
universe@192 22 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
universe@192 23 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
universe@192 24 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
universe@192 25 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
universe@192 26 * POSSIBILITY OF SUCH DAMAGE.
universe@192 27 */
universe@192 28
universe@192 29
universe@192 30 /**
universe@192 31 * @file avl.h
universe@192 32 *
universe@192 33 * AVL tree implementation.
universe@192 34 *
universe@192 35 * This binary search tree implementation allows average O(1) insertion and
universe@192 36 * removal of elements.
universe@192 37 *
universe@192 38 * @author Mike Becker
universe@192 39 * @author Olaf Wintermann
universe@192 40 */
universe@192 41
universe@192 42 #ifndef UCX_AVL_H
universe@192 43 #define UCX_AVL_H
universe@192 44
universe@193 45 #include "ucx.h"
universe@193 46
universe@193 47
universe@192 48 #ifdef __cplusplus
universe@192 49 extern "C" {
universe@192 50 #endif
universe@192 51
universe@193 52 /**
universe@193 53 * UCX AVL Node type.
universe@193 54 *
universe@193 55 * @see UcxAVLNode
universe@193 56 */
universe@193 57 typedef struct UcxAVLNode UcxAVLNode;
universe@193 58
universe@193 59 /**
universe@193 60 * UCX AVL Node.
universe@193 61 */
universe@193 62 struct UcxAVLNode {
universe@193 63 /**
universe@193 64 * The key for this node.
universe@193 65 */
universe@193 66 void *key;
universe@193 67 /**
universe@193 68 * Data contained by this node.
universe@193 69 */
universe@193 70 void *value;
universe@193 71 /**
universe@193 72 * The height of this (sub)-tree.
universe@193 73 */
universe@193 74 size_t height;
universe@193 75 /**
universe@193 76 * Parent node.
universe@193 77 */
universe@193 78 UcxAVLNode *parent;
universe@193 79 /**
universe@193 80 * Root node of left subtree.
universe@193 81 */
universe@193 82 UcxAVLNode *left;
universe@193 83 /**
universe@193 84 * Root node of right subtree.
universe@193 85 */
universe@193 86 UcxAVLNode *right;
universe@193 87 };
universe@193 88
universe@193 89 /**
universe@193 90 * UCX AVL Tree.
universe@193 91 */
universe@193 92 typedef struct {
universe@193 93 /**
universe@193 94 * Root node of the tree.
universe@193 95 */
universe@193 96 UcxAVLNode *root;
universe@193 97 /**
universe@193 98 * Compare function that shall be used to compare the UcxAVLNode keys.
universe@193 99 * @see UcxAVLNode.key
universe@193 100 */
universe@193 101 cmp_func cmpfunc;
universe@193 102 /**
universe@193 103 * Custom user data.
universe@193 104 * This data will also be provided to the cmpfunc.
universe@193 105 */
universe@193 106 void *userdata;
universe@193 107 } UcxAVLTree;
universe@193 108
universe@193 109 /**
universe@193 110 * Gets the value from the tree, that is associated with the specified key.
universe@193 111 * @param tree the UcxAVLTree
universe@193 112 * @param key the key
universe@193 113 * @return the value (or <code>NULL</code>, if the key is not present)
universe@193 114 */
universe@193 115 void *ucx_avl_get(UcxAVLTree *tree, void *key);
universe@193 116
universe@193 117 /**
universe@193 118 * Puts a key/value pair into the tree.
universe@193 119 * @param tree the UcxAVLTree
universe@193 120 * @param key the key
universe@193 121 * @param value the new value
universe@193 122 * @return the replaced value (or <code>NULL</code>, if the key is new to the
universe@193 123 * tree)
universe@193 124 */
universe@193 125 void* ucx_avl_put(UcxAVLTree *tree, void *key, void *value);
universe@193 126
universe@193 127 /**
universe@193 128 * Removes an element from the AVL tree.
universe@193 129 * @param tree the UcxAVLTree
universe@193 130 * @param key the key
universe@193 131 * @return the removed value (or <code>NULL</code>, if the key was not present)
universe@193 132 */
universe@193 133 void* ucx_avl_remove(UcxAVLTree *tree, void *key);
universe@192 134
universe@192 135
universe@192 136
universe@192 137 #ifdef __cplusplus
universe@192 138 }
universe@192 139 #endif
universe@192 140
universe@192 141 #endif /* UCX_AVL_H */
universe@192 142

mercurial