Source: haskell-hashmap
Maintainer: Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
Uploaders:
 Clint Adams <clint@debian.org>,
Priority: optional
Section: haskell
Rules-Requires-Root: no
Build-Depends:
 cdbs,
 debhelper (>= 10),
 ghc (>= 8),
 ghc-prof,
 haskell-devscripts (>= 0.13),
 libghc-hashable-dev (>= 1.0),
 libghc-hashable-prof,
Build-Depends-Indep:
 ghc-doc,
 libghc-hashable-doc,
Standards-Version: 4.1.4
Homepage: http://git.auryn.cz/haskell/hashmap/
Vcs-Browser: https://salsa.debian.org/haskell-team/DHG_packages/tree/master/p/haskell-hashmap
Vcs-Git: https://salsa.debian.org/haskell-team/DHG_packages.git [p/haskell-hashmap]

Package: libghc-hashmap-dev
Architecture: any
Depends:
 ${haskell:Depends},
 ${misc:Depends},
 ${shlibs:Depends},
Recommends:
 ${haskell:Recommends},
Suggests:
 ${haskell:Suggests},
Provides:
 ${haskell:Provides},
Description: persistent containers Map and Set based on hashing${haskell:ShortBlurb}
 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.
 .
 ${haskell:Blurb}

Package: libghc-hashmap-prof
Architecture: any
Depends:
 ${haskell:Depends},
 ${misc:Depends},
Recommends:
 ${haskell:Recommends},
Suggests:
 ${haskell:Suggests},
Provides:
 ${haskell:Provides},
Description: persistent containers Map and Set based on hashing${haskell:ShortBlurb}
 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.
 .
 ${haskell:Blurb}

Package: libghc-hashmap-doc
Architecture: all
Section: doc
Depends:
 ${haskell:Depends},
 ${misc:Depends},
Recommends:
 ${haskell:Recommends},
Suggests:
 ${haskell:Suggests},
Description: persistent containers Map and Set based on hashing${haskell:ShortBlurb}
 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.
 .
 ${haskell:Blurb}