src/cx/hash_map.h

Wed, 18 May 2022 16:26:32 +0200

author
Mike Becker <universe@uap-core.de>
date
Wed, 18 May 2022 16:26:32 +0200
changeset 549
d7f0b5a9a985
child 550
89b2a83728b1
permissions
-rw-r--r--

#189 declare basic map functions

universe@549 1 /*
universe@549 2 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
universe@549 3 *
universe@549 4 * Copyright 2021 Mike Becker, Olaf Wintermann All rights reserved.
universe@549 5 *
universe@549 6 * Redistribution and use in source and binary forms, with or without
universe@549 7 * modification, are permitted provided that the following conditions are met:
universe@549 8 *
universe@549 9 * 1. Redistributions of source code must retain the above copyright
universe@549 10 * notice, this list of conditions and the following disclaimer.
universe@549 11 *
universe@549 12 * 2. Redistributions in binary form must reproduce the above copyright
universe@549 13 * notice, this list of conditions and the following disclaimer in the
universe@549 14 * documentation and/or other materials provided with the distribution.
universe@549 15 *
universe@549 16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
universe@549 17 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
universe@549 18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
universe@549 19 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
universe@549 20 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
universe@549 21 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
universe@549 22 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
universe@549 23 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
universe@549 24 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
universe@549 25 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
universe@549 26 * POSSIBILITY OF SUCH DAMAGE.
universe@549 27 */
universe@549 28 /**
universe@549 29 * \file map.h
universe@549 30 * \brief Interface for map implementations.
universe@549 31 * \author Mike Becker
universe@549 32 * \author Olaf Wintermann
universe@549 33 * \version 3.0
universe@549 34 * \copyright 2-Clause BSD License
universe@549 35 */
universe@549 36
universe@549 37 #ifndef UCX_HASH_MAP_H
universe@549 38 #define UCX_HASH_MAP_H
universe@549 39
universe@549 40 #include "map.h"
universe@549 41
universe@549 42 #ifdef __cplusplus
universe@549 43 extern "C" {
universe@549 44 #endif
universe@549 45
universe@549 46 /** Internal structure for a key within a hash map. */
universe@549 47 struct cx_hash_map_key_s {
universe@549 48 /** The key data. */
universe@549 49 CxDataPtr data;
universe@549 50 /** The hash value of the key data. */
universe@549 51 unsigned hash;
universe@549 52 };
universe@549 53
universe@549 54 /** Internal structure for an element of a hash map. */
universe@549 55 struct cx_hash_map_element_s {
universe@549 56 /** The value data. */
universe@549 57 void *data;
universe@549 58
universe@549 59 /** A pointer to the next element in the current bucket. */
universe@549 60 struct cx_hash_map_element_s *next;
universe@549 61
universe@549 62 /** The corresponding key. */
universe@549 63 struct cx_hash_map_key_s key;
universe@549 64 };
universe@549 65
universe@549 66
universe@549 67 /**
universe@549 68 * Creates a new hash map with the specified size using a UcxAllocator.
universe@549 69 *
universe@549 70 * @param allocator the allocator to use
universe@549 71 * @param buckets the initial number of buckets in this hash map
universe@549 72 * @return a pointer to the new hash map
universe@549 73 */
universe@549 74 CxMap *cxHashMapCreate(
universe@549 75 CxAllocator *allocator,
universe@549 76 size_t buckets
universe@549 77 );
universe@549 78
universe@549 79 /**
universe@549 80 * Increases the number of buckets, if necessary.
universe@549 81 *
universe@549 82 * The load value is \c loadFactor*buckets. If the element count exceeds the load
universe@549 83 * value, the map needs to be rehashed. Otherwise, no action is performed and
universe@549 84 * this function simply returns 0.
universe@549 85 *
universe@549 86 * The rehashing process ensures, that the number of buckets is at least
universe@549 87 * \p bucketFactor times the number of stored items. So there is enough room for additional
universe@549 88 * elements without the need of another soon rehashing.
universe@549 89 *
universe@549 90 * You can use this function after filling a map to dramatically increase access performance.
universe@549 91 *
universe@549 92 * @note If the specified map is not a hash map, the behavior is undefined.
universe@549 93 *
universe@549 94 * @param map the map to rehash
universe@549 95 * @param loadFactor a percentage threshold for the load of the map
universe@549 96 * @param bucketFactor a factor for the number of buckets that shall be available after rehashing
universe@549 97 * @return zero on success, non-zero if a memory allocation error occurred
universe@549 98 */
universe@549 99 __attribute__((__nonnull__))
universe@549 100 int cxMapRehash2(
universe@549 101 CxMap *map,
universe@549 102 float loadFactor,
universe@549 103 float bucketFactor
universe@549 104 );
universe@549 105
universe@549 106 /**
universe@549 107 * Rehashes the map with load factor 0.75 and bucket factor 2.5.
universe@549 108 *
universe@549 109 * @param map the map to rehash
universe@549 110 * @return zero on success, non-zero if a memory allocation error occurred
universe@549 111 * @see cxMapRehash2()
universe@549 112 */
universe@549 113 __attribute__((__nonnull__))
universe@549 114 static inline int cxMapRehash(CxMap *map) {
universe@549 115 return cxMapRehash2(map, 0.75f, 2.5f);
universe@549 116 }
universe@549 117
universe@549 118
universe@549 119 #ifdef __cplusplus
universe@549 120 } // extern "C"
universe@549 121 #endif
universe@549 122
universe@549 123 #endif // UCX_HASH_MAP_H

mercurial