File: intersect.doc

package info (click to toggle)
hol88 2.02.19940316-35
  • links: PTS
  • area: main
  • in suites: buster
  • size: 65,988 kB
  • ctags: 21,623
  • sloc: ml: 199,939; ansic: 9,666; sh: 7,118; makefile: 6,095; lisp: 2,747; yacc: 894; sed: 201; cpp: 87; awk: 5
file content (29 lines) | stat: -rw-r--r-- 441 bytes parent folder | download | duplicates (11) 
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
 
\DOC intersect

\TYPE {intersect : (* list -> * list -> * 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}.

\FAILURE
Never fails.

\EXAMPLE
{
#intersect [1;2;3] [3;5;4;1];;
[1; 3] : int list

#intersect [1;2;4;1] [1;2;3;2];;
[1; 2; 1] : int list
}
\SEEALSO
setify, set_equal, union, subtract.

\ENDDOC