{"type":"rich","author_name":"gakuzo","url":"https://gakuzo.hatenadiary.org/entry/20090416/1239897693","blog_url":"https://gakuzo.hatenadiary.org/","width":"100%","image_url":"https://images-fe.ssl-images-amazon.com/images/I/41m8VWmORBL._SL160_.jpg","version":"1.0","description":"Purely Functional Data Structures\u4f5c\u8005: Okasaki\u51fa\u7248\u793e/\u30e1\u30fc\u30ab\u30fc: Cambridge University Press\u767a\u58f2\u65e5: 1999/07/01\u30e1\u30c7\u30a3\u30a2: \u30da\u30fc\u30d1\u30fc\u30d0\u30c3\u30af\u8cfc\u5165: 5\u4eba \u30af\u30ea\u30c3\u30af: 46\u56de\u3053\u306e\u5546\u54c1\u3092\u542b\u3080\u30d6\u30ed\u30b0 (25\u4ef6) \u3092\u898b\u308bHaskell\u5199\u7d4c\u306e\u7d9a\u304d\u3067\u3059\u30025.3\u7ae0\u306f3.2\u7ae0\u306e Binomal Heaps \u306b\u5bfe\u3059\u308b\u8ffd\u8a18\u306a\u306e\u3067\u98db\u3070\u3057\u307e\u3059\u3002\u4eca\u56de\u306f P46\u301cP52\u307e\u305a\u306f Heap \u306e\u5ba3\u8a00\u3067\u3059\u306d\u3002\u3053\u308c\u3082\u4ee5\u524d\u3068\u540c\u3058\u3067\u3059\u3002 class Heap h where empty :: Ord a => h a isEmpty :: Ord a => h\u2026","height":"190","author_url":"https://blog.hatena.ne.jp/gakuzo/","published":"2009-04-16 01:01:33","blog_title":"\u304c\u304f\u305e\u30fc\u306e\u30e1\u30e2","provider_url":"https://hatena.blog","title":" Purely Functional Data Structures \u5199\u7d4c 5.4 Splay Heaps","provider_name":"Hatena Blog","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fgakuzo.hatenadiary.org%2Fentry%2F20090416%2F1239897693\" title=\" Purely Functional Data Structures \u5199\u7d4c 5.4 Splay Heaps - \u304c\u304f\u305e\u30fc\u306e\u30e1\u30e2\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","categories":["Haskell"]}