File: default.pass.cpp

package info (click to toggle)
llvm-toolchain-19 1%3A19.1.7-3~deb12u1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm-proposed-updates
  • size: 1,998,492 kB
  • sloc: cpp: 6,951,680; ansic: 1,486,157; asm: 913,598; python: 232,024; f90: 80,126; objc: 75,281; lisp: 37,276; pascal: 16,990; sh: 10,009; ml: 5,058; perl: 4,724; awk: 3,523; makefile: 3,167; javascript: 2,504; xml: 892; fortran: 664; cs: 573
file content (91 lines) | stat: -rw-r--r-- 2,107 bytes parent folder | download | duplicates (3)
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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
//===----------------------------------------------------------------------===//
//
// 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();

#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> LCE;
    LCE e1;
    LCE e2;
    e2.seed();
    assert(e1 == e2);
}

template <class T>
void
test()
{
  const int W = sizeof(T) * CHAR_BIT;
  const T M(static_cast<T>(-1));
  const T A(static_cast<T>((static_cast<T>(1) << (W / 2)) - 1));

  // Cases where m = 0
  test1<T, 0, 0, 0>();
  test1<T, A, 0, 0>();
  test1<T, 0, 1, 0>();
  test1<T, A, 1, 0>();

  // Cases where m = 2^n for n < w
  test1<T, 0, 0, 256>();
  test1<T, 5, 0, 256>();
  test1<T, 0, 1, 256>();
  test1<T, 5, 1, 256>();

  // Cases where m is odd and a = 0
  test1<T, 0, 0, M>();
  test1<T, 0, M - 2, M>();
  test1<T, 0, M - 1, M>();

  // Cases where m is odd and m % a <= m / a (Schrage)
  test1<T, A, 0, M>();
  test1<T, A, M - 2, M>();
  test1<T, A, M - 1, M>();
}

template <class T>
void test_ext() {
  const T M(static_cast<T>(-1));

  // Cases where m is odd and m % a > m / a
  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_ext<unsigned short>();
    test<unsigned int>();
    test_ext<unsigned int>();
    test<unsigned long>();
    test_ext<unsigned long>();
    test<unsigned long long>();
    // This isn't implemented on platforms without __int128
#ifndef _LIBCPP_HAS_NO_INT128
    test_ext<unsigned long long>();
#endif

    return 0;
}