This is an important point. Adding highly dynamic features (such as the ability to ask for a stack backtrace whenever you want) frequently conflicts with asking for nice optimizations. Which is better? The debugging support of Carp's confess(), or the performance benefit of optimizing tail-recursion? (There isn't a right answer, only a trade-off.)
In reply to Re: Iterative vs Recursive Processes
by tilly
in thread Iterative vs Recursive Processes
by mvaline
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |