definition: |
intersectBy :: (a -> a -> Bool) -> [a] -> [a] -> [a] intersectBy _ [] _ = [] intersectBy _ (_:_) [] = [] intersectBy eq xs@(_:_) ys@(_:_) = [x | x <- xs, any (eq x) ys] |
demand: |
argument 2 |
deterministic: |
deterministic operation |
documentation: |
--- Computes the intersection of two lists --- according to the given equivalence relation |
failfree: |
(_, _, _) |
indeterministic: |
referentially transparent operation |
infix: |
no fixity defined |
iotype: |
{(_,{[]},_) |-> {[]} || (_,{:},{[]}) |-> {[]} || (_,{:},{:}) |-> _} |
name: |
intersectBy |
precedence: |
no precedence defined |
result-values: |
_ |
signature: |
(a -> a -> Prelude.Bool) -> [a] -> [a] -> [a] |
solution-complete: |
operation might suspend on free variables |
terminating: |
yes |
totally-defined: |
reducible on all ground data terms |