blob: 40f146ad4d7321aa07904825102656e4153eee20 (
plain)
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
|
//
// Copyright (C) 2022 by Anton Kling <anton@kling.gg>
//
// SPDX-License-Identifier: BSD-2-Clause
//
#ifndef HASHMAP_H
#define HASHMAP_H
#include <stddef.h>
#include <stdint.h>
typedef struct LinkedList {
const char *key;
int key_allocated;
void *value;
void (*upon_deletion)(const char *, void *);
struct LinkedList *next;
} LinkedList;
typedef struct HashMap {
LinkedList **entries;
size_t size;
size_t num_entries;
uint32_t (*hash_function)(const uint8_t *data, size_t len);
} HashMap;
HashMap *hashmap_create(size_t size);
void hashmap_free(HashMap *m);
// hashmap_add_entry()
// -------------------
// This function adds a entry to the hashmap. The "key" passed to the
// hashmap will be allocated by default unless (do_not_allocate_key) is
// set to 1.
int hashmap_add_entry(HashMap *m, const char *key, void *value,
void (*upon_deletion)(const char *, void *),
int do_not_allocate_key);
void *hashmap_get_entry(HashMap *m, const char *key);
int hashmap_delete_entry(HashMap *m, const char *key);
#endif
|
