dupemerge: sort incumbent inodes too

[dupemerge] / faster-dupemerge

diff --git a/faster-dupemerge b/faster-dupemerge
index d35f591a442a9c7bb6c52ea160bed284825089b0..8df7885878b2085bb2cfc8b61e05566c239225b0 100755 (executable)
--- a/faster-dupemerge
+++ b/faster-dupemerge
@@ -4,7 +4,7 @@ use Fcntl qw(:DEFAULT :flock);
 use File::Compare;
 use File::Temp;
 
-# Copyright (C) 2003-2009 Zygo Blaxell <faster-dupemerge@mailtoo.hungrycats.org>
+# Copyright (C) 2003-2010 Zygo Blaxell <faster-dupemerge@mailtoo.hungrycats.org>
 
 # This program is free software; you can redistribute it and/or modify
 # it under the terms of the GNU General Public License as published by
@@ -335,7 +335,7 @@ hash_file:
 
                        my $incumbent_list = ($hash_to_inode{$digest} ||= []);
                        my $incumbent_matched = 0;
-                       for my $incumbent (@$incumbent_list) {
+                       for my $incumbent (sort @$incumbent_list) {
                                print STDERR "\t\tInodes $incumbent and $candidate have same hash\n" if $debug;
 
                                my $finished = 0;