Safe Haskell	None
Language	Haskell2010

Data.Bifunctor.Disjunction

Contents

Synopsis

class Disj d where
- inl :: Functor f => f a -> f (a `d` b)
- inr :: Functor f => f b -> f (a `d` b)
- (<!!>) :: Representable k => k a -> k b -> k (a `d` b)
inlK :: (Contravariant k, Disj d) => k (a `d` b) -> k a
inrK :: (Contravariant k, Disj d) => k (a `d` b) -> k b
deMorganDisj :: (Representable k, Disj d) => (k a, k b) -> k (a `d` b)

Disjunctions

class Disj d where Source #

Methods

inl :: Functor f => f a -> f (a `d` b) Source #

inr :: Functor f => f b -> f (a `d` b) Source #

(<!!>) :: Representable k => k a -> k b -> k (a `d` b) infixr 3 Source #

Instances details

Disj Either Source #
Instance details Defined in Data.Bifunctor.Disjunction Methods inl :: Functor f => f a -> f (Either a b) Source # inr :: Functor f => f b -> f (Either a b) Source # (<!!>) :: Representable k => k a -> k b -> k (Either a b) Source #

inlK :: (Contravariant k, Disj d) => k (a `d` b) -> k a Source #

inrK :: (Contravariant k, Disj d) => k (a `d` b) -> k b Source #

deMorganDisj :: (Representable k, Disj d) => (k a, k b) -> k (a `d` b) Source #