数数看一行有多少棵树。

Count and see how many trees there are in a row.

《新英汉大辞典》

我们不是很乐意使用DPSI，但是我们必须跨多个分区探测多个索引树来寻找行。

We are not so pleased with the DPSI if we must probe multiple index trees to find rows across multiple partitions.

youdao

这一行访问ast树，起步于编辑单元(最顶层的节点)，并且查询所有的方法声明。

This line visits the AST tree, starting at the compilation unit (the top-most node), and queries for a list of all method declarations.

youdao