Lists of length a power of two.
|LTS Haskell 20.23:||220.127.116.11|
|Stackage Nightly 2023-05-28:||18.104.22.168|
|Latest on Hackage:||22.214.171.124|
Maintained by email@example.com
This version can be pinned in stack with:
Module documentation for 126.96.36.199
Depends on 6 packages(full list with versions):
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
The package contains an additional module with utilities for the (de)serialization of binary lists.