forked from mirror/libcxx
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.
68 lines
1.5 KiB
C++
68 lines
1.5 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// 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>
|
|
// sin(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(sin(c) == x);
|
|
}
|
|
|
|
template <class T>
|
|
void
|
|
test()
|
|
{
|
|
test(std::complex<T>(0, 0), std::complex<T>(0, 0));
|
|
}
|
|
|
|
void test_edges()
|
|
{
|
|
const unsigned N = sizeof(testcases) / sizeof(testcases[0]);
|
|
for (unsigned i = 0; i < N; ++i)
|
|
{
|
|
std::complex<double> r = sin(testcases[i]);
|
|
std::complex<double> t1(-imag(testcases[i]), real(testcases[i]));
|
|
std::complex<double> t2 = sinh(t1);
|
|
std::complex<double> z(imag(t2), -real(t2));
|
|
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<float>();
|
|
test<double>();
|
|
test<long double>();
|
|
test_edges();
|
|
}
|