note
LanX
Thats what you want?
<c>
my $sq = sub { $_[0]**2 };
my $id = sub { $_[0] };
sub sum {
my ($a,$b,$func) =@_;
$func //= $id;
my $sum;
$sum += $func->($_) for ($a..$b);
return $sum;
}
sub sum_sq{ sum($_[0],$_[1],$sq)}
$,=",";
print sum(3,5),sum_sq(3,5); # 12,50
</c><P>
I skipped the &next sub for integer stepping, but shouldn't be to difficult with a while loop checking $a<$b. <P>
(UPDATE: I'm puzzled... if "&next" is necessary to get the next element of an iterator one must also provide a &cmp for checking <c>$a<$b</c> in the loop-condition) <P>
Better avoid Lisp-recursion in Perl, when you can use "real" loops, we don't automatically optimize them to loops like Lisp does.<P>
<!-- Node text goes above. Div tags should contain sig only -->
<div class="pmsig"><div class="pmsig-708738">
<p>Cheers Rolf
</div></div>
996373
996373