flop function rather than a combination of reverse and splitAt, and
a simpler definition for permutations.
http://kimbly.com/code/fannkuch.hs
Kimberley Burchett
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
Hi Joel,
I've been working on a library to parse binary data files (java bytecode
in my case), and I ended up writing my own DataReader monad for the
purpose of reading binary streams. It offers two main features:
* It keeps track of how many bytes you've read. This is necessary for
Is there a general agreement as to whether one should prefer Data.Graph or
Data.Graph.Inductive?
I've read both of the papers, and while I find the Inductive view very
compelling, it seems like Erwig was more concerned with elegance than
performance, while KingLaunchbury seem to value
with any language that compiles to the jvm, rather
than restricting myself just to java.
The answer to the second question is: because the rest of the world
matters to some people.
Kimberley Burchett
http://www.kimbly.com/
___
Haskell-Cafe mailing list
* be a library for
this, or that the haskell community was in any way failing to live up to
my expectations. I was just surprised that nobody had gotten around to
doing it before me.
Kimberley Burchett
http://kimbly.com/
___
Haskell-Cafe mailing list
as a reusable library once it's ready, but if someone else has
already done the work then I'd love to avoid having to repeat it.
Kimberley Burchett
http://www.kimbly.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org
