Description
Implements efficient mutable hash tables based on Haskell vectors. Mutable hash tables provide fast insert, lookup, and update operations when controlled mutation is appropriate.
It is useful for parsers, compilers, caches, indexing, counters, and high-performance data processing. Developers should manage mutation scope carefully so state changes remain understandable and safe.