How about an FFI call to rand() and then measure the performance

On Thu, Feb 26, 2009 at 3:37 AM, Felipe Lessa <felipe.lessa@gmail.com> wrote:
On Thu, Feb 26, 2009 at 7:56 AM, Eugene Kirpichov <ekirpichov@gmail.com> wrote:
> Here is a variant that uses mersenne-random-pure64 and works less than
> 2x slower than C++:

And I would like to notice that rand() is incredibly dumber than the
Mersenne twister, so probably if we took rand()'s code from glibc and
rewrote it in Haskell, there would be another performance increase.

--
Felipe.
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe