Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

Re: Re: Re: Comparing hashes without sorting the keys

by greenFox (Vicar)
on Feb 19, 2004 at 04:17 UTC ( [id://330134]=note: print w/replies, xml ) Need Help??


in reply to Re: Re: Comparing hashes without sorting the keys
in thread Comparing hashes without sorting the keys

++nicely spotted. Even just "flattening" the hash to an array is suicidal, consider 
  my %aa=(aa=>'bb', cc=>'dd');
  my %bb=(bb=>'aa', dd=>'cc');

[download]
...ouch!

--
Do not seek to follow in the footsteps of the wise. Seek what they sought. -Basho

Replies are listed 'Best First'.

In Section Seekers of Perl Wisdom

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?

www.com | www.net | www.org
Node Status?
node history
Node Type: note [id://330134]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? • Last hour • Other CB clients
Other Users?
Others pondering the Monastery: (7)
As of 2024-04-18 16:16 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found