在解析时，引号导致将其中包括的所有字符视为数据，而不会潜在地将其视为标记，并且始终会在将数据添加到树之前删除引号。
When parsing, quotes cause all enclosed characters to be treated as data and not potentially as markup, and the quotes are always stripped before data is added to the tree.
树的根是文档本身，每个节点对应于一个元素或字符数据。
The root of the tree is the document itself, and each node corresponds to an element or character data.
我没有手工编写字符生成器结构，而是借用了Linux内核中的font_acorn_8x8 . c中的代码(这是framebuffer驱动程序树的一部分)。
Rather than draw out a character generator structure by hand, I've borrowed font_acorn_8x8.c from the Linux kernel (this is part of the framebuffer driver tree).
对于匹配TOPIC对象的主题字符串，以及主题树中该主题字符串之下、没有定义与之匹配的TOPIC对象的各个主题，此TOPIC对象为它们提供默认设置。
The topic object provides default Settings for the topic string that matches it, as well as topics under it in the topic tree that do not have a topic object defined to match them.
主题树可以包含任意数量的节点，每个节点都关联到一些主题字符串。
A topic tree can contain any number of nodes, each of which are related to topic strings.
清单17展示了一个示例收集器，它将在我们的树中查找字符串。
Listing 17 shows an example collector that looks for strings in our tree.
当在一个树项目中找到搜索字符串时，将会选定该树项目(第48行)。
When the search string is found in one of the tree items, that tree item is selected (line 48).
还记得吗，一个TOPIC对象的访问权隐式授予对主题树中TOPIC所在位置以及该位置以下的所有主题字符串的访问权。
Remember that access to a topic object implicitly grants access to any topic strings at or below that topic in the topic tree.
算法很简单，它对树的顶级项目进行迭代，并将其文本内容与搜索字符串进行比较(清单6中的第43- 52行)。
The algorithm is simple; it iterates through the top-level items of the tree and compares their text contents with the search string (lines 43 to 52 in listing 6).
无需为默认语言环境创建目录树或消息数据库；用于该语言环境的字符串已经被嵌入到代码中。
You don't need to create a directory tree or message database for the default locale; the strings for that locale are already embedded in the code.
这个主题树包含以下主题字符串。
如果选择这个选项，定义为Date数据类型的数据库列在类型树中定义为一个字符文本字符串。
When you select this option, a database column defined with a Date data type is defined in the type tree as a character text string.
正则表达式提供了跨文本的字符串的更丰富的模式匹配，但在遍历诸如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.
evaluate()方法拥有两个参数：一个字符串XPath，一个DOM树（用来针对其计算该 XPath），还有一个 XPath常量表示返回类型。
The evaluate() method takes two arguments: a string XPath, a DOM tree to evaluate that XPath against, and an XPath constant indicating the return type.
outline使用的seed非常简单，它只是一个字符串，到达树的分支的深度越深，该字符串就越长。
The seed used in outline is quite simple; it is just a string that gets longer as deeper branches of the tree are reached.
使用传递给该方法的xpath字符串调用evaluate，在类的构造函数中构建的dom树和常量指示将结果作为一组节点返回。
Evaluate is called with the XPath string passed into the method, the DOM tree you built in the class's constructor, and the constant indicating to return results as a list of nodes.
修正：环境-跳跃在倒下的树造成伤害和杀死字符。
Fixed: Environment - Jumping on fallen tree deals damage and kill Character.
更好一些，可以利用XSL将xml树转换成字符串的方法。
Or even better, we can take advantage of the way XSL converts XML trees to strings.
键生成器计算给定字符串的hash码，这个hash码被存储在DB 2内部的B -树中。
The key generator computes the hash code for the given string, and that hash code is stored in the DB2-internal B-Tree.
右边的截图显示了在用时6.5秒的对源代码树搜索字符串的过程中，所有的sampleprofile事件。
The screen capture to the right is a table of sample profile events during a 6.5 second period during a find string operation over a tree of source code.
它是可能的在一个虚拟的字符串树有多个标题行吗？
Is it possible to have multiple header rows in a virtual string tree?
后缀树是一种非常重要的数据结构，它在与字符串处理相关的各种领域里有着非常广泛的应用。
The suffix tree is a very important data structure, which finds a wide variety of applications in many areas related to string processing.
在分析了后缀树和后缀数组字符串匹配算法的基础上，详细阐述了基于后缀数组的精确串联重复序列识别方法。
It addresses the method of identifying the accurate tandem repeat in detail after analyzing suffix tree and suffix array algorithms of string matching.
它的结构简单，但可以在线性的时间里解决许多复杂的问题，被大量的使用在字符串及树的模式匹配中。
Despite their simple data structure, many complicated problems can be solved in linear time with suffix trees. So they are intensively employed in pattern matching on string and trees.
你只需要能够确保二叉树可以序列化成一个字符串，并且可以反序列化成原始树结构即可。
You just need to ensure that a binary tree can be serialized to a string and this string can be deserialized to the original tree structure.
此方法分析字符串并创建xml树。
主要包括的内容有：线性表，栈与队列，字符串，二叉树，树，图。
We will introduce Linear Lists, Stacks, Queues, Strings, Binary Trees, Trees and Graphs, which are fundamental data structures.
终结符号处理过程中，深入地研究了字符串匹配算法和正则表达式匹配算法，并实现了二叉排序树字符串匹配算法。
First, classic string matching algorithms and regular expression matching algorithms are studied; second a binary sort tree string matching algorithm is proposed and realized.
终结符号处理过程中，深入地研究了字符串匹配算法和正则表达式匹配算法，并实现了二叉排序树字符串匹配算法。
First, classic string matching algorithms and regular expression matching algorithms are studied; second a binary sort tree string matching algorithm is proposed and realized.
应用推荐