pipes-3.1.0: Compositional pipelines

Safe HaskellSafe
LanguageHaskell98

Control.Proxy.Trans.Maybe

Contents

Description

This module provides the proxy transformer equivalent of MaybeT.

Synopsis

MaybeP

newtype MaybeP p a' a b' b m r Source #

The Maybe proxy transformer

Constructors

MaybeP 

Fields

Instances

ProxyTrans MaybeP Source # 

Methods

liftP :: (Monad m, Proxy p) => p a' a b' b m r -> MaybeP p a' a b' b m r Source #

PFunctor MaybeP Source # 

Methods

hoistP :: (Monad m, Proxy p1) => (forall r1. p1 a' a b' b m r1 -> p2 a' a b' b n r1) -> MaybeP p1 a' a b' b m r2 -> MaybeP p2 a' a b' b n r2 Source #

MonadIOP p => MonadIOP (MaybeP p) Source # 

Methods

liftIO_P :: MonadIO m => IO r -> MaybeP p a' a b' b m r Source #

Proxy p => MonadPlusP (MaybeP p) Source # 

Methods

mzero_P :: Monad m => MaybeP p a' a b' b m r Source #

mplus_P :: Monad m => MaybeP p a' a b' b m r -> MaybeP p a' a b' b m r -> MaybeP p a' a b' b m r Source #

Proxy p => Proxy (MaybeP p) Source # 

Methods

request :: Monad m => a' -> MaybeP p a' a b' b m a Source #

respond :: Monad m => b -> MaybeP p a' a b' b m b' Source #

(>->) :: Monad m => (b' -> MaybeP p a' a b' b m r) -> (c' -> MaybeP p b' b c' c m r) -> c' -> MaybeP p a' a c' c m r Source #

(>~>) :: Monad m => (a -> MaybeP p a' a b' b m r) -> (b -> MaybeP p b' b c' c m r) -> a -> MaybeP p a' a c' c m r Source #

return_P :: Monad m => r -> MaybeP p a' a b' b m r Source #

(?>=) :: Monad m => MaybeP p a' a b' b m r -> (r -> MaybeP p a' a b' b m r') -> MaybeP p a' a b' b m r' Source #

lift_P :: Monad m => m r -> MaybeP p a' a b' b m r Source #

hoist_P :: Monad m => (forall r. m r -> n r) -> MaybeP p a' a b' b m r' -> MaybeP p a' a b' b n r' Source #

Proxy p => MonadTrans (MaybeP p a' a b' b) Source # 

Methods

lift :: Monad m => m a -> MaybeP p a' a b' b m a #

Proxy p => MFunctor (MaybeP p a' a b' b) Source # 

Methods

hoist :: Monad m => (forall c. m c -> n c) -> MaybeP p a' a b' b m b -> MaybeP p a' a b' b n b Source #

(Proxy p, Monad m) => Monad (MaybeP p a' a b' b m) Source # 

Methods

(>>=) :: MaybeP p a' a b' b m a -> (a -> MaybeP p a' a b' b m b) -> MaybeP p a' a b' b m b #

(>>) :: MaybeP p a' a b' b m a -> MaybeP p a' a b' b m b -> MaybeP p a' a b' b m b #

return :: a -> MaybeP p a' a b' b m a #

fail :: String -> MaybeP p a' a b' b m a #

(Proxy p, Monad m) => Functor (MaybeP p a' a b' b m) Source # 

Methods

fmap :: (a -> b) -> MaybeP p a' a b' b m a -> MaybeP p a' a b' b m b #

(<$) :: a -> MaybeP p a' a b' b m b -> MaybeP p a' a b' b m a #

(Proxy p, Monad m) => Applicative (MaybeP p a' a b' b m) Source # 

Methods

pure :: a -> MaybeP p a' a b' b m a #

(<*>) :: MaybeP p a' a b' b m (a -> b) -> MaybeP p a' a b' b m a -> MaybeP p a' a b' b m b #

(*>) :: MaybeP p a' a b' b m a -> MaybeP p a' a b' b m b -> MaybeP p a' a b' b m b #

(<*) :: MaybeP p a' a b' b m a -> MaybeP p a' a b' b m b -> MaybeP p a' a b' b m a #

(MonadIOP p, MonadIO m) => MonadIO (MaybeP p a' a b' b m) Source # 

Methods

liftIO :: IO a -> MaybeP p a' a b' b m a #

(Proxy p, Monad m) => Alternative (MaybeP p a' a b' b m) Source # 

Methods

empty :: MaybeP p a' a b' b m a #

(<|>) :: MaybeP p a' a b' b m a -> MaybeP p a' a b' b m a -> MaybeP p a' a b' b m a #

some :: MaybeP p a' a b' b m a -> MaybeP p a' a b' b m [a] #

many :: MaybeP p a' a b' b m a -> MaybeP p a' a b' b m [a] #

(Proxy p, Monad m) => MonadPlus (MaybeP p a' a b' b m) Source # 

Methods

mzero :: MaybeP p a' a b' b m a #

mplus :: MaybeP p a' a b' b m a -> MaybeP p a' a b' b m a -> MaybeP p a' a b' b m a #

runMaybeK :: (q -> MaybeP p a' a b' b m r) -> q -> p a' a b' b m (Maybe r) Source #

Run a MaybeP 'K'leisli arrow, returning the result or Nothing

Maybe operations

nothing :: (Monad m, Proxy p) => MaybeP p a' a b' b m r Source #

A synonym for mzero

just :: (Monad m, Proxy p) => r -> MaybeP p a' a b' b m r Source #

A synonym for return