|
definition:
|
mapAccumM :: Monad m => (a -> b -> m (a, c))
-> a -> [b] -> m (a, [c])
mapAccumM _ s [] = return (s, [])
mapAccumM f s (x : xs) = f s x >>= (\(s', x') -> (mapAccumM f s' xs) >>=
(\(s'', xs') -> return (s'', x' : xs')))
|
|
demand:
|
arguments 1 4
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Same as `mapM` but with an additional accumulator threaded through.
|
|
failfree:
|
(_, _, _, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,_,{[]}) |-> _ || (_,_,_,{:}) |-> _}
|
|
name:
|
mapAccumM
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
Prelude.Monad c => (a -> b -> c (a, d)) -> a -> [b] -> c (a, [d])
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
reducible on all ground data terms
|