An ordered list of child information items, in document order.
按照文档顺序的子元素信息的有序列表。
Contains functionality to compare nodes for their document order.
包含用于比较节点的文档顺序的功能。
The nodes in the returned collection are in reverse document order.
所传回集合中之节点的顺序为反向文件顺序。
The elements in the returned collection are in reverse document order.
返回的集合中的元素顺序与文档顺序相反。
In XSLT 2.0, sequences of nodes are not limited to being processed in document order.
在XSLT 2.0中，节点序列允许按照文档顺序以外的顺序处理。
Returns a collection of the sibling elements before this node, in document order.
按文档顺序返回此节点前的同级元素集合。
Returns a filtered collection of the sibling elements after this node, in document order.
按文档顺序返回此节点后经过筛选的同级元素的集合。
Returns a filtered collection of the sibling elements before this node, in document order.
按文档顺序返回此节点前经过筛选的同级元素的集合。
The latter expression will naturally retrieve nodes in document order, whereas the former might not.
后一个表达式将自然地按文档顺序检索节点，而前一个则不是这样。
This means that the document order is preserved as well as the original element content with whitespace.
这意味着文档顺序以及包含空格的原始元素内容将被保留。
Returns a filtered collection of the descendant elements for this document or element, in document order.
按文档顺序返回此文档或元素的经过筛选的子代元素集合。
set:trailing returns the nodes in one node-set that come after the first node in the other node-set, in document order.
trailing将返回一个节点集，其中的节点按照文档顺序要比另一个节点集中的第一个节点晚出现。
Different from the update of relational tables, XML update needs to take the document order of nodes into account.
与关系表的更新不同，XML更新要考虑到节点的文档顺序。
Set: leading returns the nodes in one node-set that come before the first node in the other node-set, in document order.
leading将返回一个节点集，其中的节点按照文档顺序要比另一个节点集中的第一个节点早出现。
However, XSLT 1.0 will not let you do that, because it processes all node-sets in document order or in reverse document order.
但是在XSLT 1.0中做不到，因为只能按照文档顺序或者逆文档顺序处理全部节点集。
A template that processes all of its children in document order ensures that processing occurs all the way down the source tree.
以文档次序处理其所有子元素的模板确保处理自始至终都沿着源树进行。
So long as the operands are both already sorted into document order, this avoids the need to allocate memory for the intermediate node sets.
只要已经按文档顺序排序了这两个操作数，就不必为中间节点集分配内存。
It is important to process mixed content in document order; otherwise, you can get completely mangled output, with a changed order of sentence parts.
按照文档顺序处理混合内容非常重要；否则，会导致混乱的输出，并且句子的顺序完全错乱。
Getting a type error where XSL: sort with a select expression obtains more than one value (XSLT 1.0 just selected the first value in document order.)
带有select表达式(返回多个值)的xsl：sort报告类型错误(XSLT 1.0只能按照文档顺序选择第一个值。)
For example, each node can contain a sequence number that makes it easy to sort nodes in their sequential document order, a frequent XSLT requirement.
例如，每个节点可以包含一个序号，这就易于按连续的文档顺序排序节点，这是一个常见的XSLT需求。
If the XPath expression does return more than one node and you've specified XPathConstants.NODE, then evaluate returns the first node in document order.
如果XPath表达式返回了多个节点并且指定了XPathConstants . NODE，则evaluate按照文档顺序返回第一个节点。
Following an axis from a context node will still return nodes in document order, but once it has those nodes, your stylesheet can reorder them as it requires.
虽然从上下文节点出发沿着某个轴仍然只能按照文档顺序返回节点，但是得到节点之后样式表可以根据需要重新排列节点。
The net result is that if you need to work with only part of the document model (the "first" part, in document order terms), AXIOM delivers great performance.
最后的结论是，如果只需要处理文档模型中的某些部分（如按文档顺序的“第一”部分），AXIOM提供了优秀的性能。
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.
实际上，如您所见，结果树没有在内存中具体化，所以串行化器将按文档顺序一次交出树的一个节点。
The database can assign sequence Numbers to each node so that it knows the position of each node and can compare the document order of two nodes in constant time.
数据库可以为每个节点分配顺序号，这样就知道每个节点的位置，可以在常数时间内比较两个节点的文档顺序。
Since a parser delivers data in document order (the same order items appear in the XML document text), the on-demand construction implemented by AXIOM requires some clever handling.
因为解析器按照文档顺序(与XML文档文本中项目的出现顺序相同)传递数据，所以AXIOM所实现的按需构造需要某种灵活的处理方法。
Saxon's result tree is not normally materialized in memory — because its nodes are always written in document order, they can be serialized as soon as they are output to the result tree.
Saxon的结果树通常不在内存中具体化——因为它的节点总是按文档顺序编写，一旦将它们输出到结果树中，就可以串行化这些节点。
This document is a partially contrived purchase order for a compact disc/tape player from the Aiwa corporation.
本文件是一份来自爱华公司的部分设计的光盘/磁带播放机订单。
I'll order a special messenger to deliver the document.
我会派专人把文件送去。
Order document size is 1KB to 2KB.
订单文档的大小是1KB到2KB。
应用推荐