Hello Sven, Wednesday, January 18, 2006, 3:33:40 PM, you wrote:
SMH> and gets a runtime for the GHC-compiled binary that's about 10x as long SMH> as for GCC. Simon M. tells me this should be much better. Here are the attached version is only 5 times slower :) please note that 1) unsafeRead/Write indexes from 0 and don't checks bounds (just C-like :) 2) generating random values takes about 1.5-2 seconds by itself. Haskell's RNG is very different from C's one -- Best regards, Bulat mailto:[EMAIL PROTECTED]
new.hs
Description: Binary data
_______________________________________________ Glasgow-haskell-users mailing list Glasgow-haskell-users@haskell.org http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
