haskell-store 0.4.3.2-1 source package in Ubuntu
Changelog
haskell-store (0.4.3.2-1) unstable; urgency=low * Initial release (Closes: #883000) -- Ilias Tsitsimpis <email address hidden> Tue, 28 Nov 2017 17:53:18 +0200
Upload details
- Uploaded by:
- Debian Haskell Group
- Uploaded to:
- Sid
- Original maintainer:
- Debian Haskell Group
- Architectures:
- any all
- Section:
- misc
- Urgency:
- Low Urgency
See full publishing history Publishing
| Series | Published | Component | Section |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| haskell-store_0.4.3.2-1.dsc | 4.8 KiB | 3e5ba5769eb0c933b6c28d70b571788c40519f988e1f2aed8be18566af165af9 |
| haskell-store_0.4.3.2.orig.tar.gz | 42.6 KiB | eca47c14b14ce5a6369a4b09a048b5a7fe7574d3f1b1099bc03449416c80308e |
| haskell-store_0.4.3.2-1.debian.tar.xz | 3.0 KiB | 792e295afd03610a3ac63ba5349db353391cf0995040a58210b87f3ce5d3002e |
No changes file available.
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.
