> I have tweaked this program a few ways for you. > The big mistake (and why it runs out of space) is that you take > ByteString.Lazy.length to compute the block size. This forces the entire > file into memory -- so no benefits of lazy IO. > As a separate matter, calling 'appendFile . encode' incrementally for > each element will be very slow. Much faster to encode an entire list in > one go. > Finally, using System.Random.Mersenne is significantly faster at Double > generation that System.Random.
Thank you! Just excellent! // I'm so happy :-) _______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
