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

Re^2: scanning hash

by Aristotle (Chancellor)
on Aug 01, 2004 at 14:40 UTC ( #379075=note: print w/ replies, xml ) Need Help??


in reply to Re: scanning hash
in thread scanning hash

This code is incorrect. It will treat undefs and empty strings as the same.

Makeshifts last the longest.


Comment on Re^2: scanning hash
Re^3: scanning hash
by ambrus (Abbot) on Aug 01, 2004 at 15:15 UTC

    Undefs and empty strings are equal. The OP wanted to check if all values are equal.

      Oh dear. Next thing we will argue about whether the equality of two values can be determined by the equality of their string representations. :-)

      Makeshifts last the longest.

        (puzzled) If you really want...I'll start us off.

        You can't determine the equality of two values from the equality of their string representations.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (6)
As of 2014-08-02 10:25 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Who would be the most fun to work for?















    Results (56 votes), past polls