Re: Comparing hashes without sorting the keys

Also for fun (and in my debut as a novice!):

#!/usr/bin/perl -w
use strict;

my %aa=(uno=>1, due=>2, tres => 3);
my %bb=(due=>2, uno=>1, tres => 3);

print comphash(\%aa, \%bb) ? "Hashes are equal\n" : "Hashes are differ
+ent\n";

sub comphash {
    my ($aa, $bb) = @_;
    return 0 unless keys %$aa == keys %$bb;
    my %whole_hash = (%$aa, %$bb);
    my $different;
    foreach (keys %whole_hash) {
        next if exists $aa{$_} && exists $bb{$_} && $aa{$_} == $bb{$_}
+;
        $different++ && last;
    }
    return not $different;
}
[download]

Cheers!

Comment on Re: Comparing hashes without sorting the keys Download Code

Replies are listed 'Best First'.

Re: Re: Comparing hashes without sorting the keys
by BrowserUk (Patriarch) on Feb 20, 2004 at 03:40 UTC

There are a few problems with that. If the hash values are not numeric your == will cause trouble. Switching that to eq will get you some way, but then values of '079' and '79' don't compare equal although they may be considered so for the applications use of them.

Then you get into more esoteric problems. What if the values of the hash are themselves hashes or arrays (references). Comparing the stringyfied references will say that two arrays are different even if their contents is similar as they will have different addresses. Are two content-similar, but physically different arrays considered equal? That's almost a philisophical debate and very much depends on the application.

That said. Many of these problem exists with most of the other solutions offered also.

Examine what is said, not who speaks.

"Efficiency is intelligent laziness." -David Dunham
"Think for yourself!" - Abigail
Timing (and a little luck) are everything!

[reply]
[d/l]
[select]


Think about Loose Coupling
	PerlMonks