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.

[maintain]

Warnings:

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

Versions0.1.0.0, 0.1.1, 0.1.1, 0.1.2
Change logchangelog.md
Dependenciesbase (>=4.5.1 && <4.12), deepseq, hashable, integer-gmp, mono-traversable, primitive, QuickCheck, semigroups [details]
LicenseBSD-3-Clause
Copyright(c) Alex Washburn 2018
AuthorAlex Washburn
Maintainerhackage@recursion.ninja
CategoryData, Bit Vectors
Home pagehttps://github.com/recursion-ninja/bv-little
Bug trackerhttps://github.com/recursion-ninja/bv-little/issues
Source repositoryhead: git clone https://github.com/recursion-ninja/bv-little
UploadedTue Apr 24 17:54:26 UTC 2018 by recursion_ninja

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees


Readme for bv-little-0.1.1

[back to package description]

Efficient little-endian bit vector Haskell library

Build Status Coverage Status License FreeBSD Hackage Stackage Nightly Stackage LTS

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:

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: