Data.Number.PartialOrd

The Prelude's Ord class for dealing with ordered types is often onerous to use because it requires Eq as well as a total ordering. While such total orderings are common, partial orderings are moreso. This module presents a class for partially ordered types.

Documentation

class PartialOrd a where

This class defines a partially ordered type. The method names were chosen so as not to conflict with Ord and Eq. We use Maybe instead of defining new types PartialOrdering and FuzzyBool because this way should make the class easier to use.

Minimum complete definition: cmp

Methods

cmp :: a -> a -> Maybe Ordering

gt :: a -> a -> Maybe Bool

ge :: a -> a -> Maybe Bool

eq :: a -> a -> Maybe Bool

ne :: a -> a -> Maybe Bool

le :: a -> a -> Maybe Bool

lt :: a -> a -> Maybe Bool

Instances

PartialOrd Double

PartialOrd Float

Ord a => PartialOrd a

PartialOrd LogFloat