> Greg Baryza
>
> From the NIST dictionary:
>
> tail recursion
> (algorithmic technique)
> Definition: A special form of recursion where the last operation of a
> function is a recursive call. The recursion may be optimized away by
> executing the call in the current stack frame and returning its result
> rather than creating a new stack frame.
>
>
> Substitute "template" for "function" and there you have it. When a
> template ends with a direct invocation of itself, the processor can
> reinitialize and reuse the stack frame. It doesn't have to push a new
one.
Cool -- thanks for the explanation!
-------------------
(*) To unsubscribe, send a message with words 'unsubscribe xep-support'
in the body of the message to majordomo@renderx.com from the address
you are subscribed from.
(*) By using the Service, you expressly agree to these Terms of Service http://www.renderx.com/terms-of-service.html
Received on Thu May 25 10:15:58 2006
This archive was generated by hypermail 2.1.8 : Thu May 25 2006 - 10:15:59 PDT