片语

motion subtrees运动树

item prefix subtrees前缀子树

the number of subtrees子树数目

oriented subtrees有向子树

non-motion subtrees非运动树

multi-subtrees多叉树

rooted maximum subtrees直接子根树

Frequent Subtrees频繁子树

Candidate Subtrees选出候选子树

英汉例句

• Single files and directory subtrees may also be restored from full or partial backups.

  单独的文件和目录子树也可以从全部或部分备份中恢复。

• This required that all subtrees are all under the same suffix, since there is no common parent between suffixes.

  这需要所有的子树都位于相同的后缀中，因为后缀之间不存在公共父节点。

• Likewise, markup subtrees (i.e. 「emph」, 「strong」, 「module」, 「code」, 「title」) are collapsed to a single node of the right type, and containing a compound string.

  同样，标记子树(即「emph」、「strong」、「module」、「code」和「title」)折叠为一个类型正确的单独节点，并包含一个复合字符串。

• Use deepcopy when serializing subtrees

  在序列化子树时使用deepcopy

• Xml.pulldom builds accessed subtrees only as needed.

  pulldom只在需要时构建被访问的子树。

• Another idea I had some time later was to allow subtrees to be loaded and populated at runtime.

  另一个之后不久我提出的想法是允许运行的时候加载和填充子树。

• The strongly connected components form the subtrees of the search tree, the roots of which are the roots of the strongly connected components.

  强连通分量形成了搜索树，他们的根就是强连通分量的根。

• Root in the value of not less than all-roots values, which are all subtrees heap.

  根结点的值不小于所有子树根的值，且所有子树均为堆。

• Compounds are encapsulated subtrees built from base nodes and other compounds.

  复合节点是利用基本节点或者其他的复合节点构建的封装子树。

• We might then more simply create n-ary subtrees of 「as many plains as possible.」

  然后，我们就可以更简单地创建「plain尽可能多」的n - ary子树了。

• Some limit laws for the branches and subtrees in a random recursive tree and binary search tree are established in this dissertation.

  本文主要研究随机递归树和随机二叉搜索树上与分支和子树相关的极限定理。

• The beginning of this article presented a scenario in which the use of standard XSL techniques for looking up data in distinct subtrees of an XML document used excessive amounts of compute time.

  本文的开头演示了这样一种方案：在XML文档的各个独立的子树中使用标準XSL技术查找数据，会花费过多数量的计算时间。

• If you want additional subtrees configured, add additional base entries with the appropriate subtree roots.

  如果您想要配置其他子树，可以添加含有适当子树根的其他库条目。

• To which is still unable to complete the parsing, chooses certain widest subtrees compulsion matched and then outputs.

  对依然无法完成的分析，选择若干最宽子树强制匹配输出。

• Single files and directory subtrees may be restored from full or partial backups.

  可以从完全或部分备份中还原单独的文件或者目录树。

• The operation rules and the transformation steps between model subtrees are described.

  论述操作规则和模型结构子树的构建步骤。

• You can think of levels in a FOT index as smaller subtrees (buckets).

  您可以将FOT索引中的级视作较小的子树(桶)。

• we can aggregate subtrees of the 「plain」 type pairwise. But I would prefer if Spark allowed a more EBNF-style grammar expression like this

  我们可以成对地聚集“plain“类型的子树。

• For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

  对于这个问题，一个高度平衡的二叉树是指每个节点的两个子节点的深度的差异都不超过1的二叉树。

• If you want additional subtrees configured, add additional base entries with appropriate subtree roots.

  如果您希望配置其他子树，可以在适当的子树根中添加其他基本项。

• Also, the metadata conditions can be easily explored by opening and closing the subtrees without selecting them.

  此外，通过打开和关闭子树(没有选中它们)，可以很容易地研究元数据条件。