... 结构树修剪 tree pruning 对象结构树 Unfolded Tree 数据结构树 data structure tree ...
基于12个网页-相关网页
... constituent structure tree 词组结构树 data-structure tree 数据结构树 decision tree structure 决策树状结构 ...
基于2个网页-相关网页
产品数据结构树 product data structure tree
数据结构二叉树的源码 binary tree data structure FOSS
数据结构算法N叉树二 data structure N-tree algorithm
以八叉剖分来建立一棵顶点树，用以表示整个网格模型的数据结构。
A vertex tree is built to represent the data structure of the models by octonary subdivision.
这个数据结构是一个“红-黑”树，对于注重性能的应用程序很理想(且恰好作为内核中的一个库普遍可用)。
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.
应用推荐