
词语导航
基本信息
词语:下一个节点
繁体:下一個節點
拼音:xià yī gè jié diǎn
英语翻译
【计】 next node
分词翻译
下一个的英语翻译:
next节点的英语翻译:
【计】 node; node point【化】 nodal; nodal point; node
【医】 Gaussian points; nodal points
【经】 node
翻译例句
1. 纠正方法相当简单:不存储下一个节点。
The fix is reasonably simple: Don"t store the next node.
2. 图中的箭头表示指向内存中下一个节点位置的指针。
The arrows in this diagram represent Pointers to the location of the next node in memory.
3. 为了获得列表的下一个节点,您需要使用cdr函数。
To retrieve the next node of a list, you need to use the function CDR.wwW.WENtIyI.com
4. 由于对消息树进行部分解析时并不会完全解析,因此消息将路由到下一个节点。
Due to partial parsing the message tree will not be parsed completely and the message will be routed to next node.
5. 传递:jump表示迭代应跳转到下一个节点,并跳过此节点的所有剩余访问者。
Passing: jump indicates that iteration should jump to the next node and skip all remaining visitors for this node.
6. 此函数返回一个匿名访问者函数,如果节点的类型不正确,则该函数将跳转到下一个节点。
This function returns an anonymous visitor function that will jump to the next node if the node is not of the correct type.
7. 如同数据从一个节点通过到下一个节点,数据的运动显示为气泡沿着连线移动。
As data passes from one node to another, the movement of data is marked by bubbles moving along the wires.
8. 该元素可能有单个文本子节点,可以通过将解析器前进到下一个节点来进行读取,如下所示。
This element likely has a single text node child, which you can read by advancing the parser to the next node like so.
9. 与此相似,创建能够检查将导致跳转到下一个节点或彻底取消迭代的情况的访问者也是非常有用的。
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.
10. 随后,其会读取结束标记节点、读取下一个节点,然后将其自身置于下一个后续节点上。
It then reads the end tag node, reads the next node, and then positions itself on the next subsequent node.
11. 这样您就拥有了一个struct,其中第一个元素为数据条目,第二个元素为指向下一个节点的指针。
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.
12. 另外一个数据存储方式叫链接,通过在数据节点中增加一个指向下一个节点的指针来对数据进行存储。
An alternative is a data storage method called a linked list, in which each piece of data includes a "pointer" that indicates the location of the next piece.
13. 下一个节点是名称为LengthProcessing的Compute节点,它将对消息数据的前四个字节进行解释。
The next node is a Compute node named Length Processing, which interprets the first four bytes of the message data.
14. 麦克称,Manet的体系结构包括建立一个路由表,每个节点不仅知道其“单跳”相临节点,还应知道与其他相临节点的下一个节点。
Macker said the Manet architecture involves building a routing table in which each node knows not only its neighbors one hop away but also the nodes next to those neighbors.
15. 换句话说,与依赖节点本身上指定的记录长度或分隔符不同,应该使用代理的解析器之一来决定一个记录从何处结束以及下一个记录从何处开始。
In other words, rather than rely on a record Length or Delimiter specified on the node itself, one of the broker"s parsers should be used to decide where one record ends and the next begins.
16. 可以将转换函数表示为两维矩阵dtran ,它会返回给定XML节点的下一个状态。
You can represent the transition function as a two dimensional matrix, dtran, that returns the next state given an XML node.
17. value是节点的下一个文本内容。
Value is the node"s text content.
18. size的实现将不得不依次获取各个bucket的锁,对该bucket中的节点进行计数,释放锁,然后继续到下一个bucket。
An implementation of size would have to sequentially acquire the lock for each bucket, count the number of nodes in that bucket, and release the lock and move on to the next bucket.
19. 迭代实际上包含三种操作:start(从根节点处查找startloc);next(给定一个loc,查找下一个loc),以及end ?
Iteration essentially consists of three operations: start (find the start loc from the root node); next (given a loc, find the next loc), and end?
20. 当客户端开始它的下一个事务时,它会联系相同的节点,也可能被再次重定向。
When the client begins its next transaction, it contacts the same node, possibly to be redirected once again.
21. 然后将映射的消息返回到消息流,处理工作将在流中的下一个步骤(节点)处继续。
The mapped message is then returned to the message flow, and processing continues with the next step (node) in the flow.
22. 为了升级到下一个发布版本,集群中的所有节点都必须停止运作。
All nodes in the cluster must be brought down in order to upgrade to the next release level.
23. 缺省情况下,每个新创建的节点代理都将按顺序赋予下一个未使用的数字,例如从BBON002、BBON003到BBONXXX。
By default, each new node agent created is given the next free number in the sequence, for example, BBON002, BBON003 to BBONXXX.
24. 在下一个循环中,父节点的父节点成了相关节点,再次从此新节点开始检查四个先决条件,查看是否需要再次执行上面的操作。
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.
25. 为了公平,调度器然后选取红黑树最左端的节点调度为下一个以便保持公平性。
The scheduler then, to be fair, picks the left-most node of the red-black tree to schedule next to maintain fairness.
26. 在下一个对话框中,选择中介运行的节点。
In the next dialog, select the node where the mediation will run.
27. 在下一个示例中,两个星号可表示名称中间的多个节点。
In the next example, the double asterisk substitutes for multiple nodes in the middle of a name.
28. 算法中并没有指定如果上一个节点的号码是19,那么下一个的编号就是20,但大多一般情况下都是如此。
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.
29. 函数返回“下一个”(也许是同一个)节点。
The function returns the "next" (perhaps the same) node.
30. FileInput节点可以使用现有的消息集模型解析各个记录,以及用于记录检测(确定一个记录从何处结束以及下一个记录从何处开始)。
Existing message set models can be used by the FileInput node for parsing individual records and for record detection (identifying where one record finishes and the next one starts).
版权声明:问题易所有作品(图文、音视频)均来源网络,版权归原创作者所有,与本站立场无关,如不慎侵犯了你的权益,请联系我们告知,我们将做删除处理!
