1 .\" Copyright (c) 1991, 1993
2 .\" The Regents of the University of California. All rights reserved.
4 .\" This code is derived from software contributed to Berkeley by
5 .\" the Institute of Electrical and Electronics Engineers, Inc.
7 .\" Redistribution and use in source and binary forms, with or without
8 .\" modification, are permitted provided that the following conditions
10 .\" 1. Redistributions of source code must retain the above copyright
11 .\" notice, this list of conditions and the following disclaimer.
12 .\" 2. Redistributions in binary form must reproduce the above copyright
13 .\" notice, this list of conditions and the following disclaimer in the
14 .\" documentation and/or other materials provided with the distribution.
15 .\" 3. All advertising materials mentioning features or use of this software
16 .\" must display the following acknowledgement:
17 .\" This product includes software developed by the University of
18 .\" California, Berkeley and its contributors.
19 .\" 4. Neither the name of the University nor the names of its contributors
20 .\" may be used to endorse or promote products derived from this software
21 .\" without specific prior written permission.
23 .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 .\" From: @(#)uniq.1 8.1 (Berkeley) 6/6/93
43 .Nd report or filter out repeated lines in a file
46 .Op Fl c | Fl d | Fl u
57 utility reads the specified
59 comparing adjacent lines, and writes a copy of each unique input line to
66 or absent, the standard input is read.
69 is absent, standard output is used for output.
70 The second and succeeding copies of identical adjacent input lines are
72 Repeated lines in the input will not be detected if they are not adjacent,
73 so it may be necessary to sort the files first.
75 The following options are available:
78 Precede each output line with the count of the number of times the line
79 occurred in the input, followed by a single space.
81 Only output lines that are repeated in the input.
85 fields in each input line when doing comparisons.
86 A field is a string of non-blank characters separated from adjacent fields
88 Field numbers are one based, i.e., the first field is field one.
92 characters in each input line when doing comparisons.
93 If specified in conjunction with the
97 characters after the first
99 fields will be ignored.
100 Character numbers are one based, i.e., the first character is character one.
102 Only output lines that are not repeated in the input.
104 Case insensitive comparison of lines.
106 .\"(Deprecated; replaced by
108 .\"Ignore the first n
109 .\"fields on each input line when doing comparisons,
110 .\"where n is a number.
111 .\"A field is a string of non-blank
112 .\"characters separated from adjacent fields
114 .\".It Cm \&\(pl Ns Ar n
115 .\"(Deprecated; replaced by
119 .\"characters when doing comparisons, where
131 environment variables affect the execution of
139 .Cm \&\(pl Ns Ar number
142 options have been deprecated but are still supported in this implementation.
150 as amended by Cor.\& 1-2002.
157 Input lines are limited to
159 (2048) bytes in length.