英语释义

• of or relating to a recursion

片语

recursive lock递归锁

recursive inference递推论

recursive computation递归计算

recursive relation[数] 递归关系

recursive algorithm[数] 递归算法

recursive function[数] 递归函数

recursive orbit回归轨道

recursive structure[数]

recursive procedure[计] 递归过程

recursive relationship递归联系

Recursive Method[数]

英汉例句

• the program then seeds the recursive function with the first item on the list and the remaining list.

  然后程序以列表中的第一项及其余部分列表为种子开始递归函数。

• since the combination of processor, connection and memory is a machine, the model can be used to describe recursive processes.

  鑒于处理 器、连接器和内存的组合就是一台机器，因此这个模型能够用于描述递归流程。

• this allows for anonymous recursive functions.

  这将允许匿名递归函数。

• consider what would happen with a recursive method, for instance.

  例如，考虑在一个递归方法中会发生的事情。

• through simple recursive statements, you can power process lists of symbols and data easily.

  通过简单的递归语句，可以轻松地推动处理符号和数据列表。

• so how does this tie back in to recursive composition?

  那么如何将其绑回到递归组合中呢？

• the eiffel tower looks striking partly because it is a recursive solution, a tower on a tower.

  艾菲尔铁塔看起来惊人的部分原因在于它是一个递归的解决方案，塔上之塔。

• the classes in listing 2 show how this recursive loading works.

  清单2中的类显示了这一递归装入的工作方式。

• the result of the present computation depended on the partial results before it, so in each successive recursive call, we pass those results forward.

  当前计算的结果依赖于之前的部分结果，所以，在每次后续递归调用中，我们向前传递那些结果。

• this permits one to describe the process simply, but still be able to construct plans of arbitrary complexity by recursive application of the rup lifecycle.

  这样做允许我们简单的描述过程，但是仍然能够通过rup生命周期的递归程序，建造十分复杂的计划。

• 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.

  分治是一种递归算法，就是指利用一种方式把问题一分为二，然后用同样的方法把已分开的问题再一分为二，直到满足最小的解决单元。

• no discussion about wsfl, however, can be complete without touching on one of its core features: recursive composition of business processes.

  但是，如果不接触它其中的一个核心功能：商业流程的递归组合，任何关于wsfl 的讨论都不能算完整。

• this is how recursive functions keep from trashing the values of the variables in other, active function calls.

  这就是递归函数是如何保证其他活动函数调用中的变量值不受影响的。

• this functionality works well as a recursive application, as shown in the sample factorial function in listing 4.

  这个功能作为递归应用程序工作良好，如 清单4中的样本阶乘函数所示。

• moreover, these extensions were all achieved using the same basic approach: recursive application of the same basic set of concepts at different levels of abstraction.

  此外，这些扩展都是通过使用相同的基本方法达到的：即在不同的抽象层面上递归地应用那些相同的基本概念集。

• you need to do this because your parameter will get clobbered on the recursive function call, and you will need access to it afterwards.

  之所以需要这么做是因为参数会在递归函数调用上被截断，而以后却还需要访问它。

• remember that when a program makes a function call (especially for recursive ones), it has to store its return address and local variables on the stack.

  记住当程序进行函数调用（特别是针对递归函数）时，它必须在堆栈上存储返回地址和本地变量。

• in a recursive cte, it is simply any query providing a set of rows.

  在递归cte 中，它只是一个普通的提供一组行的查询。

• wsfl's support for recursive composition allows you and me to link our two business processes in a way that requires us only to agree on the format of the purchase order submitted.

  wsfl支持递归组合，允许您和我用某种方法将我们的两个商业流程链接起来，这种方法要求我们只要在提交的购买订单的格式上达成一致即可。

• recursive data stored in a table (or a physical file) point to data in another column/field in a different row/record within the same table/physical file.

  存储在表（或物理文件）中的递归数据指向同一表格/物理文件的其他行/记录的另一个列/字段中的数据。

• however, one concern people have with the use of recursive functions is the growth of stack space.

  不过，对于递归函数的使用，人们所关心的一个问题是栈空间的增长。

• it allows you to succinctly describe text generated from nested or recursive data.

  通过它可以简洁地描述从嵌套或递归数据生成的文本。

• this one makes recursive calls by default; therefore, it will also find method declarations in any inner classes.

  默认情况下，它将进行递归调用。因此，您也可以在任何一个内部类中发现方法声明。

• this optimization transforms recursive calls into local loops, in order to prevent stack overflows.

  这一优化将递归调用转换成本地回路，这样可以防止栈溢出。

• this recursive technique ensures that all of the html elements are processed, regardless of how they are nested within each other.

  这一递归技术确保所有html元素都能得以处理，不管它们是如何相互嵌套的。

• we have provided two helper classes for resolving names and querying group members in a recursive manner.

  我们以递归方式为解析名称和查询群组成员提供了两个帮助器类。

• finally, for the case of recursive expressions, the parser should simply echo parentheses when it sees them within the expression recursion, as illustrated in listing 21.

  最后对于递归表达式的情况，当解析器在表达式递归中看到括号时，就应该简单地进行回送，如清单21中所示。

• however, the recursive composition characteristic of soa complicates this further: the consumer is often another service and consequently is in no position to resolve the issue [4].

  然而，soa递归组合的特性使得情况进一步的复杂化：消费者常常是另一个服务，因此也不是解决该问题的合适位置[4]。