直到到指定的叶子结点，然后将遍历过程中标记的0,1代码存在一个数组中。
Up to the designated leaf nodes, and then traverse the process of marking the existence of a 0, 1 code array.
该方法通过先序遍历哈夫曼树，记录遍历过程，得到存储哈夫曼码表的一种数据结构。
The method gets a data structure for storing static Huffman coding by preordering traverse Huffman binary tree and recording the course of traverse.
遍历过程中创建一个单选按钮和一个包含提示的标签，然后将它附加到错误消息，显示给用户。
During iteration, you create a radio button and a label that includes the suggestion, then you append it to a custom error message and display it to the user.
我们还需要一种zippers实现，它应能够在遍历过程中处理标准Clojure数据结构。
We also need a zipper implementation that can deal with the standard Clojure data structures during traversal.
对二叉树的遍历过程进行深入地研究，提出一种生成二叉树遍历序列的新方法，解决了二叉树遍历序列的生成问题。
By careful researches of the traversal of binary tree, a new method of traversing binary tree is brought forward, which is able to solve the problem of traversal of binary tree.
以下步骤将使我们遍历将WAR文件部署到门户网站中的整个过程。
The following steps walk us through the process of deploying the WAR file into the portal.
为了带领您遍历使用PDTK的整个过程，让我们来了解一个死锁场景。
To walk you through the process of using the PDTK, let's look at a deadlock scenario.
集合框架引入了迭代器，用于遍历一个列表或者其他集合，从而优化了对一个集合中的元素进行迭代的过程。
The Collections framework introduced iterators for traversing a list or other collection, which optimizes the process of iterating through the elements in a collection.
如果必须遍历一个10,000元素的hash表，那么就没有办法简化这个过程。
If you have to work through a 10,000-item hash, there's no way of simplifying that process.
清单8演示了这个过程，它遍历提要中的各项并为每一项创建一个数组。
Listing 8 does just this, iterating over the items in the feed and creating an array for each.
用一个文档遍历转换过程。
而且可以使用其中的可视化调试器来调试中介流，在这个可视化调试器中查看消息值的过程中，可以添加断点并单步跳入、单步遍历或单步跳过感兴趣的部分。
Moreover, you can debug mediation flows using an in-place visual debugger where you can add breakpoints, and step into, through, or over areas of interest while inspecting the values of the messages.
它将所能看到的未来称作“湍流”——这个遍历的过程需要将精力高度集中在手头的任务上。
He once described the future as "the rapids" -traversable terrain that required intense concentration on the task in hand.
它递归地遍历一组目录，在这个过程中应用样式表。
It recursively walks through a set of directories, applying the style sheet as it goes along.
在第一节中描述的情景用于遍历服务的生命周期中不同过程，尤其是服务的迁移和扩充。
The scenario described in the first sections was used to step through different processes during the service’s lifetime, in particular migration and scaling of the service.
上例中的过程添加了新的客户和订单，然后遍历订单号2000以下的订单项。
The procedure in the example above adds the new customer and order, and then goes through the items ordered under order number 2000.
它只做最基本的事：递归地遍历源目录，在此过程中将样式表应用到每个XML文件以产生html格式的网站。
It does only the most basic thing: it recursively walks through a source directory, applying a style sheet on every XML file along the way to produce the Web site in HTML.
简单的非递归过程表达式并不能访问所有的元素，尽管许多库都包含有帮助功能，可以用于遍历树。
No simple non-recursive procedural expression accesses all elements, although many libraries include helper functions for walking the tree.
在SQL过程中，游标不仅仅可以用来遍历结果集中的行。
In SQL procedures, cursors can be used to do more than iterate through rows of a result set.
同样，在同步过程中，脱机服务器会对每一个链接进行遍历，直到达到所配置的链接的最大深度为止。
Again, during synchronization, the offline server traverses every link up until the configured link depth is reached.
扫描会向一个单词进行累积，直到结束（或者是行或列的末尾，或者遇到非字母的块），然后将此单词添加到它寻找过程中遍历的所有字母细胞。
The scan accumulates a word until a break (either the end of a row or column, or a non-letter tile) and then adds the word to all the letter cells it found along the way.
遍历文档的过程中，为当前节点在样式表中选择一个模板。
As it walks through the document, selects a template in the stylesheet for the current node.
PHP中的 SimpleXML模块是对XSLT 的过程响应，可以将 XML文档作为一个标准 PHP 对象进行遍历。
The SimpleXML module in PHP is a procedural answer to XSLT, that lets you traverse an XML document as a standard PHP object.
运行时api，诸如dom，正在倾向于允许程序员编写XPath表达式而不是编写明确的树遍历代码(后者是一个痛苦的过程)。
Runtime APIs, such as DOM, are moving towards allowing programmers to write XPath expressions rather than writing explicit tree traversal code (which can be painful).
本文作为平稳集值随机过程的表示定理的应用，证明了平稳集值随机过程的遍历性定理。
In this paper, we prove the ergodic theorem of a stationary set valued stochastic process by the representation theorem.
应用其方法研究了一类扩展的分支过程，得到该过程强遍历的一个必要条件。
Applying the ideas for an extended class of continuous-time branching processes, one necessary condition is obtained for the strong ergodicity of the processes.
本文给出了具有突变率的广义生-灭过程的常返性、正常返性、指数遍历性及强遍历性的充分必要条件。
The necessary and sufficient conditions for recurrence, positive recurrence, exponential ergodicity and strong ergodicity of the process are presented.
结果表明，该方法通过减少真实、遍历式追踪的次数，能将普通径迹法射线追踪过程的计算量减少到原来的1/3左右。
Results show that, this method could reduce the computational cost to 1/3 of original by decreasing the true and all-over tracing times.
结果表明，该方法通过减少真实、遍历式追踪的次数，能将普通径迹法射线追踪过程的计算量减少到原来的1/3左右。
Results show that, this method could reduce the computational cost to 1/3 of original by decreasing the true and all-over tracing times.
应用推荐