bv-little
Efficient little-endian bit vector library
https://github.com/recursion-ninja/bv-little
| Version on this page: | 1.1.1 |
| LTS Haskell 23.28: | 1.3.2 |
| Stackage Nightly 2024-12-09: | 1.3.2 |
| Latest on Hackage: | 1.3.2 |
bv-little-1.1.1@sha256:52316b5a6099bf120f69656b88dfcfe6b2d722f868087ae4cccff4faee04d4c3,7452Module documentation for 1.1.1
- Data
- Data.BitVector
Efficient little-endian bit vector Haskell library
This package contains an efficient implementation of little-endian, immutable bit vectors. It implements most applicable typeclasses and also conversions to and from signed or unsigned numbers.
For an implementation of big-endian, immutable bit vectors, use the bv package.
For an implementation of little-endian, mutable bit vectors, use the bitvec package.
Tests
The test suite ensures that all typeclass instances are “lawful” and that data-structure–specific functionality is well defined.
The TestSuite.hs file contains the specification. It can be run by invoking any of the following commands:
-
cabal new-test -
cabal test -
stack test
Benchmarks
The benchmarks provide an empyrical check for the asymptotic complexity of data structure operations and also provide easy metrics for detecting performance regressions.
The Benchmaks.hs file contains these metrics. It can be run by invoking any of the following commands:
-
cabal new-bench -
cabal bench -
stack bench