Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change

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.)

Comment on Re^3: Numeric sorting WITHOUT <=>
Select or Download Code

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 romping around the Monastery: (8)
As of 2015-11-25 13:27 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (675 votes), past polls