recursion造句
- 1. Composite or Recursion?
- 使用组合还是使用递归？
youdao
- 2. Return all rows from the recursion.
- 返回递归中的所有行。
youdao
- 3. Statically forbid polymorphic recursion.
- 静态禁止多态递归。
youdao
- 4. That language didn't even support recursion.
- 这语言甚至都不支持递归。
youdao
- 5. A similar problem is too much recursion.
- 相似的问题还包括过多的递归。
youdao
- 6. This is the stop condition for the recursion.
- 这是递归的停止条件。
youdao
- 7. The tool even supports recursion to a given depth.
- 这个工具还支持递归到给定深度。
youdao
- 8. We mention recursion briefly in the previous chapter.
- 在前面的章节中，我们简要涉及了一下递归。
youdao
- 9. You'll see Lambda expressions, recursion, and macros.
- 您将学到 Lambda表达式、递归和宏。
youdao
- 10. The second part represents the iteration or recursion.
- 第二部分代表迭代或递归。
youdao
- 11. Another example of recursion at work is the following.
- 递归的另一个实例如下。
youdao
- 12. Tail recursion is a common technique in XSLT style sheets.
- 尾递归是xslt样式表中的常用技术。
youdao
- 13. There is also the concept of recursion which is important.
- 另一个重要的概念是递归。
youdao
- 14. You have added recursion to your Cusp development Arsenal.
- 已经将递归添加到了Cusp开发工具库中。
youdao
- 15. In math and engineering, recursion, especially, is a big win.
- 在数学和工程中，递归获得了重大胜利。
youdao
- 16. If you still don't know what recursion is, read this sentence.
- 如果你还不明白什么是递归，就读这个句子。
youdao
- 17. In short, NOCYCLE prevents the recursion from entering a cycle.
- 简言之，NOCYCLE防止递归进入循环。
youdao
- 18. We will get to the speed and space issues of recursion later on.
- 稍后我们会讨论递归的速度和空间问题。
youdao
- 19. The combination of first and rest works well with recursion.
- 使用first和rest 组合实现递归效果很好。
youdao
- 20. Later you'll see how recursion takes advantage of these selectors.
- 稍后，您将了解递归如何利用这些选择函数。
youdao
- 21. Using recursion tremendously simplifies the verification of programs.
- 使用递归可以极度简化程序的核查。
youdao
- 22. Here's an example involving polymorphic recursion across two classes.
- 下面的示例涉及两个类之间的多态递归。
youdao
- 23. It also demonstrates how the recursion of the function execution works.
- 这也解释了函数执行的递归是如何实现的。
youdao
- 24. The question is, can we implement the Visitor pattern without recursion?
- 问题在于，我们能否在不使用递归的前提下实现访问者模式？
youdao
- 25. Doing so would be a useful exercise, and a helpful lesson in runaway recursion.
- 这样做将是十分有用的练习，并且对失控递归非常有用。
youdao
- 26. Recursion means repetition in subelements, like the pattern of veins in a leaf.
- 递归手段重复子元素，如叶脉的排列。
youdao
- 27. You can adjust the recursion depth limit by changing a constant defined in Listing 4.
- 可以通过修改清单4中定义的常量来改变最大递归深度。
youdao
- 28. And the reason I want to show you this is to notice that the recursion can be doubled.
- 如果我来写斐波那契数列你可以看看这儿,原因是我想让你看看这部分的递归可以翻倍。
youdao
- 29. Note that this is classical functional programming, relying on recursion over iteration.
- 请注意这是典型的功能性编程，取决于迭代上的递归。
youdao
- 30. Note that this is classical functional programming, relying on recursion over iteration.
- 请注意这是典型的功能性编程，取决于迭代上的递归。
youdao