aboutsummaryrefslogtreecommitdiff
path: root/test/std/numerics/complex.number/complex.ops/complex_times_complex.pass.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'test/std/numerics/complex.number/complex.ops/complex_times_complex.pass.cpp')
-rw-r--r--test/std/numerics/complex.number/complex.ops/complex_times_complex.pass.cpp16
1 files changed, 8 insertions, 8 deletions
diff --git a/test/std/numerics/complex.number/complex.ops/complex_times_complex.pass.cpp b/test/std/numerics/complex.number/complex.ops/complex_times_complex.pass.cpp
index 565eaa5657cd..8ead5bfb627a 100644
--- a/test/std/numerics/complex.number/complex.ops/complex_times_complex.pass.cpp
+++ b/test/std/numerics/complex.number/complex.ops/complex_times_complex.pass.cpp
@@ -39,16 +39,16 @@ test()
void test_edges()
{
- const unsigned N = sizeof(x) / sizeof(x[0]);
+ 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 = x[i] * x[j];
- switch (classify(x[i]))
+ std::complex<double> r = testcases[i] * testcases[j];
+ switch (classify(testcases[i]))
{
case zero:
- switch (classify(x[j]))
+ switch (classify(testcases[j]))
{
case zero:
assert(classify(r) == zero);
@@ -68,7 +68,7 @@ void test_edges()
}
break;
case non_zero:
- switch (classify(x[j]))
+ switch (classify(testcases[j]))
{
case zero:
assert(classify(r) == zero);
@@ -88,7 +88,7 @@ void test_edges()
}
break;
case inf:
- switch (classify(x[j]))
+ switch (classify(testcases[j]))
{
case zero:
assert(classify(r) == NaN);
@@ -108,7 +108,7 @@ void test_edges()
}
break;
case NaN:
- switch (classify(x[j]))
+ switch (classify(testcases[j]))
{
case zero:
assert(classify(r) == NaN);
@@ -128,7 +128,7 @@ void test_edges()
}
break;
case non_zero_nan:
- switch (classify(x[j]))
+ switch (classify(testcases[j]))
{
case zero:
assert(classify(r) == NaN);