(1)当轨线不是周期轨时,轨迹是在圆环中稠密的,那么它是否是圆环上 遍历的 ( Ergodic ),即轨迹经过圆环上每一点?或者,它是否(或什么情况是)是圆环上一个无处稠密集?
基于68个网页-相关网页
换句话说,该类的任何实例都是不可遍历的。
In other words, any instance of this class won't be focus traversable.
Versa 以向后遍历的形式提供这一操作。
Versa provides this operation in the form of a backward traversal. For example
扩充分支总是包含在当前步骤遍历的顶级列表中。
The enrichment branch is always contained within the top-level list that the current step is iterating through.
You'll also notice that this thing goes through the entire list, even if the list is sorted before it gets partway through.
你也能注意到,它始终会遍历列表,甚至列表在排序之前,就是有序的也是这样。
And because, as long as this collection is finite, this thing is just going to walk through. All right?
这个操作就会遍历完它的,对不对?,那么,如果我给大家看看,例如?
In other words it doesn't just return when it finds one, it's going to run through all of them. All right?
但是它将会继续运行,换句话来说当它找到一个结果时,它不会立刻返回结果它会先遍历所有的内容?
应用推荐