Pandora.Pattern.Object.Chain

Documentation

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 Ordering

Defined in Pandora.Paradigm.Primary.Object

Methods

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

(<) :: Ordering -> Ordering -> Boolean

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

(>) :: Ordering -> Ordering -> Boolean

(>=) :: Ordering -> Ordering -> Boolean

Chain Boolean

Defined in Pandora.Paradigm.Primary.Object

Methods

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

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

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

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

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

Chain a => Chain (Identity a)

Defined in Pandora.Paradigm.Primary.Functor.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.Primary.Functor.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 (Validation e a)

Defined in Pandora.Paradigm.Primary.Functor.Validation

Methods

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

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

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

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

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

(Chain a, Chain (t a)) => Chain (Jack t a)

Defined in Pandora.Paradigm.Primary.Transformer.Jack

Methods

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

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

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

(>) :: Jack t a -> Jack t a -> Boolean

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

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

Defined in Pandora.Paradigm.Primary.Functor.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

Chain a => Chain (Tagged tag a)

Defined in Pandora.Paradigm.Primary.Functor.Tagged

Methods

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

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

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

(>) :: Tagged tag a -> Tagged tag a -> Boolean

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

Chain a => Chain (Constant a b)

Defined in Pandora.Paradigm.Primary.Functor.Constant

Methods

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

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

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

(>) :: Constant a b -> Constant a b -> Boolean

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