Great! Your benchmark closely matches my experience with using fingertree-psqueue and PSQueue for use in an A* search algorithm. Hopefully when people go to find a ps queue implementation they'll notice your benchmark, it would have saved me some time.

Cheers,

Oliver Batchelor

On Tue, Jun 24, 2014 at 2:07 AM, Jasper Van der Jeugt <m@jaspervdj.be> wrote:

Here at Better, we have just a released a package which implements
faster priority search queues for Haskell. We hope it proves to be
useful to the community!

More information can be found in this blogpost:

http://medium.com/@bttr/announcing-psqueues-8a0fe9fe939

Grab it from Hackage or GitHub:

http://hackage.haskell.org/package/psqueues
https://github.com/bttr/psqueues

On behalf of the engineering team at Better,
Jasper Van der Jeugt
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe