Mercurial > emacs
changeset 6376:3fe339cf2dde
(Frandom): Eliminate bias in random number generator.
author | Karl Heuer <kwzh@gnu.org> |
---|---|
date | Wed, 16 Mar 1994 06:48:19 +0000 |
parents | 212dcd2c06e4 |
children | 88d0b3f74923 |
files | src/fns.c |
diffstat | 1 files changed, 13 insertions(+), 8 deletions(-) [+] |
line wrap: on
line diff
--- a/src/fns.c Wed Mar 16 06:14:56 1994 +0000 +++ b/src/fns.c Wed Mar 16 06:48:19 1994 +0000 @@ -55,24 +55,29 @@ Lisp_Object limit; { int val; + unsigned long denominator; extern long random (); extern srandom (); extern long time (); if (EQ (limit, Qt)) srandom (getpid () + time (0)); - val = random (); - if (XTYPE (limit) == Lisp_Int && XINT (limit) != 0) + if (XTYPE (limit) == Lisp_Int && XINT (limit) > 0) { /* Try to take our random number from the higher bits of VAL, not the lower, since (says Gentzel) the low bits of `random' - are less random than the higher ones. */ - val &= 0xfffffff; /* Ensure positive. */ - val >>= 5; - if (XINT (limit) < 10000) - val >>= 6; - val %= XINT (limit); + are less random than the higher ones. We do this by using the + quotient rather than the remainder. At the high end of the RNG + it's possible to get a quotient larger than limit; discarding + these values eliminates the bias that would otherwise appear + when using a large limit. */ + denominator = (unsigned long)0x80000000 / XFASTINT (limit); + do + val = (random () & 0x7fffffff) / denominator; + while (val >= limit); } + else + val = random (); return make_number (val); }