haskell-mutable-containers 0.3.3-3build7 source package in Ubuntu

Changelog

haskell-mutable-containers (0.3.3-3build7) bionic; urgency=medium

  * Rebuild against new GHC ABI.

 -- Gianfranco Costamagna <email address hidden>  Fri, 26 Jan 2018 09:49:17 +0100

Upload details

Uploaded by:
Gianfranco Costamagna
Uploaded to:
Bionic
Original maintainer:
Ubuntu Developers
Architectures:
any all
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Bionic release universe misc

Downloads

File Size SHA-256 Checksum
haskell-mutable-containers_0.3.3.orig.tar.gz 11.8 KiB 7a7a39cbb16978dd1607a3977d7a1e5d8ecda7a528845d6983b5b97c49517ceb
haskell-mutable-containers_0.3.3-3build7.debian.tar.xz 2.8 KiB dea2d7dc2873b9d9babded69ec87f94c7f1d9e62b8d90538e7c2a540faacb9a1
haskell-mutable-containers_0.3.3-3build7.dsc 2.7 KiB eec088126c66c9595d4155a3d286f29c5cb7d8ab45de7f5782c4693c03dcc038

Available diffs

View changes file

Binary packages built by this source

libghc-mutable-containers-dev: No summary available for libghc-mutable-containers-dev in ubuntu cosmic.

No description available for libghc-mutable-containers-dev in ubuntu cosmic.

libghc-mutable-containers-doc: abstactions and concrete implementations of mutable containers; documentation

 One of Haskell's strengths is immutable data structures. These structures make
 it easier to reason about code, simplify concurrency and parallelism, and in
 some cases can improve performance by allowing sharing. However, there are
 still classes of problems where mutable data structures can both be more
 convenient, and provide a performance boost. This library is meant to provide
 such structures in a performant, well tested way. It also provides a simple
 abstraction over such data structures via typeclasses.
 .
 This package provides the documentation for a library for the Haskell
 programming language.
 See http://www.haskell.org/ for more information on Haskell.

libghc-mutable-containers-prof: abstactions and concrete implementations of mutable containers; profiling libraries

 One of Haskell's strengths is immutable data structures. These structures make
 it easier to reason about code, simplify concurrency and parallelism, and in
 some cases can improve performance by allowing sharing. However, there are
 still classes of problems where mutable data structures can both be more
 convenient, and provide a performance boost. This library is meant to provide
 such structures in a performant, well tested way. It also provides a simple
 abstraction over such data structures via typeclasses.
 .
 This package provides a library for the Haskell programming language, compiled
 for profiling. See http://www.haskell.org/ for more information on Haskell.