这两个函数均按照深度优先的顺序遍历树，但两者的差异在于先访问一个节点还是先访问其子节点。
Both functions walk the tree in depth-first order but they differ in whether a node is visited before or after its children.
您虽然不能够对注册表自由控制，但您的确可以通过一个公共根节点访问所有的应用程序。
You don't have free rein in the Registry, but you do have access from a common root node for all your applications.
需要访问集群文件系统的每个节点都需要存储网络上的一个地址。
Each node requiring access to the clustered file system needs an address on the storage network.
因为其是一个唯一索引扫描，所以在访问路径图中不显示FETCH或表节点。
There is no FETCH or table node shown in the access path graph because it is an index-only scan.
为了说明这个作法，图5显示一个虚构的迭代器的状态，它能够向后移动一、二、三、四个位置，但不能移动更多位置，因为这要求访问前面访问的叶节点。
To illustrate, Figure 5 shows the state of a hypothetical iterator that can move back one, two, three, or four places, but no more, because that would require accessing the previously visited leaf.
消息流编辑器现在可以记住访问特定节点时的最后一个制表位。
The Message Flow Editor will now remember the last TAB that you visited for a particular node.
图4展示了一个更类似的场景——事务中的第二个查询需要访问与第一个查询相同的节点上的数据。
Figure 4 shows a more likely scenario — that the second query in the transaction needs to access data on the same node as the first query.
如果类型图中的一个节点看起来过大，您可双击它，向下访问到字段布局视图(如图23所示)。
If a node in a type graph seems suspiciously large, you can double-click on it to drill down to the field layout view (Figure 23).
在访问计划图的表或索引节点上会有一个RUNSTATSTIMESTAMP属性，它表示收集统计数据的时间。
There is an attribute RUNSTATS TIMESTAMP on the table or index node of the access plan graph that indicates the last time when the statistics were collected.
即便有正则表达式的帮助，如何排除所访问节点最后一个标记中的值也需要动点脑筋。
Even with the help of regular expressions, you'd need to think a little about how to exclude the value from the last tag that's in the visits node.
当访问程序到达其中一个节点时，它会访问表示了该名称的源文件的PDOMFile对象。
When the visitor reaches one of these nodes, it accesses a PDOMFile object representing the name's source file.
为了给一个图案引入噪声，Hopfield要访问节点数组中的每一个地址。
To introduce noise into a pattern, the Hopfield net visits each address in the array of nodes.
如果感兴趣，该节点调用访问程序的visit方法，该方法返回下列三个值中的一个。
If the visitor is interested, the node calls the visitor's visit method, which returns one of three values.
检查ASTVisitor的Boolean字段中的一个，来确定访问器是否对访问此节点感兴趣。
It checks one of the ASTVisitor's Boolean fields to determine if the visitor is interested in visiting this node.
在访问路径图中，一个索引扫描通常作为一组四个节点显示在QueryTuner上。
An index scan is typically shown in Query Tuner as a group of four nodes in the access path graph.
最后一个元素selectURL是门户生成的URL，用于从菜单访问节点页。
The last element, selectURL, is the URL generated by the portal to access the node page from the menu.
同样，访问路径图的最后一步要评估8次，通过第一个NLJOIN节点产生的每条记录都要评估一次。
Similarly, the last leg in the access path graph is evaluated eight times, once for each record produced by the first NLJOIN node.
因此，Tree小部件可以以各种格式访问数据，比如一个数据存储，其中条目引用它们的父节点。
Therefore, the Tree widget can access data in various formats, such as with a data store where items reference their parents.
如果您要部署到一个名为xxx . yyy .zzz的可从因特网访问的节点(端口为ppp)，那么将每个localhost： 9080实例改成xxx . yyy . zzz：ppp，如在端口80部署，则改成xxx . yyy . zzz。
If you are deploying on an Internet-accessible node called xxx.yyy.zzz on port PPP then modify every instance of localhost: 9080 to xxx.yyy.zzz: PPP, or xxx.yyy.zzz if deploying on port 80.
RADIUS客户机是网络访问服务器，它通常是一个路由器、交换机或无线访问点(访问点是网络上专门配置的节点；wap是无线版本)。
The RADIUS client, the network access server, is typically a router, switch, or wireless access point (access points are specially configured nodes on networks; WAPs are wireless versions).
此函数返回一个匿名访问者函数，如果节点的类型不正确，则该函数将跳转到下一个节点。
This function returns an anonymous visitor function that will jump to the next node if the node is not of the correct type.
这个简单函数创建了一个表格节点，然后循环访问书的列表并为每本书创建一行，为每个数据元素分配一个单元格。
This simple function creates a table node, then iterates through the book list and creates a row for each book, with a cell for each data element.
分析API通过提供一个公用的访问者类和抽象查询机制，消除了和访问AST节点相关联的大部分挑战。
The analysis API eliminates most of the challenges associated with visiting AST nodes by providing a common visitor class and abstracting the query mechanism.
所匹配的函数类似于我们之前的访问者函数，但在开始时会获取一个要搜索的节点类型。
The matched function is like our prior visitor functions but takes a node type to search for at the beginning.
从访问提示节点开始，遍历每一个节点。
Start by accessing the Suggestions nodes and iterating through each one.
由于每个节点都应该配置一个与节点名对应的主机名，因此也简化了网络访问。
And since each node should be configured with a host name that corresponds to the node name, network access is simplified, as well.
与此相似，创建能够检查将导致跳转到下一个节点或彻底取消迭代的情况的访问者也是非常有用的。
Similarly, it is useful to create visitors that can check for cases that should cause skipping to the next node or aborting the iteration completely.
如果内容示意图中的一个节点看起来过大，您可向下访问到显示该实体实现细节的视图。
If a node in a content schematic seems suspiciously large, you can drill down to a view that shows the implementation details of that entity.
我们首先遍历树，传递一个仅打印所访问的节点并返回该节点的函数。
We first walk the tree and pass a function that merely prints the node being visited and returns the node.
当一个集群节点将磁盘资源脱机时，它将申请SCSI占用释放，于是该磁盘对于操作系统变得不可访问。
When a cluster node takes a disk resource offline, it requests that the SCSI reserve be released and then the drive will once again be unavailable to the operating system.
应用推荐