Re^2: Numeric sorting WITHOUT <=>

Replies are listed 'Best First'.
Re^3: Numeric sorting WITHOUT <=> by AnomalousMonk (Archbishop) 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` [download] Update: ikegami's code works. (Never doubt a Pope.)	[reply] [d/l] [select]
Re^3: Numeric sorting WITHOUT <=> by ikegami (Patriarch) on Oct 10, 2012 at 18:11 UTC
No. `# 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);` [download]	[reply] [d/l]
Re^4: Numeric sorting WITHOUT <=> by Marshall (Canon) on Oct 12, 2012 at 06:36 UTC
Correct. My mistake.	[reply]