forked from mirror/libcxx
You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
72 lines
1.8 KiB
C++
72 lines
1.8 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// 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(testcases) / sizeof(testcases[0]);
|
|
for (unsigned i = 0; i < N; ++i)
|
|
{
|
|
std::complex<double> r = proj(testcases[i]);
|
|
switch (classify(testcases[i]))
|
|
{
|
|
case zero:
|
|
case non_zero:
|
|
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(testcases[i])));
|
|
break;
|
|
case NaN:
|
|
case non_zero_nan:
|
|
assert(classify(r) == classify(testcases[i]));
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
int main()
|
|
{
|
|
test<float>();
|
|
test<double>();
|
|
test<long double>();
|
|
test_edges();
|
|
}
|