pomaps: Maps and sets of partial orders

[ data-structures, library, mit ] [ Propose Tags ]

Maps (and sets) indexed by keys satisfying PartialOrd.

The goal is to provide asymptotically better data structures than simple association lists or lookup tables. Asymptotics depend on the partial order used as keys, its width w specifically (the size of the biggest anti-chain).

For partial orders of great width, this package won't provide any benefit over using association lists, so benchmark for your use-case!

Change log CHANGELOG.md
Dependencies base (>= && <4.12), containers (>= && <=, deepseq (>=1.1 && <1.5), ghc-prim (>=0.4 && <0.6), lattices (>=1.7 && <2) [details]
License MIT
Maintainer Sebastian Graf <sgraf1337@gmail.com>
Category Data Structures
Home page https://github.com/sgraf812/pomaps#readme
Bug tracker https://github.com/sgraf812/pomaps/issues
Source repo head: git clone https://github.com/sgraf812/pomaps
Uploaded by sgraf812 at Sat Jun 23 20:38:07 UTC 2018
Distributions NixOS:
Downloads 433 total (67 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI





Don't depend on the lattices package and extract the PartialOrd class.


Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info


Maintainer's Corner

For package maintainers and hackage trustees