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

Re^2: Lookup closest hash key

by Anonymous Monk
on Oct 08, 2014 at 19:08 UTC ( #1103206=note: print w/replies, xml ) Need Help??

in reply to Re: Lookup closest hash key
in thread Lookup closest hash key

Didn't you mean this, rather?
sub nearest{ my ( $dist, $href ) = @_; my ( $answer ) = ( sort { abs( $a - $dist ) <=> abs( $b - $dist ) +} keys %$href )[0]; return $href -> { $answer }; }
Otherwise this is a great trick, thanks!

Replies are listed 'Best First'.
Re^3: Lookup closest hash key
by choroba (Archbishop) on Oct 09, 2014 at 07:17 UTC
    my ($answer) creates list context, so the [0] at the end is not needed: it is a list assignment, the first element on the left gets the first element on the right. With the index at the end, you can drop the parentheses on the left, as it is a scalar assignment:
    my $answer = ( sort { abs( $a - $dist ) <=> abs( $b - $dist ) } keys % +$href )[0];
    لսႽ ᥲᥒ⚪⟊Ⴙᘓᖇ Ꮅᘓᖇ⎱ Ⴙᥲ𝇋ƙᘓᖇ

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (4)
As of 2021-01-17 13:08 GMT
Find Nodes?
    Voting Booth?