complex_divide_complex.pass.cpp
4.49 KB
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
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
//===----------------------------------------------------------------------===//
//
// 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
//
//===----------------------------------------------------------------------===//
// <complex>
// template<class T>
// complex<T>
// operator/(const complex<T>& lhs, const complex<T>& rhs);
#include <complex>
#include <cassert>
#include "test_macros.h"
#include "../cases.h"
template <class T>
void
test(const std::complex<T>& lhs, const std::complex<T>& rhs, std::complex<T> x)
{
assert(lhs / rhs == x);
}
template <class T>
void
test()
{
std::complex<T> lhs(-4.0, 7.5);
std::complex<T> rhs(1.5, 2.5);
std::complex<T> x(1.5, 2.5);
test(lhs, rhs, x);
}
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 = testcases[i] / testcases[j];
switch (classify(testcases[i]))
{
case zero:
switch (classify(testcases[j]))
{
case zero:
assert(classify(r) == NaN);
break;
case non_zero:
assert(classify(r) == zero);
break;
case inf:
assert(classify(r) == zero);
break;
case NaN:
assert(classify(r) == NaN);
break;
case non_zero_nan:
assert(classify(r) == NaN);
break;
}
break;
case non_zero:
switch (classify(testcases[j]))
{
case zero:
assert(classify(r) == inf);
break;
case non_zero:
assert(classify(r) == non_zero);
break;
case inf:
assert(classify(r) == zero);
break;
case NaN:
assert(classify(r) == NaN);
break;
case non_zero_nan:
assert(classify(r) == NaN);
break;
}
break;
case inf:
switch (classify(testcases[j]))
{
case zero:
assert(classify(r) == inf);
break;
case non_zero:
assert(classify(r) == inf);
break;
case inf:
assert(classify(r) == NaN);
break;
case NaN:
assert(classify(r) == NaN);
break;
case non_zero_nan:
assert(classify(r) == NaN);
break;
}
break;
case NaN:
switch (classify(testcases[j]))
{
case zero:
assert(classify(r) == NaN);
break;
case non_zero:
assert(classify(r) == NaN);
break;
case inf:
assert(classify(r) == NaN);
break;
case NaN:
assert(classify(r) == NaN);
break;
case non_zero_nan:
assert(classify(r) == NaN);
break;
}
break;
case non_zero_nan:
switch (classify(testcases[j]))
{
case zero:
assert(classify(r) == inf);
break;
case non_zero:
assert(classify(r) == NaN);
break;
case inf:
assert(classify(r) == NaN);
break;
case NaN:
assert(classify(r) == NaN);
break;
case non_zero_nan:
assert(classify(r) == NaN);
break;
}
break;
}
}
}
}
int main(int, char**)
{
test<float>();
test<double>();
test<long double>();
test_edges();
return 0;
}