{"provider_url":"https://hatena.blog","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fhironei.hatenablog.com%2Fentry%2F20110728%2F1311839577\" title=\"Groovy++\u8a08\u6e2c(1) - hironei&#39;s diary\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","description":"Groovy\u306e\u30b9\u30af\u30ea\u30d7\u30c8\u3092\u9759\u7684\u578b\u4ed8\u3092\u3057\u3066\u304f\u308c\u308b\u3089\u3057\u3044\u3002\u30bd\u30fc\u30b9\u30b3\u30fc\u30c9\u306b@Typed\u3092\u6307\u5b9a\u3059\u308b\u3068\u9759\u7684\u306a\u578b\u306b\u57fa\u3065\u3044\u3066\u6700\u9069\u5316\u3055\u308c\u308b\u3063\u307d\u3044\u3002\u30d5\u30a3\u30dc\u30ca\u30c3\u30c1\u3067\u3061\u3087\u3063\u3068\u8a66\u3057\u3066\u307f\u305f @Typed int fib(int n) { return n < 2 ? 1 : fib(n - 1) + fib(n - 2); } int fib2(int n) { return n < 2 ? 1 : fib2(n - 1) + fib2(n - 2); } println 'Groovy++ Fibonachi Numbers(36) took '+(System.currentTimeMillis() - start\u2026","title":"Groovy++\u8a08\u6e2c(1)","type":"rich","height":"190","blog_url":"https://hironei.hatenablog.com/","blog_title":"hironei's diary","version":"1.0","published":"2011-07-28 16:52:57","author_url":"https://blog.hatena.ne.jp/hironei/","author_name":"hironei","url":"https://hironei.hatenablog.com/entry/20110728/1311839577","image_url":null,"width":"100%","categories":["Groovy"],"provider_name":"Hatena Blog"}