match package:selective

Eliminate all specified values a from f (Either a b) by replacing each of them with a given f a.

matchS :: (Eq a, Selective f) => Cases a -> f a -> (a -> f b) -> f (Either a b)

selective Control.Selective

Eliminate all specified values a from f (Either a b) by replacing each of them with a given f a.

matchA :: (Applicative f, t ~ One x) => f (Sigma t) -> (forall x . t x -> f (x -> a)) -> f a

selective Control.Selective.Multi

Every Applicative is also an ApplicativeS.

matchCases :: Functor f => Sigma t -> (t ~> Case f a) -> f a

selective Control.Selective.Multi

Generalised pattern matching on a Sigma type using a Pi type to describe how to handle each case.

matchM :: Monad f => f (Sigma t) -> (forall x . t x -> f (x -> a)) -> f a

selective Control.Selective.Multi

Every monad is a multi-way selective functor.

matchOne :: (ApplicativeS f, t ~ One x) => f (Sigma t) -> (forall x . t x -> f (x -> a)) -> f a

selective Control.Selective.Multi

matchPure :: Sigma t -> (forall x . t x -> x -> a) -> a

selective Control.Selective.Multi

Generalised pattern matching on a Sigma type using a Pi type to describe how to handle each case. This is a specialisation of matchCases for f = Identity. We could also have also given it the following type:

matchPure :: Sigma t -> (t ~> Case Identity a) -> a

We chose to simplify it by inlining ~>, Case and Identity.

matchUnconstrained :: MonadS f => f (Sigma t) -> (forall x . t x -> f (x -> a)) -> f a

selective Control.Selective.Multi