haskell-hashtables 1.2.3.3-1 source package in Ubuntu

Changelog

haskell-hashtables (1.2.3.3-1) unstable; urgency=medium

  * New upstream release

 -- Clint Adams <email address hidden>  Mon, 29 Jul 2019 20:33:28 -0400

Upload details

Uploaded by:
Debian Haskell Group on 2019-07-30
Uploaded to:
Sid
Original maintainer:
Debian Haskell Group
Architectures:
any all
Section:
haskell
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
haskell-hashtables_1.2.3.3-1.dsc 2.5 KiB d4457b1c4e23ba0fbd6f00462742dc4d59132fb58ffa138ed267709549ab2e60
haskell-hashtables_1.2.3.3.orig.tar.gz 56.3 KiB de0e85fad6123bbfc460dcc26a768e574298068f6875d86ab06a8a4f081a3703
haskell-hashtables_1.2.3.3-1.debian.tar.xz 3.3 KiB 78af31850f273fc9c8e2b84e3431a9f7f0cce7ecfc65ce7483bbb117b8df8a66

No changes file available.

Binary packages built by this source

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-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.