| definition: |
foldFM :: (key -> elt -> a -> a) -> a -> FM key elt -> a foldFM k z (FM le fm) = foldFM' le k z fm |
| demand: |
argument 3 |
| deterministic: |
deterministic operation |
| documentation: |
--- Folds finite map by given function. |
| failfree: |
(_, _, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_,{FM}) |-> _}
|
| name: |
foldFM |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
(a -> b -> c -> c) -> c -> FM a b -> c |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |