递归式遍历JSF组件树。
请注意你的递归式。
扫描是递归式的，可以定义被扫描的文件的扩展名。
Scanning can be recursive and countable files extensions can DE defined.
然后，JSF框架递归式地遍历组件树，更新组件状态。
Then, the JSF framework traverses the tree recursively, updating the state of the components.
为了能够灵活设计出满足系统要求的递归式MT I滤波器，提出了一种设计方法。
A new design method is presented to design flexibly a recursive MTI filter that can meet the specifications of the system.
本文讨论了滑动DFT的递归关系，提出了新的递归式算法，有效地改善了处理效率。
This paper first discusses the recursion relations of sliding DFT and then gives new recursion algorithm which can improve the Performance effectively.
将关联与其他对象分开使得对象的描绘更为清晰，减少了递归式问题，而且更加适合于多到多关系。
Separating associations makes the delineation of objects clearer, reduces problems with recursion, and is more adapted to many-to-many relationships.
为此，它将选取列表的第一个元素 — 列表头部 —来对该元素执行处理，然后再递归式地将列表的其余部分传递给自身。
To do so, it will pick off the first element of the list — the head — to do the processing on that element, and recursively pass the rest of the list to itself again.
实验仿真设计了两种典型的递归式MTI滤波器，结果证明该方法是一种有效的设计方法，它可以灵活而快速地设计出所需要的滤波器。
Two kinds of classical recursive MTI filters are designed in this paper. The results demonstrate the validity of this design method that can design flexibly and quickly a required filter.
函数式编程中，传统语言中用循环完成的多数任务都可以使用递归来完成。
In functional languages, most tasks that are accomplished with loops in traditional languages are instead accomplished with recursion.
通过增加简明的语法和支持，函数式语言使递归成为实现简单代码重用的候选方法。
By adding clean syntax and support, functional languages make recursion a candidate for simple code reuse.
就象静态检测糟糕的泛型构造函数调用一样，禁止多态递归会与递增式类编译发生冲突。
Just like static detection of bad generic constructor calls, forbidding polymorphic recursion conflicts with incremental class compilation.
递归方法也需要显式的返回类型。
然而，造成这种现象的部分原因是大多数命令式语言没有提供相应的支持，因此使用递归很困难。
However, part of the reason lies with the fact that most imperative languages have lackluster support for it, making it more difficult to use than it should be.
递归在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.
自己调用自己的程序的说法。递归一般在嵌入式系统中是不充许的，因为它常常占有大量的堆栈空间。
Said of software that calls itself. Recursion should generally be avoided in an embedded system, since it frequently requires a large stack.
下面的函数是递归地计算二项式系数的。
The following is a function computes the binomial coefficient recursively.
利用归一公式进行量化递归运算，求出断路器安全总突变隶属函数值。
The total function value of the HVCB can be got through recursion operation with the unitary formula.
基于现有循环不变式开发技术中的递归定义思想，提出了开发复杂递归问题循环不变式的两种新策略；
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.
对使用形式化方法及循环不变式开发新策略开发非递归算法作了较深入的实践和探讨。
The paper contributes to developing non-recursive algorithm using formal method and new strategy of developing loop invariant.
该方法是基于最小相位滤波器的复倒谱系数和其群迟延函数以及其系统函数之间的关系，通过一个非线性的递归方程求解分母多项式的系数。
Based on the relationship between the group delay function and the cepstral coefficients, the denominator polynomial coefficients can be determined through a nonlinear recursive difference equation.
设计和实现了一种得到分布式程序的所有文件生成树的递归算法。
A realizable recursive algorism is proposed to search all the File Spanning Trees for a given program in the distributed system.
本文解决了整环上两条序列的最短线性递归问题，并给出了递归极小多项式的方法。
This paper presents a solution to the problem of the shortest linear recurrence of two sequences over an integral domain and describes the recurrence of the minimal polynomial.
递归一般在嵌入式系统中是不充许的，因为它常常占有大量的堆栈空间。
Recursion should generally be avoided in an embedded system, since it frequently requires a large stack.
第二章刻画了一类满足三项递归关系的实零点多项式序列的零点位置和零点重数的关系。
In the second chapter, we characterize the relations between locations and multiplicities of zeros of a sequence of real-rooted polynomials defined by a three-term recurrence relation.
第二章刻画了一类满足三项递归关系的实零点多项式序列的零点位置和零点重数的关系。
In the second chapter, we characterize the relations between locations and multiplicities of zeros of a sequence of real-rooted polynomials defined by a three-term recurrence relation.
应用推荐