partialord

Data structure supporting partial orders

BSD-3-Clause licensed by James Cranch

Maintained by [email protected]

This version can be pinned in stack with:partialord-0.1.1@sha256:35d8586e19722e35028c3a47089878ecf8f19fccd407c902783dcdf18937c031,1780

Depends on 2 packages(full list with versions):

Used by 1 package in lts-24.0(full list with versions):

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.

All notable changes to this project will be documented in this file.

The format is based on Keep a Changelog, and this project adheres to the Haskell Package Versioning Policy.