Beefy Boxes and Bandwidth Generously Provided by pair Networks Ovid
Come for the quick hacks, stay for the epiphanies.
 
PerlMonks  

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

by Popcorn Dave (Abbot)
on Feb 19, 2004 at 12:30 UTC ( [id://330276]=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

You're right! Given the OP's data I just hacked out a quick solution, but thanks for pointing out my flaw.

Good call.

There is no emoticon for what I'm feeling now.

  • Comment on Re: Re: Re: Comparing hashes without sorting the keys

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://330276]
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.