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.
This repo is archived. You can view files and clone it, but cannot push or open issues/pull-requests.
libcxx_old/test/std/numerics/complex.number/complex.transcendentals/log.pass.cpp

134 lines
4.2 KiB
C++

//===----------------------------------------------------------------------===//
//
// 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
//
//===----------------------------------------------------------------------===//
// <complex>
// template<class T>
// complex<T>
// log(const complex<T>& x);
#include <complex>
#include <cassert>
#include "test_macros.h"
#include "../cases.h"
template <class T>
void
test(const std::complex<T>& c, std::complex<T> x)
{
assert(log(c) == x);
}
template <class T>
void
test()
{
test(std::complex<T>(0, 0), std::complex<T>(-INFINITY, 0));
}
void test_edges()
{
const double pi = std::atan2(+0., -0.);
const unsigned N = sizeof(testcases) / sizeof(testcases[0]);
for (unsigned i = 0; i < N; ++i)
{
std::complex<double> r = log(testcases[i]);
if (testcases[i].real() == 0 && testcases[i].imag() == 0)
{
if (std::signbit(testcases[i].real()))
{
assert(std::isinf(r.real()));
assert(r.real() < 0);
if (std::signbit(testcases[i].imag()))
is_about(r.imag(), -pi);
else
is_about(r.imag(), pi);
}
else
{
assert(std::isinf(r.real()));
assert(r.real() < 0);
assert(r.imag() == 0);
assert(std::signbit(testcases[i].imag()) == std::signbit(r.imag()));
}
}
else if (std::isfinite(testcases[i].real()) && std::isinf(testcases[i].imag()))
{
assert(std::isinf(r.real()));
assert(r.real() > 0);
if (testcases[i].imag() > 0)
is_about(r.imag(), pi/2);
else
is_about(r.imag(), -pi/2);
}
else if (std::isfinite(testcases[i].real()) && std::isnan(testcases[i].imag()))
{
assert(std::isnan(r.real()));
assert(std::isnan(r.imag()));
}
else if (std::isinf(testcases[i].real()) && testcases[i].real() < 0 && std::isfinite(testcases[i].imag()))
{
assert(std::isinf(r.real()) && r.real() > 0);
if (r.imag() > 0)
is_about(r.imag(), pi);
else
is_about(r.imag(), -pi);
}
else if (std::isinf(testcases[i].real()) && testcases[i].real() > 0 && std::isfinite(testcases[i].imag()))
{
assert(std::isinf(r.real()) && r.real() > 0);
assert(r.imag() == 0);
assert(std::signbit(testcases[i].imag()) == std::signbit(r.imag()));
}
else if (testcases[i].real() == 1 && testcases[i].imag() == 0)
{
assert(r.real() == 0);
assert(std::signbit(r.imag()) == std::signbit(testcases[i].imag()));
}
else if (testcases[i].real() == 0 && testcases[i].imag() == 1)
{
assert(r.real() == 0);
is_about(r.imag(), pi/2);
}
else if (testcases[i].real() == -1 && testcases[i].imag() == 0)
{
assert(r.real() == 0);
if (std::signbit(testcases[i].imag()))
is_about(r.imag(), -pi);
else
is_about(r.imag(), pi);
}
else if (testcases[i].real() == 0 && testcases[i].imag() == -1)
{
assert(r.real() == 0);
is_about(r.imag(), -pi/2);
}
else if (std::isfinite(testcases[i].real()) && std::isfinite(testcases[i].imag()) && abs(testcases[i]) < 1)
{
assert( std::signbit(r.real()));
assert(std::signbit(r.imag()) == std::signbit(testcases[i].imag()));
}
else if (std::isfinite(testcases[i].real()) && std::isfinite(testcases[i].imag()) && abs(testcases[i]) > 1)
{
assert(!std::signbit(r.real()));
assert(std::signbit(r.imag()) == std::signbit(testcases[i].imag()));
}
}
}
int main(int, char**)
{
test<float>();
test<double>();
test<long double>();
test_edges();
return 0;
}