bimaps: bijections with multiple implementations.

[ bsd3, data, library ] [ Propose Tags ]

Bijections between sets of values.


[Skip to Readme]
Versions [RSS] [faq] 0.0.0.1, 0.0.0.2, 0.0.0.3, 0.0.0.4, 0.1.0.0, 0.1.0.1, 0.1.0.2
Change log changelog.md
Dependencies aeson (>=0.8 && <0.11), base (>=4.7 && <4.9), binary (==0.7.*), cereal (==0.4.*), containers (==0.5.*), deepseq (>=1.3 && <1.5), hashable (==1.2.*), primitive (>=0.5 && <0.7), QuickCheck (>=2.7 && <2.9), storable-tuple (==0.0.2.*), unordered-containers (==0.2.5.*), vector (>=0.10 && <0.12), vector-binary-instances (==0.2.*), vector-th-unbox (==0.2.*) [details]
License BSD-3-Clause
Copyright Christian Hoener zu Siederdissen, 2014 - 2015
Author Christian Hoener zu Siederdissen
Maintainer choener@bioinf.uni-leipzig.de
Category Data
Home page https://github.com/choener/bimaps
Bug tracker https://github.com/choener/bimaps/issues
Source repo head: git clone git://github.com/choener/bimaps
Uploaded by ChristianHoener at 2015-11-20T20:43:32Z
Distributions LTSHaskell:0.1.0.2, NixOS:0.1.0.2, Stackage:0.1.0.2
Downloads 4999 total (32 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2015-12-10 [all 3 reports]

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Candidates


Readme for bimaps-0.0.0.3

[back to package description]

Build Status

bimaps

Efficient bijections between sets with dense and sparse implementations.

Contact

Christian Hoener zu Siederdissen
Leipzig University, Leipzig, Germany
choener@bioinf.uni-leipzig.de
http://www.bioinf.uni-leipzig.de/~choener/