Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"
 
PerlMonks  

Re: compare two hashes inefficiently.

by MrNobo1024 (Hermit)
on Sep 08, 2001 at 03:17 UTC ( #111076=note: print w/ replies, xml ) Need Help??


in reply to compare two hashes inefficiently.

You don't need to use MD5 just to compare two strings. :-) I would have written it like this:

sub hcmp { use Data::Dumper; return(Dumper(shift) eq Dumper(shift)); }

-- MrNobo1024

s]]HrLfbfe|EbBibmv]e|s}w}ciZx^RYhL}e^print


Comment on Re: compare two hashes inefficiently.
Select or Download Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (9)
As of 2015-07-31 05:46 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (274 votes), past polls