Tail Call Optimization in Ruby
Tail call optimization is an optimization where tail recursive functions are transformed into loops by the compiler. A tail recursive function is one where the final statement is a call to the same method. In this post, we will look at what tail recursive functions look like, how tail call optimization helps them, and how to enable TCO in Ruby. Recursion The factorial function provides an excellen
CRubyã§æœ«å°¾æœ€é©åŒ–を使ã£ãŸå†å¸° - yarbã®æ—¥è¨˜
Schemeãªã‚“ã‹ã¨é•ã£ã¦ã€è¨€èªžã¨ã—ã¦ã®Rubyã¯æœ«å°¾æœ€é©åŒ–（Tail Call Optimization）ã®å®Ÿè£…ã¯å¿…é ˆã§ã¯ãªã„ã‘ã©ã€å‡¦ç†ç³»ã¨ã—ã¦ã®CRubyã¯2.0.0ã‹ã‚‰ã‚ªãƒ—ション扱ã„ã§å…¥ã£ã¦ã„ã‚‹ã€ã¨ã„ã†è©±ã€‚2012å¹´ã®6月ã”ã‚ã«ã¯Matzã•ã‚“ã¯TCOをデフォルトã«ã™ã‚‹ã¨ã„ã†è€ƒãˆã‚‚ã‚ã£ãŸã‚ˆã†ã ã‘ã©ã€ã“ã“ã«ã‚ã‚‹è°è«–ã«ã‚ˆã‚Œã°ã€Ruby 2.0ç³»ã®ãƒžã‚¤ãƒŠãƒ¼ãƒãƒ¼ã‚¸ãƒ§ãƒ³ã¾ã§å…ˆå»¶ã°ã—ã«ãªã£ãŸæ¨¡æ§˜ã€‚性急ã«TCOを入れãªã‹ã£ãŸç†ç”±ã¯ã€ ãƒãƒƒã‚¯ãƒˆãƒ¬ãƒ¼ã‚¹ã‚’失ã†ã®ã§ä¸€èˆ¬çš„ãªRuby利用者ã«å½±éŸ¿ãŒå¤§ãã„ set_trace_func()ã®ã‚µãƒãƒ¼ãƒˆãŒå¤§å¤‰ 文法。ã¡ã‚ƒã‚“ã¨ãƒ‰ã‚ュメントã«è½ã¨ã—ã“ã‚€ã®ãŒé›£ã—ã„。ã“ã‚Œã¯åŠåˆ†å†—談ã€åŠåˆ†æœ¬æ°— ã¨ã„ã†ã“ã¨ã‚‰ã—ã„。JRubyã§ã‚‚ã€JVMãŒã‚µãƒãƒ¼ãƒˆã—ãªã„é™ã‚Šå®Ÿè£…ãŒé›£ã—ã„ã¨ã„ã†ï¼ˆã‚れ？ Clojureã¯æ˜Žç¤ºçš„ãªæœ«å°¾å‘¼ã³å‡ºã—ã®æœ€é©åŒ–ã‚’ã‚„ã£ã¦ã‚‹ã‚ˆã†ã«æ€ã†ã‘ã©ï¼‰ã€‚ Rubyã¯ã‚¤ãƒ†ãƒ¬ãƒ¼ã‚¿ã§
1
ãŠçŸ¥ã‚‰ã›
ランã‚ング
ランã‚ング
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
処ç†ã‚’実行ä¸ã§ã™
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
CPS & CTO
Tail Call Optimization in Ruby
{{#tags}}- {{label}}
{{/tags}}