Ubuntu
haskell-hashmap package

haskell-hashmap 1.3.0.1-3build1 source package in Ubuntu

Changelog

haskell-hashmap (1.3.0.1-3build1) saucy; urgency=low

  * Rebuild for new GHC ABIs.
 -- Colin Watson <email address hidden>   Thu, 30 May 2013 10:36:45 +0100

Upload details

Uploaded by:
Colin Watson
Uploaded to:
Saucy
Original maintainer:
Debian Haskell Group
Architectures:
any all
Section:
haskell
Urgency:
Low Urgency

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
haskell-hashmap_1.3.0.1.orig.tar.gz 10.4 KiB 99cb18be6c5332d4641ea2a8c435d47f9e3f1f5c94c8fc5e45c101bc72a04c9b
haskell-hashmap_1.3.0.1-3build1.debian.tar.gz 2.6 KiB e334c905bdb3ecbe5306ebfc34fb91e2b784c4262c995a0dd60e839666c2aa36
haskell-hashmap_1.3.0.1-3build1.dsc 2.3 KiB dd99abb9306b3c0085b005d0f0ea3009a41fb9d32a57a85bae571acb558adbfe

View changes file

Binary packages built by this source

libghc-hashmap-dev: persistent containers Map and Set based on hashing

 An implementation of persistent Map and Set containers based on hashing.
 The implementation is build on top of Data.IntMap.IntMap and
 Data.IntSet.IntSet, with very similar API. It uses Hashable class from the
 hashable package for hashing.
 .
 This package can be used as a drop-in replacement for Data.Map and Data.Set
 modules.
 .
 The Map key value is an Data.IntMap.IntMap indexed by the hash value,
 containing either one (key, value) or a Data.Map.Map key value for all
 keys with the same hash value.
 .
 The Set elem is an Data.IntMap.IntMap indexed by the hash value, containing
 either one elem or Data.Set.Set elem for all elements with the same hash
 value.
 .
 This package provides a library for the Haskell programming language.
 See http://www.haskell.org/ for more information on Haskell.

libghc-hashmap-doc: persistent containers Map and Set based on hashing; documentation

 An implementation of persistent Map and Set containers based on hashing.
 The implementation is build on top of Data.IntMap.IntMap and
 Data.IntSet.IntSet, with very similar API. It uses Hashable class from the
 hashable package for hashing.
 This package can be used as a drop-in replacement for Data.Map and Data.Set
 modules.
 .
 The Map key value is an Data.IntMap.IntMap indexed by the hash value,
 containing either one (key, value) or a Data.Map.Map key value for all
 keys with the same hash value.
 .
 The Set elem is an Data.IntMap.IntMap indexed by the hash value, containing
 either one elem or Data.Set.Set elem for all elements with the same hash
 value.
 .
 This package provides the documentation for a library for the Haskell
 programming language.
 See http://www.haskell.org/ for more information on Haskell.

libghc-hashmap-prof: persistent containers Map and Set based on hashing; profiling libraries

 An implementation of persistent Map and Set containers based on hashing.
 The implementation is build on top of Data.IntMap.IntMap and
 Data.IntSet.IntSet, with very similar API. It uses Hashable class from the
 hashable package for hashing.
 .
 This package can be used as a drop-in replacement for Data.Map and Data.Set
 modules.
 .
 The Map key value is an Data.IntMap.IntMap indexed by the hash value,
 containing either one (key, value) or a Data.Map.Map key value for all
 keys with the same hash value.
 .
 The Set elem is an Data.IntMap.IntMap indexed by the hash value, containing
 either one elem or Data.Set.Set elem for all elements with the same hash
 value.
 .
 This package provides a library for the Haskell programming language, compiled
 for profiling. See http://www.haskell.org/ for more information on Haskell.