Such modifications of the document structure during parsing can result in a smaller memory footprint for the DOM tree, and also reduce the time spent traversing a document and modifying it in memory.
这种在解析期间修改文档结构的做法可以使 DOM树占用更少的内存，而且还可以减少在内存中遍历和修改文档时所花的时间。
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.
为了让生活更容易（它总是一个很好的实践），我们必须确保所有的数据从单一数据结构书的根上是可获得的。
RXP works by building a compact in-memory tree structure of the XML document being parsed.
RXP通过为所要解析的XML文档构建一个紧凑的内存树结构而工作。
This reduces memory usage during the iteration because the stack depth is constant instead of dependent on the height of the tree.
这减少了迭代过程中的内存占用，因为堆栈深度始终保持一致，而不依赖于树的高度。
In practice, as you have seen, the result tree is not materialized in memory, so the serializer is handed the nodes of the tree one at a time in document order.
实际上，如您所见，结果树没有在内存中具体化，所以串行化器将按文档顺序一次交出树的一个节点。
Since the user is not using a tree-based object model to access this part of the document, constructing the entire tree would lead to a waste of memory due to replication of data.
因为用户不使用基于树的对象模型来访问这部分文档，所以构造完整的树会因为数据重复而浪费内存。
Thankfully, her parents were ahead of me and assigned a tree in her memory at an arboretum, a place where we can go and picnic, and the kids can play, a thought I know Emma would have loved.
幸亏，艾玛的父母比我有先见之明，在一家植物园以她的名义捐种了一棵树———我们可以到那里去怀念她。
The tree builder (module com.icl.saxon.Builder) is notified of these events, and uses them to construct an in-memory representation of the XML document.
树构建器 （模块 com.icl.saxon.Builder ）被通知这些事件，并使用它们来构造XML 文档的内存表示法。
This tree implementation (package com.icl.saxon.tinytree) takes up far less memory and is quicker to build, at the cost of slightly slower tree navigation.
该树实现(包com . icl . saxon . tinytree)占用极少的内存，并且构建过程更迅速，但其代价是浏览树的速度会稍微慢一点。
When he said goodbye to us after a friendly chat about his good teacher's memory, he picked a mango from the leafiest tree for the two of us.
他和我们像朋友一样聊天，谈论他那种好老师才有的记忆力，分手的时候，他从最茂盛的那课树上，为我们两个各摘了一只芒果。
To cope with the problem of heap memory leak, this paper presents a dynamic memory leak check technology based on red-black tree.
实现时采用红黑树管理所分配的堆内存，理论推导和实验表明其具有较高的效率。
Displays a hierarchical tree that represents the execution paths and memory allocation data of functions in the profiling run.
显示一个层次结构树，它表示分析运行期间各个函数的执行路径和内存分配数据。
Tree index model is to create index in the memory, as the main entrance of the retrieval.
树索引亡储模式从要非树立外亡索引，做为检索的最从要的入口。
So the memory image of the room no. 1 would be: one's father standing near a tree with a hammer in hand.
因此，一号房间的记忆形象就是：一位父亲手持一把斧头站在一棵树旁。
The number of bytes in memory that were allocated by the instances of this function that were called by the parent function in the call tree.
调用关系树中父函数所调用的此函数的实例所分配的内存字节数。
Tree breadth-first search and tree memory can be fulfilled by setting up and making access of data list in the paper.
通过建立表、访问表来实现树的存储和广度优先搜索。
Our mother, and perhaps nearly the vicissitudes of life, but she gives us the warmth is an evergreen tree, lush in our memory.
我们的母亲，也许年近沧桑，可是，她给予我们的温情却是一棵常青树，在我们的记忆里郁郁葱葱。
Our mother, and perhaps nearly the vicissitudes of life, but she gives us the warmth is an evergreen tree, lush in our memory.
我们的母亲，也许年近沧桑，可是，她给予我们的温情却是一棵常青树，在我们的记忆里郁郁葱葱。
应用推荐