Re^2: scanning hash


There's more than one way to do things
	PerlMonks

by Aristotle (Chancellor)

on Aug 01, 2004 at 14:40 UTC ( [id://379075]=note: print w/replies, xml )

Need Help??

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

Makeshifts last the longest.

Comment on Re^2: scanning hash

Replies are listed 'Best First'.
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.	[reply]
Re^4: scanning hash by Aristotle (Chancellor) on Aug 01, 2004 at 15:20 UTC
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.	[reply]
Re^5: scanning hash by ysth (Canon) on Aug 02, 2004 at 19:50 UTC
(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.	[reply]
Re^6: scanning hash by Aristotle (Chancellor) on Aug 02, 2004 at 20:13 UTC
Re^7: scanning hash by ysth (Canon) on Aug 02, 2004 at 20:20 UTC
Some notes below your chosen depth have not been shown here

Domain Nodelet^?

Node Status^?

node history
Node Type: note [id://379075]
help

Chatterbox^?

How do I use this? • Last hour • Other CB clients

Other Users^?

Others pondering the Monastery: (4)

As of 2024-04-25 07:10 GMT

Sections^?

Information^?

Find Nodes^?

Leftovers^?

Voting Booth^?

No recent polls found