• 这就是一个绝妙的递归定义。

    It's actually a wonderful recursive definition.

    youdao

  • 像这样的递归定义很快就会填满堆栈,从而导致堆栈溢出。

    A recursive definition like this is going to fill up the stack rapidly and lead to a stack overflow.

    youdao

  • 基于现有循环不变式开发技术中的递归定义思想,提出了开发复杂递归问题循环不变式的两种新策略;

    Based on recursive definition idea in existing technique of developing loop invariants, two new strategies for developing loop invariants on complicated recursive problems are presented.

    youdao

  • 更严重的问题是类定义中可能存在多态递归。

    The more serious problem is the potential for polymorphic recursion in class definitions.

    youdao

  • 在数学定义中,递归是十分常见的,如fibonacci数列(斐波那契数列)。

    Definitions in mathematics are often given recursively. For instance, the Fibonacci sequence is defined recursively.

    youdao

  • 删除与赋值的定义方法类似,也是递归的。

    Deletion is recursively defined very similar to the way assignment is defined.

    youdao

  • 可以通过修改清单4中定义的常量来改变最大递归深度。

    You can adjust the recursion depth limit by changing a constant defined in Listing 4.

    youdao

  • 注意,与我们的递归程序非常类似,链表的定义也包括一个基线条件 ——在这里是NULL指针。

    Notice how like our recursive programs, the definition of a linked list also contains a base case -- in this case, the NULL pointer.

    youdao

  • 这种查找是递归的:如果在prototype 内定义的实例不能找到属性或函数,它就会在其原型中查找,依此类推。

    This lookup is recursive: if the instance defined in prototype cannot find an attribute or function, it will look in its prototype, and so on.

    youdao

  • 探索模板的惟一方法是定义同样的递归版本以及基本案例。

    The only way to go about exploring the template is to define a recursive version of the same along with a base case.

    youdao

  • 从某种程度上来说,这些概念在UML1 中对于协作的定义里可以找到,只可惜它们不能用于递归。

    To a degree, these concepts could already be found in the UML 1 definition of collaborations, except that they were not applied recursively.

    youdao

  • 注意,与我们的递归程序非常类似,链表的定义也包括一个基线条件——在这里是NULL指针。

    Notice how like our recursive programs, the definition of a linked list also contains a base case — in this case, the NULL pointer.

    youdao

  • 该方法的新颖性在于定义时间序列的递归状态时,不仅考虑局部相空间距离而且考虑局部排序模式分布结构。

    The innovation of HRP is that the recurrence is defined not only by local phase space distance, but also by the local order patterns structure of a time series.

    youdao

  • 为了避免无限递归,Scala要求每一个辅助构造函数调用在它之前定义的构造函数[ScalaSpec2009]。

    In order to avoid infinite recursion, Scala requires each auxiliary constructor to invoke another constructor defined before it [ScalaSpec2009].

    youdao

  • 在围绕g _ range参数所定义的全部可能范围构建签名时,check_dynamics函数将递归调用自身。

    The check_dynamics function recursively calls itself while building signatures encompassing the full range of possibilities defined by the g_range parameter.

    youdao

  • 例如,可以为同一函数定义多种处理方式,还可以对递归调用应用模式匹配,这样做可以简化某些函数。

    For example, the ability to define multiple approaches to the same functions and employ pattern matching for recursive calls simplifies some functions.

    youdao

  • 过程调用可以是嵌套的或递归的,但是保存点的范围被限制为定义它的存储过程的执行。

    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.

    youdao

  • 设计并实现了一个面向教学的类c编译器,支持全局或局部变量的定义、函数参数传递和函数递归调用。

    Designing and implementing a teaching-oriented C-like compiler, which supports the definition of local and global variables, function parameters, as well as recursive call of functions.

    youdao

  • 为了允许递归,协作结构被嵌套到类的规范中。这就是说这个类的所有实例都将有一个由类定义的内部结构。

    To allow recursion, a collaboration structure is nested within a class specification, which means that all instances of that class will have an internal structure specified by the class definition.

    youdao

  • 本文对直接递归过程与间接递归过程的谓词变换语义给出了形式化的定义。

    This paper presents the formal definitions of predicate transformer seman-rics for both direct and indirect recursive procedures using the concept of WP.

    youdao

  • 对刚开始接触计算机编程的人而言,这里有递归的一个简单定义:当函数直接或者间接调用自己时,则发生了递归。

    For those of you who are new to computer programming, here's a simple definition of recursion: recursion occurs when a function calls itself directly or indirectly.

    youdao

  • 递归实际上是定义一个调用自身的函数的方式。

    Recursion is actually a way of defining functions in which the function is applied inside its own definition.

    youdao

  • 一旦检测到循环,就会设置cycle子句中已定义好的适当标记,并停止分支的递归查询过程。

    As soon as a cycle is detected the appropriate flag defined in the cycle clause is set and the recursive query process for the branch is stopped.

    youdao

  • 递归组合的思想很简单:可以通过组合现有的商业流程来定义新的商业流程(请参见图1)。

    The idea of recursive composition is simple: new business processes can be defined by combining existing business processes (see Figure 1).

    youdao

  • 依赖于目标(序列)的形式,赋值被递归地定义。

    Assignment is defined recursively depending on the form of the target (list).

    youdao

  • 在BNF表示法中,为了表示一串任意个数的元素,唯一的方法是通过递归来定义。

    In BNF, the only way to indicate a list of an arbitrary number of elements is through recursion.

    youdao

  • 在BNF表示法中,为了表示一串任意个数的元素,唯一的方法是通过递归来定义。

    In BNF, the only way to indicate a list of an arbitrary number of elements is through recursion.

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定