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

Versions 0.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, 1.1.1.1, 1.1.1.2
Dependencies base (==4.*), binary (>=0.6.4.0), bytestring (>=0.10.0.0), deepseq, phantom-state (>=0.2), transformers (>=0.3.0.0) [details]
License BSD3
Author Daniel Díaz
Maintainer dhelta.diaz@gmail.com
Stability Unknown
Category Data
Bug tracker https://github.com/Daniel-Diaz/binary-list/issues
Source repository head: git clone git://github.com/Daniel-Diaz/binary-list.git
Uploaded Thu Jul 7 03:58:14 UTC 2016 by DanielDiaz
Distributions LTSHaskell:1.1.1.2, NixOS:1.1.1.2, Stackage:1.1.1.2
Downloads 4328 total (62 in the last 30 days)
Votes
0 []
Status Docs available [build log]
Last success reported on 2016-07-07 [all 1 reports]

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees