{"provider_url":"https://hatena.blog","url":"https://lethevert.hatenadiary.org/entry/20060521/p1","blog_url":"https://lethevert.hatenadiary.org/","provider_name":"Hatena Blog","version":"1.0","width":"100%","height":"190","type":"rich","author_url":"https://blog.hatena.ne.jp/lethevert/","blog_title":"lethevert is a programmer","author_name":"lethevert","image_url":null,"categories":["\u30d7\u30ed\u30b0\u30e9\u30df\u30f3\u30b0"],"description":"\u305f\u3068\u3048\u3070\u3001\u6574\u6570\u306e\u30ea\u30b9\u30c8\u3092\u53d7\u3051\u53d6\u3063\u3066\u3001\u5947\u6570\u3060\u3051\u306e\u30ea\u30b9\u30c8\u3092\u8fd4\u3059\u95a2\u6570\u306f\u3001 oddList :: [Int] -> [Int] oddList [] = [] oddList [i:ir] | isOdd i = [i:oddList ir] = oddList ir\u3068\u5b9a\u7fa9\u3057\u307e\u3059\u304c\u3001\u3053\u308c\u3092\u3001 oddList :: [Int] -> [Int] oddList [] = [] oddList [i:ir] | isOdd i # ol = oddList ir = [i:ol] = oddList ir\u3068\u3057\u3066\u3082\u52b9\u7387\u306b\u5dee\u306f\u306a\u3044\u3067\u3059\u3002\uff08\u3053\u3053\u3067\u306e # \u306f let \u3068\u540c\u3058\u52b9\u679c\u3067\u3059\uff09 \u3057\u304b\u3057\u3001\u5947\u6570\u306e\u30ea\u30b9\u30c8\u3068\u5076\u6570\u306e\u2026","title":"Concurrent Clean : \u518d\u5e30\u30c7\u30fc\u30bf\u69cb\u9020\u306e\u751f\u6210","published":"2006-05-21 00:00:01","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Flethevert.hatenadiary.org%2Fentry%2F20060521%2Fp1\" title=\"Concurrent Clean : \u518d\u5e30\u30c7\u30fc\u30bf\u69cb\u9020\u306e\u751f\u6210 - lethevert is a programmer\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>"}