Local code intelligence for developers and AI agents. Connect code, docs and infrastructure in a persistent graph, with CBM Lens, MCP tools, agent integrations and change-aware test selection.
C aiderastclaude-codecode-analysiscode-intelligencecodexcursorcypherdeveloper-toolsgemini-cligraph-visualizationkilocodeknowledge-graphmcpmcp-servermodel-context-protocolopencodesqlitetree-sitterwindsurf
/*
* hash_table.h — String → void* hash table.
*
* Public API unchanged across implementation rewrites. As of v2 the
* internals are Verstable (https://github.com/JacksonAllan/Verstable),
* a 2024 state-of-the-art open-addressing hash table with quadratic
* probing + per-bucket 4-bit hash fragments. The struct is opaque —
* callers MUST go through cbm_ht_create() and the API functions.
*
* Keys are borrowed pointers — the table does not copy or free them.
* Callers own the key strings for the lifetime of the entry.
*/
#ifndef CBM_HASH_TABLE_H
#define CBM_HASH_TABLE_H
#include <stddef.h>
#include <stdint.h>
#include "mem_core.h" /* cbm_mem_class_t; same directory: the lsp_all unit has no -Isrc */
#include <stdbool.h>
/* Opaque — full definition lives in hash_table.c. */
typedef struct CBMHashTable CBMHashTable;
/* Create a hash table with initial capacity hint (used to pre-reserve
* buckets and avoid early growth; 0 = library default). */
CBMHashTable *cbm_ht_create(uint32_t initial_capacity);
/* Same, with the memory class the table's buckets and entries are charged
* to. cbm_ht_create charges CBM_MEM_CLASS_HASH_TABLE; an owner that wants
* its indexes attributed (the graph buffer: gbuf_index) names its class. */
CBMHashTable *cbm_ht_create_in(cbm_mem_class_t cls, uint32_t initial_capacity);
/* Free the hash table (does NOT free keys or values). */
void cbm_ht_free(CBMHashTable *ht);
/* Insert or update. Returns previous value (NULL if new key). */
void *cbm_ht_set(CBMHashTable *ht, const char *key, void *value);
/* Lookup. Returns NULL if not found. */
void *cbm_ht_get(const CBMHashTable *ht, const char *key);
/* Check if key exists. */
bool cbm_ht_has(const CBMHashTable *ht, const char *key);
/* Return the stored key pointer for a given lookup key, or NULL.
* Useful when you need the canonical (heap-owned) key string
* rather than your own local copy. */
const char *cbm_ht_get_key(const CBMHashTable *ht, const char *key);
/* Delete. Returns removed value (NULL if not found). */
void *cbm_ht_delete(CBMHashTable *ht, const char *key);
/* Number of entries. */
uint32_t cbm_ht_count(const CBMHashTable *ht);
/* Iteration: call fn(key, value, userdata) for each entry. */
typedef void (*cbm_ht_iter_fn)(const char *key, void *value, void *userdata);
void cbm_ht_foreach(const CBMHashTable *ht, cbm_ht_iter_fn fn, void *userdata);
/* Clear all entries (keeps allocated memory). */
void cbm_ht_clear(CBMHashTable *ht);
#endif /* CBM_HASH_TABLE_H */