1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
|
\DOC intersect
\TYPE {intersect : 'a list -> 'a list -> 'a list}
\SYNOPSIS
Computes the intersection of two `sets'.
\KEYWORDS
list, set.
\DESCRIBE
{intersect l1 l2} returns a list consisting of those elements of {l1} that
also appear in {l2}. If both sets are free of repetitions, this can be
considered a set-theoretic intersection operation.
\FAILURE
Never fails.
\COMMENTS
Duplicate elements in the first list will still be present in the result.
\EXAMPLE
{
# intersect [1;2;3] [3;5;4;1];;
val it : int list = [1; 3]
# intersect [1;2;4;1] [1;2;3;2];;
val it : int list = [1; 2; 1]
}
\SEEALSO
setify, set_equal, union, subtract.
\ENDDOC
|
