#!/pro/bin/perl use strict; use warnings; sub usage { my $err = shift and select STDERR; print "usage: csvdiff [--no-color] [--html] file.csv file.csv\n", " provides colorized diff on sorted CSV files\n", " assuming first line is header and first field is the key\n"; exit $err; } # usage use Getopt::Long qw(:config bundling nopermute ); my $opt_c = 1; my $opt_h = 0; my $opt_o = ""; GetOptions ( "help|?" => sub { usage (0); }, "c|color|colour!" => \$opt_c, "h|html" => \$opt_h, "o|output=s" => \$opt_o, ) or usage (1); @ARGV == 2 or usage (1); if ($opt_o) { open STDOUT, ">", $opt_o or die "$opt_o: $!\n"; } use HTML::Entities; use Term::ANSIColor qw(:constants); use Text::CSV_XS; my $csv = Text::CSV_XS->new ({ binary => 1, auto_diag => 0 }); if ($opt_h) { binmode STDOUT, ":encoding(utf-8)"; print < CFI School updates

CSV diff @ARGV

EOH $::{RED} = sub { "\cA\rr"; }; $::{GREEN} = sub { "\cA\rg"; }; $::{RESET} = sub { ""; }; } elsif (!$opt_c) { $::{$_} = sub { "" } for qw( RED GREEN RESET ); } my @f; my $opt_n = 1; foreach my $x (0, 1) { open my $fh, "<", $ARGV[$x] or die "$ARGV[$x]: $!\n"; my $n = 0; while (1) { my $row = $csv->getline ($fh) or last; @$row and push @{$f[$x]}, $row; $n++ && $row->[0] =~ m/\D/ and $opt_n = 0; } } my @n = map { $#{$f[$_]} } 0, 1; my @i = (1, 1); my $hdr = "# csvdiff < $ARGV[0] > $ARGV[1]\n"; $f[$_][1+$n[$_]][0] = $opt_n ? 2147483647 : "\xff\xff\xff\xff" for 0, 1; my %cls; %cls = ( "b" => 0, "-" => sub { "rd" }, "+" => sub { "gr" }, "H" => sub { "hd" }, "<" => sub { $cls{b} ^= 1; "b$cls{b}" }, ">" => sub { "b$cls{b}" }, ); sub show { my ($pfx, $x) = @_; my $row = $f[$x][$i[$x]++]; if ($opt_h) { my $bg = $cls{$pfx}->(); print qq{ }, (map{"$_"}@$row), "\n"; return; } print $hdr, $pfx, " ", $pfx eq "-" ? RED : $pfx eq "+" ? GREEN : ""; $csv->print (*STDOUT, $row); print RESET, "\n"; $hdr = ""; } # show # Skip first line of both are same: it probably is a header my @h0 = @{$f[0][0]}; my @h1 = @{$f[1][0]}; if ("@h0" eq "@h1") { if ($opt_h) { $i[0]--; show ("H", 0); } shift @{$f[0]}; shift @{$f[1]}; } my $x = 0; while ($i[0] <= $n[0] || $i[1] <= $n[1]) { my @r0 = @{$f[0][$i[0]]}; my @r1 = @{$f[1][$i[1]]}; if ($opt_n) { $r0[0] < $r1[0] and show ("-", 0), next; $r0[0] > $r1[0] and show ("+", 1), next; } else { $r0[0] lt $r1[0] and show ("-", 0), next; $r0[0] gt $r1[0] and show ("+", 1), next; } "@r0" eq "@r1" and $i[0]++, $i[1]++, next; foreach my $c (1 .. $#h0) { my ($L, $R) = map { $_ // "" } $r0[$c], $r1[$c]; $L eq $R and next; $f[0][$i[0]][$c] = RED . $L . RESET; $f[1][$i[1]][$c] = GREEN . $R . RESET; } show ("<", 0); show (">", 1); } $opt_h and print "

\n\n\n"; close STDOUT;