| definition: |
intersectionWith :: Ord k => (a -> b -> c)
-> Map k a -> Map k b -> Map k c
intersectionWith _ _ Tip = Tip
intersectionWith _ Tip (Bin _ _ _ _ _) = Tip
intersectionWith combiner m1@(Bin _ _ _ _ _) (Bin split_key2 a2 _ left2 right2)
| isJust maybe_a1 -- split_a *is* in intersection
= mkVBalBranch split_key2 (combiner a1' a2)
(intersectionWith combiner lts left2)
(intersectionWith combiner gts right2)
| otherwise -- split_a is *not* in intersection
= glueVBal (intersectionWith combiner lts left2)
(intersectionWith combiner gts right2)
where
lts = splitLT m1 split_key2 -- NB gt and lt, so the equal ones
gts = splitGT m1 split_key2 -- are not in either.
maybe_a1 = lookup split_key2 m1
Just a1' = maybe_a1
|
| demand: |
argument 4 |
| deterministic: |
deterministic operation |
| documentation: |
--- Filters only those keys that are bound in both of the given maps --- and combines the elements as in insertWith. |
| failfree: |
<FAILING> |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_,_,{Tip}) |-> {Tip} || (_,_,{Tip},{Bin}) |-> {Tip} || (_,_,{Bin},{Bin}) |-> _}
|
| name: |
intersectionWith |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
Prelude.Ord d => (a -> b -> c) -> Map d a -> Map d b -> Map d c |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |