A WORD, A WORLD
recursion
释义
- n.
- 递归
- 网络
- 递回；循环；递推
展开详细释义
n.
1.递演
2.重复
3.【数学】递归(式);递推,循环
在例句中理解 30 句
Recursion allows defining policies higher up in a domain and enforce them on all the component implementations and interactions within.
递归允许在域的更高层定义策略，然后将它们强制到内部所有组件实现和交互。
The last function you're going to create is going to take some recursion, where the true power of list processing using Lisp lies.
将要创建的最后一个函数要执行一些递归操作，这是使用Lisp进行列表处理的真正强大之处。
Too many method calls is often indicative of a very deep or unbounded recursion.
过多的方法调用通常意味着存在非常深的递归或无限递归。
Known as lambda calculus, it was designed to investigate the function definition and application, as well as the concept of recursion.
它被称为lambda演算，用于研究函数定义与应用程序以及递归概念。
And thus, the ability to understand pointers and recursion is directly correlated with the ability to be a great programmer.
因此，是否真正理解指针和递归，与是否是一个优秀程序员直接相关。
You may be thinking that you know how write this program to perform faster or better without recursion.
您可能会认为自己知道如何不使用递归编写这个程序，使其执行更快或者更好。
Well, there is also a possibility of using function names for recursion, but you will soon see that this is often impractical nowadays.
当然还有可能在递归调用中使用函数名称，但是你将很快看到在当下他通常不大实用。
This code uses the concept of recursion to call the main function multiple times until the last directory has been traversed.
此代码会利用递归概念多次调用主函数，直至处理完最后一个目录为止。
Recursion is one of the familiar methods in algorithm design and analysis, and through this method many efficient algorithms can be found.
递归是算法设计中常用的方法之一，利用递归可以得到很多高效算法。
Likewise, when print_report_irecurses, there is nothing left that it does after the point of recursion.
同样地，当print_report_i再次被调用时，在递归点之后不再做任何事情。
Recursion relies on a stack-based approach to passing variables. Many small machines have no hardware support for a stack.
递迴依靠一个基于堆叠的方法来传递变数。许多小系统没有硬体支持的堆叠。
Recursion relies on a "virtual stack" that purportedly has no real memory constraints.
递迴依赖于“虚拟堆叠”这看来已没有真正的记忆体限制。
Induction and the related concept of recursion also provide means of counting.
归纳法以及与之相关的递归概念也可以提供计数的方法。
This could certainly prove useful for complex programs implementing a great deal of recursion or with complicated loop conditions.
它可以被用来证明极其复杂的，含有大量递归以及循环结构的程序是否有效。
This fact may be obfuscated by our simple example earlier in which the polymorphic recursion occurs as a simple, direct self-reference.
我们先前的简单示例（其中，多态递归作为一个简单直接的自引用发生）会使这一事实变得模糊。
The processing of these lists using recursion and Lisp functions like car and cdr is the power of list processing using Lisp.
使用递归和诸如car和cdr之类的Lisp函数处理这些列表是使用Lisp处理列表的强大之处。
Recursion is a fundamental concept in mathematics and computer science and many complex problems can be fitted to a recursive framework.
递归是数学和计算机科学中的一个基本概念，许多复杂问题的求解都可以用递归算法去解决。
Doing so would be a useful exercise, and a helpful lesson in runaway recursion.
这样做将是十分有用的练习，并且对失控递归非常有用。
As a result, just trying to expand the structure directly leads to infinite recursion loops.
所以，只想直接展开结构，可能会形成无限的递归循环。
A simple recursion formula can then be used to solve such a system.
一个简单而又重复的公式能用来解这样的方程组。
In the definition above, we've written the function with explicit recursion. We'll use the Y combinator to get rid of that!
在上面的定义中，我们编写了一个显式的递归程序。我们将使用Y组合子清除它。
In this paper, using recursion formula of the adjoint polynomial, we shall obtain adjoint polynomials of two graphs.
本文运用伴随多项式的递归公式，求出了两类图的伴随多项式。
Finally, by means of the formulae of recursion and back-substitution presented in this paper the problem is worked out.
最后，按本文所述递推回代公式进行求解。实例表明，计算结果与实验相符。
Results A recursion formula to the solutions of a class of linear ordinary differential equations with constant coefficients is given.
结果给出了求一类常系数非齐次线性微分方程的特解的递推公式。
Recursion is actually a way of defining functions in which the function is applied inside its own definition.
递归实际上是定义一个调用自身的函数的方式。
Will use recursion to acquire the lock on each bucket and rehash the elements from each bucket into a new, larger hash table.
就使用递归获取每个bucket上的锁并重排每个bucket中的元素到一个新的、更大的hash表中。
Left-recursion is more efficient and, for large input sets, may be the only viable option.
向左递归更有效，而且对较大的输入集来说，这可能是惟一可行的选择。
The lengthy code snippet shown in Listing 6 uses a recursion technique inspired by the PHP open source community (see Resources).
清单6中这段长长的代码片段采用了PHP开放源码社区（请参阅参考资料）提出的递归技术。
In BNF , the only way to indicate a list of an arbitrary number of elements is through recursion .
在BNF表示法中，为了表示一串任意个数的元素，唯一的方法是通过递归来定义。
Remember that the concatenation using concat2 requires two strings, so a number will cause this function to break within the recursion.
记住，使用concat2进行连接要求使用两个字符串，因此数字将导致此函数在递归之间中断。