linear_congruential::linear_congruential
Constrói o mecanismo.
explicit linear_congruential(UIntType x0 = default_seed)
template<class Gen>
linear_congruential(Gen& gen);
linear_congruential(const linear_congruential& right);
linear_congruential(linear_congruential& right);
Parâmetros
x0
O valor semente.Gen
O tipo do gerador semente.gen
O gerador semente.right
Um objeto de linear_congruential .
Comentários
O primeiro construtor constrói um objeto de linear_congruential e inicializá-la chamando seed(x0).O segundo construtor constrói um objeto de linear_congruential e inicializá-la chamando seed(gen).A terceira e quarta construtores constroem um objeto de linear_congruential copiando um objeto de linear_congruential .
Exemplo
// std_tr1__random__linear_congruential_construct.cpp
// compile with: /EHsc
#include <random>
#include <iostream>
typedef std::mt19937 Myeng;
typedef std::linear_congruential<int, 16807, 0,
(int)((1U << 31) - 1)> Myceng; // same as minstd_rand0
int main()
{
Myeng eng;
Myceng ceng;
Myceng::result_type compval = ceng();
compval = compval; // to quiet "unused" warnings
std::cout << "A == " << Myceng::multiplier << std::endl;
std::cout << "C == " << Myceng::increment << std::endl;
std::cout << "M == " << Myceng::modulus << std::endl;
std::cout << "min == " << ceng.min() << std::endl;
std::cout << "max == " << ceng.max() << std::endl;
ceng.seed(); // reseed base engine
std::cout << "a random value == " << ceng() << std::endl;
std::cout << "a random value == " << ceng() << std::endl;
std::cout << "a random value == " << ceng() << std::endl;
Myceng ceng2(eng); // construct with generator
ceng2.seed(eng); // seed with generator
return (0);
}
Requisitos
Cabeçalho: <random>
namespace: STD