Control.Object.Chain

Documentation

data Ordering

Constructors

Less

Equal

Greater

order :: a -> a -> a -> Ordering -> a

class Setoid a => Chain a where

When providing a new instance, you should ensure it satisfies the three law:
* Reflexivity: x <= x ≡ True
* Transitivity: x <= y && y <= z ≡ True ===> x <= z ≡ True
* Antisymmetry: x <= y && y <= x ≡ True ===> x == y ≡ True

Minimal complete definition

(<=)

Methods

(<=) :: a -> a -> Ordering

(>=) :: a -> a -> Ordering

(<) :: a -> a -> Boolean

(>) :: a -> a -> Boolean