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
|
//===----------------------------------------------------------------------===//
//
// 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.
//
//===----------------------------------------------------------------------===//
// <complex>
// template<class T>
// complex<T>
// pow(const complex<T>& x, const complex<T>& y);
#include <complex>
#include <cassert>
#include "../cases.h"
template <class T>
void
test(const std::complex<T>& a, const std::complex<T>& b, std::complex<T> x)
{
std::complex<T> c = pow(a, b);
is_about(real(c), real(x));
is_about(imag(c), imag(x));
}
template <class T>
void
test()
{
test(std::complex<T>(2, 3), std::complex<T>(2, 0), std::complex<T>(-5, 12));
}
void test_edges()
{
const unsigned N = sizeof(testcases) / sizeof(testcases[0]);
for (unsigned i = 0; i < N; ++i)
{
for (unsigned j = 0; j < N; ++j)
{
std::complex<double> r = pow(testcases[i], testcases[j]);
std::complex<double> z = exp(testcases[j] * log(testcases[i]));
if (std::isnan(real(r)))
assert(std::isnan(real(z)));
else
{
assert(real(r) == real(z));
assert(std::signbit(real(r)) == std::signbit(real(z)));
}
if (std::isnan(imag(r)))
assert(std::isnan(imag(z)));
else
{
assert(imag(r) == imag(z));
assert(std::signbit(imag(r)) == std::signbit(imag(z)));
}
}
}
}
int main()
{
test<float>();
test<double>();
test<long double>();
test_edges();
}
|
