ghc-hashtables - 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.
|ghc-hashtables-220.127.116.11-3.el7.ppc64 [5 KiB]||
by Jens Petersen (2013-06-07):
- update to new simplified Haskell Packaging Guidelines