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.0, 1.0.1, 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, hashable, integer-gmp, keys, mono-traversable, mono-traversable-keys, primitive, QuickCheck, semigroups, text-show [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-02-01T19:51:17Z |
Modules
[Index]
- Data
- BitVector
Downloads
- bv-little-1.0.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