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.

there are three hash table implementations:

* data.hashtable.st.basic contains a basic open-addressing hash table using
linear probing as the collision strategy. this should currently be the
fastest available hash table implementation for lookups, although it has a
higher memory overhead than others.
* data.hashtable.st.cuckoo contains an implementation of "cuckoo hashing".
cuckoo hashing has worst-case o(1) lookups and performs well even when the
table is highly loaded.
* 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.
this package provides a library for the haskell programming language. see http://www.haskell.org/ for more information on haskell.