=begin metadata

Name: uniq
Description: report or filter out repeated lines in a file
Author: Jonathan Feinberg, jdf@pobox.com
License: perl

=end metadata


# uniq - report or filter out repeated lines in a file

use strict;

my $VERSION = '1.0';

  close STDOUT || die "$0: can't close stdout: $!\n";
  $? = 1 if $? == 255;  # from die

sub help {
  print "$0 [-c | -d | -u] [-f fields] [-s chars] [input files]\n";
  exit 0;

sub version { print "$0 (Perl Power Tools) $VERSION\n"; exit 0; }

# options
my ($optc, $optd, $optf, $opts, $optu);

sub get_numeric_arg {
  # $_ contains current arg
  my ($argname, $desc, $opt) = @_;
  if    (length) { $opt = $_ }
  elsif (@ARGV)  { $opt = shift @ARGV }
  else           {die "$0: option requires an argument -- $argname\n"}
  $opt =~ /\D/ && die "$0: invalid number of $desc: `$opt'\n";

while (@ARGV && $ARGV[0] =~ /^[-+]/) {
  local $_ = shift;
  /^-[h?]$/    && help();        # terminates
  /^-v$/       && version();     # terminates
  /^-c$/       && ($optc++, next);
  /^-d$/       && ($optd++, next);
  /^-u$/       && ($optu++, next);
  /^-(\d+)$/   && (($optf = $1), next);
  /^\+(\d+)$/  && (($opts = $1), next);
  s/^-f//      && (($optf = get_numeric_arg('f', 'fields to skip')), next);
  s/^-s//      && (($opts = get_numeric_arg('s', 'bytes to skip')), next);

  die "$0: invalid option -- $_\n";

my ($comp, $save_comp, $line, $save_line, $count, $eof);

# prime the pump
$comp = $line = <>;
exit 0 unless defined $line;
if ($optf) {($comp) = (split ' ', $comp, $optf+1)[$optf] }
if ($opts) { $comp  =  substr($comp, $opts) }

while (!$eof) {
  $save_line = $line;
  $save_comp = $comp;
  $count = 1;
  while (!($eof = eof())) {
    $comp = $line = <>;
    if ($optf) {($comp) = (split ' ', $comp, $optf+1)[$optf] }
    if ($opts) { $comp  =  substr($comp, $opts) }
    last DUPS if $comp ne $save_comp;
  # when we get here, $save_line is the first occurrence of a sequence
  # of duplicate lines, $count is the number of times it appears
  if    ($optc) { printf "%7d $save_line", $count }
  elsif ($optd) { print $save_line if $count >  1 }
  elsif ($optu) { print $save_line if $count == 1 }
  else          { print $save_line }

exit 0;


=head1 NAME

uniq - report or filter out repeated lines in a file


uniq [B<-c> | B<-d> | B<-u>] [B<-f> I<fields>] [B<-s> I<chars>] [I<input files>]


The uniq utility reads the standard input comparing adjacent lines and
writes a copy of each unique input line to the standard output.  The sec-
ond and succeeding copies of identical adjacent input lines are not writ-
ten.  Repeated lines in the input will not be detected if they are not
adjacent, so it may be necessary to sort the files first.

The following options are available:


=item c

Precede each output line with the count of the number of times the
line occurred in the input, followed by a single space.

= item d

Don't output lines that are not repeated in the input.

=item f I<fields>

Ignore the first fields in each input line when doing compar-
isons.  A field is a string of non-blank characters separated
from adjacent fields by blanks.  Field numbers are one based,
i.e. the first field is field one.

=item s I<chars>

Ignore the first chars characters in each input line when doing
comparisons.  If specified in conjunction with the B<-f> option, the
first chars characters after the first fields fields will be ig-
nored.  Character numbers are one based, i.e. the first character is
character one.

=item u

Don't output lines that are repeated in the input.


If additional arguments are specified on the command line, they are
used as the names of input files.

The uniq utility exits 0 on success or >0 if an error occurred.


The historic B<->I<number> and B<+>I<number> options are supported as
synonyms for B<-f> I<fields> and B<-s> I<chars>, respectively.

This version accepts 0 as a valid argument for the B<-f> and
B<-s> switches; some implementations of uniq do not.

=head1 SEE ALSO


=head1 BUGS

I<uniq> has no known bugs.

=head1 AUTHOR

The Perl implementation of I<uniq> was written by Jonathan Feinberg,


This program is copyright (c) Jonathan Feinberg 1999.

This program is free and open software. You may use, modify, distribute,
and sell this program (and any modified variants) in any way you wish,
provided you do not restrict others from doing the same.