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

Re^3: Numeric sorting WITHOUT <=>

by AnomalousMonk (Canon)
on Oct 10, 2012 at 13:08 UTC ( #998225=note: print w/replies, xml ) Need Help??

in reply to Re^2: Numeric sorting WITHOUT <=>
in thread Numeric sorting WITHOUT <=>

my ($min) = keys(%jetsons); This is the number of keys in %jetsons.

Actually, it's a randomly (insofar as the hashing algorithm is random) chosen key from the hash. The assignment is in list context and seeds the min/max finder loop that follows.

>perl -wMstrict -le "my %jetsons = qw(aa 1 bb 2 cc 3 dd 4 ee 5); my ($min) = keys %jetsons; print $min; " cc

Update: ikegami's code works. (Never doubt a Pope.)

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (10)
As of 2016-10-26 19:19 GMT
Find Nodes?
    Voting Booth?
    How many different varieties (color, size, etc) of socks do you have in your sock drawer?

    Results (346 votes). Check out past polls.