pipes-3.0.0: Compositional pipelines

Safe HaskellSafe
LanguageHaskell98

Control.Proxy.Trans.Reader

Contents

Description

This module provides the proxy transformer equivalent of ReaderT.

Synopsis

ReaderP

newtype ReaderP i p a' a b' b m r Source #

The Reader proxy transformer

Constructors

ReaderP 

Fields

Instances

ProxyTrans (ReaderP i) Source # 

Methods

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

PFunctor (ReaderP i) Source # 

Methods

hoistP :: (Monad m, Proxy p) => (forall a' a b' b r1. p a' a b' b m r1 -> q a' a b' b m r1) -> ReaderP i p a' a b' b m r2 -> ReaderP i q a' a b' b m r2 Source #

MonadIOP p => MonadIOP (ReaderP i p) Source # 

Methods

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

MonadPlusP p => MonadPlusP (ReaderP i p) Source # 

Methods

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

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

Interact p => Interact (ReaderP i p) Source # 

Methods

(\>\) :: Monad m => (b' -> ReaderP i p a' a x' x m b) -> (c' -> ReaderP i p b' b x' x m c) -> c' -> ReaderP i p a' a x' x m c Source #

(/>/) :: Monad m => (a -> ReaderP i p x' x b' b m a') -> (b -> ReaderP i p x' x c' c m b') -> a -> ReaderP i p x' x c' c m a' Source #

Proxy p => Proxy (ReaderP i p) Source # 

Methods

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

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

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

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

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

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

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

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

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

Methods

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

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

Methods

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

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

Methods

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

(>>) :: ReaderP i p a' a b' b m a -> ReaderP i p a' a b' b m b -> ReaderP i p a' a b' b m b #

return :: a -> ReaderP i p a' a b' b m a #

fail :: String -> ReaderP i p a' a b' b m a #

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

Methods

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

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

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

Methods

pure :: a -> ReaderP i p a' a b' b m a #

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

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

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

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

Methods

liftIO :: IO a -> ReaderP i p a' a b' b m a #

(MonadPlusP p, Monad m) => Alternative (ReaderP i p a' a b' b m) Source # 

Methods

empty :: ReaderP i p a' a b' b m a #

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

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

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

(MonadPlusP p, Monad m) => MonadPlus (ReaderP i p a' a b' b m) Source # 

Methods

mzero :: ReaderP i p a' a b' b m a #

mplus :: ReaderP i p a' a b' b m a -> ReaderP i p a' a b' b m a -> ReaderP i p a' a b' b m a #

runReaderP :: i -> ReaderP i p a' a b' b m r -> p a' a b' b m r Source #

Run a ReaderP computation, supplying the environment

runReaderK :: i -> (q -> ReaderP i p a' a b' b m r) -> q -> p a' a b' b m r Source #

Run a ReaderP 'K'leisli arrow, supplying the environment

withReaderP :: (j -> i) -> ReaderP i p a' a b' b m r -> ReaderP j p a' a b' b m r Source #

Modify a computation's environment (a more general version of local)

Reader operations

ask :: (Proxy p, Monad m) => ReaderP i p a' a b' b m i Source #

Get the environment

local :: (i -> i) -> ReaderP i p a' a b' b m r -> ReaderP i p a' a b' b m r Source #

Modify a computation's environment (a specialization of withReaderP)

asks :: (Proxy p, Monad m) => (i -> r) -> ReaderP i p a' a b' b m r Source #

Get a function of the environment