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!

Flags

Automatic Flags
NameDescriptionDefault
no-lattices

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

Disabled

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

Downloads

Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

Versions [RSS] 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
Change log CHANGELOG.md
Dependencies base (>=4.6.0.0 && <4.13), containers (>=0.5.9.2 && <=0.6.0.1), deepseq (>=1.1 && <1.5), ghc-prim (>=0.4 && <0.6), lattices (>=1.7) [details]
License MIT
Author
Maintainer Sebastian Graf <sgraf1337@gmail.com>
Revised Revision 1 made by HerbertValerioRiedel at 2019-04-27T17:28:39Z
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 2019-04-27T07:04:13Z
Distributions
Reverse Dependencies 1 direct, 1 indirect [details]
Downloads 4780 total (25 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2019-04-27 [all 1 reports]