以八叉剖分来建立一棵顶点树，用以表示整个网格模型的数据结构。
A vertex tree is built to represent the data structure of the models by octonary subdivision.
所以，要构建一个非阻塞的链表、树或哈希表，需要找到一种方式，可以用CAS更新多个指针，同时不会让数据结构处于不一致的状态。
So to construct a nonblocking linked list, tree, or hash table, we need to find a way to update multiple Pointers with CAS without leaving the data structure in an inconsistent state.
这个数据结构是一个“红-黑”树，对于注重性能的应用程序很理想(且恰好作为内核中的一个库普遍可用)。
The data structure used is a red-black tree, which is ideal for performance-focused applications (and happens to be available generically as a library within the kernel).
正则表达式提供了跨文本的字符串的更丰富的模式匹配，但在遍历诸如xml树这样的数据结构时，它和XPath一样易于使用。
Regular expressions provide much richer pattern matching across strings of text, but are as easy to use as XPath when traversing a data structure such as an XML tree.
在上面的示例中，如果使用一个简单的散列图(hashmap)或二进制搜索树就可以轻易地解决问题，但是用XSL实现一个这样的数据结构并不是很方便，并且是不必要的。
In the above example, a simple hashmap or binary search tree could have easily solved the problem, but implementing one of these data structures in XSL would be inconvenient and unnecessary.
可以分析rxp . c文件的源代码，以了解rxp解析生成紧凑文档树作为数据结构的方法。
You can look through the source code for the file rxp.c to see the way that RXP parsing generates a compact document tree as a data structure.
由于clojure树是不可变的数据结构，因此任何操作都需要返回一个经过修改的新树。
Because Clojure trees are immutable data structures, any manipulation requires that we return a new, modified tree.
在考虑每个节点都是一个不可变数据结构的节点树时，我们必须考虑如何修改树内的一个节点或多个节点，而不必更改整个树。
When considering a tree of nodes where each node is an immutable data structure, we must consider how to modify a node or nodes inside the tree without modifying the entire tree.
访问者模式往往用于将数据结构(本例中是树)与通过数据结构操作的算法分离开来。
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.
在考虑树操作问题之前，让我们来看看将用于定义树的各个节点的数据结构。
Before we consider the question of tree manipulation, let's consider the data structure we'll use to define each node of the tree.
在消息流能够处理和转换它之前，必须将其转换为逻辑消息树，这是反映消息逻辑结构的代理数据结构。
Before it can be processed and transformed by the message flow, it must be converted into a logical message tree, which is a broker data structure that reflects the logical structure of the message.
采用四叉树的层次数据结构来表示物体运动。
The object motion was represented using hierarchical data structure of quad tree.
关于二叉树的相关知识和算法，适合学习数据结构和算法的朋友，欢迎下载！
On the tree of knowledge and algorithms for learning data structures and algorithms friends are welcome to download!
一些数据结构的基本算法，例如树，图的遍历等。
Some of the basic algorithm for data structure, such as trees, graph traversal and so on.
其次，将BOM的各种数据结构进行分析，选择了二叉树表示型的数据结构来存储bom，同时利用二叉树型的BOM实现从核心企业到节点企业的任务分解。
Next, it analyzed various kinds of data structure of BOM and chose binary tree as the data structure to save BOM, and realize duty decomposition from the core enterprise to the node enterprise.
并对系统所需的基础数据进行了分析与设计，对软件设计中的难点问题——树的数据结构进行了探讨。
And then discusses the difficult problem in the design of software: the data structure of the tree after analyzing and designing the basic data demanded by the system.
后缀树是一种非常重要的数据结构，它在与字符串处理相关的各种领域里有着非常广泛的应用。
The suffix tree is a very important data structure, which finds a wide variety of applications in many areas related to string processing.
平衡二叉树和半边匹配数据结构的引入，提高了拓扑信息重建的速度。
The execution rate of topological reconstruction is enhanced by introducing the AVL tree and half edge data structure.
本文建立了列车进路的二叉树数据结构，并对列车进路自动排定搜索算法进行了研究探讨。
The thesis sets up binary tree data structure of train route, and research train route automatic arrangement search arithmetic.
该方法通过先序遍历哈夫曼树，记录遍历过程，得到存储哈夫曼码表的一种数据结构。
The method gets a data structure for storing static Huffman coding by preordering traverse Huffman binary tree and recording the course of traverse.
本文针对前缀路由查询，根据前缀被访问的概率依据字母表树构建了一种基于概率的最优路由查询数据结构。
This paper constructs a data structure to implement optimal looking up by alphabet tree based on probabilities of the prefix to be accessed.
以四分树为数据结构，建立了网格细分法生成自适应网格算法。
The generation algorithm of adaptive mesh which is based on the quad-tree data structure is presented.
在《数据结构》有关图的章节中，对最小生成树两大算法的解释都是基于MST性质来说明的。
In the chapters on graphs of Data Structure, the statement to the two calculation ways of the minimal produce trees is based on the MST nature.
利用这种数据结构，作者编制了激光光学系统杂散光分析软件，针对两个实例建立了近轴鬼光束树。
Using this data structure, stray light analysis software of laser systems is programmed, the examples are given and the paraxial stray light binary trees are built.
本文提出一种用于区域表达的数据结构——数字搜索树(DST)及其线性化编码(LDST)。
In this paper, we put forward a region representation data structure-digital search tree (DST) and its lineal encoding (LDST).
最优二叉树是一种十分重要的数据结构，在通信、工程及软件开发等领域有着广泛的应用。
The optimal B-tree is very important data structure, it is broadly applied in the fields of communicating and engineering, and so on.
数学表达式、栈的操作、二又树的遍历，这几个概念在数据结构的教材中是不可缺少的。
The concepts such as mathematical expression, stack operation and binary tree traversal must be presented in data structure.
提出了表示二值图像的模式四叉树(PQT)数据结构。
A pattern quadtree (PQT) data structure for representing binary images is presented.
本文从植物生态学角度出发，根据树的生长原理，建立生长模型及相应的数据结构，并提出该结构的遍历演算法。
With the plant bionomy the tree ' s growth mechanism is analysed. tree ' s growth model and data structure are builded, and the way of traversaling is advanced.
在基于顶点聚类的网格简化算法中，通常对网格模型进行八叉剖分来建立一棵顶点树以表示整个网格模型的数据结构；
In the algorithm of mesh simplification based on vertex clustering, a vertex tree is built to represent the data structure of the models by octonary subdivision.
应用推荐