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.


Dependenciesbase (==4.*), binary (>=, bytestring (>=, deepseq, phantom-state (>=0.2), transformers (>=
AuthorDaniel Díaz
Bug tracker
Source repositoryhead: git clone git://
UploadedTue Nov 18 14:45:59 UTC 2014 by DanielDiaz
DistributionsLTSHaskell:, NixOS:, Stackage:
Downloads1562 total (150 in last 30 days)
StatusDocs uploaded by user
Build status unknown [no reports yet]




Maintainers' corner

For package maintainers and hackage trustees