haskell-hashtables 1.2.4.2-1build1 source package in Ubuntu
Changelog
haskell-hashtables (1.2.4.2-1build1) lunar; urgency=medium * Rebuild against new GHC ABI. -- Gianfranco Costamagna <email address hidden> Sun, 11 Dec 2022 05:40:37 +0100
Upload details
- Uploaded by:
- Gianfranco Costamagna
- Uploaded to:
- Lunar
- Original maintainer:
- Debian Haskell Group
- Architectures:
- any all
- Section:
- haskell
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section | |
---|---|---|---|---|
Mantic | release | universe | haskell | |
Lunar | release | universe | haskell |
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
haskell-hashtables_1.2.4.2.orig.tar.gz | 57.1 KiB | a8e7220352500fdc90e80422c9fa3b47e1f7ad7f6f9da07f929fc7c5011470fc |
haskell-hashtables_1.2.4.2-1build1.debian.tar.xz | 3.4 KiB | 450b9960a386bd5e65efc123694bb4d97cc92a5f09aaff67bda2d426ef43e55f |
haskell-hashtables_1.2.4.2-1build1.dsc | 2.5 KiB | 65d2071e538e2b20f47a4e8a0cfc3c7602f0ce43d1721a890ea01063bac1ff6a |
Available diffs
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-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.