5 recursive calls to get there.
5次递归调用，才得到这个答案。
This one makes recursive calls by default;
默认情况下，它将进行递归调用。
Implementation ideas: the use of recursive calls. 2, paging display.
实现思路：使用递归调用。2、分页显示。
In short, recursive calls are basically SQL performed on behalf of your SQL.
简而言之，递归调用就是代表你的SQL执行的SQL语句。
You should also ensure that you cannot run out of memory due to having too many recursive calls.
您也应该确定不会因过多的递回呼叫而将记忆体用完。
This optimization transforms recursive calls into local loops, in order to prevent stack overflows.
这一优化将递归调用转换成本地回路，这样可以防止栈溢出。
This one makes recursive calls by default; therefore, it will also find method declarations in any inner classes.
默认情况下，它将进行递归调用。因此，您也可以在任何一个内部类中发现方法声明。
This is obvious in the Visitor implementation where you see all of the recursive calls to the eval-concat function.
在访问者实现中可以清楚地看到这一点，您可以看到对eval - concat函数的所有递归调用。
For example, the ability to define multiple approaches to the same functions and employ pattern matching for recursive calls simplifies some functions.
例如，可以为同一函数定义多种处理方式，还可以对递归调用应用模式匹配，这样做可以简化某些函数。
If your logic does not require the operator procedure to call itself, then remove any recursive calls or replace them with statements that do not call their own procedure.
如果逻辑上不要求运算符过程调用自身，请移除任何递归调用，或将其替换为不调用自身过程的语句。
Recursive methods is reported as sum of the calls. The viewer should be more clever in this respect.
方法的递归调用在报表显示为调用的总合，显示程序在这方面需要更聪明一些。
This is how recursive functions keep from trashing the values of the variables in other, active function calls.
这就是递归函数是如何保证其他活动函数调用中的变量值不受影响的。
Procedure calls can be nested or recursive, but the scope of a savepoint is restricted to the execution of the stored procedure in which it is defined.
过程调用可以是嵌套的或递归的，但是保存点的范围被限制为定义它的存储过程的执行。
Goto statements and recursive function calls may be supported by the language definition, but it is known that using other methods makes the code easier to understand.
语言规范可能支持goto语句和递归函数调用，但使用其他方法能够让代码更易于理解。
The nonreentrant probes provider filters out recursive firing of named probes (calls).
nonreentrant探测器提供者滤除了指定探测器的递归执行(调用)。
A function that calls itself is recursive; the process of executing it is called recursion.
调用自身的函数就是递归的；执行这种函数的过程就叫递归运算。
This algorithm is commonly referred to as recursive halving and doubling and is the underlying mechanism behind the class of reduce function calls in MPI, which we discuss next.
这种算法通常就称为递归二分和倍增(recur sive halving and doubling)法，它就是在mpi中reduce函数调用的类背后所采用的机制，稍后我们就要讨论。
Obviously, the straightforward method is faster because there aren't any function calls or stack manipulation, but the recursive way is more elegant and better reflects the problem.
很明显，直接方法执行速度要快一些，因为没有涉及到任何函数调用或堆栈操作。但递归方法更优雅，能更好地反映问题的本质。
Compared with recursive algorithm for binary tree traversing, non-recursive algorithm reduces expenses of function calls, gains performance advantage.
二叉树遍历的非递归算法相对于递归算法，减少了函数调用等开销，具有性能优势。
This can be especially useful when you are debugging a recursive function, a function that calls itself.
在调试递归函数（调用自身的函数）时，这个功能尤其有用。
This can be especially useful when you are debugging a recursive function, a function that calls itself.
在调试递归函数（调用自身的函数）时，这个功能尤其有用。
应用推荐