Pandora.Pattern.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 laws:
* 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 -> Boolean

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

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

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

Instances

Chain a => Chain (Identity a)

Defined in Pandora.Paradigm.Basis.Identity

Methods

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

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

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

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

(>=) :: Identity a -> Identity a -> Boolean

Chain a => Chain (Maybe a)

Defined in Pandora.Paradigm.Basis.Maybe

Methods

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

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

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

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

(>=) :: Maybe a -> Maybe a -> Boolean

(Chain e, Chain a) => Chain (Conclusion e a)

Defined in Pandora.Paradigm.Basis.Conclusion

Methods

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

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

(<=) :: Conclusion e a -> Conclusion e a -> Boolean

(>) :: Conclusion e a -> Conclusion e a -> Boolean

(>=) :: Conclusion e a -> Conclusion e a -> Boolean