|
definition:
|
plusFM_C :: Eq key => (elt -> elt -> elt)
-> FM key elt -> FM key elt -> FM key elt
plusFM_C combiner (FM le1 fm1) (FM _ fm2) =
FM le1 (plusFM_C' le1 combiner fm1 fm2)
|
|
demand:
|
arguments 3 4
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Efficiently combine key/element mappings of two maps into a single one,
--- cf. addToFM_C
|
|
failfree:
|
(_, _, _, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,{FM},{FM}) |-> {FM}}
|
|
name:
|
plusFM_C
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{FM}
|
|
signature:
|
Prelude.Eq b => (a -> a -> a) -> FM b a -> FM 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
|