The arrows in this diagram represent Pointers to the location of the next node in memory.
图中的箭头表示指向内存中下一个节点位置的指针。
End handler waits until all child tokens are completed and then transitions to the next node.
End处理器等待所有的子令牌完成，然后transition到下个节点。
It then reads the end tag node, reads the next node, and then positions itself on the next subsequent node.
随后，其会读取结束标记节点、读取下一个节点，然后将其自身置于下一个后续节点上。
Due to partial parsing the message tree will not be parsed completely and the message will be routed to next node.
由于对消息树进行部分解析时并不会完全解析，因此消息将路由到下一个节点。
Passing: jump indicates that iteration should jump to the next node and skip all remaining visitors for this node.
传递：jump表示迭代应跳转到下一个节点，并跳过此节点的所有剩余访问者。
Thirdly, the platform transmits data to next node through the best link according to the route-choosing algorithm.
第三，此平台通过路由选择算法得出最优链路来将信息和数据及时地转发到下一节点。
The next node is a Compute node named Length Processing, which interprets the first four bytes of the message data.
下一个节点是名称为LengthProcessing的Compute节点，它将对消息数据的前四个字节进行解释。
This element likely has a single text node child, which you can read by advancing the parser to the next node like so.
该元素可能有单个文本子节点，可以通过将解析器前进到下一个节点来进行读取，如下所示。
This function returns an anonymous visitor function that will jump to the next node if the node is not of the correct type.
此函数返回一个匿名访问者函数，如果节点的类型不正确，则该函数将跳转到下一个节点。
Here you have a struct that includes the first element as a data item and the second element as a pointer to the next node.
这样您就拥有了一个struct，其中第一个元素为数据条目，第二个元素为指向下一个节点的指针。
Each node consists of two parts: one is stored data element data fields, the other is a storage next node address pointer domain.
每个结点包罗两个局部：一个是存储数据元素地数据域，另一个是存储下一个结点地址地指针域。
This algorithm employs probes to search feasible paths in parallel, and USES heuristic functions to randomly select a suitable next node.
算法采用探测包并行地搜索可行路径，并使用启发式函数随机选择下一跳节点。
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.
与此相似，创建能够检查将导致跳转到下一个节点或彻底取消迭代的情况的访问者也是非常有用的。
Next, bind each data node in the data instance to the XFDL items on the form.
接下来，将数据实例中的每个数据节点绑定到表单上的XFDL元素。
When the client begins its next transaction, it contacts the same node, possibly to be redirected once again.
当客户端开始它的下一个事务时，它会联系相同的节点，也可能被再次重定向。
Next, at point (3), the user exit is invoked after the node processing is completed.
接下来在点(3)处，在节点处理完成后调用了用户出口。
Looking at just the leaf node, this resembles the source code to a fair extend. Next this is translated into the machine code of the regular expression engine.
它的叶子节点就好像一种略加扩展的源代码，而下一步便是把它转换为正则表达式引擎所使用的机器码。
The mapped message is then returned to the message flow, and processing continues with the next step (node) in the flow.
然后将映射的消息返回到消息流，处理工作将在流中的下一个步骤(节点)处继续。
The parent's parent is the node of interest next round and the four prerequisites are checked again from this new node to see whether the above operations need to be performed again.
在下一个循环中，父节点的父节点成了相关节点，再次从此新节点开始检查四个先决条件，查看是否需要再次执行上面的操作。
The reference for the next child node is loaded (line 7) before any other processing is done for the current child.
在对当前子节点进行任何其它处理之前，先装入下个子节点的引用(第7行)。
The default location on the next screen will be fine, as will the default node and host names, and ports on the following two screens.
可以使用下一屏幕上的缺省位置，接下来两个屏幕上的缺省节点和主机名、端点也是如此。
The scheduler then, to be fair, picks the left-most node of the red-black tree to schedule next to maintain fairness.
为了公平，调度器然后选取红黑树最左端的节点调度为下一个以便保持公平性。
Nothing inherent in the algorithm says that if the last node was numbered 19, the next one will be numbered 20, yet in most common cases that is indeed the case.
算法中并没有指定如果上一个节点的号码是19，那么下一个的编号就是20，但大多一般情况下都是如此。
Next, configure the custom node parts for deployment as figure 12 shows.
接下来，配置定制节点部分，见图12。
Next, provide the name of the database to access on the CNS node, as shown below.
接着，提供该数据库的名称，以在CNS节点上进行访问，如下所示。
Next, you add a standard break tag, br, and finally, the node that contains the actual note text.
接下来，添加一个标准的break标记br，最后添加包含实际节点文本的节点。
Specify the Cubing model generated above and the target as the database node of the physical data model, then click Next.
指定上面生成的Cubing模型和目标作为物理数据模型的数据库节点，然后单击Next。
You can represent the transition function as a two dimensional matrix, dtran, that returns the next state given an XML node.
可以将转换函数表示为两维矩阵dtran ，它会返回给定XML 节点的下一个状态。
Each propagation is split from the next by the FileOutput node padding its length to a required length using the padding bytes.
FileOut put节点使用填充字节将每次传播的长度填充至所需的长度，从而拆分每次传播。
From the standpoint of a single thread, a new node is created whose next pointer points to the top of the stack.
从单一线程的角度来看，创建了一个新节点，它的next指针指向堆栈的顶部。
应用推荐