Re^3: Sort directory by file size

[graff]

(1) When you want to post a chunk of code (or data) at the Monastery, start by typing these two lines into the composition box:

<c>

</c>

Then paste your code (or data) into the space between those two tags; you won't need to muck with anything else in order to get the code (or data) to show up correctly when posted. (Don't forget to put your paragraphs of explanation outside the code tags.)

2. Since you want to use file size to determine when to do md5 checksums, I think it would make more sense to build of a hash of arrays keyed by byte count: for each distinct byte count, the hash key is the size and the hash value is an array holding files of that size. Then loop over the hash and do md5s for each set of two or more files with a given size. You don't really need to do any sorting - just keep track of the different sizes. Here's how I would do it (on a unix/linux system):

#!/usr/bin/perl 

use strict;
use warnings;
use Digest::MD5;

die "Usage: $0  dir1  dir2\n"
    unless ( @ARGV == 2 and -d $ARGV[0] and -d $ARGV[1] );

my %fsize;

for my $dir ( @ARGV ) {
    opendir DIR, $dir or die "$dir: $!\n";
    while ( my $fn = readdir DIR ) {
        next unless -f "$dir/$fn";
        push @{$fsize{ -s "$dir/$fn" }}, "$dir/$fn";
    }
}

my %fmd5;
my $digest = Digest::MD5->new;

for my $bc ( keys %fsize ) {
    next if scalar @{$fsize{$bc}} == 1;
    for my $fn ( @{$fsize{$bc}} ) {
        if ( open( my $fh, "<", $fn )) {
            $digest->new;
            $digest->addfile( $fh );
            push @{$fmd5{ $digest->b64digest }}, $fn;
        }
    }
}

for my $md ( keys %fmd5 ) {
    print join( " == ", @{$fmd5{$md}} )."\n" if ( scalar @{$fmd5{$md}}
+ > 1 );
}

(That just lists sets of files that have identical content; you can tweak it do to other things, as you see fit.)

[nnigam1]

Thank you o Wise Ones.
Fantastic suggestions. I am incorporating them.
This is a way I had not thought of. It should definitely improve performance.