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
|
#include "bowl.h"
#include "array.h"
#include "hash.h"
#include "utils.h"
#include <malloc.h>
typedef struct {
char *key;
struct bowl *data;
} hash_item;
err_t hash_insert_key(struct bowl *self, char *key, struct bowl *child)
{
CHECK(self, INVALID_STATE)
CHECK(child, INVALID_STATE)
CHECK(key, INVALID_STATE)
// Even though we're a HASH node, we use an array under the hood
struct bowl_arr *arr = self->_pl.array;
CHECK(arr, INVALID_STATE)
size_t idx;
err_t e = _hash(key, arr->size, &idx);
if(e) return e;
// If the index is used, rescale and try again
if(arr->ptr[idx] != NULL) {
struct bowl *prev = self;
// Allocate new array
e = array_malloc(self, arr->size * 2);
if(e) return e;
for(int i = 0; i < arr->size; i++) {
if(arr->ptr[i] != NULL) {
// FIXME: This is horrible
hash_item *item = (hash_item*) arr->ptr[i];
e = hash_insert_key(self, item->key, item->data);
if(e) return e;
}
}
e = array_free(prev);
if(e) return e;
e = hash_insert_key(self, key, child);
if(e) return e;
} else {
hash_item *item = malloc(sizeof(hash_item));
CHECK(item, MALLOC_FAILED)
item->key = calloc(sizeof(char), REAL_STRLEN(key));
CHECK(item->key, MALLOC_FAILED)
strcpy(item->key, key);
item->data = child;
arr->ptr[idx] = (struct bowl*) item;
}
return OK;
}
err_t hash_remove_key(struct bowl *self, char *key, struct bowl **child)
{
CHECK(self, INVALID_STATE)
CHECK(child, INVALID_STATE)
CHECK(key, INVALID_STATE)
// Even though we're a HASH node, we use an array under the hood
struct bowl_arr *arr = self->_pl.array;
CHECK(arr, INVALID_STATE)
size_t idx;
err_t e = _hash(key, arr->size, &idx);
if(e) return e;
(*child) = arr->ptr[idx];
arr->ptr[idx] = NULL;
return OK;
}
|
