pomaps

Maps and sets of partial orders

https://github.com/sgraf812/pomaps#readme

Version on this page:	0.0.1.0
LTS Haskell 11.22:	0.0.1.0
Stackage Nightly 2018-03-12:	0.0.0.3
Latest on Hackage:	0.2.0.1

See all snapshots pomaps appears in

MIT licensed

Maintained by Sebastian Graf

This version can be pinned in stack with:pomaps-0.0.1.0@sha256:b834a391ece134e7fbbe23a531fc27eea05fa907602e3aafc747c8c1287dacd5,3160

Module documentation for 0.0.1.0

Data
- Data.POMap
- Data.POSet
  - Data.POSet.Internal

Depends on 5 packages(full list with versions):

base, containers, deepseq, ghc-prim, lattices

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!

Changes

Change log

pomaps follows the PVP. The change log is available on GitHub.