I had to implement a ring buffer, and I wanted the code using it to be
written in Haskell. I ended up implementing the buffer in C, and wrapping
it in FFI from Haskell because implementing a destructive array in Haskell
is kind of unwieldy to someone of my experience level. In Clean, it
All:
mathlink is a library for writing Mathematica packages in Haskell.
One simply writes some functions of type:
(MLGet a, MLPut b) = a - IO b
and provides a package specification in a simple DSL that mimics that of
Mathematica's mprep utility. The result is a program that exposes functions
Already posted to the Haskell list but dons suggested I post to the cafe, as
well...
All:
mathlink is a library for writing Mathematica packages in Haskell.
One simply writes some functions of type:
(MLGet a, MLPut b) = a - IO b
and provides a package specification in a simple DSL that mimics
We don't seem to have a binding to any of the foreign language libs for
very large graphs.
Do you know of any stand-out libraries in this regard worth binding?
When I looked in to this last year, the best I could find was the boost
library. It depends very heavily on template
On Thu, Feb 26, 2009 at 7:17 AM, Lennart Augustsson
lenn...@augustsson.netwrote:
You can implement a reasonable split if you can fast-forward the generator.
There's no known method to fast-forward the MT, but other generators
like MRG32k3a can handle it.
Are you aware of any existing
Awesome, Felipe. Thanks.
--Tracy
On Thu, Feb 26, 2009 at 11:07 AM, Felipe Lessa felipe.le...@gmail.comwrote:
2009/2/26 Tracy Wadleigh tracy.wadle...@gmail.com:
On Thu, Feb 26, 2009 at 7:17 AM, Lennart Augustsson
lenn...@augustsson.net
wrote:
You can implement a reasonable split
Benedikt writes:
I think a good general purpose graph library is tricky though:
- There are lot of variants of graphs (trees, bipartite, acyclic,
undirected, simple, edge labeled etc.), hard to find adequate and easy to
use abstraction.
- There is no single 'best' implementation (mutable vs.
