Gregg Lebovitz wrote:
> Ryan writes:
>
> With a few years of Haskell experience in my backpack I know how to
> utilize laziness to get amazing performance for code that most people
> would feel must be written with destructively updating loop.
That was me actually. Just a minor side note that s
Truly amazing! I wonder it would fare with larger repositories. =)
Cheers,
--
Felipe – enviado do meu Galaxy Tab.
Em 12/05/2012 09:52, "Sönke Hahn" escreveu:
> Hi all!
>
> Yesterday I wrote a little tool to output the dependencies of darcs
> patches in dot format. The hardest part was to wrap m
Hi!
I am pleased to announce patterns-0.0.3.
On Hackage: http://hackage.haskell.org/package/patterns
The Patterns package implements communication patterns that are often
used in distributed, message-oriented applications. The package
implements a set of basic patterns and a device to connect
Recall I reported a surprising result from an implementation of a
Linear Diophantine equation solver based on an algorithm by Contejean
and Devie. When using it to solve an inhomogeneous equation, a
version of my code generated a non-minimal solution. It turns out
that when solving the inhomogene
Chris,
Thanks you for indulging me. I will eventually get use to the idea that
there is a wiki page for almost every topic :-)
Gregg
On 5/12/2012 1:02 AM, Chris Wong wrote:
On Sat, May 12, 2012 at 12:41 AM, Gregg Lebovitz wrote:
I would find it useful to pull all this information together
Hi all!
Yesterday I wrote a little tool to output the dependencies of darcs
patches in dot format. The hardest part was to wrap my head around the
darcs API and find a way to let it compute the patch dependencies. I
don't know, if I got it right, but it looks correct at first glance.
Here is the
