Compared with recursive algorithm for binary tree traversing, non-recursive algorithm reduces expenses of function calls, gains performance advantage.
二叉树遍历的非递归算法相对于递归算法，减少了函数调用等开销，具有性能优势。
Such modifications of the document structure during parsing can result in a smaller memory footprint for the DOM tree, and also reduce the time spent traversing a document and modifying it in memory.
这种在解析期间修改文档结构的做法可以使 DOM树占用更少的内存，而且还可以减少在内存中遍历和修改文档时所花的时间。
Traversing the JSF component tree recursively.
递归式遍历JSF组件树。
Traversing that tree, you will eventually find the JIT code buffer (also commonly known as the code cache).
通过树，你最后会找到JIT代码缓冲。
Note that in traversing a tree, at any point in the traversal, a node can be the root of a new subtree.
注意在穿越树中，任何的点，一个节点都可能是新的子树的根。
Part 2 shows how to save the form data of the current view by traversing the JSF component tree and getting the values of the input components.
第2部分展示了如何通过遍历jsf组件树并获取输入组件的值来保存当前视图的表单数据。
Regular expressions provide much richer pattern matching across strings of text, but are as easy to use as XPath when traversing a data structure such as an XML tree.
正则表达式提供了跨文本的字符串的更丰富的模式匹配，但在遍历诸如xml树这样的数据结构时，它和XPath一样易于使用。
While XPath provides a compact and elegant way of traversing an XML tree, its pattern matching functions have a rather limited capability.
尽管XPath提供了一种紧凑和优雅的方式来遍历xml树，但其模式匹配函数的能力相当有限。
Next, you'll see how to create a custom component that sets the styleClass attribute for all its nested components, traversing the JSF component tree recursively.
接下来，您会看到如何创建一个定制组件来为它的所有嵌套组件设置styleclass属性，递归遍历jsf组件树。
A well-known solution to the problem of traversing and modifying a tree in functional programming is the zipper, most famously described by Gerard Huet (see Resources).
在函数式编程中，解决遍历和修改树的问题的一种知名的解决方法就是zippers (zipper)，因gerard Huet(参见参考资料)的描述而闻名于世。
Usually, using SimpleParse means generating a parse tree in one function call, then traversing this tree in separate code.
一般来说，使用SimpleParse就意味着在一个函数调用中生成一个解析树，然后在分开的代码中遍历这个树。
The current state of the router including a tree of the currently activated routes in our application along convenience methods for traversing the route tree.
路由器的当前状态包含了一棵由程序中激活的路由构成的树。它包含一些用于遍历路由树的快捷方法。
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.
对二叉树的遍历过程进行深入地研究，提出一种生成二叉树遍历序列的新方法，解决了二叉树遍历序列的生成问题。
This paper discusses the application of adjacency matrix at the algorithm's analysis for traversing Graph, Minimum cost Spanning Tree, Topological sort and Critical Path.
对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。
By using binary tree instead of2-D table, the new method can avoid of traversing in whole table to find a matched code, and can speedup lookup pro cess2 ~ 3times.
通过将二维码表转换成二叉树形式，避免了对整个码表的遍历查找过程，使查找速度提高了2 ~3倍。
The hierarchical graph is drawn and other researches on fuzzy cluster analysis are made with a computer by traversing the multi -ranched tree.
通过遍历此树，用计算机完成模糊聚类分析中谱系图绘制等多项工作。
Binary tree operation: create a binary tree, before traversing binary, inorder, postorder binary tree traversal.
说明：二叉树操作：建立二叉树，前序遍历二叉树、中序、后序遍历二叉树。
Property inheritance works by traversing a tree of elements.
属性继承通过遍历元素树来工作。
In addition, we add a bit string to each node in the tree to store the prefix of the items. By using the structure we can avoid repeatedly traversing the sub-tree while expanding the patterns.
除此之外，算法对频繁模式树中每个节点增加一个位串来存储该项目的前缀项目，以避免在模式扩展的时候频繁的遍历子树。
These algorithms will build the tree structure to store the paths sequence data and mine the path by traversing the tree.
此二演算法主要以树状结构储存路径资料再利用走访树状结构的方式加以探勘。
These algorithms will build the tree structure to store the paths sequence data and mine the path by traversing the tree.
此二演算法主要以树状结构储存路径资料再利用走访树状结构的方式加以探勘。
应用推荐