haskell-hashtables 1.2.1.0-1 source package in Ubuntu
Changelog
haskell-hashtables (1.2.1.0-1) unstable; urgency=medium * New upstream release -- Clint Adams <email address hidden> Fri, 04 Dec 2015 00:09:22 -0500
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 | Published | Component | Section |
---|
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
haskell-hashtables_1.2.1.0-1.dsc | 2.6 KiB | 09429079ce5f3f8be3582f79d5a73fbb118515b6d742781682579d76038b9149 |
haskell-hashtables_1.2.1.0-1.debian.tar.xz | 2.9 KiB | cc6ad06d4df1f963a79260240b5ce9ae744d76a0cf712c0deb0382fd94de52c6 |
haskell-hashtables_1.2.1.0.orig.tar.gz | 52.4 KiB | ef5122c8f3b72d1e817a4f2adb410ad88b30818934a276b7184790697f4fdcac |
Available diffs
- diff from 1.2.0.2-2 to 1.2.1.0-1 (3.0 KiB)
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-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.