binary-list: Lists of length a power of two.
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.
Downloads
- binary-list-1.1.1.2.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 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 && <5), binary (>=0.6.4.0), bytestring (>=0.10.0.0), deepseq, phantom-state (>=0.2), transformers (>=0.3.0.0) [details] |
| License | BSD-3-Clause |
| Author | Daniel Díaz |
| Maintainer | dhelta.diaz@gmail.com |
| Category | Data |
| Bug tracker | https://github.com/Daniel-Diaz/binary-list/issues |
| Source repo | head: git clone git://github.com/Daniel-Diaz/binary-list.git |
| Uploaded | by DanielDiaz at 2016-07-07T03:58:14Z |
| Distributions | LTSHaskell:1.1.1.2, NixOS:1.1.1.2, Stackage:1.1.1.2 |
| Reverse Dependencies | 2 direct, 0 indirect [details] |
| Downloads | 23783 total (35 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2016-07-07 [all 1 reports] |