aboutsummaryrefslogtreecommitdiffstats
path: root/examples/hashtable/uns_hashtable.h
blob: a9f16a34cc14d84dfecbf801341e8d772e22b180 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
#ifndef UNS_STRING_H
#define UNS_STRING_H

/* Copyright (c) 2024, Peter McGoron
 *
 * 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
 * OWNER 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 "uns.h"

/* Imperative hash tables with internal chaining.
 *
 * Internal chaining is inefficient, but it is a good showcase of garbage
 * collection.
 *
 * Hashtable:
 * [size][used][pointers to entries]
 *               NULL or  |/---------------------------------------------\
 *               [pointer to length][pointer to string][pointer to next] /
 *                                                         | NULL or    /
 *                                                         \-----------/
 */

void uns_hashtable_search(struct uns_gc *gc, struct uns_ctr *htbl,
                          unsigned char *str, size_t string_len,
                          struct uns_ctr *found);
size_t uns_hashtable_used(struct uns_gc *gc, struct uns_ctr *htbl);
size_t uns_hashtable_len(struct uns_gc *gc, struct uns_ctr *htbl);
void uns_hashtable_del(struct uns_gc *gc, struct uns_ctr *htbl,
                       unsigned char *str, size_t string_len,
                       struct uns_ctr *old_value);

/* The following functions may collect. */
void uns_hashtable_alloc_into(struct uns_gc *gc, struct uns_ctr *r, size_t size);
void uns_hashtable_add(struct uns_gc *gc, struct uns_ctr *htbl,
                       struct uns_ctr *string, size_t string_len,
                       struct uns_ctr *value, struct uns_ctr *old_value);
void uns_hashtable_resize(struct uns_gc *gc, struct uns_ctr *htbl, size_t newsize);

#endif