Control.Monad.Reader (original) (raw)
MonadAccum w m => MonadAccum w (ReaderT r m) Source #
Since: 2.3
Instance details
Defined in Control.Monad.Accum
Methods
look :: ReaderT r m w Source #
add :: w -> ReaderT r m () Source #
accum :: (w -> (a, w)) -> ReaderT r m a Source #
MonadError e m => MonadError e (ReaderT r m) Source #
Instance details
Defined in Control.Monad.Error.Class
Methods
throwError :: e -> ReaderT r m a Source #
catchError :: ReaderT r m a -> (e -> ReaderT r m a) -> ReaderT r m a Source #
Monad m => MonadReader r (ReaderT r m) Source #
Instance details
Defined in Control.Monad.Reader.Class
Methods
local :: (r -> r) -> ReaderT r m a -> ReaderT r m a Source #
reader :: (r -> a) -> ReaderT r m a Source #
MonadSelect r' m => MonadSelect r' (ReaderT r m) Source #
Provides a read-only environment of type r
to the 'strategy' function. However, the 'ranking' function (or more accurately, representation) has no access to r
. Put another way, you can influence what values get chosen by changing r
, but not how solutions are ranked.
Since: 2.3
Instance details
Defined in Control.Monad.Select
Methods
select :: ((a -> r') -> a) -> ReaderT r m a Source #
MonadState s m => MonadState s (ReaderT r m) Source #
Instance details
Defined in Control.Monad.State.Class
Methods
put :: s -> ReaderT r m () Source #
state :: (s -> (a, s)) -> ReaderT r m a Source #
MonadWriter w m => MonadWriter w (ReaderT r m) Source #
Instance details
Defined in Control.Monad.Writer.Class
Methods
writer :: (a, w) -> ReaderT r m a Source #
tell :: w -> ReaderT r m () Source #
listen :: ReaderT r m a -> ReaderT r m (a, w) Source #
pass :: ReaderT r m (a, w -> w) -> ReaderT r m a Source #
MonadTrans (ReaderT r)
Instance details
Defined in Control.Monad.Trans.Reader
Methods
lift :: Monad m => m a -> ReaderT r m a #
MonadFail m => MonadFail (ReaderT r m)
Instance details
Defined in Control.Monad.Trans.Reader
Methods
fail :: String -> ReaderT r m a #
MonadFix m => MonadFix (ReaderT r m)
Instance details
Defined in Control.Monad.Trans.Reader
Methods
mfix :: (a -> ReaderT r m a) -> ReaderT r m a #
MonadIO m => MonadIO (ReaderT r m)
Instance details
Defined in Control.Monad.Trans.Reader
Methods
liftIO :: IO a -> ReaderT r m a #
MonadZip m => MonadZip (ReaderT r m)
Instance details
Defined in Control.Monad.Trans.Reader
Methods
mzip :: ReaderT r m a -> ReaderT r m b -> ReaderT r m (a, b) #
mzipWith :: (a -> b -> c) -> ReaderT r m a -> ReaderT r m b -> ReaderT r m c #
munzip :: ReaderT r m (a, b) -> (ReaderT r m a, ReaderT r m b) #
Contravariant m => Contravariant (ReaderT r m)
Instance details
Defined in Control.Monad.Trans.Reader
Methods
contramap :: (a' -> a) -> ReaderT r m a -> ReaderT r m a' #
(>$) :: b -> ReaderT r m b -> ReaderT r m a #
Alternative m => Alternative (ReaderT r m)
Instance details
Defined in Control.Monad.Trans.Reader
Methods
(<|>) :: ReaderT r m a -> ReaderT r m a -> ReaderT r m a #
some :: ReaderT r m a -> ReaderT r m [a] #
many :: ReaderT r m a -> ReaderT r m [a] #
Applicative m => Applicative (ReaderT r m)
Instance details
Defined in Control.Monad.Trans.Reader
Methods
(<*>) :: ReaderT r m (a -> b) -> ReaderT r m a -> ReaderT r m b #
liftA2 :: (a -> b -> c) -> ReaderT r m a -> ReaderT r m b -> ReaderT r m c #
(*>) :: ReaderT r m a -> ReaderT r m b -> ReaderT r m b #
(<*) :: ReaderT r m a -> ReaderT r m b -> ReaderT r m a #
Functor m => Functor (ReaderT r m)
Instance details
Defined in Control.Monad.Trans.Reader
Methods
fmap :: (a -> b) -> ReaderT r m a -> ReaderT r m b #
(<$) :: a -> ReaderT r m b -> ReaderT r m a #
Monad m => Monad (ReaderT r m)
Instance details
Defined in Control.Monad.Trans.Reader
Methods
(>>=) :: ReaderT r m a -> (a -> ReaderT r m b) -> ReaderT r m b #
(>>) :: ReaderT r m a -> ReaderT r m b -> ReaderT r m b #
return :: a -> ReaderT r m a #
MonadPlus m => MonadPlus (ReaderT r m)
Instance details
Defined in Control.Monad.Trans.Reader
Methods
mplus :: ReaderT r m a -> ReaderT r m a -> ReaderT r m a #
MonadCont m => MonadCont (ReaderT r m) Source #
Instance details
Defined in Control.Monad.Cont.Class
Methods
callCC :: ((a -> ReaderT r m b) -> ReaderT r m a) -> ReaderT r m a Source #