Control.Monad.Trans.Compose

Documentation

newtype ComposeT s t m a

Constructors

ComposeT

Fields

• getComposeT :: s (t m) a

Instances

(MFunctor k1 k2 s, MFunctor k2 k t) => MFunctor k1 k (ComposeT (k -> *) k1 (k2 -> *) s t)

Methods

mmap :: (forall a. m a -> n a) -> t m a -> t n a

(MFunctor * * s, MonadTrans s, MonadTrans t) => MonadTrans (ComposeT (* -> *) * (* -> *) s t)

Methods

lift :: Monad m => m a -> ComposeT (* -> *) * (* -> *) s t m a

Monad (s (t m)) => Monad (ComposeT k1 * k s t m)

Methods

(>>=) :: ComposeT k1 * k s t m a -> (a -> ComposeT k1 * k s t m b) -> ComposeT k1 * k s t m b

(>>) :: ComposeT k1 * k s t m a -> ComposeT k1 * k s t m b -> ComposeT k1 * k s t m b

return :: a -> ComposeT k1 * k s t m a

fail :: String -> ComposeT k1 * k s t m a

Functor (s (t m)) => Functor (ComposeT k1 * k s t m)

Methods

fmap :: (a -> b) -> ComposeT k1 * k s t m a -> ComposeT k1 * k s t m b

(<$) :: a -> ComposeT k1 * k s t m b -> ComposeT k1 * k s t m a

Applicative (s (t m)) => Applicative (ComposeT k1 * k s t m)

Methods

pure :: a -> ComposeT k1 * k s t m a

(<*>) :: ComposeT k1 * k s t m (a -> b) -> ComposeT k1 * k s t m a -> ComposeT k1 * k s t m b

(*>) :: ComposeT k1 * k s t m a -> ComposeT k1 * k s t m b -> ComposeT k1 * k s t m b

(<*) :: ComposeT k1 * k s t m a -> ComposeT k1 * k s t m b -> ComposeT k1 * k s t m a

Foldable (s (t m)) => Foldable (ComposeT k1 * k s t m)

Methods

fold :: Monoid m => ComposeT k1 * k s t m m -> m

foldMap :: Monoid m => (a -> m) -> ComposeT k1 * k s t m a -> m

foldr :: (a -> b -> b) -> b -> ComposeT k1 * k s t m a -> b

foldr' :: (a -> b -> b) -> b -> ComposeT k1 * k s t m a -> b

foldl :: (b -> a -> b) -> b -> ComposeT k1 * k s t m a -> b

foldl' :: (b -> a -> b) -> b -> ComposeT k1 * k s t m a -> b

foldr1 :: (a -> a -> a) -> ComposeT k1 * k s t m a -> a

foldl1 :: (a -> a -> a) -> ComposeT k1 * k s t m a -> a

toList :: ComposeT k1 * k s t m a -> [a]

null :: ComposeT k1 * k s t m a -> Bool

length :: ComposeT k1 * k s t m a -> Int

elem :: Eq a => a -> ComposeT k1 * k s t m a -> Bool

maximum :: Ord a => ComposeT k1 * k s t m a -> a

minimum :: Ord a => ComposeT k1 * k s t m a -> a

sum :: Num a => ComposeT k1 * k s t m a -> a

product :: Num a => ComposeT k1 * k s t m a -> a

Traversable (s (t m)) => Traversable (ComposeT k1 * k s t m)

Methods

traverse :: Applicative f => (a -> f b) -> ComposeT k1 * k s t m a -> f (ComposeT k1 * k s t m b)

sequenceA :: Applicative f => ComposeT k1 * k s t m (f a) -> f (ComposeT k1 * k s t m a)

mapM :: Monad m => (a -> m b) -> ComposeT k1 * k s t m a -> m (ComposeT k1 * k s t m b)

sequence :: Monad m => ComposeT k1 * k s t m (m a) -> m (ComposeT k1 * k s t m a)

Eq1 (s (t m)) => Eq1 (ComposeT k1 * k s t m)

Methods

liftEq :: (a -> b -> Bool) -> ComposeT k1 * k s t m a -> ComposeT k1 * k s t m b -> Bool

Ord1 (s (t m)) => Ord1 (ComposeT k1 * k s t m)

Methods

liftCompare :: (a -> b -> Ordering) -> ComposeT k1 * k s t m a -> ComposeT k1 * k s t m b -> Ordering

Read1 (s (t m)) => Read1 (ComposeT k1 * k s t m)

