pomaps: Maps and sets of partial orders
This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.
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!
Properties
| Versions | 0.0.0.1, 0.0.0.2, 0.0.0.3, 0.0.0.4, 0.0.1.0, 0.0.2.0, 0.0.2.1, 0.1.0.0, 0.2.0.0, 0.2.0.1, 0.2.0.1 |
|---|---|
| Change log | CHANGELOG.md |
| Dependencies | base (>=4.6.0.0 && <4.15), containers (>=0.5.9.2 && <=0.6.4.1), deepseq (>=1.1 && <1.5), ghc-prim (>=0.4 && <0.7), lattices (>=1.7) [details] |
| License | MIT |
| Author | Sebastian Graf <sgraf1337@gmail.com> |
| 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 2021-02-07T20:01:00Z |
Modules
[Index] [Quick Jump]
Downloads
- pomaps-0.2.0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees