eventually, the algorithm reaches a leaf node with the final classification.
最终,算法抵达的叶子节点就是最终分类。
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.
the xpath for a computed value should be a leaf node only.
计算出的值的xpath只能是叶节点。
note: here, the challenge is data structure are not hardcoded and any point of time new leaf node or parent node may be added at runtime.
挑战来自数据结构不是硬编码的,叶子节点和父亲节点是动态添加的。
for information on how to remove a leaf node or entire node subtree from a document, see removing nodes from the dom.
有关如何从文档中移除叶节点或整个节点子树的信息,请参见从dom 中移除节点。
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).
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.
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.
不能将叶子节点配置成主节点,因为它不能直接访问其非根服务器之外的所有其他节点。
furthermore, if a leaf node gets split or merged during data insertion or deletion or update, it may take longer for the whole index to adjust the change.