English

Arabic Catalan Chinese Czech Danish Dutch English French German Greek Hebrew Hindi Hungarian Italian Japanese Korean Persian Polish Portuguese Romanian Russian Slovak Spanish Swedish Thai Turkish Ukrainian Vietnamese

Chinese

Definition Arabic Catalan Chinese Czech Danish Dutch English French German Greek Hebrew Hindi Hungarian Italian Japanese Korean Persian Polish Portuguese Romanian Russian Slovak Spanish Swedish Thai Turkish Ukrainian Vietnamese

Favorites

Advertising

recursion depth

Translation of "recursion depth" in Chinese

We couldn’t find this entry. Showing approximate results. Check your spelling or suggest adding this term to the dictionary.

递归深度

this can occur because of recursion depth, data skew, trace flags, or bit counting

因为递归深度、数据倾斜、跟踪标志或位计数可能会发生这种情况

As we can see from the illustrations above, recursion depth equals the maximal number of context in the stack.

从上面的插图我们可以看出，递归深度等于堆栈中上下文的最大数量。

The maximal number of nested calls (including the first one) is called recursion depth. In our case, it will be exactly n.

最大的嵌套调用次数（包括首次）被称为 递归深度。在我们的例子中，它正好等于 n。

Of course, the greater the recursion depth, the more the performance difference between Lollipop and Marshmallow.

当然，递归深度越深，Lollipop 和 Marshmallow 之间的性能差别便越大。

The recursion depth in this case was: 3.

本示例中的递归深度为：3。

You can limit the number of folders the image gallery creator will traverse to by setting an upper bound for the recursion depth.

您可以设置递归包含子文件夹的深度，限制创建图库时搜索的文件夹数目。

The maximal recursion depth is limited by JavaScript engine. We can rely on it being 10000, some engines allow more, but 100000 is probably out of limit for the majority of them. There are automatic optimizations that help alleviate this ("tail calls optimizations"), but they are not yet supported everywhere and work only in simple cases.

最大递归深度受限于 JavaScript 引擎。对我们来说，引擎在最大迭代深度为 10000 及以下时是可靠的，有些引擎可能允许更大的最大深度，但是对于大多数引擎来说，100000 可能就超出限制了。有一些自动优化能够帮助减轻这种情况（尾部调用优化），但目前它们还没有被完全支持，只能用于简单场景。