使用组合还是使用递归？
Return all rows from the recursion.
返回递归中的所有行。
Statically forbid polymorphic recursion.
静态禁止多态递归。
That language didn't even support recursion.
这语言甚至都不支持递归。
The tool even supports recursion to a given depth.
这个工具还支持递归到给定深度。
We mention recursion briefly in the previous chapter.
在前面的章节中，我们简要涉及了一下递归。
You'll see Lambda expressions, recursion, and macros.
您将学到 Lambda表达式、递归和宏。
The second part represents the iteration or recursion.
第二部分代表迭代或递归。
Tail recursion is a common technique in XSLT style sheets.
尾递归是xslt样式表中的常用技术。
You have added recursion to your Cusp development Arsenal.
已经将递归添加到了Cusp开发工具库中。
Logging the log methods would result in an infinite recursion.
记录log方法将导致无限递归。
This example uses what in Scheme is called tail recursion.
这个例子使用Scheme中所谓的尾递归（tail recursion）。
In short, NOCYCLE prevents the recursion from entering a cycle.
简言之，NOCYCLE防止递归进入循环。
We will get to the speed and space issues of recursion later on.
稍后我们会讨论递归的速度和空间问题。
Later you'll see how recursion takes advantage of these selectors.
稍后，您将了解递归如何利用这些选择函数。
Using recursion tremendously simplifies the verification of programs.
使用递归可以极度简化程序的核查。
Here's an example involving polymorphic recursion across two classes.
下面的示例涉及两个类之间的多态递归。
It also demonstrates how the recursion of the function execution works.
这也解释了函数执行的递归是如何实现的。
Lisp offers a performance optimization called tail recursion optimization.
Lisp提供一项称作尾部递归优化的性能优化技术。
Doing so would be a useful exercise, and a helpful lesson in runaway recursion.
这样做将是十分有用的练习，并且对失控递归非常有用。
Recursion means repetition in subelements, like the pattern of veins in a leaf.
递归手段重复子元素，如叶脉的排列。
You'll notice Haskell programs frequently use recursion to solve a problem.
可以注意到：Haskell程序频繁地用递归来解决问题。
All this pseudo column does is to return 1 if a given row is a leaf in recursion.
这个伪列只是当一个给定行在递归中是叶子的时候返回1。
Parameter to limit the depth of recursion. For example, xdebug.max_nesting_level.
您可以设定xdebug. max_nesting_level参数来限定递归深度。
You can adjust the recursion depth limit by changing a constant defined in Listing 4.
可以通过修改清单4中定义的常量来改变最大递归深度。
And the reason I want to show you this is to notice that the recursion can be doubled.
如果我来写斐波那契数列你可以看看这儿,原因是我想让你看看这部分的递归可以翻倍。
Note that this is classical functional programming, relying on recursion over iteration.
请注意这是典型的功能性编程，取决于迭代上的递归。
If the object's target attribute is recursive (group), it will be ignored (no recursion).
如果对象的目标属性为递归的(组)，则忽略该对象(无递归)。
As a result, just trying to expand the structure directly leads to infinite recursion loops.
所以，只想直接展开结构，可能会形成无限的递归循环。
As a result, just trying to expand the structure directly leads to infinite recursion loops.
所以，只想直接展开结构，可能会形成无限的递归循环。
应用推荐