Collect all columns used in a subtree.
集合一个子树中使用的所有列。
The replication for this subtree should look like this
这个子树的复制拓扑应该像下面这样
Writes an XML representation of the DOM subtree under the specified node.
——写入指定节点下dom子树的XML表示形式。
In this article, we specify only one subtree for the configured LDAP server.
在本文中，我们只为已配置的LDAP服务器指定一个子树。
If a subtree is found, the method calls itself recursively, as shown in Listing 18.
如果找到子树，递归地调用其本身，见清单18。
Effects: Returns the number of nodes of the subtree.
作用：返回子树的节点数量。
When ng If becomes true again, Angular recreates the component and its subtree.
当ngIf重新变为true的时候，Angular会重新创建该组件及其子树。
They expect to work with an entire document, or at least an entire subtree of a document.
它们希望处理整个文档，或者至少是文档中一个完整的子树。
The destination node may be in another document, in which case the subtree is copied between documents.
目标节点可以在另一个文档中，在这种情况下，在两个文档之间复制子树。
Sometimes you actually want to sign or compare a subtree of an XML document, rather than the whole thing.
有时候真正需要的可能是签署或比较XML文档的一个子树，而不是全部内容。
If you want additional subtrees configured, add additional base entries with the appropriate subtree roots.
如果您想要配置其他子树，可以添加含有适当子树根的其他库条目。
To retrieve an item from a subtree, you compute a hash value from the column you chose when creating the index.
从子树中检索一个项目，当您创建索引时，可以从所选的列中计算出一个hash值。
Listing 2 creates a subtree representing an ordered list, using the main HTML document as a factory for creating nodes.
清单2创建了一个表示有序列表的子树，将html主文档作为工厂(factory)来创建节点。
For information on how to remove a leaf node or entire node subtree from a document, see Removing Nodes from the DOM.
有关如何从文档中移除叶节点或整个节点子树的信息，请参见从DOM中移除节点。
Listing 2 follows a general pattern of reading the source XML tree and then adding corresponding nodes to the output HTML subtree.
清单2使用普通模式读取源xml树，然后将相应的节点添加到输出html子树中。
Every node in the address tree will have lesser address nodes in its left subtree and higher address nodes in its right subtree.
地址树中每个节点的地址都比左边子树中的节点低，比右边子树中的节点高。
With the repository that was just added, enter the path of the subtree, which will be searched in the LDAP server for user entries.
对于刚刚添加的存储库，输入子树的路径，这将在LDAP服务器中对用户条目进行搜索。
The delete action is also accessible via the toolbar or the menu and has the effect of deleting the subtree rooted at the selected node.
您也可以通过工具栏或菜单访问delete操作，该操作能够删除以所选择的节点为根节点的子树。
The provider uses a subtree search starting at the search point specified in the connection string to determine whether a user exists.
提供程序从连接字符串中指定的搜索点开始执行子树搜索，以确定用户是否存在。
Subtree-based splitting: in this splitting mechanism, each subtree is configured to reside on a separate directory server in the back end.
基于子树的分割：按照这种分割机制，每个子树驻留在一个单独的后端目录服务器上。
According to our well-established Huffman coding, starting from the root node in the left subtree is marked as 0, the right is labeled 1.
根据建立好的哈夫曼树我们进行编码，从根结点出发在左子树则标为0，右则标为1。
The example program has many configuration files and deployment plans, nearly all of which are found in the src/resources subtree of the project.
示例程序有许多配置文件和部署计划，几乎所有的这些东西都能在项目的src/resources子树中找到。
This not only forces you to clean up the source nodes that are left behind, but it can also be expensive if the subtree you're moving is large.
这不仅要求清除留在后面的源节点，而且当要移动的子树很大时需要付出很高的代价。
This command will walk the entire subtree of a given management value and return all the information about the system contained within the subtree.
此命令将遍历某个给定的管理值的整个子树，并返回在该子树中获得的有关系统的所有信息。
You define a simple Perl subroutine to add a subelement to a node in the tree and then use this to construct the subtree representing an individual pet.
这里定义了一个简单的Perl子例程向树中的一个节点增加子元素，然后用它构造表示单个新宠物的子树。
In a hierarchical repository, like LDAP, a base entry is mapped to an entry in the directory information tree that identifies the top of a subtree in the DIT.
在分层存储库中(例如ldap)，基本项映射到目录信息树中标识DIT中子树顶部的一个项。
Binary Decision Diagram and Markov method are applied in the DFT modeling of satellite key devices to process static subtree and dynamic subtree, respectively.
分别采用二元决策图及马尔科夫方法对关键设备的动态故障树模型中静态子树和动态子树进行分析。
Now that the repository has been added to the list of federated repositories, a base entry needs to be configured to point to a subtree (search base) in the LDAP directory.
现在已经将存储库添加到联合存储库列表，需要将一个基本项配置为指向LDAP目录中的一个子树(搜索基)。
A frequent embedded subtree mining algorithm based on discrete interval, called DIFTM algorithm, was presented by using discrete interval to construct project database.
针对频繁嵌入式子树挖掘，利用离散区间来构造投影库，给出一种基于离散区间的频繁嵌入式子树挖掘算法。
A frequent embedded subtree mining algorithm based on discrete interval, called DIFTM algorithm, was presented by using discrete interval to construct project database.
针对频繁嵌入式子树挖掘，利用离散区间来构造投影库，给出一种基于离散区间的频繁嵌入式子树挖掘算法。
应用推荐