Safe Haskell | None |
---|---|
Language | Haskell2010 |
Documentation
newtype ComposeT s t m a Source #
ComposeT | |
|
Instances
(MFunctor s, MFunctor t) => MFunctor (ComposeT s t :: (k1 -> Type) -> k3 -> Type) Source # | |
(MFunctor s, MonadTrans s, MonadTrans t) => MonadTrans (ComposeT s t) Source # | |
Defined in Control.Monad.Trans.Compose | |
Monad (s (t m)) => Monad (ComposeT s t m) Source # | |
Functor (s (t m)) => Functor (ComposeT s t m) Source # | |
Applicative (s (t m)) => Applicative (ComposeT s t m) Source # | |
Defined in Control.Monad.Trans.Compose pure :: a -> ComposeT s t m a # (<*>) :: ComposeT s t m (a -> b) -> ComposeT s t m a -> ComposeT s t m b # liftA2 :: (a -> b -> c) -> ComposeT s t m a -> ComposeT s t m b -> ComposeT s t m c # (*>) :: ComposeT s t m a -> ComposeT s t m b -> ComposeT s t m b # (<*) :: ComposeT s t m a -> ComposeT s t m b -> ComposeT s t m a # | |
Foldable (s (t m)) => Foldable (ComposeT s t m) Source # | |
Defined in Control.Monad.Trans.Compose fold :: Monoid m0 => ComposeT s t m m0 -> m0 # foldMap :: Monoid m0 => (a -> m0) -> ComposeT s t m a -> m0 # foldr :: (a -> b -> b) -> b -> ComposeT s t m a -> b # foldr' :: (a -> b -> b) -> b -> ComposeT s t m a -> b # foldl :: (b -> a -> b) -> b -> ComposeT s t m a -> b # foldl' :: (b -> a -> b) -> b -> ComposeT s t m a -> b # foldr1 :: (a -> a -> a) -> ComposeT s t m a -> a # foldl1 :: (a -> a -> a) -> ComposeT s t m a -> a # toList :: ComposeT s t m a -> [a] # null :: ComposeT s t m a -> Bool # length :: ComposeT s t m a -> Int # elem :: Eq a => a -> ComposeT s t m a -> Bool # maximum :: Ord a => ComposeT s t m a -> a # minimum :: Ord a => ComposeT s t m a -> a # | |
Traversable (s (t m)) => Traversable (ComposeT s t m) Source # | |
Defined in Control.Monad.Trans.Compose traverse :: Applicative f => (a -> f b) -> ComposeT s t m a -> f (ComposeT s t m b) # sequenceA :: Applicative f => ComposeT s t m (f a) -> f (ComposeT s t m a) # mapM :: Monad m0 => (a -> m0 b) -> ComposeT s t m a -> m0 (ComposeT s t m b) # sequence :: Monad m0 => ComposeT s t m (m0 a) -> m0 (ComposeT s t m a) # | |
Eq1 (s (t m)) => Eq1 (ComposeT s t m) Source # | |
Ord1 (s (t m)) => Ord1 (ComposeT s t m) Source # | |
Defined in Control.Monad.Trans.Compose | |
Read1 (s (t m)) => Read1 (ComposeT s t m) Source # | |
Defined in Control.Monad.Trans.Compose liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (ComposeT s t m a) # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [ComposeT s t m a] # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (ComposeT s t m a) # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [ComposeT s t m a] # | |
Show1 (s (t m)) => Show1 (ComposeT s t m) Source # | |
Alternative (s (t m)) => Alternative (ComposeT s t m) Source # | |
MonadPlus (s (t m)) => MonadPlus (ComposeT s t m) Source # | |
Functor (s (t m)) => Functor (ComposeT s t m) Source # | |
Bounded (s (t m) a) => Bounded (ComposeT s t m a) Source # | |
Eq (s (t m) a) => Eq (ComposeT s t m a) Source # | |
Ord (s (t m) a) => Ord (ComposeT s t m a) Source # | |
Defined in Control.Monad.Trans.Compose compare :: ComposeT s t m a -> ComposeT s t m a -> Ordering # (<) :: ComposeT s t m a -> ComposeT s t m a -> Bool # (<=) :: ComposeT s t m a -> ComposeT s t m a -> Bool # (>) :: ComposeT s t m a -> ComposeT s t m a -> Bool # (>=) :: ComposeT s t m a -> ComposeT s t m a -> Bool # max :: ComposeT s t m a -> ComposeT s t m a -> ComposeT s t m a # min :: ComposeT s t m a -> ComposeT s t m a -> ComposeT s t m a # | |
Read (s (t m) a) => Read (ComposeT s t m a) Source # | |
Show (s (t m) a) => Show (ComposeT s t m a) Source # | |
Semigroup (s (t m) a) => Semigroup (ComposeT s t m a) Source # | |
Monoid (s (t m) a) => Monoid (ComposeT s t m a) Source # | |