haskell-hashtables 1.2.2.0-1 source package in Ubuntu
Changelog
haskell-hashtables (1.2.2.0-1) unstable; urgency=medium [ Sean Whitton ] * New upstream release [ Ilias Tsitsimpis ] * Change Priority to optional. Since Debian Policy version 4.0.1, priority extra has been deprecated. * Use the HTTPS form of the copyright-format URL * Modify d/watch and Source field in d/copyright to use HTTPS * Declare compliance with Debian policy 4.1.1 -- Ilias Tsitsimpis <email address hidden> Sat, 04 Nov 2017 21:07:30 +0200
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.2.0-1.dsc | 2.5 KiB | c86967786d3dcafb020b1f1f0f757e96c97e71682aa993dc313cc91f7bd6129b |
haskell-hashtables_1.2.2.0.orig.tar.gz | 55.5 KiB | 6e2d3fc695ff0b3824065c0938641bb98f8dfbf3fbfb3fb331d2fa4b4075f36c |
haskell-hashtables_1.2.2.0-1.debian.tar.xz | 3.2 KiB | 2493f40b2ee6f6e52722b115644085095a7ed9bd66c8eb2cfbe404ac3777b4a9 |
Available diffs
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.