utility-ht-0.0.5.1: Various small helper functions for Lists, Maybes, Tuples, FunctionsSource codeContentsIndex
Control.Monad.HT
Synopsis
(<=<) :: Monad m => (b -> m c) -> (a -> m b) -> a -> m c
repeat :: Monad m => m a -> m [a]
untilM :: Monad m => (a -> Bool) -> m a -> m a
until :: Monad m => (a -> Bool) -> m a -> m a
iterateLimitM :: Monad m => Int -> (a -> m a) -> a -> m [a]
iterateLimit :: Monad m => Int -> (a -> m a) -> a -> m [a]
andLazy :: Monad m => m Bool -> m Bool -> m Bool
orLazy :: Monad m => m Bool -> m Bool -> m Bool
Documentation
(<=<) :: Monad m => (b -> m c) -> (a -> m b) -> a -> m cSource
Also present in newer versions of the base package.
repeat :: Monad m => m a -> m [a]Source
Monadic List.repeat.
untilM :: Monad m => (a -> Bool) -> m a -> m aSource
repeat action until result fulfills condition
until :: Monad m => (a -> Bool) -> m a -> m aSource
iterateLimitM :: Monad m => Int -> (a -> m a) -> a -> m [a]Source
parameter order equal to that of nest
iterateLimit :: Monad m => Int -> (a -> m a) -> a -> m [a]Source
andLazy :: Monad m => m Bool -> m Bool -> m BoolSource
Lazy monadic conjunction. That is, when the first action returns False, then False is immediately returned, without running the second action.
orLazy :: Monad m => m Bool -> m Bool -> m BoolSource
Lazy monadic disjunction. That is, when the first action returns True, then True is immediately returned, without running the second action.
Produced by Haddock version 2.4.2