Moduleutility-ht-0.0.17.2Haskell98

Control.Monad.HT

Synopsis

value <=<
value repeat
value nest
value untilM
value until
value iterateLimitM
value iterateLimit
value iterate
value andLazy
value orLazy
value void
value for
value map
value zipWith
value chain
value filter
value replicate
value lift
value lift2
value lift3
value lift4
value lift5
value liftJoin2
value liftJoin3
value liftJoin4
value liftJoin5

Packageutility-ht-0.0.17.2
Exports26
LanguageHaskell98
LicenceBSD-3-Clause
SourceHT.hs

value(<=<) :: Monad m => (b -> m c) -> (a -> m b) -> a -> m c

Source#

Also present in newer versions of the base package.

valuerepeat :: Monad m => m a -> m [a]

Source#

Monadic repeat.

valuenest :: Monad m => Int -> (a -> m a) -> a -> m a

valueuntilM :: Monad m => (a -> Bool) -> m a -> m a

Source#

Deprecated. use M.until

repeat action until result fulfills condition

valueuntil :: Monad m => (a -> Bool) -> m a -> m a

Source#

repeat action until result fulfills condition

valueiterateLimitM :: Monad m => Int -> (a -> m a) -> a -> m [a]

Source#

Deprecated. use M.iterateLimit

parameter order equal to that of nest

valueiterateLimit :: Monad m => Int -> (a -> m a) -> a -> m [a]

Source#

parameter order equal to that of nest

valueiterate :: Monad m => (a -> m a) -> a -> m [a]

Source#

I think this makes only sense in a lazy monad like Trans.State.Lazy or IO.Lazy.

valueandLazy :: Monad m => m Bool -> m Bool -> m Bool

Source#

Lazy monadic conjunction. That is, when the first action returns False, then False is immediately returned, without running the second action.

valueorLazy :: Monad m => m Bool -> m Bool -> m Bool

Source#

Lazy monadic disjunction. That is, when the first action returns True, then True is immediately returned, without running the second action.

valuevoid :: Monad m => m a -> m ()

valuefor :: Monad m => [a] -> (a -> m b) -> m [b]

valuemap :: Monad m => (a -> m b) -> [a] -> m [b]

valuezipWith :: Monad m => (a -> b -> m c) -> [a] -> [b] -> m [c]

valuechain :: Monad m => [a -> m a] -> a -> m a

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

valuereplicate :: Monad m => Int -> m a -> m [a]

valuelift :: Monad m => (a -> r) -> m a -> m r

valuelift2 :: Monad m => (a -> b -> r) -> m a -> m b -> m r

valuelift3 :: Monad m => (a -> b -> c -> r) -> m a -> m b -> m c -> m r

valuelift4

:: Monad m
=> a -> b -> c -> d -> r
-> m a
-> m b
-> m c
-> m d
-> m r

valuelift5

:: Monad m
=> a -> b -> c -> d -> e -> r
-> m a
-> m b
-> m c
-> m d
-> m e
-> m r

valueliftJoin2 :: Monad m => (a -> b -> m c) -> m a -> m b -> m c

valueliftJoin3 :: Monad m => (a -> b -> c -> m d) -> m a -> m b -> m c -> m d

valueliftJoin4

:: Monad m
=> a -> b -> c -> d -> m e
-> m a
-> m b
-> m c
-> m d
-> m e

valueliftJoin5

:: Monad m
=> a -> b -> c -> d -> e -> m f
-> m a
-> m b
-> m c
-> m d
-> m e
-> m f