Hi Niklas,
> No, it does not stack overflow, and it seems to perform slightly better
> than the other implementations; it also doesn't suffer from the toList
> slowness problem as does listlike.
Thanks. It's nice.
> However, it is probably not as generally usable as it hardcodes the
> priorities to be Doubles.
I think that you can import the tips of GHC PSQ to original PSQ.
P.S.
If you need test cases, you can find some properties for Heap
(priority queue) here:
https://github.com/kazu-yamamoto/llrbtree/blob/master/test/Heap.hs
You can add some properties relating dilatation to them.
--Kazu
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
