Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

Re^2: resetting a foreach loop!

by AnomalousMonk (Archbishop)
on Nov 17, 2017 at 18:08 UTC ( [id://1203694]=note: print w/replies, xml ) Need Help??


in reply to Re: resetting a foreach loop!
in thread resetting a foreach loop!

my ($largest, $smallest) = (-9e9,9e9); # in +itialize to the wrong extremes ... for my $v (@array) { # [a +nonymous monk]'s [id://1203660]: single pass through loop, without so +rting; more efficient than brostad's single sort $largest = $v if $v > $largest; $smallest = $v if $v < $smallest; }

The only quarrel I have with this implementation is that it depends on assumptions about the smallest and largest representable numbers (the wrongest extremes) in the system. Even if the assumptions are true in a given system, all bets are off if you move, e.g., to a different platform: from a 32-bit float to a 64-, 80- or who-knows-how-many-bit float. And if they're not true:

c:\@Work\Perl\monks>perl -wMstrict -le "my @array = (-9e9-123, -9e9-234); ;; my ($largest, $smallest) = (-9e9, 9e9); ;; for my $elem (@array) { $largest = $elem if $elem > $largest; $smallest = $elem if $elem < $smallest; } print qq{smallest: $smallest; largest: $largest}; " smallest: -9000000234; largest: -9000000000
Taking the initial smallest/largest value from the array itself is bulletproof: either the initializer is already the smallest/largest value, or some other value will be found in the array that is smaller/larger.
c:\@Work\Perl\monks>perl -wMstrict -le "my @array = (-9e9-123, -9e9-234); ;; my ($largest, $smallest) = ($array[0], $array[0]); ;; for my $elem (@array) { $largest = $elem if $elem > $largest; $smallest = $elem if $elem < $smallest; } print qq{smallest: $smallest; largest: $largest}; " smallest: -9000000234; largest: -9000000123


Give a man a fish:  <%-{-{-{-<

Replies are listed 'Best First'.
Re^3: resetting a foreach loop!
by pryrt (Abbot) on Nov 17, 2017 at 18:56 UTC

    You're right. I should have pointed the dangers of my assumptions in my post. I hadn't even thought of just using the 0th element of the array twice to initialize the largest/smallest -- but that's the best choice for the single-loop version. Thanks.

    TIMTOWTDI: with perl 5.24 and newer, you could set those to my ($largest, $smallest) = (-POSIX::Inf, +POSIX::Inf): nothing's bigger or smaller than Infinity, after all. :-)

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others perusing the Monastery: (3)
As of 2024-04-26 00:55 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found