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

Re: Re: Re: Re: Re: Pure Perl tail call optimization

by pdcawley (Hermit)
on Mar 19, 2004 at 16:19 UTC ( [id://338178]=note: print w/replies, xml ) Need Help??

This is an archived low-energy page for bots and other anonmyous visitors. Please sign up if you are a human and want to interact.


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

You'll note that the original subject was 'Tail call optimization' not 'Tail recursion optimization'. Tail call optimization comes in handy even when you're not recursing. It comes in handy when you're using lots of simple methods that simply return the results of a simple function call
package LeafNode; ... sub accept { my($self, $visitor) = @_; $visitor->visit_leaf($self); }
When you have tail call optimization in place, visit_leaf can return directly to accept's caller('s caller's caller's ...). Even without recursion, this can be a win because stack frames can be costly to create.

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://338178]
help
Sections?
Information?
Find Nodes?
Leftovers?
    Notices?
    hippoepoptai's answer Re: how do I set a cookie and redirect was blessed by hippo!
    erzuuliAnonymous Monks are no longer allowed to use Super Search, due to an excessive use of this resource by robots.