In the second case, if your numerical data is just a big array, why not
just mmap it? Unless you're running on a 32 bit machine, or have a
*seriously* large amount of data, that seems like the easiest option.
Although if you're talking about mutable data, that's a whole 'nother can
of worms... but
ginal Message
From: Andrew Coppin <[EMAIL PROTECTED]>
To: haskell-cafe@haskell.org
Sent: Monday, August 13, 2007 3:55:57 PM
Subject: Re: [Haskell-cafe] out of core computing in haskell
Carter T Schonwald wrote:
> Hello Everyone,
> I'm not quite sure if I'm posing this q
Carter T Schonwald wrote:
Hello Everyone,
I'm not quite sure if I'm posing this question correctly, but what
facilities currently exist in haskell to nicely deal with
datastructures that won't fit within a given machine's ram?
And if there are no such facilities, what would it take to fix that
On Mon, Aug 13, 2007 at 12:29:25PM -0700, Carter T Schonwald wrote:
> Hello Everyone,
> I'm not quite sure if I'm posing this question correctly, but what
> facilities currently exist in haskell to nicely deal with
> datastructures that won't fit within a given machine's ram? And if
> there are n
Hello Everyone,
I'm not quite sure if I'm posing this question correctly, but what facilities
currently exist in haskell to nicely deal with datastructures that won't fit
within a given machine's ram?
And if there are no such facilities, what would it take to fix that?
thanks
-Carter
___
