1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
|
/* Random_Number_Generator class implementation: inline functions.
Copyright (C) 2001-2010 Roberto Bagnara <bagnara@cs.unipr.it>
Copyright (C) 2010-2011 BUGSENG srl (http://bugseng.com)
This file is part of the Parma Polyhedra Library (PPL).
The PPL is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
Free Software Foundation; either version 3 of the License, or (at your
option) any later version.
The PPL is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software Foundation,
Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
For the most up-to-date information see the Parma Polyhedra Library
site: http://www.cs.unipr.it/ppl/ . */
#ifndef PPL_Random_Number_Generator_inlines_hh
#define PPL_Random_Number_Generator_inlines_hh 1
#include <ctime>
namespace Parma_Polyhedra_Library {
namespace Implementation {
namespace Random_Numbers {
template <typename T>
class Random_Number_Generator_Aux {
public:
Random_Number_Generator_Aux(unsigned int max_bits) {
if (std::numeric_limits<T>::is_bounded) {
assign_r(zmin, std::numeric_limits<T>::min(), ROUND_NOT_NEEDED);
assign_r(zrange, std::numeric_limits<T>::max(), ROUND_NOT_NEEDED);
zrange -= zmin;
++zrange;
}
else if (std::numeric_limits<T>::is_signed) {
zmin = 1;
zmin <<= (max_bits - 1);
zmin = -zmin;
}
else {
assign_r(zmin, std::numeric_limits<T>::min(), ROUND_NOT_NEEDED);
}
}
mpz_class zmin;
mpz_class zrange;
};
} // namespace Random_Numbers
} // namespace Implementation
inline
Random_Number_Generator::Random_Number_Generator()
: rand(gmp_randinit_default), max_bits(512) {
// Seed the random number generator with the current time.
rand.seed((unsigned long) time(0));
}
inline
Random_Number_Generator::Random_Number_Generator(const unsigned long seed)
: rand(gmp_randinit_default), max_bits(512) {
// Seed the random number generator with the given value.
rand.seed(seed);
}
template <typename T>
inline void
Random_Number_Generator::get(T& x, unsigned int info) {
using Implementation::Random_Numbers::Random_Number_Generator_Aux;
used(info);
static Random_Number_Generator_Aux<T> aux(max_bits);
mpz_class n;
if (std::numeric_limits<T>::is_bounded) {
n = rand.get_z_range(aux.zrange);
}
else {
n = rand.get_z_bits(max_bits);
}
n += aux.zmin;
assign_r(x, n, ROUND_NOT_NEEDED);
}
} // namespace Parma_Polyhedra_Library
#endif // !defined(PPL_Random_Number_Generator_inlines_hh)
|
