该方法不以递归方式搜索当前组。
这个新的功能提供了以递归方式读取数据关系的另一种方法。
This new support provides a different way to recursively navigate data relationships.
我们以递归方式为解析名称和查询群组成员提供了两个帮助器类。
We have provided two helper classes for resolving names and querying group members in a recursive manner.
如果锁是以递归方式被请求，那么发出请求的线程已经持有了它。
If a lock is acquired recursively, the requesting thread already owns it.
对于此场景，请单击subtrees按钮，从而以递归方式比较两个完整配置。
For this scenario, click the Subtrees button to recursively compare the two complete configurations.
一旦所有的妻子都知道至少有一个男人出轨，我们就可以按递归方式来看待这个流程。
Once all the wives know there are at least 1 cheating husband, we can understand the process recursively.
该成像算法能够以递归方式将新的数据融入到成像中，这使成像背景噪声随时间减少。
The imaging algorithm can incorporate new data into the image in a recursive fashion which causes image background noise to diminish over time.
完全分解过程将以递归方式执行此替换，直到字符串中的任何字符都不能再做进一步的分解。
A full decomposition recursively performs this replacement until none of the characters in the string can be decomposed further.
要执行递归调用，必须在以递归方式调用的程序的PROGRAM - ID段落中编写RECURsive子句(或属性)，或指定THREAD编译器选项。
To make a recursive call, you must either code the recursive clause (or attribute) in the PROGRAM-ID paragraph of the recursively called program or specify the THREAD compiler option.
分治是一种递归算法，就是指利用一种方式把问题一分为二，然后用同样的方法把已分开的问题再一分为二，直到满足最小的解决单元。
Divide-and-conquer is a recursive technique, meaning that it uses some method to split a problem in half, then uses the same method to split those halves in half, and so on.
Lisp提供用于迭代的编码结构，但递归是更受欢迎的列表遍历方式。
Lisp provides coding structures for iteration, but recursion is a far more popular way to navigate lists.
nose测试运行器采用的实现方式介于另两种工具之间：它向下递归地搜索每个Python包，但是只检查目录名中包含单词test 的目录。
The nose test runner implements a middle way between the other two tools: it descends into every Python package, but is only willing to examine directories, if they have the word test in their name.
可以通过两种方式(递归地或非递归地)的其中一种来请求锁。
A lock can be acquired in one of two ways, recursively or non-recursively.
清单2中的类显示了这一递归装入的工作方式。
The classes in Listing 2 show how this recursive loading works.
由于尾部递归优化，这种方式是对列表进行迭代的一种非常简单的方式。
With tail-recursion optimization, this idiom is a marvelously concise way to iterate over a list.
以递归的方式进行定义；例如，应用程序包括其他应用程序。
Is defined in a recursive manner; for example, if an application includes other applications.
不过，随着程序越来越复杂，递归程序设计能够让程序员以可维护且逻辑一致的方式更好地组织代码。
But as programs become more complex, recursive programming gives the programmer a better way of organizing code in a way that is both maintainable and logically consistent.
例如，可以为同一函数定义多种处理方式，还可以对递归调用应用模式匹配，这样做可以简化某些函数。
For example, the ability to define multiple approaches to the same functions and employ pattern matching for recursive calls simplifies some functions.
通过递归地将系统分解为各个要素部分，关注体系架构也是一种很好的将大型问题分解为一系列小型问题的方式。
The focus on architecture is also a good way of taking a large problem and breaking it down into a series of smaller problems, by recursively decomposing the system into its constituent parts.
这两步递归地以深度优先的方式重复。
它是由递归下行复合数据结构引起的，这种下行方式有时在一次递归调用中要下行多级。
It is caused by recursively descending a composite data structure in such a way that, sometimes, more than one step in the descent is taken in a single recursive call.
递归实际上是定义一个调用自身的函数的方式。
Recursion is actually a way of defining functions in which the function is applied inside its own definition.
Lisp编译器或解释器能够将特定形式的递归翻译为迭代，从而允许以一种更为简单明快的方式来使用递归数据结构（如树结构）。
The Lisp compiler or interpreter can translate certain forms of recursion to iteration, allowing a simpler, cleaner way to work with recursive data structures, such as trees.
递归在haskell中至关重要。与命令式语言要求你去表达求解的方式不同，haskell更倾向于让你提供问题的描述。
Recursion is important to Haskell because unlike imperative languages, you do computations in Haskell by declaring what something is instead of declaring how you get it.
如果对象的目标属性为递归的(组)，则其内容必须是一组dn值，并指向将按如下方式进行解析和处理(递归)的其他LDAP对象。
If the object's target attribute is recursive (group), its content must be a set of dn values pointing to other LDAP objects that will be resolved and treated as follows.
根据Wikipedia：递归（拉丁语recurrere->currere =run和re =return）是以自相似性的方式循环某些项的过程。
According to Wikipedia: Recursion (lat. recurrere -> currere = run and re = return) is the process of repeating items in a self-similar way.
基本理解XPath表达式、模板的匹配方式和xslt递归算法之后，就可以创建简短的可维护的转换。
A basic understanding of XPath expressions, how templates are matched, and XSLT recursive algorithms will result in the creation of small, easy, and maintainable transforms.
为什么是把文化翻译成彼此的递归的形成环一种足够的操作的方式的力学？
Why is the mechanics of recursive looping an adequate operational mode for translating cultures into one another?
它采用了递归的方式由上而下的对一个文本的词法进行分析。
It USES recursive manner of a top-down version of the lexical analysis.
给出了递归函数调用时利用变量传递解决复杂问题的实例，展示了递归算法在解决非数值运算问题中的独特解题方式和效果。
Examples are given for solving complex problem by transferring variables in recursive function program, and the recursive function programs show excellent capability for solving non-numeral problem.
应用推荐