Jeremy Howard writes:
: How much hand-waving can we do with implementation efficiency of anonymous
: subs and higher order functions? How much can we expect Perl to optimise
: away at compile time? For instance, if:
:
: $sum = reduce ^_+^_, @list;
:
: has any substantial overhead on each itera
Ariel Scolnicov wrote:
> Nathan Torkington <[EMAIL PROTECTED]> writes:
> > $a and $b were done for speed: quicker to set up those global
> > variables than to pass values through the stack. The documentation
> > for perl5's sort function says that passing as arguments is
> > considerably slower
