|
definition:
|
addToFM_C :: Eq key => (elt -> elt -> elt) -> FM key elt -> key -> elt
-> FM key elt
addToFM_C combiner (FM le fm) key elt =
FM le (addToFM_C' le combiner fm key elt)
|
|
demand:
|
argument 3
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Instead of throwing away the old binding,
--- addToFM_C combines the new element with the old one.
--- @param combiner a function combining to elements
--- @param fm a finite map
--- @param key the key of the elements to be combined
--- @param elt the new element
--- @result a modified finite map
|
|
failfree:
|
(_, _, _, _, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,{FM},_,_) |-> {FM}}
|
|
name:
|
addToFM_C
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{FM}
|
|
signature:
|
Prelude.Eq b => (a -> a -> a) -> FM b a -> b -> a -> FM b a
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|