• In the hilum is a small yellow tan granuloma in a hilar lymph node next to a bronchus.

    淋巴结靠近支气管处有一个块黄褐色肉芽肿

    youdao

  • Next, bind each data node in the data instance to the XFDL items on the form.

    接下来,将数据实例中的每个数据节点绑定表单XFDL元素。

    youdao

  • Next, any extended data is applied to this node object.

    接下来,将任何扩展数据应用这个节点对象。

    youdao

  • When the client begins its next transaction, it contacts the same node, possibly to be redirected once again.

    客户开始下一个事务时,会联系相同节点,也可能再次重定向。

    youdao

  • Next, at point (3), the user exit is invoked after the node processing is completed.

    接下来(3)处,节点处理完成调用用户出口

    youdao

  • The mapped message is then returned to the message flow, and processing continues with the next step (node) in the flow.

    然后将映射消息返回消息处理工作在流中的下一个步骤(节点)处继续。

    youdao

  • Due to partial parsing the message tree will not be parsed completely and the message will be routed to next node.

    由于消息进行部分解析并不完全解析,因此消息路由下一个节点。

    youdao

  • The arrows in this diagram represent Pointers to the location of the next node in memory.

    中的箭头表示指向内存中下一个节点位置指针

    youdao

  • 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.

    在下一个循环中,节点父节点成了相关节点,再次从此节点开始检查四个先决条件,查看是否需要再次执行上面操作

    youdao

  • The reference for the next child node is loaded (line 7) before any other processing is done for the current child.

    当前节点进行任何其它处理之前,先装入个子节点引用(第7行)。

    youdao

  • 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.

    可以使用下一屏幕缺省位置接下来两个屏幕上的缺省节点主机端点也是如此。

    youdao

  • Next provide a name for this node; for example purposes, call it CNS.

    接下来,要节点提供一个名称例如cns

    youdao

  • The scheduler then, to be fair, picks the left-most node of the red-black tree to schedule next to maintain fairness.

    为了公平度器然后选取红黑最左端的节点调度下一个以便保持公平性。

    youdao

  • 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大多一般情况下是如此。

    youdao

  • Next, configure the custom node parts for deployment as figure 12 shows.

    接下来配置定制节点部分图12。

    youdao

  • The function returns the "next" (perhaps the same) node.

    函数返回下一个”(也许是同一个)节点

    youdao

  • Click Next and verify (or change) the host name and node name.

    单击Next验证(更改)主机节点名。

    youdao

  • Next, you invoke CAS and copy the new node to the top location.

    接下来调用CAS 内置函数,把新的节点复制top 位置。

    youdao

  • Specify the Cubing model generated above and the target as the database node of the physical data model, then click Next.

    指定上面生成Cubing模型目标作为物理数据模型的数据库节点然后单击Next

    youdao

  • Choose one node and the target disk. Next, run the command.

    选择一个节点目标磁盘

    youdao

  • You can represent the transition function as a two dimensional matrix, dtran, that returns the next state given an XML node.

    可以转换函数表示矩阵dtran ,它会返回给定XML 节点一个状态

    youdao

  • Each propagation is split from the next by the FileOutput node padding its length to a required length using the padding bytes.

    FileOut put节点使用填充字节每次传播长度填充至所需的长度,从而拆分每次传播。

    youdao

  • From the standpoint of a single thread, a new node is created whose next pointer points to the top of the stack.

    单一线程角度来看创建了一个节点next指针指向堆栈的顶部

    youdao

  • In the quiescent state, the next field of the link node pointed to by the tail is always null; in the intermediate state, it is always non-null.

    静止状态时指针指向链接节点next字段null,而在中间状态时,这个字段为非null

    youdao

  • The next two columns show the setting for Thread and Node.

    接下来显示ThreadNode设置

    youdao

  • Figure 4. DelimitedEach propagation is split from the next by the FileInput node identifying delimiter characters.

    4.Delimited——FileInput节点通过确定分隔符来拆分每次传播

    youdao

  • 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?

    迭代实际上包含三种操作start(节点查找startloc);next(给定一个loc,查找一个loc),以及end

    youdao

  • This function returns an anonymous visitor function that will jump to the next node if the node is not of the correct type.

    函数返回匿名访问者函数,如果节点类型正确,则该函数跳转一个节点。

    youdao

  • The next step establishes what physical devices from each node are connected to each network.

    下一步确定每个节点哪个物理设备连接每个网络

    youdao

  • The default just includes the next line as more text within the current node.

    缺省情况下,只是包括作为当前节点额外的文本

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定