Hackage :: [Package]

partialord: Data structure supporting partial orders

[ bsd3, data-structures, library ] [ Propose Tags ] [ Report a vulnerability ]

Please see README.md

[Skip to Readme]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

Versions [RSS] 0.0.0, 0.0.1, 0.0.2, 0.0.3, 0.1.0, 0.1.1
Change log CHANGELOG.md
Dependencies base (>=4.7 && <5), containers (>=0.6 && <0.9) [details]
License BSD-3-Clause
Copyright 2023 James Cranch
Author James Cranch
Maintainer j.d.cranch@sheffield.ac.uk
Category Data structures
Home page https://github.com/jcranch/partialord#readme
Bug tracker https://github.com/jcranch/partialord/issues
Source repo head: git clone https://github.com/jcranch/partialord
Uploaded by jcranch at 2025-05-08T13:21:33Z
Distributions LTSHaskell:0.0.2, NixOS:0.0.2, Stackage:0.1.1
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 233 total (16 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2025-05-08 [all 1 reports]

Readme for partialord-0.1.0

[back to package description]

partialord

A data structure supporting partial orders, and some helpful associated routines.

Other packages

An alternative package is already available, namely partial-order. Differences include:

  • PartialOrd has a comparison valued in Maybe Ordering; we use a fresh type with four constructors.
  • Where types have several natural partial orderings, we provide newtypes rather than choosing one.
  • We pay slightly more attention to algorithmic complexity.