MIT licensed
Maintained by Sebastian Graf
This version can be pinned in stack with:pomaps-,3160

Module documentation for

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

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