Ubuntu
haskell-hashtables package

haskell-hashtables 1.0.0.0-1 source package in Ubuntu

haskell-hashtables (1.0.0.0-1) unstable; urgency=low


  * Initial release.

 -- Iain Lane <email address hidden>  Wed, 23 Nov 2011 10:24:22 +0000

Series	Pocket	Published	Component	Section

File	Size	SHA-256 Checksum
haskell-hashtables_1.0.0.0-1.dsc	2.4 KiB	d81559bb84f06d1359a9bd0317658069d80c19e5b02ae1c65642748f5e4d4ce4
haskell-hashtables_1.0.0.0.orig.tar.gz	33.6 KiB	c81833b58d94a1b069bb0086d6f2716af04e5d76440100c99af805e9d871f0c4
haskell-hashtables_1.0.0.0-1.debian.tar.gz	2.5 KiB	5cb1ab430feae4008f8151342b468a7e36613769a8be4818866e079ffef35a52

No changes file available.

libghc-hashtables-dev: mutable hash tables: 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.

libghc-hashtables-doc: mutable hash tables -- documentation: 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 the documentation for a library for the Haskell
programming language. See http://www.haskell.org/ for more information on
Haskell.

libghc-hashtables-prof: mutable hash tables -- profiling libraries: 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, compiled
for profiling. See http://www.haskell.org/ for more information on Haskell.