Beefy Boxes and Bandwidth Generously Provided by pair Networks Frank
Don't ask to ask, just ask
 
PerlMonks  

Re: Comparing hashes without sorting the keys

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

This is an archived low-energy page for bots and other anonmyous visitors. Please sign up if you are a human and want to interact.


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
Sections?
Information?
Find Nodes?
Leftovers?
    Notices?
    hippoepoptai's answer Re: how do I set a cookie and redirect was blessed by hippo!
    erzuuliAnonymous Monks are no longer allowed to use Super Search, due to an excessive use of this resource by robots.