morphisms-objects-0.1.3: Algebraic structures
Control.Object.Chain
data Ordering Source #
Constructors
order :: a -> a -> a -> Ordering -> a Source #
class Setoid a => Chain a where Source #
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 Source #
(>=) :: a -> a -> Ordering Source #
(<) :: a -> a -> Boolean Source #
(>) :: a -> a -> Boolean Source #