File: uniq.doc

package info (click to toggle)
hol-light 20170109-1
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 36,568 kB
  • ctags: 8,549
  • sloc: ml: 540,018; cpp: 439; lisp: 286; java: 279; makefile: 262; sh: 229; yacc: 108; perl: 78; ansic: 57; sed: 39
file content (27 lines) | stat: -rw-r--r-- 445 bytes parent folder | download | duplicates (6) 
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
 
\DOC uniq

\TYPE {uniq : 'a list -> 'a list}

\SYNOPSIS
Eliminate adjacent identical elements from a list.

\DESCRIBE
When applied to a list, {uniq} gives a new list that results from coalescing
adjacent (only) elements of the list into one.

\FAILURE
Never fails.

\EXAMPLE
{
  # uniq [1;2;3;1;2;3];;
  val it : int list = [1; 2; 3; 1; 2; 3]

  # uniq [1;1;1;2;3;3;3;3;4];;
  val it : int list = [1; 2; 3; 4]
}

\SEEALSO
setify, sort.

\ENDDOC