On Fri, 29 Mar 2013, Niklas Hambüchen wrote:
(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.)
Could you please put your experiences the Wiki? This would help others to
choose a package.
I had a 5 second look at the PSQueue implementation and here's what I got
so far:
* fromList should use foldl'.
* LTree should be spine strict (i.e. strict in the (LTree k p) fields).
* Winner should be strict in the (LTree k p) field and probably in all
other fields as well.
This is a nice
On Fri, 29 Mar 2013, Louis Wasserman wrote:
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
Does that mean the repo is still there without web access or gone?
On 29/03/13 20:14, Henning Thielemann wrote:
Was it on code.haskell.org? Then it might have been moved to a non-web
directory after the last attack 2011.
___
Haskell-Cafe mailing list
On Fri, 29 Mar 2013, Niklas Hambüchen wrote:
On 29/03/13 20:14, Henning Thielemann wrote:
Was it on code.haskell.org? Then it might have been moved to a non-web
directory after the last attack 2011.
Does that mean the repo is still there without web access
I assume that.
or gone?
If