| definition: |
mapFM :: (key -> elt1 -> elt2) -> FM key elt1 -> FM key elt2 mapFM f (FM le fm) = FM le (mapFM' le f fm) |
| demand: |
argument 2 |
| deterministic: |
deterministic operation |
| documentation: |
--- Applies a given function on every element in the map. |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,{FM}) |-> {FM}}
|
| name: |
mapFM |
| precedence: |
no precedence defined |
| result-values: |
{FM}
|
| signature: |
(a -> b -> c) -> FM a b -> FM a c |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |