There is also a fingertree-based priority search queue on Hackage:

http://hackage.haskell.org/package/fingertree-psqueue

which I used once. I think it is not thoroughly tested, though (the first version
was rather buggy).


On Thu, May 5, 2011 at 3:53 AM, wren ng thornton <wren@freegeek.org> wrote:
On 5/1/11 7:58 PM, Edward Z. Yang wrote:
> OK, to summarize the current discussion:
> - It would be nice to have a general-purpose priority queue in containers.
>    I'm not interested in this goal per se, but I do view it as the
cleanest way
>    to get what I want.

With regards to this point, is there any reason why the following does
not suffice (albeit not in base)?

    http://code.google.com/p/priority-queues/

They're not priority *search* queues, but I'm not sure how much to read
into your leaving out that word...

--
Live well,
~wren


_______________________________________________
Libraries mailing list
Libraries@haskell.org
http://www.haskell.org/mailman/listinfo/libraries