Pandora.Pattern.Functor.Alternative

Documentation

class Covariant t => Alternative t where

When providing a new instance, you should ensure it satisfies the two laws:
* Associativity of <+>: (x <+> y) <+> z ≡ x <+> (y <+> z)
* Left-distributes <$> over <+>: f <$> (x <+> y) ≡ (f <$> x) <+> (f <$> y)

Minimal complete definition

(<+>)

Methods

(<+>) :: t a -> t a -> t a infixl 3

Infix version of alter

alter :: t a -> t a -> t a

Prefix version of <+>

Instances

Alternative Maybe

Defined in Pandora.Paradigm.Primary.Functor.Maybe

Methods

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

alter :: Maybe a -> Maybe a -> Maybe a

Alternative (Proxy :: Type -> Type)

Defined in Pandora.Paradigm.Primary.Functor.Proxy

Methods

(<+>) :: Proxy a -> Proxy a -> Proxy a

alter :: Proxy a -> Proxy a -> Proxy a

Alternative (Validation e)

Defined in Pandora.Paradigm.Primary.Functor.Validation

Methods

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

alter :: Validation e a -> Validation e a -> Validation e a

Alternative t => Alternative (Yoneda t)

Defined in Pandora.Paradigm.Primary.Transformer.Yoneda

Methods

(<+>) :: Yoneda t a -> Yoneda t a -> Yoneda t a

alter :: Yoneda t a -> Yoneda t a -> Yoneda t a

Alternative t => Alternative (Jack t)

Defined in Pandora.Paradigm.Primary.Transformer.Jack

Methods

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

alter :: Jack t a -> Jack t a -> Jack t a

Alternative t => Alternative (Instruction t)

Defined in Pandora.Paradigm.Primary.Transformer.Instruction

Methods

(<+>) :: Instruction t a -> Instruction t a -> Instruction t a

alter :: Instruction t a -> Instruction t a -> Instruction t a

Alternative (Conclusion e)

Defined in Pandora.Paradigm.Primary.Functor.Conclusion

Methods

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

alter :: Conclusion e a -> Conclusion e a -> Conclusion e a

Alternative (Schematic Monad t u) => Alternative (t :> u)

Defined in Pandora.Paradigm.Controlflow.Effect.Transformer.Monadic

Methods

(<+>) :: (t :> u) a -> (t :> u) a -> (t :> u) a

alter :: (t :> u) a -> (t :> u) a -> (t :> u) a

Alternative (Schematic Comonad t u) => Alternative (t :< u)

Defined in Pandora.Paradigm.Controlflow.Effect.Transformer.Comonadic

Methods

(<+>) :: (t :< u) a -> (t :< u) a -> (t :< u) a

alter :: (t :< u) a -> (t :< u) a -> (t :< u) a

(Applicative t, Covariant t', Alternative u) => Alternative ((t <:<.>:> t') := u)

Defined in Pandora.Paradigm.Schemes.TUT

Methods

(<+>) :: ((t <:<.>:> t') := u) a -> ((t <:<.>:> t') := u) a -> ((t <:<.>:> t') := u) a

alter :: ((t <:<.>:> t') := u) a -> ((t <:<.>:> t') := u) a -> ((t <:<.>:> t') := u) a

(Covariant u, Alternative t) => Alternative (t <:.> u)

Defined in Pandora.Paradigm.Schemes.TU

Methods

(<+>) :: (t <:.> u) a -> (t <:.> u) a -> (t <:.> u) a

alter :: (t <:.> u) a -> (t <:.> u) a -> (t <:.> u) a