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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
|
#include "hashmap.h"
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
HashMap *hashmap_new(
size_t key_size, size_t value_size, size_t (*hash)(void *key), int (*compare)(void *key1, void *key2), void (*key_cleanup)(void *key),
void (*value_cleanup)(void *key)
) {
HashMap *map = malloc(sizeof(HashMap));
for (size_t i = 0; i < HASHMAP_TABLE_SIZE; i++)
map->table[i] = NULL;
map->key_size = key_size;
map->value_size = value_size;
map->hash = hash;
map->compare = compare;
map->key_cleanup = key_cleanup;
map->value_cleanup = value_cleanup;
return map;
}
void hashmap_put(HashMap *map, void *key, void *value) {
size_t key_hash = map->hash(key);
HashMapNode *node = map->table[key_hash];
// check if it exists
while (node) {
// if it exists - update node
if (map->compare(key, node->key)) {
// ensure no hanging memory allocation
if (map->value_cleanup) {
map->value_cleanup(node);
}
memcpy(node->value, value, map->value_size);
return;
}
node = node->next;
}
// if it doesn't exist - create new node
HashMapNode *new_node = malloc(sizeof(HashMapNode));
new_node->key = malloc(map->key_size);
new_node->value = malloc(map->value_size);
memcpy(new_node->key, key, map->key_size);
memcpy(new_node->value, value, map->value_size);
// put in front of the linked list
new_node->next = map->table[key_hash];
map->table[key_hash] = new_node;
}
void *hashmap_get(HashMap *map, void *key) {
size_t key_hash = map->hash(key);
HashMapNode *node = map->table[key_hash];
// check if it exists
while (node) {
// if it exists - return the value pointer
if (map->compare(key, node->key)) {
return node->value;
}
node = node->next;
}
// if it doesn't exist - return NULL
return NULL;
}
void free_node_without_next(HashMap *map, HashMapNode *node) {
if (map->key_cleanup) {
map->key_cleanup(node);
}
if (map->value_cleanup) {
map->value_cleanup(node);
}
free(node->key);
free(node->value);
free(node);
}
void hashmap_delete(HashMap *map, void *key) {
size_t key_hash = map->hash(key);
HashMapNode **p_node = &map->table[key_hash];
// check if it exists
while (*p_node) {
// if it exists - delete it
if (map->compare(key, (*p_node)->key)) {
HashMapNode *next = (*p_node)->next;
free_node_without_next(map, *p_node);
*p_node = next;
return;
}
p_node = &(*p_node)->next;
}
}
HashMapNode *hashmap_first(HashMap *map) {
for (size_t i = 0; i < HASHMAP_TABLE_SIZE; i++) {
HashMapNode *node = map->table[i];
if (node)
return node;
}
return NULL;
}
HashMapNode *hashmap_next(HashMap *map, HashMapNode *node) {
if (node->next)
return node->next;
for (size_t i = map->hash(node->key) + 1; i < HASHMAP_TABLE_SIZE; i++) {
HashMapNode *node = map->table[i];
if (node)
return node;
}
return NULL;
}
void hashmap_free(HashMap *map) {
for (size_t i = 0; i < HASHMAP_TABLE_SIZE; i++) {
HashMapNode *curr = map->table[i];
while (curr) {
HashMapNode *next = curr->next;
free_node_without_next(map, curr);
curr = next;
}
}
free(map);
}
size_t hash_uint32(void *key) {
// MurmurHash3
uint32_t k = *(uint32_t *)key;
k ^= k >> 16;
k *= 0x85ebca6b;
k ^= k >> 13;
k *= 0xc2b2ae35;
k ^= k >> 16;
return k % HASHMAP_TABLE_SIZE;
}
int compare_uint32(void *key1, void *key2) {
uint32_t *k1 = key1;
uint32_t *k2 = key2;
return *k1 == *k2;
}
|
