78 lines
1.6 KiB
C
78 lines
1.6 KiB
C
#include "collection.h"
|
|
#include <stddef.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
|
|
void array_push(
|
|
void** data, size_t* capacity, size_t* size, void* elem, size_t elem_size)
|
|
{
|
|
if (!*capacity) {
|
|
*capacity = 4;
|
|
}
|
|
if (!*data) {
|
|
*data = malloc(elem_size * *capacity);
|
|
*size = 0;
|
|
}
|
|
if (*size >= *capacity) {
|
|
*capacity *= 2;
|
|
*data = realloc(*data, *capacity * elem_size);
|
|
}
|
|
memcpy((unsigned char*)*data + *size, elem, elem_size);
|
|
*size += 1;
|
|
}
|
|
|
|
static void push_kwpair(Hashmap* m, KwPair* pair)
|
|
{
|
|
array_push((void**)&m->entries,
|
|
&m->entries_capacity,
|
|
&m->entries_size,
|
|
pair,
|
|
sizeof(*pair));
|
|
}
|
|
|
|
void hashmap_init(Hashmap* m)
|
|
{
|
|
*m = (Hashmap) {
|
|
.entries = nullptr,
|
|
.entries_capacity = 8,
|
|
.entries_size = 0,
|
|
};
|
|
}
|
|
|
|
void hashmap_deinit(Hashmap* m)
|
|
{
|
|
if (m->entries) {
|
|
for (size_t i = 0; i < m->entries_size; ++i) {
|
|
free(m->entries[i].key);
|
|
}
|
|
free(m->entries);
|
|
}
|
|
}
|
|
|
|
static KwPair* find_entry(Hashmap* m, const char* key)
|
|
{
|
|
for (size_t i = 0; i < m->entries_size; ++i) {
|
|
if (strcmp(m->entries[i].key, key) == 0) {
|
|
return &m->entries[i];
|
|
}
|
|
}
|
|
return nullptr;
|
|
}
|
|
|
|
void hashmap_set(Hashmap* m, const char* key, void* val)
|
|
{
|
|
KwPair* existing = find_entry(m, key);
|
|
if (existing) {
|
|
existing->val = val;
|
|
return;
|
|
}
|
|
|
|
push_kwpair(m, &(KwPair) { strdup(key), val });
|
|
}
|
|
|
|
void* hashmap_get(Hashmap* m, const char* key)
|
|
{
|
|
KwPair* existing = find_entry(m, key);
|
|
return existing ? existing->val : nullptr;
|
|
}
|