尾遞歸 的英文怎麼說

中文拼音 [wěidìguī]
尾遞歸 英文
tail recursion
  • 遞 : Ⅰ動詞（傳送;傳遞） hand over; pass; give Ⅱ副詞（順著次序） in the proper order; successively
  • 歸 : Ⅰ動詞1 （返回） return; go back to 2 （還給; 歸還） return sth to; give back to 3 （趨向或集中於...
  1. Tail - recursive transformations can speed up your apps, but not all jvms can perform the task

    尾遞歸轉換能加快應用程序的速度，但不是所有的jvm都會做這種轉換
  2. Instead, the transformation from tail - recursive function to simple loop must be done dynamically by a jit compiler

    相反地，這種從尾遞歸函數到簡單循環的轉換必須由jit編譯器動態地進行。
  3. But although it is well known how to automatically transform a tail - recursive function into a simple loop, the java specification doesn t require that this transformation be made

    但是，盡管大家都熟知如何把一個尾遞歸函數自動轉換成一個簡單循環， java規范卻不要求做這種轉換。
  4. Is strictly tail recursive

    是嚴格尾遞歸的。
  5. One way to check whether your jit transforms your tail - recursive methods is to compile and run the following small test class

    要判斷您的jit會否轉換尾遞歸的一個辦法是編譯並運行如下小測試類：
  6. Although the manual is, of course, written for common lisp, the discussion on tail recursion is applicable to other languages, including the java language

    雖然這本手冊是（當然是）為common lisp寫的，但其中關于尾遞歸的討論也適用於其他語言，包括java語言。
  7. Remember : we can t rely on our code to always be running on a jvm that will transform tail - recursive calls

    記住：我們不能寄希望於我們的代碼會總是運行在會轉換尾遞歸調用的jvm上。
  8. If your jit compiler converts tail - recursive calls to iteration, this program will continue to run indefinitely

    如果您的jit編譯器把尾遞歸調用轉換成迭代，這個程序將無限期地運行下去。
  9. Tail recursion and transformations

    尾遞歸及其轉換
  10. For a good discussion of tail recursion and its conversion to iteration, check out the

    欲詳細了解尾遞歸及其到迭代的轉換，請參閱
  11. Can your jit transform tail recursion on code while preserving language semantics

    清單4 .您的jit會在保持語言語義的同時轉換尾遞歸代碼嗎？
  12. So, as the example in listing 3 shows, we cannot expect static compilers to perform transformation of tail recursion on java code while preserving the semantics of the language

    因此，如清單3中的示例所示，我們不能期望靜態編譯器會在保持語言語義的同時對java代碼執行尾遞歸轉換。
  13. He shows why this matters and offers a bit of code to help you determine whether your just - in - time compiler can transform tail recursion on code while preserving semantics

    他說明了為什麼這是一個重要問題，並提供了一段代碼來幫助判斷您的即時（ jit ）編譯器是否會在保持語言語義的同時做尾遞歸代碼轉換。
  14. Therefore, to guarantee reasonable performance across jvms, you should always try to write code that most naturally fits a tail - recursive pattern in an iterative style instead

    因此，為了保證您的程序在所有jvm上都有適當的性能，您應始終努力把那些最自然地符合尾遞歸模式的代碼按迭代風格編寫。
  15. 01 may 2001 many algorithms are expressed most concisely as tail - recursive methods

    很多演算法用尾遞歸方法表示會顯得格外簡明。
分享友人
分享到 Line

分享到臉書