adv.遞歸地

If you have a correct definition of you cubeNode it is very easy to create an octree recursively. 如果你正確的定義了你的立方體節(jié)點，那么遞歸地創(chuàng)建一個八叉樹是很容易的。

Location paths can recursively contain expressions that are used to filter sets of nodes. 定位路徑可以遞歸地包含用于過濾節(jié)點或集合的表達式。