Methods

liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (ComposeT k1 * k s t m a)

liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [ComposeT k1 * k s t m a]

Show1 (s (t m)) => Show1 (ComposeT k1 * k s t m)

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> ComposeT k1 * k s t m a -> ShowS

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [ComposeT k1 * k s t m a] -> ShowS

Alternative (s (t m)) => Alternative (ComposeT k1 * k s t m)

Methods

empty :: ComposeT k1 * k s t m a

(<|>) :: ComposeT k1 * k s t m a -> ComposeT k1 * k s t m a -> ComposeT k1 * k s t m a

some :: ComposeT k1 * k s t m a -> ComposeT k1 * k s t m [a]

many :: ComposeT k1 * k s t m a -> ComposeT k1 * k s t m [a]

MonadPlus (s (t m)) => MonadPlus (ComposeT k1 * k s t m)

Methods

mzero :: ComposeT k1 * k s t m a

mplus :: ComposeT k1 * k s t m a -> ComposeT k1 * k s t m a -> ComposeT k1 * k s t m a

Functor (s (t m)) => Functor (ComposeT k1 * k s t m)

Methods

gmap :: (a -> b) -> ComposeT k1 * k s t m b -> ComposeT k1 * k s t m a

(>$) :: b -> ComposeT k1 * k s t m b -> ComposeT k1 * k s t m a

Bounded (s (t m) a) => Bounded (ComposeT k2 k1 k s t m a)

Methods

minBound :: ComposeT k2 k1 k s t m a

maxBound :: ComposeT k2 k1 k s t m a

Eq (s (t m) a) => Eq (ComposeT k2 k1 k s t m a)

Methods

(==) :: ComposeT k2 k1 k s t m a -> ComposeT k2 k1 k s t m a -> Bool

(/=) :: ComposeT k2 k1 k s t m a -> ComposeT k2 k1 k s t m a -> Bool

Ord (s (t m) a) => Ord (ComposeT k2 k1 k s t m a)

Methods

compare :: ComposeT k2 k1 k s t m a -> ComposeT k2 k1 k s t m a -> Ordering

(<) :: ComposeT k2 k1 k s t m a -> ComposeT k2 k1 k s t m a -> Bool

(<=) :: ComposeT k2 k1 k s t m a -> ComposeT k2 k1 k s t m a -> Bool

(>) :: ComposeT k2 k1 k s t m a -> ComposeT k2 k1 k s t m a -> Bool

(>=) :: ComposeT k2 k1 k s t m a -> ComposeT k2 k1 k s t m a -> Bool

max :: ComposeT k2 k1 k s t m a -> ComposeT k2 k1 k s t m a -> ComposeT k2 k1 k s t m a

min :: ComposeT k2 k1 k s t m a -> ComposeT k2 k1 k s t m a -> ComposeT k2 k1 k s t m a

Read (s (t m) a) => Read (ComposeT k2 k1 k s t m a)

Methods

readsPrec :: Int -> ReadS (ComposeT k2 k1 k s t m a)

readList :: ReadS [ComposeT k2 k1 k s t m a]

readPrec :: ReadPrec (ComposeT k2 k1 k s t m a)

readListPrec :: ReadPrec [ComposeT k2 k1 k s t m a]

Show (s (t m) a) => Show (ComposeT k2 k1 k s t m a)

Methods

showsPrec :: Int -> ComposeT k2 k1 k s t m a -> ShowS

show :: ComposeT k2 k1 k s t m a -> String

showList :: [ComposeT k2 k1 k s t m a] -> ShowS

Semigroup (s (t m) a) => Semigroup (ComposeT k2 k1 k s t m a)

Methods

(<>) :: ComposeT k2 k1 k s t m a -> ComposeT k2 k1 k s t m a -> ComposeT k2 k1 k s t m a

sconcat :: NonEmpty (ComposeT k2 k1 k s t m a) -> ComposeT k2 k1 k s t m a

stimes :: Integral b => b -> ComposeT k2 k1 k s t m a -> ComposeT k2 k1 k s t m a

Monoid (s (t m) a) => Monoid (ComposeT k2 k1 k s t m a)

Methods

mempty :: ComposeT k2 k1 k s t m a

mappend :: ComposeT k2 k1 k s t m a -> ComposeT k2 k1 k s t m a -> ComposeT k2 k1 k s t m a

mconcat :: [ComposeT k2 k1 k s t m a] -> ComposeT k2 k1 k s t m a