alpar@1
|
1 |
/* glprng02.c */
|
alpar@1
|
2 |
|
alpar@1
|
3 |
/***********************************************************************
|
alpar@1
|
4 |
* This code is part of GLPK (GNU Linear Programming Kit).
|
alpar@1
|
5 |
*
|
alpar@1
|
6 |
* Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008,
|
alpar@1
|
7 |
* 2009, 2010 Andrew Makhorin, Department for Applied Informatics,
|
alpar@1
|
8 |
* Moscow Aviation Institute, Moscow, Russia. All rights reserved.
|
alpar@1
|
9 |
* E-mail: <mao@gnu.org>.
|
alpar@1
|
10 |
*
|
alpar@1
|
11 |
* GLPK is free software: you can redistribute it and/or modify it
|
alpar@1
|
12 |
* under the terms of the GNU General Public License as published by
|
alpar@1
|
13 |
* the Free Software Foundation, either version 3 of the License, or
|
alpar@1
|
14 |
* (at your option) any later version.
|
alpar@1
|
15 |
*
|
alpar@1
|
16 |
* GLPK is distributed in the hope that it will be useful, but WITHOUT
|
alpar@1
|
17 |
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
|
alpar@1
|
18 |
* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
|
alpar@1
|
19 |
* License for more details.
|
alpar@1
|
20 |
*
|
alpar@1
|
21 |
* You should have received a copy of the GNU General Public License
|
alpar@1
|
22 |
* along with GLPK. If not, see <http://www.gnu.org/licenses/>.
|
alpar@1
|
23 |
***********************************************************************/
|
alpar@1
|
24 |
|
alpar@1
|
25 |
#include "glpenv.h"
|
alpar@1
|
26 |
#include "glprng.h"
|
alpar@1
|
27 |
#define xfault xerror
|
alpar@1
|
28 |
|
alpar@1
|
29 |
/***********************************************************************
|
alpar@1
|
30 |
* NAME
|
alpar@1
|
31 |
*
|
alpar@1
|
32 |
* rng_unif_01 - obtain pseudo-random number in the range [0, 1]
|
alpar@1
|
33 |
*
|
alpar@1
|
34 |
* SYNOPSIS
|
alpar@1
|
35 |
*
|
alpar@1
|
36 |
* #include "glprng.h"
|
alpar@1
|
37 |
* double rng_unif_01(RNG *rand);
|
alpar@1
|
38 |
*
|
alpar@1
|
39 |
* RETURNS
|
alpar@1
|
40 |
*
|
alpar@1
|
41 |
* The routine rng_unif_01 returns a next pseudo-random number which is
|
alpar@1
|
42 |
* uniformly distributed in the range [0, 1]. */
|
alpar@1
|
43 |
|
alpar@1
|
44 |
double rng_unif_01(RNG *rand)
|
alpar@1
|
45 |
{ double x;
|
alpar@1
|
46 |
x = (double)rng_next_rand(rand) / 2147483647.0;
|
alpar@1
|
47 |
xassert(0.0 <= x && x <= 1.0);
|
alpar@1
|
48 |
return x;
|
alpar@1
|
49 |
}
|
alpar@1
|
50 |
|
alpar@1
|
51 |
/***********************************************************************
|
alpar@1
|
52 |
* NAME
|
alpar@1
|
53 |
*
|
alpar@1
|
54 |
* rng_uniform - obtain pseudo-random number in the range [a, b]
|
alpar@1
|
55 |
*
|
alpar@1
|
56 |
* SYNOPSIS
|
alpar@1
|
57 |
*
|
alpar@1
|
58 |
* #include "glprng.h"
|
alpar@1
|
59 |
* double rng_uniform(RNG *rand, double a, double b);
|
alpar@1
|
60 |
*
|
alpar@1
|
61 |
* RETURNS
|
alpar@1
|
62 |
*
|
alpar@1
|
63 |
* The routine rng_uniform returns a next pseudo-random number which is
|
alpar@1
|
64 |
* uniformly distributed in the range [a, b]. */
|
alpar@1
|
65 |
|
alpar@1
|
66 |
double rng_uniform(RNG *rand, double a, double b)
|
alpar@1
|
67 |
{ double x;
|
alpar@1
|
68 |
if (a >= b)
|
alpar@1
|
69 |
xfault("rng_uniform: a = %g, b = %g; invalid range\n", a, b);
|
alpar@1
|
70 |
x = rng_unif_01(rand);
|
alpar@1
|
71 |
x = a * (1.0 - x) + b * x;
|
alpar@1
|
72 |
xassert(a <= x && x <= b);
|
alpar@1
|
73 |
return x;
|
alpar@1
|
74 |
}
|
alpar@1
|
75 |
|
alpar@1
|
76 |
/* eof */
|