//===----------------------------------------------------------------------===// // // 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. // //===----------------------------------------------------------------------===// // // template // complex // pow(const complex& x, const complex& y); #include #include #include "../cases.h" template void test(const std::complex& a, const std::complex& b, std::complex x) { std::complex c = pow(a, b); is_about(real(c), real(x)); is_about(imag(c), imag(x)); } template void test() { test(std::complex(2, 3), std::complex(2, 0), std::complex(-5, 12)); } void test_edges() { const double pi = std::atan2(+0., -0.); const unsigned N = sizeof(x) / sizeof(x[0]); for (unsigned i = 0; i < N; ++i) { for (unsigned j = 0; j < N; ++j) { std::complex r = pow(x[i], x[j]); std::complex z = exp(x[j] * log(x[i])); if (std::isnan(real(r))) assert(std::isnan(real(z))); else { assert(real(r) == real(z)); assert(std::signbit(real(r)) == std::signbit(real(z))); } if (std::isnan(imag(r))) assert(std::isnan(imag(z))); else { assert(imag(r) == imag(z)); assert(std::signbit(imag(r)) == std::signbit(imag(z))); } } } } int main() { test(); test(); test(); test_edges(); }