File: union.doc

package info (click to toggle)
hol88 2.02.19940316dfsg-5
  • links: PTS
  • area: main
  • in suites: bookworm
  • size: 65,816 kB
  • sloc: ml: 199,939; ansic: 9,666; sh: 6,913; makefile: 6,032; lisp: 2,747; yacc: 894; sed: 201; cpp: 87; awk: 5
file content (29 lines) | stat: -rw-r--r-- 454 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 union

\TYPE {union : (* list -> * list -> * list)}

\SYNOPSIS
Computes the union of two `sets'.

\KEYWORDS
list, set.

\DESCRIBE
{union l1 l2} returns a list consisting of {l1} concatenated with those
elements of {l2} which are not in {l1}.

\FAILURE
Never fails.

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

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

\ENDDOC