hash_table.h

#pragma once
 
#include <kiba/allocators/allocator.h>
#include <kiba/defines.h>
 
// TODO restructure this. try an array of keys and values instead
typedef struct hash_table_entry {
    u64   hash;
    usize key_size;
    void *key;
    uptr  value;
} hash_table_entry;
 
typedef struct hash_table {
    usize             size;
    usize             capacity;
    f64               max_load;
    allocator        *alloc;
    hash_table_entry *data;
} hash_table;
 
KB_API b8 hash_table_create(hash_table *table, usize initial_capacity, f64 max_load, allocator *alloc);
 
KB_API void hash_table_destroy(hash_table *table);
 
KB_API b8 hash_table_set(hash_table *table, const void *key, usize key_size, uptr value);
 
KB_API b8 hash_table_get(hash_table *table, const void *key, usize key_size, void *value_ptr);
 
#define hash_table_for_each(table)                                                                 \
    for (hash_table_entry *entry = (table).data; entry < (table).data + (table).capacity; ++entry) \
        if (entry->key_size != 0)