mirror of https://github.com/CPunch/Laika.git
55 lines
2.3 KiB
C
55 lines
2.3 KiB
C
// Copyright 2020 Joshua J Baker. All rights reserved.
|
|
// Use of this source code is governed by an MIT-style
|
|
// license that can be found in the LICENSE file.
|
|
|
|
#ifndef HASHMAP_H
|
|
#define HASHMAP_H
|
|
|
|
#include <stdbool.h>
|
|
#include <stddef.h>
|
|
#include <stdint.h>
|
|
|
|
struct hashmap;
|
|
|
|
struct hashmap *hashmap_new(size_t elsize, size_t cap,
|
|
uint64_t seed0, uint64_t seed1,
|
|
uint64_t (*hash)(const void *item,
|
|
uint64_t seed0, uint64_t seed1),
|
|
int (*compare)(const void *a, const void *b,
|
|
void *udata),
|
|
void (*elfree)(void *item),
|
|
void *udata);
|
|
struct hashmap *hashmap_new_with_allocator(
|
|
void *(*malloc)(size_t),
|
|
void *(*realloc)(void *, size_t),
|
|
void (*free)(void*),
|
|
size_t elsize, size_t cap,
|
|
uint64_t seed0, uint64_t seed1,
|
|
uint64_t (*hash)(const void *item,
|
|
uint64_t seed0, uint64_t seed1),
|
|
int (*compare)(const void *a, const void *b,
|
|
void *udata),
|
|
void (*elfree)(void *item),
|
|
void *udata);
|
|
void hashmap_free(struct hashmap *map);
|
|
void hashmap_clear(struct hashmap *map, bool update_cap);
|
|
size_t hashmap_count(struct hashmap *map);
|
|
bool hashmap_oom(struct hashmap *map);
|
|
void *hashmap_get(struct hashmap *map, const void *item);
|
|
void *hashmap_set(struct hashmap *map, void *item);
|
|
void *hashmap_delete(struct hashmap *map, void *item);
|
|
void *hashmap_probe(struct hashmap *map, uint64_t position);
|
|
bool hashmap_scan(struct hashmap *map,
|
|
bool (*iter)(const void *item, void *udata), void *udata);
|
|
|
|
uint64_t hashmap_sip(const void *data, size_t len,
|
|
uint64_t seed0, uint64_t seed1);
|
|
uint64_t hashmap_murmur(const void *data, size_t len,
|
|
uint64_t seed0, uint64_t seed1);
|
|
|
|
|
|
// DEPRECATED: use `hashmap_new_with_allocator`
|
|
void hashmap_set_allocator(void *(*malloc)(size_t), void (*free)(void*));
|
|
|
|
#endif
|