@TrisH0x2A: a hash map in 25 lines of C FNV-1a handles the hashing, start with a fixed value and XOR each byte multiply by a prime …

a hash map in 25 lines of C FNV-1a handles the hashing, start with a fixed value and XOR each byte multiply by a prime and repeat the interesting part is the last line instead of using hash % cap it uses hash & (cap - 1) same result when the capacity is a power of two and a bitwise AND is generally cheaper than a modulo operation another neat detail is the use of void pointers for values the hash map does not care what type you store integers strings structs anything works the caller handles the casting when storing and retrieving data