CurryInfo: base-3.4.0 / Control.Monad.mapAndUnzipM
definition: 
|
mapAndUnzipM :: (Applicative m) => (a -> m (b,c)) -> [a] -> m ([b], [c]) mapAndUnzipM f xs = unzip <$> sequenceA (map f xs) |
|
demand:
|
argument 1 |
|
deterministic:
|
deterministic operation |
|
documentation:
|
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. |
|
failfree:
|
(_, _, _) |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{(_,_,_) |-> _}
|
|
name:
|
mapAndUnzipM |
|
precedence:
|
no precedence defined |
|
result-values:
|
_ |
|
signature:
|
Prelude.Applicative b => (a -> b (c, d)) -> [a] -> b ([c], [d]) |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
yes |
|
totally-defined:
|
reducible on all ground data terms |