Ubuntu
haskell-hashtables package

haskell-hashtables 1.2.1.0-1build1 source package in Ubuntu

Changelog

haskell-hashtables (1.2.1.0-1build1) xenial; urgency=medium

  * Rebuild for new GHC ABIs.

 -- Colin Watson <email address hidden>  Tue, 12 Jan 2016 15:45:53 +0000

Upload details

Uploaded by:
Colin Watson
Uploaded to:
Xenial
Original maintainer:
Debian Haskell Group
Architectures:
any all
Section:
haskell
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Xenial release universe haskell

Downloads

File Size SHA-256 Checksum
haskell-hashtables_1.2.1.0.orig.tar.gz 52.4 KiB ef5122c8f3b72d1e817a4f2adb410ad88b30818934a276b7184790697f4fdcac
haskell-hashtables_1.2.1.0-1build1.debian.tar.xz 3.0 KiB 2d83a2d522f52c576823ff3530b4f7744fc8e23bd6c6f820f2a9140ba913f9ae
haskell-hashtables_1.2.1.0-1build1.dsc 2.5 KiB 2399da3aaec96569f1116e61744c3f7fbf11c8182600ad8e54f99e9fa6ccaa84

View changes file

Binary packages built by this source

libghc-hashtables-dev: No summary available for libghc-hashtables-dev in ubuntu yakkety.

No description available for libghc-hashtables-dev in ubuntu yakkety.

libghc-hashtables-doc: mutable hash tables -- documentation; 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; 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.