cxx/test/numerics/rand/rand.eng/rand.eng.lcong/values.pass.cpp
2010-05-11 21:36:01 +00:00

68 lines
1.8 KiB
C++

//===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
// <random>
// template <class UIntType, UIntType a, UIntType c, UIntType m>
// class linear_congruential_engine
// {
// public:
// engine characteristics
// static constexpr result_type multiplier = a;
// static constexpr result_type increment = c;
// static constexpr result_type modulus = m;
// static constexpr result_type min() { return c == 0u ? 1u: 0u;}
// static constexpr result_type max() { return m - 1u;}
// static constexpr result_type default_seed = 1u;
#include <random>
#include <type_traits>
#include <cassert>
template <class T, T a, T c, T m>
void
test1()
{
typedef std::linear_congruential_engine<T, a, c, m> LCE;
typedef typename LCE::result_type result_type;
static_assert((LCE::multiplier == a), "");
static_assert((LCE::increment == c), "");
static_assert((LCE::modulus == m), "");
/*static_*/assert((LCE::min() == (c == 0u ? 1u: 0u))/*, ""*/);
/*static_*/assert((LCE::max() == result_type(m - 1u))/*, ""*/);
static_assert((LCE::default_seed == 1), "");
}
template <class T>
void
test()
{
test1<T, 0, 0, 0>();
test1<T, 0, 1, 2>();
test1<T, 1, 1, 2>();
const T M(~0);
test1<T, 0, 0, M>();
test1<T, 0, M-2, M>();
test1<T, 0, M-1, M>();
test1<T, M-2, 0, M>();
test1<T, M-2, M-2, M>();
test1<T, M-2, M-1, M>();
test1<T, M-1, 0, M>();
test1<T, M-1, M-2, M>();
test1<T, M-1, M-1, M>();
}
int main()
{
test<unsigned short>();
test<unsigned int>();
test<unsigned long>();
test<unsigned long long>();
}