1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61
|
//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
// <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>
#include "test_macros.h"
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(int, char**)
{
test<unsigned short>();
test<unsigned int>();
test<unsigned long>();
test<unsigned long long>();
return 0;
}
|