#if __GLASGOW_HASKELL__ >= 702
#endif
#if __GLASGOW_HASKELL__ >= 710
#endif
module Control.Monad.Trans.Reader (
    
    Reader,
    reader,
    runReader,
    mapReader,
    withReader,
    
    ReaderT(..),
    mapReaderT,
    withReaderT,
    
    ask,
    local,
    asks,
    
    liftCallCC,
    liftCatch,
    ) where
import Control.Monad.IO.Class
import Control.Monad.Signatures
import Control.Monad.Trans.Class
#if MIN_VERSION_base(4,12,0)
import Data.Functor.Contravariant
#endif
import Data.Functor.Identity
import Control.Applicative
import Control.Monad
#if MIN_VERSION_base(4,9,0)
import qualified Control.Monad.Fail as Fail
#endif
import Control.Monad.Fix
#if !(MIN_VERSION_base(4,6,0))
import Control.Monad.Instances ()  
#endif
#if MIN_VERSION_base(4,4,0)
import Control.Monad.Zip (MonadZip(mzipWith))
#endif
#if MIN_VERSION_base(4,2,0)
import Data.Functor(Functor(..))
#endif
type Reader r = ReaderT r Identity
reader :: (Monad m) => (r -> a) -> ReaderT r m a
reader f = ReaderT (return . f)
runReader
    :: Reader r a       
    -> r                
    -> a
runReader m = runIdentity . runReaderT m
mapReader :: (a -> b) -> Reader r a -> Reader r b
mapReader f = mapReaderT (Identity . f . runIdentity)
withReader
    :: (r' -> r)        
    -> Reader r a       
    -> Reader r' a
withReader = withReaderT
newtype ReaderT r m a = ReaderT { runReaderT :: r -> m a }
mapReaderT :: (m a -> n b) -> ReaderT r m a -> ReaderT r n b
mapReaderT f m = ReaderT $ f . runReaderT m
withReaderT
    :: (r' -> r)        
    -> ReaderT r m a    
    -> ReaderT r' m a
withReaderT f m = ReaderT $ runReaderT m . f
instance (Functor m) => Functor (ReaderT r m) where
    fmap f  = mapReaderT (fmap f)
    
#if MIN_VERSION_base(4,2,0)
    x <$ v = mapReaderT (x <$) v
    
#endif
instance (Applicative m) => Applicative (ReaderT r m) where
    pure    = liftReaderT . pure
    
    f <*> v = ReaderT $ \ r -> runReaderT f r <*> runReaderT v r
    
#if MIN_VERSION_base(4,2,0)
    u *> v = ReaderT $ \ r -> runReaderT u r *> runReaderT v r
    
    u <* v = ReaderT $ \ r -> runReaderT u r <* runReaderT v r
    
#endif
#if MIN_VERSION_base(4,10,0)
    liftA2 f x y = ReaderT $ \ r -> liftA2 f (runReaderT x r) (runReaderT y r)
    
#endif
instance (Alternative m) => Alternative (ReaderT r m) where
    empty   = liftReaderT empty
    
    m <|> n = ReaderT $ \ r -> runReaderT m r <|> runReaderT n r
    
instance (Monad m) => Monad (ReaderT r m) where
#if !(MIN_VERSION_base(4,8,0))
    return   = lift . return
    
#endif
    m >>= k  = ReaderT $ \ r -> do
        a <- runReaderT m r
        runReaderT (k a) r
    
#if MIN_VERSION_base(4,8,0)
    (>>) = (*>)
#else
    m >> k = ReaderT $ \ r -> runReaderT m r >> runReaderT k r
#endif
    
#if !(MIN_VERSION_base(4,13,0))
    fail msg = lift (fail msg)
    
#endif
#if MIN_VERSION_base(4,9,0)
instance (Fail.MonadFail m) => Fail.MonadFail (ReaderT r m) where
    fail msg = lift (Fail.fail msg)
    
#endif
instance (MonadPlus m) => MonadPlus (ReaderT r m) where
    mzero       = lift mzero
    
    m `mplus` n = ReaderT $ \ r -> runReaderT m r `mplus` runReaderT n r
    
instance (MonadFix m) => MonadFix (ReaderT r m) where
    mfix f = ReaderT $ \ r -> mfix $ \ a -> runReaderT (f a) r
    
instance MonadTrans (ReaderT r) where
    lift   = liftReaderT
    
instance (MonadIO m) => MonadIO (ReaderT r m) where
    liftIO = lift . liftIO
    
#if MIN_VERSION_base(4,4,0)
instance (MonadZip m) => MonadZip (ReaderT r m) where
    mzipWith f (ReaderT m) (ReaderT n) = ReaderT $ \ a ->
        mzipWith f (m a) (n a)
    
#endif
#if MIN_VERSION_base(4,12,0)
instance Contravariant m => Contravariant (ReaderT r m) where
    contramap f = ReaderT . fmap (contramap f) . runReaderT
    
#endif
liftReaderT :: m a -> ReaderT r m a
liftReaderT m = ReaderT (const m)
ask :: (Monad m) => ReaderT r m r
ask = ReaderT return
local
    :: (r -> r)         
    -> ReaderT r m a    
    -> ReaderT r m a
local = withReaderT
asks :: (Monad m)
    => (r -> a)         
    -> ReaderT r m a
asks f = ReaderT (return . f)
liftCallCC :: CallCC m a b -> CallCC (ReaderT r m) a b
liftCallCC callCC f = ReaderT $ \ r ->
    callCC $ \ c ->
    runReaderT (f (ReaderT . const . c)) r
liftCatch :: Catch e m a -> Catch e (ReaderT r m) a
liftCatch f m h =
    ReaderT $ \ r -> f (runReaderT m r) (\ e -> runReaderT (h e) r)