Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

Re: Re: Re: Pure Perl tail call optimization

by TimToady (Parson)
on Mar 05, 2004 at 20:02 UTC ( #334343=note: print w/ replies, xml ) Need Help??

in reply to Re: Re: Pure Perl tail call optimization
in thread Pure Perl tail call optimization

Um, goto &SUB does create a new stack frame, but only after the old one is stripped off. (Shouldn't leak memory though.)

And goto LABEL doesn't do a linear search through the source file. And the way the (non-linear) search is written, going from the last statement to a label at the beginning should be pretty fast. Benchmarks are the only way to tell which will be faster.

Comment on Re: Re: Re: Pure Perl tail call optimization
Select or Download Code

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (3)
As of 2016-05-25 03:04 GMT
Find Nodes?
    Voting Booth?