Click the Data Tree to select a city.
点击Data Tree选择一个城市。
Figure 31 shows how the Data Tree should look.
图31显示了Data Tree应当显示的样子。
Navigate through each node of an in-memory data tree.
导航内存中的数据树中的每个节点。
This line of code returns the user root of the data tree.
这一行代码返回数据树的userroot。
Understanding parallel data tree structure and how to control it.
并行数据结构深入理解和控制。
During the process of designing the JSP page, the Data Tree might lose its configuration.
在设计jsp页面的过程中，Data Tree可能会丢失其配置。
The page will use a Data Tree to display all of the states and cities in a hierarchical view.
此页面将会使用一个Data Tree在一个层次视图中显示所有的州和城市。
The data tree now reflects the user input and you can go ahead and send it back, as shown in Figure 16.
数据树现在反映用户输入，可以发送它了，见图16。
From the Data tree Properties view (Figure 29), with the odc: tree leaf selected, specify these values.
从Data treeProperties视图(图29)中，选择odc： tree页节点，指定以下这些值。
Each instance, however, can only contain a single XML data tree — in other words, there can only be one root node.
然而，每个实例只能包含一个XML数据树结构—换句话说，只能有一个根节点。
Always ensure that the Tree Node List for the Data Tree reflects what configured previously, and save your work.
总是确保Data Tree的TreeNodeList反映了您之前所作的配置，并保存您的工作。
As mentioned previously, during the process of designing the JSP page, the Data Tree might lose its configuration.
如同在前面所提到的，在设计jsp页面的过程中，Data Tree可能会丢失其配置。
Always ensure that the Tree Node List for the Data Tree reflects what you previously configured, and save your work.
总是确保Data Tree的TreeNodeList反映了您之前所作的配置，并保存您的工作。
Generally, when we store a value using the preferences API, we put it in a slot in one of the nodes in the preferences data tree.
一般来说，当我们用Preferencesapi存储值时，我们将它放到首选项数据树中一个节点的slot中。
If you are processing a large XML data tree, keep in mind that SimpleXML loads the full XML document tree into memory before processing.
如果您处理的是一个大型的XML数据树，那么请务必注意SimpleXML在处理前是需要将整个XML文档加载到内存中的。
If we had only one byte array, it would be easy to write to a slot in the data tree, since the Preferences API supports byte arrays directly.
如果我们只有一个字节数组，写入数据树中的slot会很容易，因为PreferencesAPI直接支持字节数组。
In this paper, knowledge reasoning is applied to recognize design features, and then the data tree structure is used to record design features.
本文提出了一种注塑产品设计特征树构造算法，该算法应用正向推理技术实现设计特征的识别，并以特征树结构记录产品的设计特征。
Based on the domain analysis of the mine project management system, the data tree table object model, database management object model, and general reports making object model are abstracted.
在对矿山项目管理系统进行领域分析的基础上，抽象出数据树表对象模型、数据库管理对象模型和通用报表对象模型。
ApacheDS sends a confirmation response message back to JXplorer and JXplorer updates the data tree, as shown in Figure 16. You can see the resulting entry named Alice on the right side of Figure 18.
ApacheDS把确认响应消息发送回JXplorer, JXplorer更新数据树，如图16所示。
A vertex tree is built to represent the data structure of the models by octonary subdivision.
以八叉剖分来建立一棵顶点树，用以表示整个网格模型的数据结构。
Examine each value in the tree and record its data.
检查树中的每个值，并记录其数据。
In this example, we look at all the data objects referenced from the change summary tree and get the new data objects from there.
该例中，我们将考察变更摘要树中引用的所有数据对象，并从中获得新的数据对象。
In a hierarchical database (HDBMS), you begin with a strictly defined tree of data nodes.
在层次数据库(HDBMS)中，首先是从严格定义的数据节点树开始的。
The Visitor pattern is often used to separate a data structure (the tree, in this case) from the algorithms that operate over the data structure.
访问者模式往往用于将数据结构(本例中是树)与通过数据结构操作的算法分离开来。
This article discussed two data mining algorithms: the classification tree and clustering.
本文讨论了两种数据挖掘算法：分类树和群集。
You can also convert the data in the expression tree into another domain (such as XML).
你也能将表达式树中的数据转换到其他的域的数据形式(如xml)。
For parts of the past where there were no thermometers to consult, such studies use proxy data, such as tree rings.
在过去的一部分时间里，人们没有温度计测温，那些研究过程就使用具代表性的数据，比如树木的年轮来衡量。
Reason about the data in the expression tree, and do custom processing over it.
推断表达式树内数据，并对它做自定义处理。
For large tree data sets you probably want to only load the necessary data for the visible nodes of the tree. When a user expands a node, it starts to load the children of that node.
对于较大的树型数据集，您可能只想加载可见树节点的必要数据，当用户展开一个节点后再记载该节点的子节点。
To make life easier (and it is good practice anyway), we make sure that all data is reachable from the root of a single tree of data structures in memory.
为了让生活更容易（它总是一个很好的实践），我们必须确保所有的数据从单一数据结构书的根上是可获得的。
应用推荐