class UIntType,
UIntType a,
UIntType c,
UIntType m
linear_congruential_engine
is a random number engine based on Linear congruential generator (LCG).
When m is not zero, if a >= m or c >= m is true, the program is ill-formed.
[edit] Generator propertiesThe size of the states of linear_congruential_engine
is 1, each of them consists of a single integer.
The actual modulus \(\scriptsize m_0\)m0 is defined as follows:
result_type
).The transition algorithm of linear_congruential_engine
is \(\scriptsize TA(x_i) = (a \cdot x_i + c)\mod m_0\)TA(xi) = (a·xi+c) mod m0.
The generation algorithm of linear_congruential_engine
is \(\scriptsize GA(x_i) = (a \cdot x_i + c)\mod m_0\)GA(xi) = (a·xi+c) mod m0.
The pseudo-random number generated with the current state is also the successor state.
[edit] Predefined specializationsThe following specializations define the random number engine with two commonly used parameter sets:
Type Definitionminstd_rand0
(C++11) std::linear_congruential_engine<std::uint_fast32_t,
16807, 0, 2147483647>
Discovered in 1969 by Lewis, Goodman and Miller, adopted as "Minimal standard" in 1988 by Park and Miller[edit]
minstd_rand
(C++11)
std::linear_congruential_engine<std::uint_fast32_t,
48271, 0, 2147483647>
Newer "Minimum standard", recommended by Park, Miller, and Stockmeyer in 1993[edit]
result_type
UIntType
[edit] Data members
constexpr UIntType multiplier
[static]
aconstexpr UIntType increment
[static]
cconstexpr UIntType modulus
[static]
mconstexpr UIntType default_seed
[static]
1uRetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4