Files
mercury/library/random.m
Thomas Conway 98576713ce Change the coefficients for the linear-congruential generator.
Estimated hours taken: 0.1

library/random.m:
	Change the coefficients for the linear-congruential generator.
	They now assume only 31 bits (unsigned) rather than 32. This
	should prevent the defective behaviour reported on the
	mercury-users mailing list.
1998-10-28 23:18:42 +00:00

109 lines
3.4 KiB
Mathematica

%---------------------------------------------------------------------------%
% Copyright (C) 1994-1998 The University of Melbourne.
% This file may only be copied under the terms of the GNU Library General
% Public License - see the file COPYING.LIB in the Mercury distribution.
%---------------------------------------------------------------------------%
%
% file: rand.m
% main author: conway
% stability: low
%
% Define a set of random number generator predicates. This implementation
% uses a threaded random-number supply. It could be made non-unique, but
% since each thread returns the same list of random numbers, in the interests
% of safety, it is declared with (backtrackable) unique modes.
% The coefficients used in the implementation were taken from Numerical
% Recipes in C (Press et al), and are originally due to Knuth.
%
%---------------------------------------------------------------------------%
:- module random.
:- interface.
:- import_module list.
% The type `random__supply' represents a supply of random numbers.
:- type random__supply.
% random__init(Seed, RS): creates a supply of random numbers RS
% using the specified Seed.
:- pred random__init(int, random__supply).
:- mode random__init(in, uo) is det.
% random__random(Num, RS0, RS): extracts a number Num in the
% range 0 .. RandMax from the random number supply RS0, and
% binds RS to the new state of the random number supply.
:- pred random__random(int, random__supply, random__supply).
:- mode random__random(out, mdi, muo) is det.
% random__randmax(RandMax, RS0, RS): binds Randax to the maximum
% random number that can be returned from the random number
% supply RS0, and returns RS = RS0.
:- pred random__randmax(int, random__supply, random__supply).
:- mode random__randmax(out, mdi, muo) is det.
%---------------------------------------------------------------------------%
:- implementation.
% Everything after the first `:- implementation' does not appear
% in the Mercury Library Reference Manual.
:- interface.
% The following predicate was just for test purposes.
% It should not be used by user programs.
:- pragma obsolete(random__test/4).
:- pred random__test(int, int, list(int), int).
:- mode random__test(in, in, out, out) is det.
%---------------------------------------------------------------------------%
:- implementation.
:- import_module int.
:- type random__supply == int. % I(j)
:- pred random__params(int, int, int). % a, c, m
:- mode random__params(out, out, out) is det.
random__params(9301, 49297, 233280).
random__init(I0, RS) :-
copy(I0, RS).
random__random(I, RS0, RS) :-
RS0 = I0,
random__params(A, C, M),
I is ((I0 * A) + C) mod M,
copy(I, RS).
random__randmax(M1, Rs, Rs) :-
random__params(_A, _C, M),
M1 is M - 1.
%---------------------------------------------------------------------------%
%---------------------------------------------------------------------------%
random__test(Seed, N, Nums, Max) :-
random__init(Seed, RS),
random__randmax(Max, RS, RS1),
random__test_2(N, Nums, RS1, _RS2).
:- pred random__test_2(int, list(int), random__supply, random__supply).
:- mode random__test_2(in, out, mdi, muo) is det.
random__test_2(N, Is, RS0, RS) :-
(
N > 0
->
N1 is N - 1,
random__random(I, RS0, RS1),
random__test_2(N1, Is0, RS1, RS),
Is = [I|Is0]
;
Is = [],
RS = RS0
).
%---------------------------------------------------------------------------%