Ubuntu
haskell-hashtables package

haskell-hashtables 1.2.3.4-1build2 source package in Ubuntu

Changelog

haskell-hashtables (1.2.3.4-1build2) hirsute; urgency=medium

  * No-change rebuild for new GHC ABIs

 -- Steve Langasek <email address hidden>  Fri, 30 Oct 2020 00:47:35 +0000

Upload details

Uploaded by:
Steve Langasek
Uploaded to:
Hirsute
Original maintainer:
Ubuntu Developers
Architectures:
any all
Section:
haskell
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Jammy release universe haskell

Downloads

File Size SHA-256 Checksum
haskell-hashtables_1.2.3.4.orig.tar.gz 57.1 KiB 125ce62701fba3f666609f5c75f452005aa5d32dff4eeee3f3903c30b2ed55e6
haskell-hashtables_1.2.3.4-1build2.debian.tar.xz 3.5 KiB 53db6f357c7baa923d5e74e9bc958ce180f936cbd575907bcbce0f11343f9294
haskell-hashtables_1.2.3.4-1build2.dsc 2.6 KiB ff694f39fd7f1f59915b93b4cc7e7aced014607e3b4e6eb3f6a0fdd75ab07593

Available diffs

View changes file

Binary packages built by this source

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

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

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.