Duck typing - Wikipedia
In computer programming, duck typing is an application of the duck test—"If it walks like a duck and it quacks like a duck, then it must be a duck"—to determine whether an object can be used for a particular purpose. With nominative typing, an object is of a given type if it is declared as such (or if a type's association with the object is inferred through mechanisms such as object inheritance).
満足ã›ã‚‹è±šã€‚çœ ãŸã’ãªãƒãƒã€‚:Duck Typing
よãæ„味ã®ã‚ã‹ã£ã¦ã„ãªã‹ã£ãŸDuck Typingã®ã“ã¨ãŒç†è§£ã§ãã€éžå¸¸ã«ã™ã£ãり。 Duck Typing アヒルã®ã‚ˆã†ã«æ©ãã€ã‚¢ãƒ’ルã®ã‚ˆã†ã«ãªãã‚‚ã®ã¯ã‚¢ãƒ’ルã åž‹ã§ãªãメソッドã«ã‚ˆã‚‹æ•´åˆæ€§ ãƒãƒªãƒ¢ãƒ¼ãƒ•ã‚£ã‚ºãƒ ã®å¯èƒ½æ€§ã®è¿½æ±‚ å°†æ¥ã®å¤‰æ›´ã«å¼·ã„ å…ƒã¯ã€ã¾ã¤ã‚‚ã¨ã•ã‚“ã®ç‘波大ã§ã®è¬›ç¾©ã‹ã‚‰ã€‚資料ã®å…¬é–‹ã«æ„Ÿè¬ã€‚ http://www.rubyist.net/~matz/slides/tsukuba-seminar2/mgp00038.html 一日目ã®è³‡æ–™ãƒˆãƒƒãƒ—　http://www.rubyist.net/~matz/slides/tsukuba-seminar1/ 二日目ã®è³‡æ–™ãƒˆãƒƒãƒ—　http://www.rubyist.net/~matz/slides/tsukuba-seminar2/
1
ランã‚ング
ランã‚ング
ランã‚ング
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
処ç†ã‚’実行ä¸ã§ã™
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
Nao Haida's weblog: ダック・タイピング
{{#tags}}- {{label}}
{{/tags}}