//===----------------------------------------------------------------------===// // // 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 // //===----------------------------------------------------------------------===// // // template // complex // proj(const complex& x); #include #include #include "test_macros.h" #include "../cases.h" template void test(const std::complex& z, std::complex x) { assert(proj(z) == x); } template void test() { test(std::complex(1, 2), std::complex(1, 2)); test(std::complex(-1, 2), std::complex(-1, 2)); test(std::complex(1, -2), std::complex(1, -2)); test(std::complex(-1, -2), std::complex(-1, -2)); } void test_edges() { const unsigned N = sizeof(testcases) / sizeof(testcases[0]); for (unsigned i = 0; i < N; ++i) { std::complex 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(int, char**) { test(); test(); test(); test_edges(); return 0; }