aboutsummaryrefslogtreecommitdiff
path: root/hashtable.c
diff options
context:
space:
mode:
Diffstat (limited to 'hashtable.c')
-rw-r--r--hashtable.c9
1 files changed, 4 insertions, 5 deletions
diff --git a/hashtable.c b/hashtable.c
index bfda316..020d281 100644
--- a/hashtable.c
+++ b/hashtable.c
@@ -1,6 +1,5 @@
#include <limits.h>
#include "hashtable.h"
-#include "global.h"
// Generated by starting with 5, then repeatedly taking the smallest prime at
@@ -16,7 +15,7 @@ static const size_t doubling_primes[] = {
struct keyvalue {
- unsigned int key;
+ u64 key;
void *value;
};
@@ -90,7 +89,7 @@ void ht_free(struct hashtable *ht) {
free(ht);
}
-void ht_insert(struct hashtable *ht, unsigned int key, void *value) {
+void ht_insert(struct hashtable *ht, u64 key, void *value) {
struct bucket *bucket = &ht->table[key % ht->modulus];
if (bucket->cap == 0) {
@@ -117,7 +116,7 @@ void ht_insert(struct hashtable *ht, unsigned int key, void *value) {
}
}
-void* ht_find(const struct hashtable *ht, unsigned int key) {
+void* ht_find(const struct hashtable *ht, u64 key) {
struct bucket *bucket = &ht->table[key % ht->modulus];
for (int i = 0; i < bucket->len; i++) {
if (bucket->pairs[i].key == key) {
@@ -127,7 +126,7 @@ void* ht_find(const struct hashtable *ht, unsigned int key) {
return NULL;
}
-void ht_delete(struct hashtable *ht, unsigned int key) {
+void ht_delete(struct hashtable *ht, u64 key) {
struct bucket *bucket = &ht->table[key % ht->modulus];
for (int i = 0; i < bucket->len; i++) {
if (bucket->pairs[i].key == key) {