Ubuntu
haskell-store package

haskell-store 0.4.3.2-1build1 source package in Ubuntu

Changelog

haskell-store (0.4.3.2-1build1) bionic; urgency=medium

  * Rebuild against new GHC ABI.

 -- Gianfranco Costamagna <email address hidden>  Wed, 20 Dec 2017 19:12:02 +0100

Upload details

Uploaded by:
Gianfranco Costamagna
Uploaded to:
Bionic
Original maintainer:
Debian Haskell Group
Architectures:
any all
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
haskell-store_0.4.3.2.orig.tar.gz 42.6 KiB eca47c14b14ce5a6369a4b09a048b5a7fe7574d3f1b1099bc03449416c80308e
haskell-store_0.4.3.2-1build1.debian.tar.xz 3.0 KiB 26266c68bb9f82f9312d6b63af22517e35400ceb0aa46fd8e7c5dd0c507efbba
haskell-store_0.4.3.2-1build1.dsc 4.8 KiB 106a39c71d673b4e98e2b780765a3d1cfee23c63fc8e11e815fe597b1c9748e5

View changes file

Binary packages built by this source

libghc-store-dev: Fast binary serialization

 The 'store' package provides efficient binary serialization. There are a
 couple features that particularly distinguish it from most prior Haskell
 serialization libraries:
 .
  * Its primary goal is speed. By default, direct machine representations
    are used for things like numeric values (Int, Double, Word32, etc)
    and buffers (Text, ByteString, Vector, etc). This means that much of
    serialization uses the equivalent of memcpy.
  * Instead of implementing lazy serialization / deserialization involving
    multiple input / output buffers, peek and poke always work with a
    single buffer. This buffer is allocated by asking the value for its
    size before encoding. This simplifies the encoding logic, and allows
    for highly optimized tight loops.
  * store can optimize size computations by knowing when some types always
    use the same number of bytes. This allows for computing the byte size
    of a `Vector Int32` by just doing `length v * 4`.
 .
 It also features:
 .
  * Optimized serialization instances for many types from base, vector,
    bytestring, text, containers, time, template-haskell, and more.
  * TH and GHC Generics based generation of Store instances for datatypes
  * TH generation of testcases
 .
 This package provides a library for the Haskell programming language.
 See http://www.haskell.org/ for more information on Haskell.

libghc-store-doc: Fast binary serialization; documentation

 The 'store' package provides efficient binary serialization. There are a
 couple features that particularly distinguish it from most prior Haskell
 serialization libraries:
 .
  * Its primary goal is speed. By default, direct machine representations
    are used for things like numeric values (Int, Double, Word32, etc)
    and buffers (Text, ByteString, Vector, etc). This means that much of
    serialization uses the equivalent of memcpy.
  * Instead of implementing lazy serialization / deserialization involving
    multiple input / output buffers, peek and poke always work with a
    single buffer. This buffer is allocated by asking the value for its
    size before encoding. This simplifies the encoding logic, and allows
    for highly optimized tight loops.
  * store can optimize size computations by knowing when some types always
    use the same number of bytes. This allows for computing the byte size
    of a `Vector Int32` by just doing `length v * 4`.
 .
 It also features:
 .
  * Optimized serialization instances for many types from base, vector,
    bytestring, text, containers, time, template-haskell, and more.
  * TH and GHC Generics based generation of Store instances for datatypes
  * TH generation of testcases
 .
 This package provides the documentation for a library for the Haskell
 programming language.
 See http://www.haskell.org/ for more information on Haskell.

libghc-store-prof: Fast binary serialization; profiling libraries

 The 'store' package provides efficient binary serialization. There are a
 couple features that particularly distinguish it from most prior Haskell
 serialization libraries:
 .
  * Its primary goal is speed. By default, direct machine representations
    are used for things like numeric values (Int, Double, Word32, etc)
    and buffers (Text, ByteString, Vector, etc). This means that much of
    serialization uses the equivalent of memcpy.
  * Instead of implementing lazy serialization / deserialization involving
    multiple input / output buffers, peek and poke always work with a
    single buffer. This buffer is allocated by asking the value for its
    size before encoding. This simplifies the encoding logic, and allows
    for highly optimized tight loops.
  * store can optimize size computations by knowing when some types always
    use the same number of bytes. This allows for computing the byte size
    of a `Vector Int32` by just doing `length v * 4`.
 .
 It also features:
 .
  * Optimized serialization instances for many types from base, vector,
    bytestring, text, containers, time, template-haskell, and more.
  * TH and GHC Generics based generation of Store instances for datatypes
  * TH generation of testcases
 .
 This package provides a library for the Haskell programming language, compiled
 for profiling. See http://www.haskell.org/ for more information on Haskell.