计算出的值的XPath只能是叶节点。
例如，一个叶节点知道它自身及其父节点。
最佳实践：在组织层次结构的叶节点创建商店。
Best practice: Create stores at leaf nodes in the organizational hierarchy.
文档显示为叶节点。
所谓的深度就是指从根节点到最远的叶节点之间的距离。
The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
从节点到后代叶节点的所有简单路径都包含相同的黑节点数。
Every simple path from a node to a descendant leaf contains the same number of black nodes.
通过每一叶节点以及整个图像的噪声的估计方差变化计算叶节点阈值。
The threshold of each leaf is calculated through the variance of each and the estimated noise variance of the entire image.
每个CDATA部分、注释、处理指令和非叶节点都被分配一个二进制代码字。
Each CDATA section, comment, processing instruction, and non-leaf node is assigned a binary codeword.
该框架是分层分布式结构，由中央控制节点层、汇聚节点层和叶节点层构成。
This framework is of layered and distributed structure, including a central control node layer, a convergent node layer and a leaf node layer.
有关如何从文档中移除叶节点或整个节点子树的信息，请参见从DOM中移除节点。
For information on how to remove a leaf node or entire node subtree from a document, see Removing Nodes from the DOM.
分类阶段从根开始，按照决策树的分类属性逐层往下划分，直到叶节点，获得概念。
Decision Tree Apply Model to Test Data Test Data Start from the root of...
注意：如果您连接到非根节点或叶节点，您可以查看的信息和可以采取的操作将受到限制。
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.
在上面举例说明的HDBMS中，找到答案的唯一方法是搜索每个书籍叶节点，而这样做的成本极其高。
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.
View对象是树的叶节点，而ViewGroup对象是树的分支(参阅楼上的视图层次图)。
View objects are leaves in the tree, ViewGroup objects are branches in the tree (see the View Hierarchy figure above).
LSEQ编码通过记录非叶节点的路径，在节点查询中避免了结构连接操作，提高了查询效率。
Through storing the path of internal nodes, LSEQ enhanced querying efficiency and avoided structure-joining.
该方法以初始点为根节点进行扩展，直至随机树的叶节点中包含了目标点或目标区域中的点为止。
Starting with an initial point as the root, the tree is expanded until the nodes include the goal point or a point within the goal area.
若能把铁线莲种植得足够深，深到能使两组叶子(或叶节点)在土表以下，你就等于给加了它一份保险。
When you plant clematis deep enough to put two sets of leaves (or leaf nodes) under the surface of the soil, you give the plant an insurance policy.
在本示例中，我们将禁用所有的非叶节点，因为通常非叶节点只用来对希望对其执行任务的那些项进行分类。
In this example, we will disable all non-leaf nodes, because it is common that non-leaf nodes are just used for categorizing the items that you want to perform tasks on.
提出了基于六边形格网的三叶节点管理与瓦片编码的基本思路，确立了球面不同实体的六边形格网表达模式。
The essential clew of managing the three leaves nodes and tiles code is put forward based on hexagonal grid, and the hexagonal grid expression modes of different spherical entities are established.
这是一个有限、已标记、导向的树状结构，其中的内部节点会标示运算子，而分叶节点则代表节点运算子的运算元。
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.
如果两个商店在逻辑上相关联(如上面的示例，商店通过地域相关联)，则可以引入一个中间节点，但是，要保持商店为叶节点。
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.
但是向后移动要复杂些，因为迭代器内部执行的是深度优先算法，预先排好了Rope遍历的顺序，需要访问每个叶节点。
But moving backward is more complicated, because internally the iterator performs a depth-first, preorder traversal of the Rope, visiting each of its leaf nodes.
在分析了构件刻面分类模式和树映射相关理论的基础上，提出了一个新颖的叶节点包容匹配模型，并给出了相应的检索算法。
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.
对于大文件(包括片段文件)，一个inode能够引用一个索引节点，而每个索引节点能够引用一个叶节点(引用多个区段)。
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).
并且该算法改进了决策树创建叶节点的条件，从而决策树不会用尽所有的候选属性才停止构造，这就消除了没有原始数据造成的影响。
And the algorithm improves the ending condition of building decision tree which don't stop constructing from using all of the attributes. So it has no influence on original data.
这个EMF层级deltas （单个的变更），显示在叶节点，可以在UML 层级很方便地归到复核的 deltas 中。
The EMF level deltas (individual changes), shown at the leaf nodes, are conveniently grouped into composite deltas at the UML level.
为了说明这个作法，图5显示一个虚构的迭代器的状态，它能够向后移动一、二、三、四个位置，但不能移动更多位置，因为这要求访问前面访问的叶节点。
To illustrate, Figure 5 shows the state of a hypothetical iterator that can move back one, two, three, or four places, but no more, because that would require accessing the previously visited leaf.
这等到我们之后讲到成键时是非常重要的，现在先要记住，我们有两个节点，不好意思，是两个叶瓣，每个都是不同的相位。
So, that's going to be important later when we get to bonding, but just take note of it now, we have two nodes, or we have two lobes, excuse me, each with a separate phase.
由于缺乏匹配的谓词，IXSCAN节点详细描述显示所有被扫描的1,680个叶级页。
The IXSCAN node detailed description shows that all of the 1,680 leaf pages are scanned due to the lack of a matching predicate.
树由根，内部节点和叶组成。根可以是叶或具有两个或更多个子节点的节点。
B + tree consists of a root, internal nodes and leaves. The root may be either a leaf or a node with two or more children.
应用推荐