Beefy Boxes and Bandwidth Generously Provided by pair Networks DiBona
Just another Perl shrine
 
PerlMonks  

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

by greenFox (Vicar)
on Feb 18, 2004 at 23:17 UTC ( [id://330134]=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 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
Sections?
Information?
Find Nodes?
Leftovers?
    Notices?
    • hippo‥ epoptai's answer Re: how do I set a cookie and redirect was blessed by hippo!
    • erzuuli‥ Anonymous Monks are no longer allowed to use Super Search, due to an excessive use of this resource by robots.