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
|
//===----------------------------------------------------------------------===//
//
// 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>
// proj(const complex<T>& x);
#include <complex>
#include <cassert>
#include "../cases.h"
template <class T>
void
test(const std::complex<T>& z, std::complex<T> x)
{
assert(proj(z) == x);
}
template <class T>
void
test()
{
test(std::complex<T>(1, 2), std::complex<T>(1, 2));
test(std::complex<T>(-1, 2), std::complex<T>(-1, 2));
test(std::complex<T>(1, -2), std::complex<T>(1, -2));
test(std::complex<T>(-1, -2), std::complex<T>(-1, -2));
}
void test_edges()
{
const unsigned N = sizeof(x) / sizeof(x[0]);
for (unsigned i = 0; i < N; ++i)
{
std::complex<double> r = proj(x[i]);
switch (classify(x[i]))
{
case zero:
case non_zero:
assert(r == x[i]);
assert(std::signbit(real(r)) == std::signbit(real(x[i])));
assert(std::signbit(imag(r)) == std::signbit(imag(x[i])));
break;
case inf:
assert(std::isinf(real(r)) && real(r) > 0);
assert(imag(r) == 0);
assert(std::signbit(imag(r)) == std::signbit(imag(x[i])));
break;
case NaN:
case non_zero_nan:
assert(classify(r) == classify(x[i]));
break;
}
}
}
int main()
{
test<float>();
test<double>();
test<long double>();
test_edges();
}
|
