Hets - the Heterogeneous Tool Set

Copyright(c) Keith Wansbrough 200 and Uni Bremen 2005
LicenseGPLv2 or higher, see LICENSE.txt
MaintainerChristian.Maeder@dfki.de
Stabilityprovisional
Portabilityportable
Safe HaskellSafe-Inferred

Common.Partial

Description

Support for partial orders

Synopsis

Documentation

type POrder a = a -> a -> Maybe Ordering

the partial order relation type

totalOrder :: Ord a => POrder a

equivBy :: POrder a -> [a] -> [[a]]

split a list of elements into equivalence classes

minimalBy :: POrder a -> [a] -> ([a], [a])

split a set into the minimal elements and the remaining elements

rankBy :: POrder a -> [a] -> [[a]]

split a set into ranks of elements, minimal first

class Partial a where

A partial-ordering class.

Minimal complete definition

Nothing

Methods

pCmp :: POrder a

(<=?) :: a -> a -> Bool

equiv :: Partial a => [a] -> [[a]]

minimal :: Partial a => [a] -> ([a], [a])

rank :: Partial a => [a] -> [[a]]