bv-little: Efficient little-endian bit vector library
This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.
Warnings:
- 'ghc-options: -O2' is rarely needed. Check that it is giving a real benefit and not just imposing longer compile times on your users.
- Packages relying on Cabal 1.12 or later should specify a specific version of the Cabal spec of the form 'cabal-version: x.y'. Use 'cabal-version: 1.22'.
This package contains a time- and space- efficient implementation of little-endian bit vectors. Provides implementations of applicable typeclasses and numeric conversions.
The declared cost of each operation is either worst-case or amortized.
For an implementation of big-endian bit vectors, use the bv package.
[Skip to Readme]
Properties
| Versions | 0.1.0.0, 0.1.1, 0.1.2, 1.0.0, 1.0.1, 1.1.0, 1.1.0, 1.1.1, 1.3.0, 1.3.1, 1.3.2 |
|---|---|
| Change log | changelog.md |
| Dependencies | base (>=4.5.1 && <5), deepseq (>=1.4.1.1), hashable (>=1.2.3.2), integer-gmp (>=1.0), keys (>=3.10.1), mono-traversable (>=1.0.5.0), mono-traversable-keys (>=0.1.0), primitive (>=0.6.4.0), QuickCheck (>=2.8), semigroups (>=0.18 && <1.0), text-show (>=3.2.1) [details] |
| License | BSD-3-Clause |
| Copyright | (c) Alex Washburn 2018 |
| Author | Alex Washburn |
| Maintainer | hackage@recursion.ninja |
| Category | Data, Bit Vectors |
| Home page | https://github.com/recursion-ninja/bv-little |
| Bug tracker | https://github.com/recursion-ninja/bv-little/issues |
| Source repo | head: git clone https://github.com/recursion-ninja/bv-little |
| Uploaded | by recursion_ninja at 2019-07-22T13:38:50Z |
Modules
[Index] [Quick Jump]
- Data
- BitVector
Downloads
- bv-little-1.1.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees
Readme for bv-little-1.1.0
[back to package description]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 bv 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 empirical 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