Mutable hash tables in the ST monad
This package provides a couple of different implementations of mutable hash tables in the ST monad, as well as a typeclass abstracting their common operations, and a set of wrappers to use the hash tables in the IO monad. This package currently contains three hash table implementations: 1. Data.HashTable.ST.Basic contains a basic open-addressing hash table using linear probing as the collision strategy. 2. Data.HashTable.ST.Cuckoo contains an implementation of "cuckoo hashing" which has worst-case O(1) lookups and can reach a high "load factor". 3. Data.HashTable.ST.Linear contains a linear hash table, which trades some insert and lookup performance for higher space efficiency and much shorter delays when expanding the table.
Release | Stable | Testing |
---|---|---|
Fedora Rawhide | 1.3.1-6.fc40 | - |
Fedora 40 | 1.3.1-6.fc40 | - |
Fedora 39 | 1.3.1-4.fc39 | - |
Fedora 38 | 1.3.1-2.fc38 | - |
EPEL 9 | 1.2.4.2-1.el9 | - |
EPEL 8 | 1.2.3.1-1.el8 | - |
EPEL 7 | 1.0.1.8-4.el7 | - |
You can contact the maintainers of this package via email at
ghc-hashtables dash maintainers at fedoraproject dot org
.