On 30/03/13 06:44, Louis Wasserman wrote:
> That said, I'm not sure I follow how queuelike is a
> psqueue at all as opposed to a pqueue?
Louis,
you are actually right. I was tricked by the delete function, which
takes only the queue, not the key, so it simply pops the top - queuelike
is not a psq
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.lo...@gmail.com
http:
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 c
Bearing in mind that I haven't looked at this in several years...
> Why did you switch from queuelike to pqueue?
Because I liked the API better?
> Could you put the code up somewhere manageable (repo)?
I had it up on darcs, but since that's not there any more, I don't have any
more source histo
(This is a slightly detailed email. If you are the maintainer of one of
the packages benchmarked here, you might want to read it though.)
Today I was looking for a Priority Queue that also allows a delete
operation (some call this a "Priority Search Queue").
I found
http://stackoverflow.com/ques
