//===----------------------------------------------------------------------===//
//
//                     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>
//   atanh(const complex<T>& x);

#include <complex>
#include <cassert>

#include "../cases.h"

template <class T>
void
test(const std::complex<T>& c, std::complex<T> x)
{
    assert(atanh(c) == x);
}

template <class T>
void
test()
{
    test(std::complex<T>(0, 0), std::complex<T>(0, 0));
}

void test_edges()
{
    typedef std::complex<double> C;
    const double pi = std::atan2(+0., -0.);
    const unsigned N = sizeof(x) / sizeof(x[0]);
    for (unsigned i = 0; i < N; ++i)
    {
        std::complex<double> r = atanh(x[i]);
        if (x[i].real() == 0 && x[i].imag() == 0)
        {
            assert(std::signbit(r.real()) == std::signbit(x[i].real()));
            assert(std::signbit(r.imag()) == std::signbit(x[i].imag()));
        }
        else if ( x[i].real() == 0 && std::isnan(x[i].imag()))
        {
            assert(r.real() == 0);
            assert(std::signbit(x[i].real()) == std::signbit(r.real()));
            assert(std::isnan(r.imag()));
        }
        else if (abs(x[i].real()) == 1 && x[i].imag() == 0)
        {
            assert(std::isinf(r.real()));
            assert(std::signbit(x[i].real()) == std::signbit(r.real()));
            assert(r.imag() == 0);
            assert(std::signbit(x[i].imag()) == std::signbit(r.imag()));
        }
        else if (std::isfinite(x[i].real()) && std::isinf(x[i].imag()))
        {
            assert(r.real() == 0);
            assert(std::signbit(x[i].real()) == std::signbit(r.real()));
            if (x[i].imag() > 0)
                is_about(r.imag(),  pi/2);
            else
                is_about(r.imag(), -pi/2);
        }
        else if (std::isfinite(x[i].real()) && std::isnan(x[i].imag()))
        {
            assert(std::isnan(r.real()));
            assert(std::isnan(r.imag()));
        }
        else if (std::isinf(x[i].real()) && std::isfinite(x[i].imag()))
        {
            assert(r.real() == 0);
            assert(std::signbit(x[i].real()) == std::signbit(r.real()));
            if (std::signbit(x[i].imag()))
                is_about(r.imag(), -pi/2);
            else
                is_about(r.imag(),  pi/2);
        }
        else if (std::isinf(x[i].real()) && std::isinf(x[i].imag()))
        {
            assert(r.real() == 0);
            assert(std::signbit(x[i].real()) == std::signbit(r.real()));
            if (std::signbit(x[i].imag()))
                is_about(r.imag(), -pi/2);
            else
                is_about(r.imag(),  pi/2);
        }
        else if (std::isinf(x[i].real()) && std::isnan(x[i].imag()))
        {
            assert(r.real() == 0);
            assert(std::signbit(x[i].real()) == std::signbit(r.real()));
            assert(std::isnan(r.imag()));
        }
        else if (std::isnan(x[i].real()) && std::isfinite(x[i].imag()))
        {
            assert(std::isnan(r.real()));
            assert(std::isnan(r.imag()));
        }
        else if (std::isnan(x[i].real()) && std::isinf(x[i].imag()))
        {
            assert(r.real() == 0);
            assert(std::signbit(x[i].real()) == std::signbit(r.real()));
            if (std::signbit(x[i].imag()))
                is_about(r.imag(), -pi/2);
            else
                is_about(r.imag(),  pi/2);
        }
        else if (std::isnan(x[i].real()) && std::isnan(x[i].imag()))
        {
            assert(std::isnan(r.real()));
            assert(std::isnan(r.imag()));
        }
        else
        {
            assert(std::signbit(r.real()) == std::signbit(x[i].real()));
            assert(std::signbit(r.imag()) == std::signbit(x[i].imag()));
        }
    }
}

int main()
{
    test<float>();
    test<double>();
    test<long double>();
    test_edges();
}