summaryrefslogtreecommitdiff
path: root/test/std/numerics/complex.number/complex.value.ops
diff options
context:
space:
mode:
Diffstat (limited to 'test/std/numerics/complex.number/complex.value.ops')
-rw-r--r--test/std/numerics/complex.number/complex.value.ops/abs.pass.cpp6
-rw-r--r--test/std/numerics/complex.number/complex.value.ops/arg.pass.cpp46
-rw-r--r--test/std/numerics/complex.number/complex.value.ops/norm.pass.cpp6
-rw-r--r--test/std/numerics/complex.number/complex.value.ops/polar.pass.cpp6
-rw-r--r--test/std/numerics/complex.number/complex.value.ops/proj.pass.cpp16
5 files changed, 40 insertions, 40 deletions
diff --git a/test/std/numerics/complex.number/complex.value.ops/abs.pass.cpp b/test/std/numerics/complex.number/complex.value.ops/abs.pass.cpp
index 5d841d6ee9f10..7a0e3bd700722 100644
--- a/test/std/numerics/complex.number/complex.value.ops/abs.pass.cpp
+++ b/test/std/numerics/complex.number/complex.value.ops/abs.pass.cpp
@@ -28,11 +28,11 @@ 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)
{
- double r = abs(x[i]);
- switch (classify(x[i]))
+ double r = abs(testcases[i]);
+ switch (classify(testcases[i]))
{
case zero:
assert(r == 0);
diff --git a/test/std/numerics/complex.number/complex.value.ops/arg.pass.cpp b/test/std/numerics/complex.number/complex.value.ops/arg.pass.cpp
index a7da456b979c1..78f2781b76e24 100644
--- a/test/std/numerics/complex.number/complex.value.ops/arg.pass.cpp
+++ b/test/std/numerics/complex.number/complex.value.ops/arg.pass.cpp
@@ -29,42 +29,42 @@ test()
void test_edges()
{
const double pi = std::atan2(+0., -0.);
- const unsigned N = sizeof(x) / sizeof(x[0]);
+ const unsigned N = sizeof(testcases) / sizeof(testcases[0]);
for (unsigned i = 0; i < N; ++i)
{
- double r = arg(x[i]);
- if (std::isnan(x[i].real()) || std::isnan(x[i].imag()))
+ double r = arg(testcases[i]);
+ if (std::isnan(testcases[i].real()) || std::isnan(testcases[i].imag()))
assert(std::isnan(r));
else
{
- switch (classify(x[i]))
+ switch (classify(testcases[i]))
{
case zero:
- if (std::signbit(x[i].real()))
+ if (std::signbit(testcases[i].real()))
{
- if (std::signbit(x[i].imag()))
+ if (std::signbit(testcases[i].imag()))
is_about(r, -pi);
else
is_about(r, pi);
}
else
{
- assert(std::signbit(x[i].imag()) == std::signbit(r));
+ assert(std::signbit(testcases[i].imag()) == std::signbit(r));
}
break;
case non_zero:
- if (x[i].real() == 0)
+ if (testcases[i].real() == 0)
{
- if (x[i].imag() < 0)
+ if (testcases[i].imag() < 0)
is_about(r, -pi/2);
else
is_about(r, pi/2);
}
- else if (x[i].imag() == 0)
+ else if (testcases[i].imag() == 0)
{
- if (x[i].real() < 0)
+ if (testcases[i].real() < 0)
{
- if (std::signbit(x[i].imag()))
+ if (std::signbit(testcases[i].imag()))
is_about(r, -pi);
else
is_about(r, pi);
@@ -72,37 +72,37 @@ void test_edges()
else
{
assert(r == 0);
- assert(std::signbit(x[i].imag()) == std::signbit(r));
+ assert(std::signbit(testcases[i].imag()) == std::signbit(r));
}
}
- else if (x[i].imag() > 0)
+ else if (testcases[i].imag() > 0)
assert(r > 0);
else
assert(r < 0);
break;
case inf:
- if (std::isinf(x[i].real()) && std::isinf(x[i].imag()))
+ if (std::isinf(testcases[i].real()) && std::isinf(testcases[i].imag()))
{
- if (x[i].real() < 0)
+ if (testcases[i].real() < 0)
{
- if (x[i].imag() > 0)
+ if (testcases[i].imag() > 0)
is_about(r, 0.75 * pi);
else
is_about(r, -0.75 * pi);
}
else
{
- if (x[i].imag() > 0)
+ if (testcases[i].imag() > 0)
is_about(r, 0.25 * pi);
else
is_about(r, -0.25 * pi);
}
}
- else if (std::isinf(x[i].real()))
+ else if (std::isinf(testcases[i].real()))
{
- if (x[i].real() < 0)
+ if (testcases[i].real() < 0)
{
- if (std::signbit(x[i].imag()))
+ if (std::signbit(testcases[i].imag()))
is_about(r, -pi);
else
is_about(r, pi);
@@ -110,12 +110,12 @@ void test_edges()
else
{
assert(r == 0);
- assert(std::signbit(r) == std::signbit(x[i].imag()));
+ assert(std::signbit(r) == std::signbit(testcases[i].imag()));
}
}
else
{
- if (x[i].imag() < 0)
+ if (testcases[i].imag() < 0)
is_about(r, -pi/2);
else
is_about(r, pi/2);
diff --git a/test/std/numerics/complex.number/complex.value.ops/norm.pass.cpp b/test/std/numerics/complex.number/complex.value.ops/norm.pass.cpp
index 48f774e8e1c92..da7ad14bedce5 100644
--- a/test/std/numerics/complex.number/complex.value.ops/norm.pass.cpp
+++ b/test/std/numerics/complex.number/complex.value.ops/norm.pass.cpp
@@ -28,11 +28,11 @@ 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)
{
- double r = norm(x[i]);
- switch (classify(x[i]))
+ double r = norm(testcases[i]);
+ switch (classify(testcases[i]))
{
case zero:
assert(r == 0);
diff --git a/test/std/numerics/complex.number/complex.value.ops/polar.pass.cpp b/test/std/numerics/complex.number/complex.value.ops/polar.pass.cpp
index a8747bd7c83b4..5e6cb0d523c25 100644
--- a/test/std/numerics/complex.number/complex.value.ops/polar.pass.cpp
+++ b/test/std/numerics/complex.number/complex.value.ops/polar.pass.cpp
@@ -46,11 +46,11 @@ 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)
{
- double r = real(x[i]);
- double theta = imag(x[i]);
+ double r = real(testcases[i]);
+ double theta = imag(testcases[i]);
std::complex<double> z = std::polar(r, theta);
switch (classify(r))
{
diff --git a/test/std/numerics/complex.number/complex.value.ops/proj.pass.cpp b/test/std/numerics/complex.number/complex.value.ops/proj.pass.cpp
index 10bf7f8576f6b..1a7e0c53f3d32 100644
--- a/test/std/numerics/complex.number/complex.value.ops/proj.pass.cpp
+++ b/test/std/numerics/complex.number/complex.value.ops/proj.pass.cpp
@@ -37,26 +37,26 @@ 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)
{
- std::complex<double> r = proj(x[i]);
- switch (classify(x[i]))
+ std::complex<double> r = proj(testcases[i]);
+ switch (classify(testcases[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])));
+ assert(r == testcases[i]);
+ assert(std::signbit(real(r)) == std::signbit(real(testcases[i])));
+ assert(std::signbit(imag(r)) == std::signbit(imag(testcases[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])));
+ assert(std::signbit(imag(r)) == std::signbit(imag(testcases[i])));
break;
case NaN:
case non_zero_nan:
- assert(classify(r) == classify(x[i]));
+ assert(classify(r) == classify(testcases[i]));
break;
}
}