[Haskell] ANN: psqueue-benchmarks - benchmarks of priority queue implementations
mail at nh2.me
Fri Mar 29 23:17:38 CET 2013
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.
More information about the Haskell