Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
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

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://111076]
help
Chatterbox?
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (5)
As of 2017-06-23 04:26 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    How many monitors do you use while coding?















    Results (534 votes). Check out past polls.