If have a little perl scipt handy which does roughly what you desire. It takes two file names as argument and compares them. The files doal NOT have to be sorted. The first file will be stored in memory as keys to an accosiative array, the values being the line numbers. This obviously does NOT handle duplicate lines (SMOP to make it do that :-), and it might run into memory problems with large (many MB) input files. 10,000 lines should be fine. 1,000,000 probably not.
Try it?
Hein
---- compare_file_lines.pl ----------
#
# Open first file and remember all lines with their line numbers in array f1
#
$name = shift @ARGV or die "Must provide first filename";
open FILE, "<$name" or die "Could not read file $name";
while () {
chomp;
next if /^$/; # skip blanks
next if /^\s+#/; # skip comments
$f1{$_}=$.;
}
close FILE; # reset line number
#
# open and loop through second file.
# delete each corresponding element from the array
# Report if missing (could be duplicate in second file)
#
$name = shift @ARGV or die "Must provide second filename";
open FILE, "<$name" or die "Could not read file $name";
while () {
chomp;
next if /^$/; # skip blanks
next if /^\s+#/; # skip comments
next if delete $f1{$_};
print "2:$. not in 1:$_\n";
}
#
# All lines remaining in array must not have been in second file
#
foreach (sort {$f1{$a} <=> $f1{$b}} keys %f1) {
print "1:$f1{$_} not in 2:$_\n";
}
-------------------------
# perl compare_file_lines.pl left right
Hein.
