bimaps: bijections with multiple implementations.

[ bsd3, data, library ] [ Propose Tags ]

Bijections between sets of values.

[Skip to Readme]


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


Versions [RSS],,,,,,
Change log
Dependencies aeson (>=0.8), base (>=4.7 && <5.0), binary (>=0.7), cereal (>=0.4), cereal-vector (>=0.2), containers (>=0.5), deepseq (>=1.3), hashable (>=1.2), primitive (>=0.5), storable-tuple (>=0.0.3), unordered-containers (>=0.2.5), vector (>=0.10), vector-binary-instances (>=0.2), vector-th-unbox (>=0.2) [details]
License BSD-3-Clause
Copyright Christian Hoener zu Siederdissen, 2014 - 2016
Author Christian Hoener zu Siederdissen
Category Data
Home page
Bug tracker
Source repo head: git clone git://
Uploaded by ChristianHoener at 2017-03-03T16:27:50Z
Distributions LTSHaskell:, NixOS:, Stackage:
Reverse Dependencies 7 direct, 21 indirect [details]
Downloads 5858 total (34 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2017-03-03 [all 1 reports]

Readme for bimaps-

[back to package description]

Build Status


Efficient bijections between sets with dense and sparse implementations.


Christian Hoener zu Siederdissen
Leipzig University, Leipzig, Germany