[Haskell-cafe] ANN: psqueue-benchmarks - benchmarks of priority queue implementations

[Louis Wasserman]

I don't remember the answer to either of your questions, I'm afraid --
queuelike was last updated in 2009 (!), and that's really the last time I
looked at it.  That said, I'm not sure I follow how queuelike is a psqueue
at all as opposed to a pqueue?

Louis Wasserman
wasserman.louis at gmail.com
http://profiles.google.com/wasserman.louis


On Fri, Mar 29, 2013 at 3:17 PM, Niklas Hambüchen <mail at nh2.me> wrote:

> Hey Louis,
>
> I think that queuelike is still a nice psqueue implementation (and I
> personally don't dislike the api), so may I ask two more questions:
>
> * Do you have any clue why toList is 10 times slower than in the other
> implementation? It is based on extract, and queuelike's extract is very
> fast compared to the others ... that is weird.
>
> * What could I do such that queuelike creation is not measured as
> instant? Using whnf does not seem to be enough.
>
> Thank you
> Niklas
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20130329/56166a14/attachment.htm>