{-# LANGUAGE CPP #-}
{-# LANGUAGE QuantifiedConstraints #-}
{-# LANGUAGE UnboxedTuples #-}
{-# LANGUAGE UndecidableInstances #-}
module Control.Monad.Trans.Compose where
import Control.Monad.Base
import Control.Monad.IO.Class
import Control.Monad.Trans.Class
import Control.Monad.Trans.Control
import Control.Monad.Trans.Control.Identity
import Control.Monad.Trans.Elevator
import Data.Kind
#if defined(VERSION_exceptions)
import Control.Monad.Catch qualified as Exceptions
import Control.Monad.Catch.Pure qualified as Exceptions.T
#endif
#if defined(VERSION_mtl)
import Control.Monad.Accum qualified as Mtl
import Control.Monad.Accum.OrphanInstances qualified as Mtl ()
import Control.Monad.Cont.Class qualified as Mtl
import Control.Monad.Error.Class qualified as Mtl
import Control.Monad.Reader.Class qualified as Mtl
import Control.Monad.RWS.Class qualified as Mtl (MonadRWS)
import Control.Monad.Select qualified as Mtl
import Control.Monad.Select.OrphanInstances qualified as Mtl ()
import Control.Monad.State.Class qualified as Mtl
import Control.Monad.Trans.Accum qualified as Mtl.T
import Control.Monad.Trans.Cont qualified as Mtl.T
import Control.Monad.Trans.Except qualified as Mtl.T
import Control.Monad.Trans.RWS.CPS qualified as Mtl.CPST
import Control.Monad.Trans.RWS.Lazy qualified as Mtl.LT
import Control.Monad.Trans.RWS.Strict qualified as Mtl.ST
import Control.Monad.Trans.Reader qualified as Mtl.T
import Control.Monad.Trans.Select qualified as Mtl.T
import Control.Monad.Trans.State.Lazy qualified as Mtl.LT
import Control.Monad.Trans.State.Strict qualified as Mtl.ST
import Control.Monad.Trans.Writer.CPS qualified as Mtl.CPST
import Control.Monad.Trans.Writer.Lazy qualified as Mtl.LT
import Control.Monad.Trans.Writer.Strict qualified as Mtl.ST
import Control.Monad.Writer.Class qualified as Mtl
import Data.Functor.Identity qualified as Mtl
#endif
#if defined(VERSION_primitive)
import Control.Monad.Primitive qualified as Primitive
#endif
#if defined(VERSION_resourcet)
import Control.Monad.Trans.Resource qualified as ResourceT
#endif
#if defined(VERSION_unliftio_core)
import Control.Monad.IO.Unlift qualified as UnliftIO
#endif
type ComposeT :: ((Type -> Type) -> Type -> Type)
-> ((Type -> Type) -> Type -> Type)
-> (Type -> Type)
-> Type
-> Type
newtype ComposeT t1 t2 m a = ComposeT { forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
(m :: * -> *) a.
ComposeT t1 t2 m a -> t1 (t2 m) a
deComposeT :: t1 (t2 m) a }
deriving newtype (forall a. a -> ComposeT t1 t2 m a
forall a b.
ComposeT t1 t2 m a -> ComposeT t1 t2 m b -> ComposeT t1 t2 m a
forall a b.
ComposeT t1 t2 m a -> ComposeT t1 t2 m b -> ComposeT t1 t2 m b
forall a b.
ComposeT t1 t2 m (a -> b)
-> ComposeT t1 t2 m a -> ComposeT t1 t2 m b
forall a b c.
(a -> b -> c)
-> ComposeT t1 t2 m a -> ComposeT t1 t2 m b -> ComposeT t1 t2 m c
forall (f :: * -> *).
Functor f
-> (forall a. a -> f a)
-> (forall a b. f (a -> b) -> f a -> f b)
-> (forall a b c. (a -> b -> c) -> f a -> f b -> f c)
-> (forall a b. f a -> f b -> f b)
-> (forall a b. f a -> f b -> f a)
-> Applicative f
forall {t1 :: (* -> *) -> * -> *} {t2 :: (* -> *) -> * -> *}
{m :: * -> *}.
Applicative (t1 (t2 m)) =>
Functor (ComposeT t1 t2 m)
forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
(m :: * -> *) a.
Applicative (t1 (t2 m)) =>
a -> ComposeT t1 t2 m a
forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
(m :: * -> *) a b.
Applicative (t1 (t2 m)) =>
ComposeT t1 t2 m a -> ComposeT t1 t2 m b -> ComposeT t1 t2 m a
forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
(m :: * -> *) a b.
Applicative (t1 (t2 m)) =>
ComposeT t1 t2 m a -> ComposeT t1 t2 m b -> ComposeT t1 t2 m b
forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
(m :: * -> *) a b.
Applicative (t1 (t2 m)) =>
ComposeT t1 t2 m (a -> b)
-> ComposeT t1 t2 m a -> ComposeT t1 t2 m b
forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
(m :: * -> *) a b c.
Applicative (t1 (t2 m)) =>
(a -> b -> c)
-> ComposeT t1 t2 m a -> ComposeT t1 t2 m b -> ComposeT t1 t2 m c
<* :: forall a b.
ComposeT t1 t2 m a -> ComposeT t1 t2 m b -> ComposeT t1 t2 m a
$c<* :: forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
(m :: * -> *) a b.
Applicative (t1 (t2 m)) =>
ComposeT t1 t2 m a -> ComposeT t1 t2 m b -> ComposeT t1 t2 m a
*> :: forall a b.
ComposeT t1 t2 m a -> ComposeT t1 t2 m b -> ComposeT t1 t2 m b
$c*> :: forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
(m :: * -> *) a b.
Applicative (t1 (t2 m)) =>
ComposeT t1 t2 m a -> ComposeT t1 t2 m b -> ComposeT t1 t2 m b
liftA2 :: forall a b c.
(a -> b -> c)
-> ComposeT t1 t2 m a -> ComposeT t1 t2 m b -> ComposeT t1 t2 m c
$cliftA2 :: forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
(m :: * -> *) a b c.
Applicative (t1 (t2 m)) =>
(a -> b -> c)
-> ComposeT t1 t2 m a -> ComposeT t1 t2 m b -> ComposeT t1 t2 m c
<*> :: forall a b.
ComposeT t1 t2 m (a -> b)
-> ComposeT t1 t2 m a -> ComposeT t1 t2 m b
$c<*> :: forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
(m :: * -> *) a b.
Applicative (t1 (t2 m)) =>
ComposeT t1 t2 m (a -> b)
-> ComposeT t1 t2 m a -> ComposeT t1 t2 m b
pure :: forall a. a -> ComposeT t1 t2 m a
$cpure :: forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
(m :: * -> *) a.
Applicative (t1 (t2 m)) =>
a -> ComposeT t1 t2 m a
Applicative, forall a b. a -> ComposeT t1 t2 m b -> ComposeT t1 t2 m a
forall a b. (a -> b) -> ComposeT t1 t2 m a -> ComposeT t1 t2 m b
forall (f :: * -> *).
(forall a b. (a -> b) -> f a -> f b)
-> (forall a b. a -> f b -> f a) -> Functor f
forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
(m :: * -> *) a b.
Functor (t1 (t2 m)) =>
a -> ComposeT t1 t2 m b -> ComposeT t1 t2 m a
forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
(m :: * -> *) a b.
Functor (t1 (t2 m)) =>
(a -> b) -> ComposeT t1 t2 m a -> ComposeT t1 t2 m b
<$ :: forall a b. a -> ComposeT t1 t2 m b -> ComposeT t1 t2 m a
$c<$ :: forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
(m :: * -> *) a b.
Functor (t1 (t2 m)) =>
a -> ComposeT t1 t2 m b -> ComposeT t1 t2 m a
fmap :: forall a b. (a -> b) -> ComposeT t1 t2 m a -> ComposeT t1 t2 m b
$cfmap :: forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
(m :: * -> *) a b.
Functor (t1 (t2 m)) =>
(a -> b) -> ComposeT t1 t2 m a -> ComposeT t1 t2 m b
Functor, forall a. a -> ComposeT t1 t2 m a
forall a b.
ComposeT t1 t2 m a -> ComposeT t1 t2 m b -> ComposeT t1 t2 m b
forall a b.
ComposeT t1 t2 m a
-> (a -> ComposeT t1 t2 m b) -> ComposeT t1 t2 m b
forall (m :: * -> *).
Applicative m
-> (forall a b. m a -> (a -> m b) -> m b)
-> (forall a b. m a -> m b -> m b)
-> (forall a. a -> m a)
-> Monad m
forall {t1 :: (* -> *) -> * -> *} {t2 :: (* -> *) -> * -> *}
{m :: * -> *}.
Monad (t1 (t2 m)) =>
Applicative (ComposeT t1 t2 m)
forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
(m :: * -> *) a.
Monad (t1 (t2 m)) =>
a -> ComposeT t1 t2 m a
forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
(m :: * -> *) a b.
Monad (t1 (t2 m)) =>
ComposeT t1 t2 m a -> ComposeT t1 t2 m b -> ComposeT t1 t2 m b
forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
(m :: * -> *) a b.
Monad (t1 (t2 m)) =>
ComposeT t1 t2 m a
-> (a -> ComposeT t1 t2 m b) -> ComposeT t1 t2 m b
return :: forall a. a -> ComposeT t1 t2 m a
$creturn :: forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
(m :: * -> *) a.
Monad (t1 (t2 m)) =>
a -> ComposeT t1 t2 m a
>> :: forall a b.
ComposeT t1 t2 m a -> ComposeT t1 t2 m b -> ComposeT t1 t2 m b
$c>> :: forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
(m :: * -> *) a b.
Monad (t1 (t2 m)) =>
ComposeT t1 t2 m a -> ComposeT t1 t2 m b -> ComposeT t1 t2 m b
>>= :: forall a b.
ComposeT t1 t2 m a
-> (a -> ComposeT t1 t2 m b) -> ComposeT t1 t2 m b
$c>>= :: forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
(m :: * -> *) a b.
Monad (t1 (t2 m)) =>
ComposeT t1 t2 m a
-> (a -> ComposeT t1 t2 m b) -> ComposeT t1 t2 m b
Monad)
instance (MonadTrans t1, MonadTrans t2) => MonadTrans (ComposeT t1 t2) where
lift :: forall (m :: * -> *) a. Monad m => m a -> ComposeT t1 t2 m a
lift = forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
(m :: * -> *) a.
t1 (t2 m) a -> ComposeT t1 t2 m a
ComposeT forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (t :: (* -> *) -> * -> *) (m :: * -> *) a.
(MonadTrans t, Monad m) =>
m a -> t m a
lift forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (t :: (* -> *) -> * -> *) (m :: * -> *) a.
(MonadTrans t, Monad m) =>
m a -> t m a
lift
instance (MonadTransControl t1, MonadTransControl t2) => MonadTransControl (ComposeT t1 t2) where
type StT (ComposeT t1 t2) a = StT t2 (StT t1 a)
liftWith :: forall (m :: * -> *) a.
Monad m =>
(Run (ComposeT t1 t2) -> m a) -> ComposeT t1 t2 m a
liftWith Run (ComposeT t1 t2) -> m a
f = forall (m :: * -> *) (n' :: (* -> *) -> * -> *)
(n :: (* -> *) -> * -> *) (t :: (* -> *) -> * -> *) a.
(Monad m, Monad (n' m), MonadTransControl n,
MonadTransControl n') =>
(forall b. n (n' m) b -> t m b)
-> (forall (o :: * -> *) b. t o b -> n (n' o) b)
-> (RunDefault2 t n n' -> m a)
-> t m a
defaultLiftWith2 forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
(m :: * -> *) a.
t1 (t2 m) a -> ComposeT t1 t2 m a
ComposeT forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
(m :: * -> *) a.
ComposeT t1 t2 m a -> t1 (t2 m) a
deComposeT forall a b. (a -> b) -> a -> b
$ \ RunDefault2 (ComposeT t1 t2) t1 t2
x -> Run (ComposeT t1 t2) -> m a
f RunDefault2 (ComposeT t1 t2) t1 t2
x
restoreT :: forall (m :: * -> *) a.
Monad m =>
m (StT (ComposeT t1 t2) a) -> ComposeT t1 t2 m a
restoreT = forall (m :: * -> *) (n' :: (* -> *) -> * -> *)
(n :: (* -> *) -> * -> *) a (t :: (* -> *) -> * -> *).
(Monad m, Monad (n' m), MonadTransControl n,
MonadTransControl n') =>
(n (n' m) a -> t m a) -> m (StT n' (StT n a)) -> t m a
defaultRestoreT2 forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
(m :: * -> *) a.
t1 (t2 m) a -> ComposeT t1 t2 m a
ComposeT
instance (MonadTransControlIdentity t1, MonadTransControlIdentity t2) => MonadTransControlIdentity (ComposeT t1 t2) where
liftWithIdentity :: forall (m :: * -> *) a.
Monad m =>
((forall x. ComposeT t1 t2 m x -> m x) -> m a)
-> ComposeT t1 t2 m a
liftWithIdentity (forall x. ComposeT t1 t2 m x -> m x) -> m a
inner = forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
(m :: * -> *) a.
t1 (t2 m) a -> ComposeT t1 t2 m a
ComposeT forall a b. (a -> b) -> a -> b
$ forall (t :: (* -> *) -> * -> *) (m :: * -> *) a.
(MonadTransControlIdentity t, Monad m) =>
((forall x. t m x -> m x) -> m a) -> t m a
liftWithIdentity forall a b. (a -> b) -> a -> b
$ \ forall x. t1 (t2 m) x -> t2 m x
runId1 ->
forall (t :: (* -> *) -> * -> *) (m :: * -> *) a.
(MonadTransControlIdentity t, Monad m) =>
((forall x. t m x -> m x) -> m a) -> t m a
liftWithIdentity forall a b. (a -> b) -> a -> b
$ \ forall x. t2 m x -> m x
runId2 -> (forall x. ComposeT t1 t2 m x -> m x) -> m a
inner forall a b. (a -> b) -> a -> b
$ forall x. t2 m x -> m x
runId2 forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall x. t1 (t2 m) x -> t2 m x
runId1 forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
(m :: * -> *) a.
ComposeT t1 t2 m a -> t1 (t2 m) a
deComposeT
deriving via Elevator (ComposeT t1 t2) m
instance
( MonadIO m
, MonadTrans (ComposeT t1 t2)
) => MonadIO (ComposeT t1 t2 m)
deriving via Elevator (ComposeT t1 t2) m
instance
( MonadBase b m
, MonadTrans (ComposeT t1 t2)
) => MonadBase b (ComposeT t1 t2 m)
deriving via Elevator (ComposeT t1 t2) m
instance
( MonadBaseControl b m
, MonadTransControl (ComposeT t1 t2)
) => MonadBaseControl b (ComposeT t1 t2 m)
deriving via Elevator (ComposeT t1 t2) m
instance
( MonadBaseControlIdentity b m
, MonadTransControlIdentity (ComposeT t1 t2)
) => MonadBaseControlIdentity b (ComposeT t1 t2 m)
#if defined(VERSION_exceptions)
deriving via Elevator t1 (t2 (m :: Type -> Type))
instance {-# OVERLAPPABLE #-}
( Exceptions.MonadThrow (t2 m)
, MonadTrans t1
) => Exceptions.MonadThrow (ComposeT t1 t2 m)
deriving via Exceptions.T.CatchT (t2 (m :: Type -> Type))
instance
( Monad (t2 m)
) => Exceptions.MonadThrow (ComposeT Exceptions.T.CatchT t2 m)
deriving via Elevator t1 (t2 (m :: Type -> Type))
instance {-# OVERLAPPABLE #-}
( Exceptions.MonadCatch (t2 m)
, MonadTransControl t1
) => Exceptions.MonadCatch (ComposeT t1 t2 m)
deriving via Exceptions.T.CatchT (t2 (m :: Type -> Type))
instance
( Monad (t2 m)
) => Exceptions.MonadCatch (ComposeT Exceptions.T.CatchT t2 m)
#endif
#if defined(VERSION_mtl)
deriving via Elevator t1 (t2 (m :: Type -> Type))
instance {-# OVERLAPPABLE #-}
( Mtl.MonadAccum w (t2 m)
, MonadTrans t1
) => Mtl.MonadAccum w (ComposeT t1 t2 m)
deriving via Mtl.T.AccumT w (t2 (m :: Type -> Type))
instance
( Monoid w
, Monad (t2 m)
) => Mtl.MonadAccum w (ComposeT (Mtl.T.AccumT w) t2 m)
deriving via Elevator t1 (t2 (m :: Type -> Type))
instance {-# OVERLAPPABLE #-}
( Mtl.MonadCont (t2 m)
, MonadTransControl t1
) => Mtl.MonadCont (ComposeT t1 t2 m)
deriving via Mtl.T.ContT r (t2 (m :: Type -> Type))
instance Mtl.MonadCont (ComposeT (Mtl.T.ContT r) t2 m)
deriving via Elevator t1 (t2 (m :: Type -> Type))
instance {-# OVERLAPPABLE #-}
( Mtl.MonadError e (t2 m)
, MonadTransControl t1
) => Mtl.MonadError e (ComposeT t1 t2 m)
deriving via Mtl.T.ExceptT e (t2 (m :: Type -> Type))
instance
( Monad (t2 m)
) => Mtl.MonadError e (ComposeT (Mtl.T.ExceptT e) t2 m)
deriving via Elevator t1 (t2 (m :: Type -> Type))
instance {-# OVERLAPPABLE #-}
( Mtl.MonadReader r (t2 m)
, MonadTransControl t1
) => Mtl.MonadReader r (ComposeT t1 t2 m)
deriving via Mtl.T.ReaderT r (t2 (m :: Type -> Type))
instance
( Monad (t2 m)
) => Mtl.MonadReader r (ComposeT (Mtl.T.ReaderT r) t2 m)
deriving via Mtl.CPST.RWST r w s (t2 (m :: Type -> Type))
instance
( Monoid w
, Monad (t2 m)
) => Mtl.MonadReader r (ComposeT (Mtl.CPST.RWST r w s) t2 m)
deriving via Mtl.LT.RWST r w s (t2 (m :: Type -> Type))
instance
( Monoid w
, Monad (t2 m)
) => Mtl.MonadReader r (ComposeT (Mtl.LT.RWST r w s) t2 m)
deriving via Mtl.ST.RWST r w s (t2 (m :: Type -> Type))
instance
( Monoid w
, Monad (t2 m)
) => Mtl.MonadReader r (ComposeT (Mtl.ST.RWST r w s) t2 m)
deriving via Elevator t1 (t2 (m :: Type -> Type))
instance {-# OVERLAPPABLE #-}
( Mtl.MonadRWS r w s (t2 m)
, MonadTransControl t1
) => Mtl.MonadRWS r w s (ComposeT t1 t2 m)
deriving via Mtl.CPST.RWST r w s (t2 (m :: Type -> Type))
instance
( Monoid w
, Monad (t2 m)
) => Mtl.MonadRWS r w s (ComposeT (Mtl.CPST.RWST r w s) t2 m)
deriving via Mtl.LT.RWST r w s (t2 (m :: Type -> Type))
instance
( Monoid w
, Monad (t2 m)
) => Mtl.MonadRWS r w s (ComposeT (Mtl.LT.RWST r w s) t2 m)
deriving via Mtl.ST.RWST r w s (t2 (m :: Type -> Type))
instance
( Monoid w
, Monad (t2 m)
) => Mtl.MonadRWS r w s (ComposeT (Mtl.ST.RWST r w s) t2 m)
deriving via Elevator t1 (t2 (m :: Type -> Type))
instance {-# OVERLAPPABLE #-}
( Mtl.MonadSelect r (t2 m)
, MonadTrans t1
) => Mtl.MonadSelect r (ComposeT t1 t2 m)
deriving via Mtl.T.SelectT r (t2 (m :: Type -> Type))
instance
( MonadBaseControlIdentity Mtl.Identity (t2 m)
) => Mtl.MonadSelect r (ComposeT (Mtl.T.SelectT r) t2 m)
deriving via Elevator t1 (t2 (m :: Type -> Type))
instance {-# OVERLAPPABLE #-}
( Mtl.MonadState s (t2 m)
, MonadTrans t1
) => Mtl.MonadState s (ComposeT t1 t2 m)
deriving via Mtl.LT.StateT s (t2 (m :: Type -> Type))
instance
( Monad (t2 m)
) => Mtl.MonadState s (ComposeT (Mtl.LT.StateT s) t2 m)
deriving via Mtl.ST.StateT s (t2 (m :: Type -> Type))
instance
( Monad (t2 m)
) => Mtl.MonadState s (ComposeT (Mtl.ST.StateT s) t2 m)
deriving via Mtl.CPST.RWST r w s (t2 (m :: Type -> Type))
instance
( Monoid w
, Monad (t2 m)
) => Mtl.MonadState s (ComposeT (Mtl.CPST.RWST r w s) t2 m)
deriving via Mtl.LT.RWST r w s (t2 (m :: Type -> Type))
instance
( Monoid w
, Monad (t2 m)
) => Mtl.MonadState s (ComposeT (Mtl.LT.RWST r w s) t2 m)
deriving via Mtl.ST.RWST r w s (t2 (m :: Type -> Type))
instance
( Monoid w
, Monad (t2 m)
) => Mtl.MonadState s (ComposeT (Mtl.ST.RWST r w s) t2 m)
deriving via Elevator t1 (t2 (m :: Type -> Type))
instance {-# OVERLAPPABLE #-}
( Mtl.MonadWriter w (t2 m)
, MonadTransControl t1
) => Mtl.MonadWriter w (ComposeT t1 t2 m)
deriving via Mtl.CPST.WriterT w (t2 (m :: Type -> Type))
instance
( Monoid w
, Monad (t2 m)
) => Mtl.MonadWriter w (ComposeT (Mtl.CPST.WriterT w) t2 m)
deriving via Mtl.LT.WriterT w (t2 (m :: Type -> Type))
instance
( Monoid w
, Monad (t2 m)
) => Mtl.MonadWriter w (ComposeT (Mtl.LT.WriterT w) t2 m)
deriving via Mtl.ST.WriterT w (t2 (m :: Type -> Type))
instance
( Monoid w
, Monad (t2 m)
) => Mtl.MonadWriter w (ComposeT (Mtl.ST.WriterT w) t2 m)
deriving via Mtl.CPST.RWST r w s (t2 (m :: Type -> Type))
instance
( Monoid w
, Monad (t2 m)
) => Mtl.MonadWriter w (ComposeT (Mtl.CPST.RWST r w s) t2 m)
deriving via Mtl.LT.RWST r w s (t2 (m :: Type -> Type))
instance
( Monoid w
, Monad (t2 m)
) => Mtl.MonadWriter w (ComposeT (Mtl.LT.RWST r w s) t2 m)
deriving via Mtl.ST.RWST r w s (t2 (m :: Type -> Type))
instance
( Monoid w
, Monad (t2 m)
) => Mtl.MonadWriter w (ComposeT (Mtl.ST.RWST r w s) t2 m)
#endif
#if defined(VERSION_primitive)
deriving via Elevator (ComposeT t1 t2) m
instance
( Primitive.PrimMonad m
, MonadTrans (ComposeT t1 t2)
) =>
Primitive.PrimMonad (ComposeT t1 t2 m)
#endif
#if defined(VERSION_resourcet)
deriving via Elevator t1 (t2 (m :: Type -> Type))
instance {-# OVERLAPPABLE #-}
( ResourceT.MonadResource (t2 m)
, MonadTrans t1
, MonadIO m
, MonadTrans t2
) => ResourceT.MonadResource (ComposeT t1 t2 m)
deriving via ResourceT.ResourceT (t2 (m :: Type -> Type))
instance
( MonadIO (t2 m)
, MonadIO m
, MonadTrans t2
) => ResourceT.MonadResource (ComposeT ResourceT.ResourceT t2 m)
#endif
#if defined(VERSION_unliftio_core)
deriving via Elevator (ComposeT t1 t2) m
instance
( UnliftIO.MonadUnliftIO m
, MonadTransControlIdentity (ComposeT t1 t2)
) =>
UnliftIO.MonadUnliftIO (ComposeT t1 t2 m)
#endif
runComposeT :: (forall a. t1 (t2 m) a -> t2 m (StT t1 a))
-> (forall a. t2 m a -> m (StT t2 a))
-> (forall a. ComposeT t1 t2 m a -> m (StT t2 (StT t1 a)))
runComposeT :: forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
(m :: * -> *).
(forall a. t1 (t2 m) a -> t2 m (StT t1 a))
-> (forall a. t2 m a -> m (StT t2 a))
-> forall a. ComposeT t1 t2 m a -> m (StT t2 (StT t1 a))
runComposeT forall a. t1 (t2 m) a -> t2 m (StT t1 a)
runT1 forall a. t2 m a -> m (StT t2 a)
runT2 = forall a. t2 m a -> m (StT t2 a)
runT2 forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a. t1 (t2 m) a -> t2 m (StT t1 a)
runT1 forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
(m :: * -> *) a.
ComposeT t1 t2 m a -> t1 (t2 m) a
deComposeT
runComposeT' :: (t1 (t2 m) a -> t2 m a)
-> (t2 m a -> m a)
-> (ComposeT t1 t2 m a -> m a)
runComposeT' :: forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
(m :: * -> *) a.
(t1 (t2 m) a -> t2 m a)
-> (t2 m a -> m a) -> ComposeT t1 t2 m a -> m a
runComposeT' t1 (t2 m) a -> t2 m a
runT1 t2 m a -> m a
runT2 = t2 m a -> m a
runT2 forall b c a. (b -> c) -> (a -> b) -> a -> c
. t1 (t2 m) a -> t2 m a
runT1 forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (t1 :: (* -> *) -> * -> *) (t2 :: (* -> *) -> * -> *)
(m :: * -> *) a.
ComposeT t1 t2 m a -> t1 (t2 m) a
deComposeT