nx_hash.nx

nx_hash.nx -- open-addressing hash table (linear probing, fnv-1a). FOUNDATION primitive. Any code that needs O(1) lookup uses this: * Symbol table during link * String interning in lex * Deduplication in opt * Visited-set in graph algorithms Today every NishiLang module that needs lookup either does linear scan or builds an ad-hoc table. Centralising removes ~hundred lines of repeated code across the runtime. Algorithm: open-addressing with linear probing. Power-of-two capacity for fast modulo (mask = cap - 1). Hash via FNV-1a (Fowler-Noll-Vo, public domain, well-distributed). Load factor: caller-controlled; resize is a TODO (v0.0.1 expects caller to size the table appropriately). API: nx_hash_new(cap_pow2) -- construct nx_hash_put(t, key, val) -- insert / overwrite nx_hash_get(t, key) -- lookup; -1 = not found nx_hash_has(t, key) -- 1 = present nx_hash_count(t) -- number of entries Keys are i64 (use the FNV-1a hash); values are i64. String interning users compute the FNV-1a of their string and use that as the i64 key.