swish-0.9.0.13: A semantic web toolkit.

Portability H98 experimental Douglas Burke Safe-Inferred

Data.Ord.Partial

Description

This module provides methods to support operations on partially ordered collections. The partial ordering relationship is represented by `Maybe` `Ordering`.

Thanks to members of the haskell-cafe mailing list - Robert (rvollmert-lists@gmx.net) and Tom Pledger (Tom.Pledger@peace.com) - who suggested key ideas on which some of the code in this module is based.

Synopsis

# Documentation

type PartCompare a = a -> a -> Maybe OrderingSource

Partial comparison function.

# Finding the range of a part-ordered list

minima :: PartCompare a -> [a] -> [a]Source

This function finds the minima in a list of partially ordered values, preserving the sequence of retained values from the supplied list.

It returns all those values in the supplied list for which there is no smaller element in the list.

maxima :: PartCompare a -> [a] -> [a]Source

This function finds the maxima in a list of partially ordered values, preserving the sequence of retained values from the supplied list.

It returns all those values in the supplied list for which there is no larger element in the list.

# Comparing part-ordered containers

Partial ordering for Eq values

partComparePair :: PartCompare a -> PartCompare b -> (a, b) -> (a, b) -> Maybe OrderingSource

Part-ordering comparison on pairs of values, where each has a part-ordering relationship

partCompareListMaybe :: Eq a => [Maybe a] -> [Maybe a] -> Maybe OrderingSource

Part-ordering comparison on lists of Maybe values.

partCompareListSubset :: Eq a => [a] -> [a] -> Maybe OrderingSource

Part-ordering comparison on lists based on subset relationship