[erlang-questions] Speedy unsort:shuffle/1,2 ?

[Kenji Rikitake]

In the message <5DD3CDF1-6148-46FC-8496-A3010B97BD30@REDACTED>
dated Fri, May 28, 2010 at 10:56:45AM +1200,
Richard O'Keefe <ok@REDACTED> writes:
[...]
> It might be a good idea to move the core random number generator
> in random: into C (at present random:uniform() is quite slow) and
> perhaps even replace it by a better RNG.
[...]

For a testing purpose, the RNG doesn't really have to be
cryptographycally safe; it only has to have a uniform distribution.

Anybody has implemented a NIF or port version of Mersenne Twister or SFMT?
http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/index.html

(Mersenne Twister has been incorporated as the default RNG for Python
and R, so far as I know.)

BTW for a native Erlang version of MT:
http://www.erlang.org/pipermail/erlang-questions/2007-June/027065.html

Regards,
Kenji Rikitake