The binary-list package

[Tags: bsd3, library]

Implementation of lists whose number of elements is a power of two. Binary lists have this property by definition, so it is impossible to build a value with other kind of length. The implementation take advantage of this property to get additional performance.

Some algorithms are designed to work only when the input list has length a power of two. Use binary lists to ensure this property in the input. In addition, this library exports some useful functions for this kind of algorithms. An example implementing the Fast Fourier Transform is provided in the Data.BinaryList module.

The package contains an additional module with utilities for the (de)serialization of binary lists.

Properties

Versions0.1.0.0, 0.1.0.1, 0.1.0.2, 0.2.0.0, 0.2.0.1, 0.2.0.2, 0.2.0.3, 0.2.0.4, 0.3.0.0, 0.3.1.0, 0.3.1.1, 0.3.1.2, 0.3.2.0, 0.3.2.1, 0.3.3.0, 0.3.4.0, 0.3.4.1, 0.3.5.0, 0.4.0.0, 1.0.0.0, 1.0.0.1, 1.0.1.0, 1.1.0.0, 1.1.0.1, 1.1.0.2, 1.1.1.0
Change logNone available
Dependenciesbase (==4.*), binary (>=0.6.4.0), bytestring (>=0.10.0.0), deepseq, phantom-state (>=0.2), transformers (>=0.3.0.0)
LicenseBSD3
AuthorDaniel Díaz
Maintainerdhelta.diaz@gmail.com
CategoryData
Bug trackerhttps://github.com/Daniel-Diaz/binary-list/issues
Source repositoryhead: git clone git://github.com/Daniel-Diaz/binary-list.git
UploadedMon Apr 13 14:20:34 UTC 2015 by DanielDiaz
DistributionsLTSHaskell:1.1.1.0, NixOS:1.1.1.0, Stackage:1.1.1.0
Downloads2645 total (301 in last 30 days)
StatusDocs available [build log]
Last success reported on 2015-04-13 [all 1 reports]

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees