1//===----------------------------------------------------------------------===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8
9// <complex>
10
11// template<class T>
12// complex<T>
13// asinh(const complex<T>& x);
14
15#include <complex>
16#include <cassert>
17
18#include "test_macros.h"
19#include "../cases.h"
20
21template <class T>
22void
23test(const std::complex<T>& c, std::complex<T> x)
24{
25 assert(asinh(c) == x);
26}
27
28template <class T>
29void
30test()
31{
32 test(std::complex<T>(0, 0), std::complex<T>(0, 0));
33}
34
35void test_edges()
36{
37 const double pi = std::atan2(y: +0., x: -0.);
38 const unsigned N = sizeof(testcases) / sizeof(testcases[0]);
39 for (unsigned i = 0; i < N; ++i)
40 {
41 std::complex<double> r = asinh(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::abs(testcases[i].imag()) == 1)
48 {
49 assert(r.real() == 0);
50 assert(std::signbit(testcases[i].imag()) == std::signbit(r.imag()));
51 if (std::signbit(testcases[i].imag()))
52 is_about(x: r.imag(), y: -pi/2);
53 else
54 is_about(x: r.imag(), y: pi/2);
55 }
56 else if (std::isfinite(testcases[i].real()) && std::isinf(testcases[i].imag()))
57 {
58 assert(std::isinf(r.real()));
59 assert(std::signbit(testcases[i].real()) == std::signbit(r.real()));
60 if (std::signbit(testcases[i].imag()))
61 is_about(x: r.imag(), y: -pi/2);
62 else
63 is_about(x: r.imag(), y: pi/2);
64 }
65 else if (std::isfinite(testcases[i].real()) && std::isnan(testcases[i].imag()))
66 {
67 assert(std::isnan(r.real()));
68 assert(std::isnan(r.imag()));
69 }
70 else if (std::isinf(testcases[i].real()) && std::isfinite(testcases[i].imag()))
71 {
72 assert(std::isinf(r.real()));
73 assert(std::signbit(testcases[i].real()) == std::signbit(r.real()));
74 assert(r.imag() == 0);
75 assert(std::signbit(testcases[i].imag()) == std::signbit(r.imag()));
76 }
77 else if (std::isinf(testcases[i].real()) && std::isinf(testcases[i].imag()))
78 {
79 assert(std::isinf(r.real()));
80 assert(std::signbit(testcases[i].real()) == std::signbit(r.real()));
81 if (std::signbit(testcases[i].imag()))
82 is_about(x: r.imag(), y: -pi/4);
83 else
84 is_about(x: r.imag(), y: pi/4);
85 }
86 else if (std::isinf(testcases[i].real()) && std::isnan(testcases[i].imag()))
87 {
88 assert(std::isinf(r.real()));
89 assert(std::signbit(testcases[i].real()) == std::signbit(r.real()));
90 assert(std::isnan(r.imag()));
91 }
92 else if (std::isnan(testcases[i].real()) && testcases[i].imag() == 0)
93 {
94 assert(std::isnan(r.real()));
95 assert(r.imag() == 0);
96 assert(std::signbit(testcases[i].imag()) == std::signbit(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(std::isinf(r.real()));
106 assert(std::isnan(r.imag()));
107 }
108 else if (std::isnan(testcases[i].real()) && std::isnan(testcases[i].imag()))
109 {
110 assert(std::isnan(r.real()));
111 assert(std::isnan(r.imag()));
112 }
113 else
114 {
115 assert(std::signbit(r.real()) == std::signbit(testcases[i].real()));
116 assert(std::signbit(r.imag()) == std::signbit(testcases[i].imag()));
117 }
118 }
119}
120
121int main(int, char**)
122{
123 test<float>();
124 test<double>();
125 test<long double>();
126 test_edges();
127
128 return 0;
129}
130

source code of libcxx/test/std/numerics/complex.number/complex.transcendentals/asinh.pass.cpp