| definition: |
forM_ :: Monad m => [a] -> (a -> m _) -> m () forM_ = flip mapM_ |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- `forM_` is `mapM_` with its arguments flipped. --- It is useful for writing imperative-style loops: --- --- main = forM_ [1, 2, 3] $ \i -> print i |
| failfree: |
_ |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_) |-> {flip}}
|
| name: |
forM_ |
| precedence: |
no precedence defined |
| result-values: |
{flip}
|
| signature: |
Prelude.Monad b => [a] -> (a -> b c) -> b () |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |