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

[prev in list] [next in list] [prev in thread] [next in thread] 

List:       haskell
Subject:    Re: [Haskell] ANN: psqueue-benchmarks - benchmarks of priority queue implementations
From:       Louis Wasserman <wasserman.louis () gmail ! com>
Date:       2013-03-29 22:44:04
Message-ID: CA+tXMXMaDKUsb=MfMYY93CzV=CMa5ZSh5o8y6EANQNGDAq5KHA () mail ! gmail ! com
[Download RAW message or body]

[Attachment #2 (multipart/alternative)]

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@gmail.com
http://profiles.google.com/wasserman.louis

On Fri, Mar 29, 2013 at 3:17 PM, Niklas Hamb=FCchen <mail@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
>

[Attachment #5 (text/html)]

<div dir="ltr">I don&#39;t remember the answer to either of your questions, I&#39;m \
afraid -- queuelike was last updated in 2009 (!), and that&#39;s really the last time \
I looked at it.  That said, I&#39;m not sure I follow how queuelike is a psqueue at \
all as opposed to a pqueue?</div>

<div class="gmail_extra"><br clear="all"><div>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></div>

<br><br><div class="gmail_quote">On Fri, Mar 29, 2013 at 3:17 PM, Niklas Hambüchen \
<span dir="ltr">&lt;<a href="mailto:mail@nh2.me" \
target="_blank">mail@nh2.me</a>&gt;</span> wrote:<br><blockquote class="gmail_quote" \
style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">

Hey Louis,<br>
<br>
I think that queuelike is still a nice psqueue implementation (and I<br>
personally don&#39;t dislike the api), so may I ask two more questions:<br>
<br>
* Do you have any clue why toList is 10 times slower than in the other<br>
implementation? It is based on extract, and queuelike&#39;s extract is very<br>
fast compared to the others ... that is weird.<br>
<br>
* What could I do such that queuelike creation is not measured as<br>
instant? Using whnf does not seem to be enough.<br>
<br>
Thank you<br>
<span class="HOEnZb"><font color="#888888">Niklas<br>
</font></span></blockquote></div><br></div>

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

[prev in list] [next in list] [prev in thread] [next in thread] 