Common mathematical functions | |||||||||||||||||||||||||||||||
Mathematical special functions(C++17) | |||||||||||||||||||||||||||||||
Mathematical constants(C++20) | |||||||||||||||||||||||||||||||
Basic linear algebra algorithms(C++26) | |||||||||||||||||||||||||||||||
Data-parallel types (SIMD)(C++26) | |||||||||||||||||||||||||||||||
Floating-point environment(C++11) | |||||||||||||||||||||||||||||||
Complex numbers | |||||||||||||||||||||||||||||||
Numeric array (valarray ) | |||||||||||||||||||||||||||||||
Pseudo-random number generation | |||||||||||||||||||||||||||||||
Bit manipulation(C++20) | |||||||||||||||||||||||||||||||
Saturation arithmetic(C++26) | |||||||||||||||||||||||||||||||
Factor operations | |||||||||||||||||||||||||||||||
|
| ||||||||||||||||||||||||||||||
Interpolations | |||||||||||||||||||||||||||||||
|
| ||||||||||||||||||||||||||||||
Generic numeric operations | |||||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||||
C-style checked integer arithmetic | |||||||||||||||||||||||||||||||
|
|
|
Member functions | ||||
Generation | ||||
Characteristics | ||||
Non-member functions | ||||
(C++11)(C++11)(until C++20) | ||||
(C++11)(C++11) |
Defined in header <random> | ||
template< class UIntType, | (since C++11) | |
linear_congruential_engine
is a random number engine based onLinear congruential generator (LCG).
Contents |
UIntType | - | The result type generated by the generator. The effect is undefined if this is not one ofunsignedshort,unsignedint,unsignedlong, orunsignedlonglong. |
a | - | the multiplier term |
c | - | the increment term |
m | - | the modulus term |
Whenm is not zero, ifa>= m orc>= m istrue, the program is ill-formed.
Thesize of the states oflinear_congruential_engine
is1, each of them consists of a single integer.
The actual modulus\(\scriptsize m_0\)m0 is defined as follows:
result_type
).Thetransition algorithm oflinear_congruential_engine
is\(\scriptsize TA(x_i) = (a \cdot x_i + c)\mod m_0\)TA(xi) = (a·xi+c) mod m0.
Thegeneration algorithm oflinear_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.
The following specializations define the random number engine with two commonly used parameter sets:
Defined in header <random> | |
Type | Definition |
minstd_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, |
Type | Definition |
result_type | UIntType |
constexpr UIntType multiplier [static] | a (public static member constant) |
constexpr UIntType increment [static] | c (public static member constant) |
constexpr UIntType modulus [static] | m (public static member constant) |
constexpr UIntType default_seed [static] | 1u (public static member constant) |
Construction and Seeding | |
constructs the engine (public member function)[edit] | |
sets the current state of the engine (public member function)[edit] | |
Generation | |
advances the engine's state and returns the generated value (public member function)[edit] | |
advances the engine's state by a specified amount (public member function)[edit] | |
Characteristics | |
[static] | gets the smallest possible value in the output range (public static member function)[edit] |
[static] | gets the largest possible value in the output range (public static member function)[edit] |
(C++11)(C++11)(removed in C++20) | compares the internal states of two pseudo-random number engines (function)[edit] |
(C++11) | performs stream input and output on pseudo-random number engine (function template)[edit] |
This section is incomplete Reason: no example |