blob: f8f6d9172ea7678b79bef919393da4c230b7c579 (
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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
|
/*
This file is part of ct.
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
You should have received a copy of the GNU General Public License
along with Takwrap. If not, see <https://www.gnu.org/licenses/>.
*/
#ifndef HASHTABLE_H
#define HASHTABLE_H
#include <stdlib.h>
#include <stdint.h>
// ===================================================================
// Types
// ===================================================================
#define HASHTABLE_SIZE ((uint32_t)((1<<19) - 1))
typedef struct ht_node_s {
struct ht_node_s *next;
uint64_t key;
void* data;
} ht_entry_t;
typedef struct hashtable_s {
ht_entry_t *entries[HASHTABLE_SIZE+1];
uint64_t num_entries;
} hashtable_t;
// ===================================================================
// Methods
// ===================================================================
hashtable_t*
ht_init(void);
void
ht_free(void data_free(void *), hashtable_t *table);
ht_entry_t
*ht_seek(const uint64_t key, hashtable_t *table);
int
ht_insert(const uint64_t key, void* data, hashtable_t *table);
#endif
|
