Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much
 
PerlMonks  

Re: scanning hash

by davido (Archbishop)
on Aug 01, 2004 at 09:47 UTC ( #379044=note: print w/ replies, xml ) Need Help??


in reply to scanning hash

I just wanted to add that ysth's solution can also be adapted in such a way that it can be applied to arrays.

Determine if all elements in @array are equal.

use strict; use warnings; my @goodarray = ( 1, 1, 1, 1, 1 ); my @badarray = ( 1, 2, 3, 4, 5 ); foreach my $aref ( \@goodarray, \@badarray ) { print SameVals($aref) ? "Good!\n" : "Bad!\n"; } sub SameVals { keys %{ { map { $_ => undef } @{ +shift } } } <= 1; }

Enjoy!\n


Dave


Comment on Re: scanning hash
Download Code
Re^2: scanning hash
by Aristotle (Chancellor) on Aug 01, 2004 at 14:42 UTC
    This too suffers the same problem as Re: scanning hash: it treats undefs and empty strings as the same.

    Makeshifts last the longest.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others lurking in the Monastery: (8)
As of 2014-07-11 10:01 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    When choosing user names for websites, I prefer to use:








    Results (224 votes), past polls