binary-list

Lists of length a power of two.

LTS Haskell 21.24:	1.1.1.2
Stackage Nightly 2023-12-10:	1.1.1.2
Latest on Hackage:	1.1.1.2

See all snapshots binary-list appears in

BSD-3-Clause licensed by Daniel Díaz

Maintained by dhelta.diaz@gmail.com

This version can be pinned in stack with:binary-list-1.1.1.2@sha256:248935768b8885d3ce1a647bba50a303bd17ff4105fa376175be9c0dfa29cc74,2209

Module documentation for 1.1.1.2

Data
- Data.BinaryList
  - Data.BinaryList.Serialize

Depends on 6 packages(full list with versions):

base, binary, bytestring, deepseq, phantom-state, transformers

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.