Ubuntu
haskell-hashtables package

haskell-hashtables 1.2.4.2-1 source package in Ubuntu

Changelog

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

  * New upstream release

 -- Clint Adams <email address hidden>  Tue, 14 Jun 2022 16:18:36 -0400

Upload details

Uploaded by:
Debian Haskell Group
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.4.2-1.dsc 2.5 KiB de092859bc3dce1913f8f95dab8e2e7da1d165d5d9bdd25ed83cc976b4b0102a
haskell-hashtables_1.2.4.2.orig.tar.gz 57.1 KiB a8e7220352500fdc90e80422c9fa3b47e1f7ad7f6f9da07f929fc7c5011470fc
haskell-hashtables_1.2.4.2-1.debian.tar.xz 3.4 KiB 6994f0e5bdeeaff87e31bd86bc463fed0c62e2da349dc0df5a57bff23a193eca

No changes file available.

Binary packages built by this source

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

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

libghc-hashtables-doc: No summary available for libghc-hashtables-doc in ubuntu kinetic.

No description available for libghc-hashtables-doc in ubuntu kinetic.

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.