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.

[maintain]

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

Versions0.0.0.1, 0.0.0.2, 0.0.0.3, 0.0.0.4, 0.0.1.0, 0.0.1.0, 0.0.2.0
Change logCHANGELOG.md
Dependenciesbase (>=4.6.0.0 && <4.12), containers (>=0.5.9.2 && <=0.6.0.1), deepseq (>=1.1 && <1.5), ghc-prim (>=0.4 && <0.6), lattices (>=1.7 && <2) [details]
LicenseMIT
MaintainerSebastian Graf <sgraf1337@gmail.com>
CategoryData Structures
Home pagehttps://github.com/sgraf812/pomaps#readme
Bug trackerhttps://github.com/sgraf812/pomaps/issues
Source repositoryhead: git clone https://github.com/sgraf812/pomaps
UploadedSat Jun 23 20:28:53 UTC 2018 by sgraf812

Modules

[Index]

Flags

NameDescriptionDefaultType
no-lattices

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

DisabledAutomatic

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

Downloads

Maintainers' corner

For package maintainers and hackage trustees