• The LXML parse method reads the entire document and builds an in-memory tree.

    lxmlparse方法读取整个文档在内存中构建一个

    youdao

  • This is an in-memory tree structure representing the XML document that was parsed.

    表示解析XML文档内存中结构

    youdao

  • RXP works by building a compact in-memory tree structure of the XML document being parsed.

    RXP通过为所要解析的XML文档构建一个紧凑内存结构工作

    youdao

  • SAX consists of an event-based set of callbacks, while DOM has an in-memory tree structure.

    SAX包含基于事件回调函数集DOM一个内存中的树状结构

    youdao

  • When building an in-memory tree is not desired or practical, use an iterative parsing technique that does not rely on reading the entire source file. LXML offers two approaches.

    如果构建内存不是必须并不实际,则可以使用迭代解析技术这种技术需要读取整个源树。

    youdao

  • Unlike tree style parsing, stream parsing does not load the entire XML document into memory.

    解析方式不同,解析需要将整个文档加载内存中

    youdao

  • Perhaps the biggest research challenge is to write an XSLT processor that can operate without building the source tree in memory.

    也许最大研究挑战编写不用内存中构建可以操作XSLT处理器

    youdao

  • Indeed SAX does not explicitly build the document tree in memory.

    实际上SAX并不内存中显式地构建文档

    youdao

  • Tree style parsing involves loading the entire XML document into memory.

    解析方式需要将整个XML文档加载内存中

    youdao

  • This reduces memory usage during the iteration because the stack depth is constant instead of dependent on the height of the tree.

    减少了迭代过程中的内存占用因为堆栈深度始终保持一致,而不依赖于树高度

    youdao

  • 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占用内存而且可以减少在内存中遍历修改文档所花的时间。

    youdao

  • DOM, for example, parses the whole document and constructs a complete document tree in memory before it returns control to the client.

    比如DOM需要解析全部文档内存中构造完整的文档然后控制交给客户。

    youdao

  • 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.

    实际上见,结果没有内存中具体化所以串行化器将文档顺序交出节点

    youdao

  • This often yields a tree structure in memory many times larger than the source XML file.

    通常会内存中生成一个xml文件许多树状结构

    youdao

  • First it showed you how to convert an XML document into a tree of objects in memory.

    本文首先说明如何XML文档转化内存中的对象

    youdao

  • XMLNSC also USES less memory when building a message tree from an XML document.

    XMLNSC在XML文档构建消息使用更少内存

    youdao

  • Saxon's result tree is not normally materialized in memorybecause its nodes are always written in document order, they can be serialized as soon as they are output to the result tree.

    Saxon结果通常不在内存具体化——因为节点总是文档顺序编写一旦它们输出结果树中,就可以串行化这些节点

    youdao

  • 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文档加载内存中的。

    youdao

  • 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)占用极少内存并且构建过程更迅速,但其代价浏览树的速度稍微慢一点。

    youdao

  • Navigate through each node of an in-memory data tree.

    导航内存中的数据中的每个节点

    youdao

  • Target parsing can be reasonably fast and does not generate a memory-consuming parse tree, but all events fire for all elements in the data.

    目标解析可以实现合理速度并且不会生成消耗内存的解析但是数据所有元素触发事件

    youdao

  • 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.

    为了生活更容易总是很好的实践),我们必须确保所有数据单一数据结构上是获得

    youdao

  • The same could be said about any other API, whether it's intended for parsing XML, reading property files, or creating tree-based structures in memory.

    同样问题适用于其他API无论是解析xml读取属性文件还是内存中创建树状结构的API。

    youdao

  • 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.

    因为用户使用基于对象模型访问部分文档所以构造完整因为数据重复浪费内存

    youdao

  • The most common in-memory database index strategy is called T-tree.

    常见内存中数据库索引策略T -树。

    youdao

  • 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.

    幸亏艾玛父母有先见之明,一家植物园的名义捐种了一棵树———我们可以那里怀念她。

    youdao

  • Among Heng wave the tree person's heredity memory there is this way to the meeting?

    树人遗传记忆当中是否对会这种情况地办法呢?

    youdao

  • 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 文档内存表示法

    youdao

  • Is it because we have been badly educated, cultivating only memory and, from earliest childhood, have never been shown a tree, a flower, a bird, or a stretch of water?

    是不是因为我们受过糟糕的教育,幼小的童年开始就培养记忆,却从未带到一棵树一朵水面前?

    youdao

  • Is it because we have been badly educated, cultivating only memory and, from earliest childhood, have never been shown a tree, a flower, a bird, or a stretch of water?

    是不是因为我们受过糟糕的教育,幼小的童年开始就培养记忆,却从未带到一棵树一朵水面前?

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定