|
|
1.1 root 1: .TH UNIQ 1 "10 February 1983"
2: .SH NAME
3: uniq \- report repeated lines in a file
4: .SH SYNOPSIS
5: .B uniq
6: [
7: .B \-udc
8: [
9: .BR + n
10: ] [
11: .BR \- n
12: ]
13: ] [ input [ output ] ]
14: .SH DESCRIPTION
15: .I Uniq
16: reads the input file comparing adjacent lines.
17: In the normal case, the second and succeeding copies of repeated lines are
18: removed; the remainder is written on the output file.
19: Note that repeated lines must be adjacent in order to be found; see
20: .IR sort (1).
21: If the
22: .B \-u
23: flag is used, just the lines that are not repeated
24: in the original file are output. The
25: .B \-d
26: option specifies that one copy of just the repeated lines is to be written.
27: The normal mode output is the union of the
28: .B \-u
29: and
30: .B \-d
31: mode outputs.
32: .PP
33: The
34: .B \-c
35: option supersedes
36: .B \-u
37: and
38: .B \-d
39: and generates an output report in default style
40: but with each line preceded by a count of the number of times it occurred.
41: .PP
42: The
43: .I n
44: arguments specify skipping an initial portion of each line in the comparison:
45: .TP 8
46: .BI \- n
47: The first
48: .IR n
49: fields together with any blanks before each are ignored.
50: A field is defined as a string of non-space, non-tab characters
51: separated by tabs and spaces from its neighbors.
52: .TP 8
53: .BI + n
54: The first
55: .IR n
56: characters are ignored. Fields are skipped before characters.
57: .PP
58: .SH "SEE ALSO"
59: sort(1), comm(1)
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.