Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

Re^2: Numeric sorting WITHOUT <=>

by Marshall (Prior)
on Oct 10, 2012 at 04:42 UTC ( #998130=note: print w/ replies, xml ) Need Help??

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

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

Comment on Re^2: Numeric sorting WITHOUT <=>
Download Code
Replies are listed 'Best First'.
Re^3: Numeric sorting WITHOUT <=>
by AnomalousMonk (Canon) on Oct 10, 2012 at 13:08 UTC
    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.)

Re^3: Numeric sorting WITHOUT <=>
by ikegami (Pope) on Oct 10, 2012 at 18:11 UTC
    # keys in scalar context: Number of keys. my $min = keys(%jetsons); # keys in list context: List of keys. First one is assigned my ($min) = keys(%jetsons);
      My mistake.

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (5)
As of 2015-11-29 03:49 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 (746 votes), past polls