• For example, a leaf node knows itself and its parent.

    例如,一个叶节点知道它自身及其父节点。

    youdao

  • The XPath for a computed value should be a leaf node only.

    计算出的值的XPath只能是叶节点。

    youdao

  • Each CDATA section, comment, processing instruction, and non-leaf node is assigned a binary codeword.

    每个CDATA部分、注释、处理指令和非叶节点都被分配一个二进制代码字。

    youdao

  • In an HDBMS like the one illustrated above, the only way to discover this would be an extremely costly search of every book leaf node.

    在上面举例说明的HDBMS中,找到答案的唯一方法是搜索每个书籍叶节点,而这样做的成本极其高。

    youdao

  • The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.

    最小深度是指从根节点出发到达最近的叶子节点所需要经过的节点个数。

    youdao

  • For information on how to remove a leaf node or entire node subtree from a document, see Removing Nodes from the DOM.

    有关如何从文档中移除叶节点或整个节点子树的信息,请参见从DOM中移除节点。

    youdao

  • Note: If you are connected to a non-root node or a leaf node, the information that you can view and the actions that you can take are limited.

    注意:如果您连接到非根节点或叶节点,您可以查看的信息和可以采取的操作将受到限制。

    youdao

  • This framework is of layered and distributed structure, including a central control node layer, a convergent node layer and a leaf node layer.

    该框架是分层分布式结构,由中央控制节点层、汇聚节点层和叶节点层构成。

    youdao

  • In the network model, Nodes change between the three roles: root node, branch node and leaf node, to organize and maintain the network tree structure.

    在该网络模型中节点在三种角色之间变化:根节点,分支节点和叶子节点,来组织和维护树型网络结构。

    youdao

  • For large files (including those that are fragmented), an inode can reference an index node, each of which can reference a leaf node (referencing multiple extents).

    对于大文件(包括片段文件),一个inode能够引用一个索引节点,而每个索引节点能够引用一个叶节点(引用多个区段)。

    youdao

  • Based on faceted classification schema and theory of tree mapping, a novel matching model named leaf node containment matching model and correspondence retrieving algorithm are put forward.

    在分析了构件刻面分类模式和树映射相关理论的基础上,提出了一个新颖的叶节点包容匹配模型,并给出了相应的检索算法。

    youdao

  • Based on faceted classification schema and theory of tree mapping, a novel matching model named leaf node containment matching model and correspondence retrieving algorithm are put forward.

    在分析了构件刻面分类模式和树映射相关理论的基础上,提出了一个新颖的叶节点包容匹配模型,并给出了相应的检索算法。

    youdao

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

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

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