Beefy Boxes and Bandwidth Generously Provided by pair Networks
Problems? Is your data what you think it is?
 
PerlMonks  

Re: Comparing hashes without sorting the keys

by davido (Cardinal)
on Feb 18, 2004 at 19:33 UTC ( [id://330024]=note: print w/replies, xml ) Need Help??


in reply to Comparing hashes without sorting the keys

Here's a Data::Compare example:

use strict; use warnings; use Data::Compare; my %aa = qw( uno 1 due 2 ); my %bb = qw( due 2 uno 11234325161111 ); print Compare( \%aa, \%bb ) ? "Equal!\n" : "Unequal!\n";


Dave

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://330024]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (6)
As of 2024-03-28 19:20 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found