在诉说著一个更为各态遍历的区呢。
前序遍历的递归算法如何回到父母吗？
How does the recursion preorder traversal algorithm go back to parent?
换句话说，该类的任何实例都是不可遍历的。
In other words, any instance of this class won't be focus traversable.
可能需要在遍历的过程中更改集合的元素。
You might need to change the elements of the collection in the middle of a traversal.
Versa 以向后遍历的形式提供这一操作。
Versa provides this operation in the form of a backward traversal. For example
扩充分支总是包含在当前步骤遍历的顶级列表中。
The enrichment branch is always contained within the top-level list that the current step is iterating through.
算法只需通过设置参数开关来控制遍历的方式。
This arithmetic is simply achieved by setting parameter switch to control the traverse way.
将被遍历的元素的内容转换为一组作为数组存储的中介表示。
Convert the content of traversed elements into a set of intermediate representations stored as arrays.
DPTK查询表达式语言提供用于指定模型遍历的多种步骤。
The DPTK query expression language provides for several kinds of steps with which to specify model traversals.
请注意，您是通过wiki：entry[1]进行遍历的。
这是数据结构的一个遍历的简单算法，希望对初学者有所帮助。
This is the data structure of a simple traversal algorithm, and they hope to be helpful to beginners.
内部存储结构很容易影响API架构，以及信息检索与遍历的方式。
The internal structure of the storage can easily affect the API architecture and the way information is retrieved and traversed.
创建一个变量，指向要遍历的数组或集合，然后对定义的变量进行操作。
The long and the short of it is that you create a variable, indicate the array or collection to iterate over, and then operate upon the variable you defined.
为了简化遍历需求，QueryPath提供了一些用于遍历的方法。
To facilitate the many traversal needs, QueryPath provides several methods for traversing.
XPath表达式必须指向在处理扇出原语期间可以遍历的元素数组。
This XPath expression must point to an array of elements that can be iterated over during the processing of the Fan Out primitive.
使用索引来遍历一个序列中的值的时候，弄清楚遍历的开头和结尾很不容易。
When you use indices to traverse the values in a sequence, it is tricky to get the beginning and end of the traversal right.
应用其方法研究了一类扩展的分支过程，得到该过程强遍历的一个必要条件。
Applying the ideas for an extended class of continuous-time branching processes, one necessary condition is obtained for the strong ergodicity of the processes.
由for-yield表达式产生的集合类型会从被遍历的集合类型中推断。
The type of the collection resulting from a for-yield expression is inferred from the type of the collection being iterated over.
二叉树遍历的非递归算法相对于递归算法，减少了函数调用等开销，具有性能优势。
Compared with recursive algorithm for binary tree traversing, non-recursive algorithm reduces expenses of function calls, gains performance advantage.
迭代器功能强大，因为您可以添加要遍历的新类型条目，并且无需更改遍历条目的代码。
An iterator is powerful because you can add new types of items through which to iterate, and you don't have to change the code that loops through the items.
它将所能看到的未来称作“湍流”——这个遍历的过程需要将精力高度集中在手头的任务上。
He once described the future as "the rapids" -traversable terrain that required intense concentration on the task in hand.
这个变量应该有自己的类型，这样，它就可以与将遍历的列表、数组或集合中的每一个项兼容。
This variable should be typed so that it's compatible with each item in the list, array, or collection being iterated over.
输入输出消息需要遍历的队列管理器越少，处理消息的成本就越低，由此可获取更快的消息速度。
The fewer queue managers that input and output messages have to traverse the cheaper the cost of processing the messages and therefore the higher the message rate that can be obtained.
这个变量应该有自己的类型，这样，它就可以与将遍历的列表、数组或集合中的每一个项兼容。
This variable should be typed so that it's compatible with each item in the list, array , or collection being iterated over.
虽然，下一个焦点可遍历的可见组件获取初始的焦点也是合理的，但这的确依赖于本机焦点管理器。
Although it makes sense for the next focus traversable visible component to get the initial focus, it really depends on the native focus manager.
在此基础上，采用深度优先遍历的递归理论和数据库技术，实现了流域节点间关系的计算机存储。
In these foundations, the recursion theory of depth first traversal, database technology and visual programming technology are employed to computer memory, which is expressed to node relations.
DOM和zend类提供了更好的支持，即将所有名称空间的元素表示为可按层次遍历的节点或元素。
DOM and the Zend classes provide better support by presenting all elements of all namespaces as individual hierarchically-traversable nodes of other elements.
弄清楚需要遍历的东西，弄清楚我需要遍历的东西的集合，弄清楚我在每一步该做什么，弄清楚终结测试。
Figure out what I'm trying to walk through what's the collection of things I'm trying to walk through. Figure out what I want to do at each stage. Figure out what the end test is.
如果您的程序需要遍历文件系统(递归地遍历子目录)，那么要提防攻击者可能会利用您正在遍历的目录结构。
If your program walks the file system, recursively iterating through subdirectories, be careful if an attacker could ever manipulate the directory structure you're walking.
查询9没有为该员工生成一行，因为for循环遍历的是不同的office值，这些值不包括丢失的办公室信息。
Query 9 doesn't produce a row for that employee because the for loop iterates over the distinct office values which do not include missing office information.
应用推荐