forked from mirror/libcxx
You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
59 lines
1.3 KiB
C++
59 lines
1.3 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
// Source Licenses. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <random>
|
|
|
|
// template <class UIntType, UIntType a, UIntType c, UIntType m>
|
|
// class linear_congruential_engine;
|
|
|
|
// linear_congruential_engine(const linear_congruential_engine&);
|
|
|
|
#include <random>
|
|
#include <cassert>
|
|
|
|
template <class T, T a, T c, T m>
|
|
void
|
|
test1()
|
|
{
|
|
typedef std::linear_congruential_engine<T, a, c, m> E;
|
|
E e1;
|
|
E e2 = e1;
|
|
assert(e1 == e2);
|
|
(void)e1();
|
|
(void)e2();
|
|
assert(e1 == e2);
|
|
}
|
|
|
|
template <class T>
|
|
void
|
|
test()
|
|
{
|
|
test1<T, 0, 0, 0>();
|
|
test1<T, 0, 1, 2>();
|
|
test1<T, 1, 1, 2>();
|
|
const T M(static_cast<T>(-1));
|
|
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>();
|
|
}
|