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
|
\DOC setify
\TYPE {setify : 'a list -> 'a list}
\SYNOPSIS
Removes repeated elements from a list. Makes a list into a `set'.
\DESCRIBE
{setify l} removes repeated elements from {l}, leaving the last occurrence of
each duplicate in the list.
\FAILURE
Never fails.
\EXAMPLE
{
# setify [1;2;3;1;4;3];;
val it : int list = [1; 2; 3; 4]
}
\COMMENTS
The current implementation will in fact return a sorted list according to the
basic OCaml polymorphic ordering.
\SEEALSO
uniq.
\ENDDOC
|
