Efficient little-endian bit vector library
|Version on this page:||0.1.2|
|LTS Haskell 18.28:||1.1.1|
|Stackage Nightly 2021-06-14:||1.1.1|
|Latest on Hackage:||1.1.1|
Module documentation for 0.1.2
Efficient little-endian bit vector Haskell library
This package contains an efficient implementation of little-endian bit vectors. It implements most applicable typeclasses and also conversions to and from signed or unsigned numbers. Care has been taken to balance the number of transitive dependencies with respect to functionality provided.
For an implementation of big-endian bit vectors, use the
The test suite ensures that all typeclass instances are “lawful” and that data-structure–specific functionality is well defined.
TestSuite.hs file contains the specification. It can be run by invoking any of the following commands:
The benchmarks provide an empirical check for the asymptotic complexity of data structure operations and also provide easy metrics for detecting performance regressions.
Benchmaks.hs file contains these metrics. It can be run by invoking any of the following commands:
- Updating to base bounds for GHC 8.6.1
Updated to well-typed internal representation
Corrected defect in rotate, rotateL, and rotateR
Improved performance by switching exponentiation with base 2 to bit shifting operations
Improved performance of clearBit by increasing strictness
Increased benchmark coverage
Increased test suite coverage
Created instances of applicable typeclass instances
Added numeric conversion functions
Added basic test suite
Added stub benchmark