1 //===----------------------------------------------------------------------===//
2 //
3 // The LLVM Compiler Infrastructure
4 //
5 // This file is dual licensed under the MIT and the University of Illinois Open
6 // Source Licenses. See LICENSE.TXT for details.
7 //
8 //===----------------------------------------------------------------------===//
9
10 // <complex>
11
12 // template<class T>
13 // complex<T>
14 // atanh(const complex<T>& x);
15
16 #include <complex>
17 #include <cassert>
18
19 #include "../cases.h"
20
21 template <class T>
22 void
test(const std::complex<T> & c,std::complex<T> x)23 test(const std::complex<T>& c, std::complex<T> x)
24 {
25 assert(atanh(c) == x);
26 }
27
28 template <class T>
29 void
test()30 test()
31 {
32 test(std::complex<T>(0, 0), std::complex<T>(0, 0));
33 }
34
test_edges()35 void test_edges()
36 {
37 const double pi = std::atan2(+0., -0.);
38 const unsigned N = sizeof(testcases) / sizeof(testcases[0]);
39 for (unsigned i = 0; i < N; ++i)
40 {
41 std::complex<double> r = atanh(testcases[i]);
42 if (testcases[i].real() == 0 && testcases[i].imag() == 0)
43 {
44 assert(std::signbit(r.real()) == std::signbit(testcases[i].real()));
45 assert(std::signbit(r.imag()) == std::signbit(testcases[i].imag()));
46 }
47 else if ( testcases[i].real() == 0 && std::isnan(testcases[i].imag()))
48 {
49 assert(r.real() == 0);
50 assert(std::signbit(testcases[i].real()) == std::signbit(r.real()));
51 assert(std::isnan(r.imag()));
52 }
53 else if (std::abs(testcases[i].real()) == 1 && testcases[i].imag() == 0)
54 {
55 assert(std::isinf(r.real()));
56 assert(std::signbit(testcases[i].real()) == std::signbit(r.real()));
57 assert(r.imag() == 0);
58 assert(std::signbit(testcases[i].imag()) == std::signbit(r.imag()));
59 }
60 else if (std::isfinite(testcases[i].real()) && std::isinf(testcases[i].imag()))
61 {
62 assert(r.real() == 0);
63 assert(std::signbit(testcases[i].real()) == std::signbit(r.real()));
64 if (testcases[i].imag() > 0)
65 is_about(r.imag(), pi/2);
66 else
67 is_about(r.imag(), -pi/2);
68 }
69 else if (std::isfinite(testcases[i].real()) && std::isnan(testcases[i].imag()))
70 {
71 assert(std::isnan(r.real()));
72 assert(std::isnan(r.imag()));
73 }
74 else if (std::isinf(testcases[i].real()) && std::isfinite(testcases[i].imag()))
75 {
76 assert(r.real() == 0);
77 assert(std::signbit(testcases[i].real()) == std::signbit(r.real()));
78 if (std::signbit(testcases[i].imag()))
79 is_about(r.imag(), -pi/2);
80 else
81 is_about(r.imag(), pi/2);
82 }
83 else if (std::isinf(testcases[i].real()) && std::isinf(testcases[i].imag()))
84 {
85 assert(r.real() == 0);
86 assert(std::signbit(testcases[i].real()) == std::signbit(r.real()));
87 if (std::signbit(testcases[i].imag()))
88 is_about(r.imag(), -pi/2);
89 else
90 is_about(r.imag(), pi/2);
91 }
92 else if (std::isinf(testcases[i].real()) && std::isnan(testcases[i].imag()))
93 {
94 assert(r.real() == 0);
95 assert(std::signbit(testcases[i].real()) == std::signbit(r.real()));
96 assert(std::isnan(r.imag()));
97 }
98 else if (std::isnan(testcases[i].real()) && std::isfinite(testcases[i].imag()))
99 {
100 assert(std::isnan(r.real()));
101 assert(std::isnan(r.imag()));
102 }
103 else if (std::isnan(testcases[i].real()) && std::isinf(testcases[i].imag()))
104 {
105 assert(r.real() == 0);
106 assert(std::signbit(testcases[i].real()) == std::signbit(r.real()));
107 if (std::signbit(testcases[i].imag()))
108 is_about(r.imag(), -pi/2);
109 else
110 is_about(r.imag(), pi/2);
111 }
112 else if (std::isnan(testcases[i].real()) && std::isnan(testcases[i].imag()))
113 {
114 assert(std::isnan(r.real()));
115 assert(std::isnan(r.imag()));
116 }
117 else
118 {
119 assert(std::signbit(r.real()) == std::signbit(testcases[i].real()));
120 assert(std::signbit(r.imag()) == std::signbit(testcases[i].imag()));
121 }
122 }
123 }
124
main()125 int main()
126 {
127 test<float>();
128 test<double>();
129 test<long double>();
130 test_edges();
131 }
132