|
definition:
|
intersectFM_C :: Eq key => (elt -> elt2 -> elt3) -> FM key elt -> FM key elt2
-> FM key elt3
intersectFM_C combiner (FM le1 fm1) (FM _ fm2) =
FM le1 (intersectFM_C' le1 combiner fm1 fm2)
|
|
demand:
|
arguments 3 4
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Filters only those keys that are bound in both of the given maps
--- and combines the elements as in addToFM_C.
|
|
failfree:
|
<FAILING>
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,{FM},{FM}) |-> {FM}}
|
|
name:
|
intersectFM_C
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{FM}
|
|
signature:
|
Prelude.Eq d => (a -> b -> c) -> FM d a -> FM d b -> FM d c
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|