|mapM f is equivalent to sequence . map f.
|mapAndUnzipM :: Monad m => (a -> m (b, c)) -> [a] -> m ([b], [c])||Source|
|The mapAndUnzipM function maps its first argument over a list, returning
the result as a pair of lists. This function is mainly used with complicated
data structures or a state-transforming monad.
|foldlM :: Monad m => (a -> b -> m a) -> a -> [b] -> m a||Source|
|Monadic version of foldl
|foldrM :: Monad m => (b -> a -> m a) -> a -> [b] -> m a||Source|
|Monadic version of foldr
|Do it flag is true
A functor with application.
Instances should satisfy the following laws:
pure id <*> v = v
pure (.) <*> u <*> v <*> w = u <*> (v <*> w)
pure f <*> pure x = pure (f x)
u <*> pure y = pure ($ y) <*> u
- ignore left value
u *> v = pure (const id) <*> u <*> v
- ignore right value
u <* v = pure const <*> u <*> v
The Functor instance should satisfy
fmap f x = pure f <*> x
If f is also a Monad, define pure = return and (<*>) = ap.
Minimal complete definition: pure and <*>.
|Lift a value.
|(<*>) :: f (a -> b) -> f a -> f b||Source|
|(*>) :: f a -> f b -> f b||Source|
|Sequence actions, discarding the value of the first argument.
|(<*) :: f a -> f b -> f a||Source|
|Sequence actions, discarding the value of the second argument.
|An infix synonym for fmap.
|A value of type UniqSupply is unique, and it can
supply one distinct Unique. Also, from the supply, one can
also manufacture an arbitrary number of further UniqueSupply values,
which will be distinct from the first and from all others.
|Produced by Haddock version 2.6.0|