Yo,<br><br>If you're interested in adding priority queues to containers, shameless plug: I've got a good implementation of pairing heaps in <a href="http://hackage.haskell.org/package/queuelike">http://hackage.haskell.org/package/queuelike</a>. It's a bit obfuscated right now, but I'd definitely be interested in producing something that's actually readable and usable enough to be put into containers...<br>
<br clear="all">Louis Wasserman<br><a href="mailto:wasserman.louis@gmail.com">wasserman.louis@gmail.com</a><br><a href="http://profiles.google.com/wasserman.louis">http://profiles.google.com/wasserman.louis</a><br>
<br><br><div class="gmail_quote">On Wed, Mar 3, 2010 at 11:28 AM, <span dir="ltr"><<a href="mailto:libraries-request@haskell.org">libraries-request@haskell.org</a>></span> wrote:<br><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
<div id=":1dp" class="ii gt">Re: Improving containers library</div></blockquote></div><br>