Control.Monad.TM

Monadic combinators missing from the standard library

Documentation

(.=<<.) :: (Applicative q, Monad m, Traversable m) => (a -> q (m b)) -> m a -> q (m b)

Lifting bind into a monad. Often denoted concatMapM.

(.>>=.) :: (Applicative q, Monad m, Traversable m) => m a -> (a -> q (m b)) -> q (m b)

Lifting bind into a monad. Often denoted concatMapM.

anyM :: Monad m => (a -> m Bool) -> [a] -> m Bool

Existential quantification.

allM :: Monad m => (a -> m Bool) -> [a] -> m Bool

Universal quantification.

findM :: Monad m => (a -> m Bool) -> [a] -> m (Maybe a)

Find an element satisfying a predicate