-
-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathrandom_splitmix
124 lines (101 loc) · 4.98 KB
/
random_splitmix
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
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
/*
Copyright (C) 2018-2024 Geoffrey Daniels. https://gpdaniels.com/
This program 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, version 3 of the License only.
This program 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, see <https://www.gnu.org/licenses/>.
*/
#pragma once
#ifndef GTL_RANDOM_RANDOM_SPLITMIX_HPP
#define GTL_RANDOM_RANDOM_SPLITMIX_HPP
// Summary: Splitmix pseudo-random number generator.
#ifndef NDEBUG
#if defined(_MSC_VER)
#define __builtin_trap() __debugbreak()
#endif
/// @brief A simple assert macro to break the program if the random_splitmix is misused.
#define GTL_RANDOM_SPLITMIX_ASSERT(ASSERTION, MESSAGE) static_cast<void>((ASSERTION) || (__builtin_trap(), 0))
#else
/// @brief At release time the assert macro is implemented as a nop.
#define GTL_RANDOM_SPLITMIX_ASSERT(ASSERTION, MESSAGE) static_cast<void>(0)
#endif
namespace gtl {
/// @brief The random_splitmix class implements the splitmix pseudo-random-number generator.
class random_splitmix final {
private:
/// @brief Current state of the random number generator.
unsigned long long int state;
public:
/// @brief Defaulted destructor.
~random_splitmix() = default;
/// @brief Empty constructor.
random_splitmix()
: state(1) {
}
/// @brief Defaulted copy constructor.
random_splitmix(const random_splitmix&) = default;
/// @brief Defaulted move constructor.
random_splitmix(random_splitmix&&) = default;
/// @brief Defaulted copy assignment.
random_splitmix& operator=(const random_splitmix&) = default;
/// @brief Defaulted move assignment.
random_splitmix& operator=(random_splitmix&&) = default;
/// @brief Constructor with 64 bit seed.
/// @param seed_value Seed value used to initialise the state.
random_splitmix(unsigned long long int seed_value) {
this->seed(seed_value);
}
/// @brief Initialise the state from a 64 bit seed.
/// @param seed_value Seed value used to initialise the state.
void seed(unsigned long long int seed_value) {
this->state = seed_value;
}
/// @brief Get the next random number from the generator.
/// @return A pseudo-random number.
unsigned int get_random_raw() {
unsigned long long int z = (this->state += 0x9E3779B97F4A7C15ull);
z = (z ^ (z >> 30)) * 0xBF58476D1CE4E5B9ull;
z = (z ^ (z >> 27)) * 0x94D049BB133111EBull;
return static_cast<unsigned int>((z ^ (z >> 31)) >> 31);
}
public:
/// @brief Get a random number in the open interval 0 < value < 1.
/// @return A pseudo-random number.
double get_random_exclusive() {
return (static_cast<double>(this->get_random_raw()) + 0.5) * (1.0 / static_cast<double>(1ull << 32));
}
/// @brief Get a random number in the half-open interval 0 <= value < 1.
/// @return A pseudo-random number.
double get_random_exclusive_top() {
return static_cast<double>(this->get_random_raw()) * (1.0 / static_cast<double>(1ull << 32));
}
/// @brief Get a random number in the closed interval 0 <= value <= 1.
/// @return A pseudo-random number.
double get_random_inclusive() {
return static_cast<double>(this->get_random_raw()) * (1.0 / static_cast<double>((1ull << 32) - 1));
}
/// @brief Get a random number between two bounds.
/// @param inclusive_min Minimum number that can be returned.
/// @param inclusive_max Max number than can be returned.
/// @return A pseudo-random number.
unsigned int get_random(unsigned int inclusive_min, unsigned int inclusive_max) {
GTL_RANDOM_SPLITMIX_ASSERT(inclusive_min < inclusive_max, "Minimum bound must be lower than maximum bound.");
return (this->get_random_raw() % (1 + inclusive_max - inclusive_min)) + inclusive_min;
}
/// @brief Get a random number between two bounds.
/// @param inclusive_min Minimum number that can be returned.
/// @param inclusive_max Max number than can be returned.
/// @return A pseudo-random number.
double get_random(double inclusive_min, double inclusive_max) {
GTL_RANDOM_SPLITMIX_ASSERT(inclusive_min < inclusive_max, "Minimum bound must be lower than maximum bound.");
return (this->get_random_inclusive() * (inclusive_max - inclusive_min)) + inclusive_min;
}
};
}
#undef GTL_RANDOM_SPLITMIX_ASSERT
#endif // GTL_RANDOM_RANDOM_SPLITMIX_HPP