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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
|
///
/// @file ipow.cpp
/// @brief Test integer raise to power function.
///
/// Copyright (C) 2024 Kim Walisch, <kim.walisch@gmail.com>
///
/// This file is distributed under the BSD License. See the COPYING
/// file in the top level directory.
///
#include <imath.hpp>
#include <int128_t.hpp>
#include <stdint.h>
#include <iostream>
#include <cstdlib>
using namespace primecount;
void check(bool OK)
{
std::cout << " " << (OK ? "OK" : "ERROR") << "\n";
if (!OK)
std::exit(1);
}
int main()
{
for (uint64_t n = 1; n < 10; n++)
{
uint64_t res = ipow<0>(n);
std::cout << "pow<0>(" << n << ") = " << res;
check(res == 1);
}
for (uint64_t n = 0; n < 10; n++)
{
uint64_t res = ipow<1>(n);
std::cout << "pow<1>(" << n << ") = " << res;
check(res == n);
}
for (uint64_t n = 0; n < 10; n++)
{
uint64_t res = ipow<2>(n);
std::cout << "pow<2>(" << n << ") = " << res;
check(res == n * n);
}
for (uint64_t n = 0; n < 10; n++)
{
uint64_t res = ipow<3>(n);
std::cout << "pow<3>(" << n << ") = " << res;
check(res == n * n * n);
}
for (uint64_t n = 0; n < 10; n++)
{
uint64_t res = ipow<4>(n);
std::cout << "pow<4>(" << n << ") = " << res;
check(res == n * n * n * n);
}
for (uint64_t n = 0; n < 10; n++)
{
uint64_t res = ipow<5>(n);
std::cout << "pow<5>(" << n << ") = " << res;
check(res == n * n * n * n * n);
}
for (uint64_t n = 0; n < 10; n++)
{
uint64_t res = ipow<6>(n);
std::cout << "pow<6>(" << n << ") = " << res;
check(res == n * n * n * n * n * n);
}
for (uint64_t n = 0; n < 10; n++)
{
uint64_t res = ipow<7>(n);
std::cout << "pow<7>(" << n << ") = " << res;
check(res == n * n * n * n * n * n * n);
}
for (uint64_t n = 0; n < 10; n++)
{
uint64_t res = ipow<8>(n);
std::cout << "pow<8>(" << n << ") = " << res;
check(res == n * n * n * n * n * n * n * n);
}
for (uint64_t n = 0; n < 10; n++)
{
uint64_t res = ipow<9>(n);
std::cout << "pow<9>(" << n << ") = " << res;
check(res == n * n * n * n * n * n * n * n * n);
}
for (uint64_t n = 0; n < 10; n++)
{
uint64_t res = ipow<10>(n);
std::cout << "pow<10>(" << n << ") = " << res;
check(res == n * n * n * n * n * n * n * n * n * n);
}
std::cout << std::endl;
std::cout << "All tests passed successfully!" << std::endl;
return 0;
}
|
