For example, a leaf node knows itself and its parent.
例如，一个叶节点知道它自身及其父节点。
The XPath for a computed value should be a leaf node only.
计算出的值的XPath只能是叶节点。
Eventually, the algorithm reaches a leaf node with the final classification.
最终，算法抵达的叶子节点就是最终分类。
Each CDATA section, comment, processing instruction, and non-leaf node is assigned a binary codeword.
每个CDATA部分、注释、处理指令和非叶节点都被分配一个二进制代码字。
The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
所谓的深度就是指从根节点到最远的叶节点之间的距离。
The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.
最小深度是指从根节点出发到达最近的叶子节点所需要经过的节点个数。
For information on how to remove a leaf node or entire node subtree from a document, see Removing Nodes from the DOM.
有关如何从文档中移除叶节点或整个节点子树的信息，请参见从DOM中移除节点。
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中，找到答案的唯一方法是搜索每个书籍叶节点，而这样做的成本极其高。
You cannot configure a leaf node as the master node because it does not have direct access to all the nodes other than its non-root server.
不能将叶子节点配置成主节点，因为它不能直接访问其非根服务器之外的所有其他节点。
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.
注意：如果您连接到非根节点或叶节点，您可以查看的信息和可以采取的操作将受到限制。
This framework is of layered and distributed structure, including a central control node layer, a convergent node layer and a leaf node layer.
该框架是分层分布式结构，由中央控制节点层、汇聚节点层和叶节点层构成。
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.
在该网络模型中节点在三种角色之间变化：根节点，分支节点和叶子节点，来组织和维护树型网络结构。
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.
它的叶子节点就好像一种略加扩展的源代码，而下一步便是把它转换为正则表达式引擎所使用的机器码。
It is a finite, labeled, directed tree in which the internal nodes are labeled by operators, and the leaf nodes represent the operands of the node operators.
这是一个有限、已标记、导向的树状结构，其中的内部节点会标示运算子，而分叶节点则代表节点运算子的运算元。
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能够引用一个索引节点，而每个索引节点能够引用一个叶节点(引用多个区段)。
If two stores are logically related (as in our example above, where the stores were related by region), then introduce an intermediate node, but keep the stores as leaf nodes.
如果两个商店在逻辑上相关联(如上面的示例，商店通过地域相关联)，则可以引入一个中间节点，但是，要保持商店为叶节点。
For example, if a certain element is always a leaf node in a particular document type (and has no XML attributes), you might want to refer to its PCDATA just by the node name itself.
比方说，如果特定文档中某个元素总是叶子节点(而且没有xml属性)，您可能希望通过节点名本身来引用其PCDATA。
Select the test case MoneyBag Equals (the red leaf node) and locate the problem line in each file. This information is given in the lower part of NUnit's right hand pane, shown in Figure 3 .
选择MoneyBag Equals测试用例（红色的叶结点），并定位到该文件的出错行，此时NUnit的右侧下方会显示相关信息，如图二
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.
在分析了构件刻面分类模式和树映射相关理论的基础上，提出了一个新颖的叶节点包容匹配模型，并给出了相应的检索算法。
Results flow from the bottom of the run tree (leaf nodes) to the top (XTree node) where the result is represented in RSAPI (Resultset API) format and can be sent to the report service for rendering.
结果从运行树（叶子节点）流到顶部（XTree节点），其中结果以 RSAPI (ResultsetAPI)格式表示，且可被发送到报表服务以供呈现。
Each node can be either a branch or a leaf.
每个节点都可以是一个分支或者是一个叶子。
At each node, you answer the question and move on that branch, until you reach a leaf that answers yes or no.
在每个节点，您都会回答这个问题并继续沿着分支下移，直到您到达一个回答了是或不是的叶子节点。
In this pattern, the node and leaf roles are superimposed on existing components, and both need to know their responsibility in implementing the component interface.
该模式中，节点和叶子的角色被添加到已有的组件上，并且它们都需要知道自己在实现组件接口时的职责。
It contains index entries for every text node, i.e. every leaf element value in every XML document in the XML column.
它包含每个文本节点(即xml列中的每个XML文档中的每个叶子元素值)的索引条目。
The IXSCAN node detailed description shows that all of the 1,680 leaf pages are scanned due to the lack of a matching predicate.
由于缺乏匹配的谓词，IXSCAN节点详细描述显示所有被扫描的1,680个叶级页。
Every simple path from a node to a descendant leaf contains the same number of black nodes.
从节点到后代叶节点的所有简单路径都包含相同的黑节点数。
This is unlike the previous scenarios we have seen we could assert that the patterns we complete, an XML node is either a node or a leaf, we did not allow for the possibility of anything else.
这不像之前的例子中，我们能断言一个模式的执行结果，对于xml节点来说不是节点就是叶子，我们也不允许有其他可能的情况存在。
However, you need to make the widget look like an organization (tree node), instead of like an employee (tree leaf).
但是，需要让这个部件看起来像一个组织(树节点)，而不是像职员(树叶)。
However, you need to make the widget look like an organization (tree node), instead of like an employee (tree leaf).
但是，需要让这个部件看起来像一个组织(树节点)，而不是像职员(树叶)。
应用推荐