boost/math
2
0
Fork 0
mirror of https://github.com/boostorg/math.git synced 2026-01-19 04:22:09 +00:00
Code Issues Projects Releases Wiki Activity

Coverage: try and fix up sinc_pi test.

Browse Source
This commit is contained in:
jzmaddock
2025-05-09 10:00:28 +01:00
parent 9a1c19d127
commit ea0cd6af09
1 changed files with 14 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

25
test/sinc_test.hpp
View File

@@ -60,18 +60,21 @@ BOOST_TEST_CASE_TEMPLATE_FUNCTION(sinc_pi_complex_test, T)
// A very poor test with rather large tolerance for failure.
// But it does get out coverage up!
//
T tolerance = std::numeric_limits<T>::epsilon() * 20000;
std::complex<T> val(1, 2);
for (unsigned i = 0; i < 5; ++i)
BOOST_MATH_IF_CONSTEXPR(std::numeric_limits<T>::is_specialized && std::numeric_limits<T>::digits < 60)
{
using mp_t = boost::multiprecision::cpp_complex_50;
val /= 3;
std::complex<T> r1, r2;
r1 = sinc_pi<T>(val);
r2 = static_cast<std::complex<T>>(sin(mp_t(val)) / mp_t(val));
BOOST_CHECK_CLOSE_FRACTION(arg(r1), arg(r2), tolerance);
BOOST_CHECK_CLOSE_FRACTION(abs(r1), abs(r2), tolerance);
T tolerance = std::numeric_limits<T>::epsilon() * 20000;
std::complex<T> val(1, 2);
for (unsigned i = 0; i < 5; ++i)
{
using mp_t = boost::multiprecision::cpp_complex_100;
val /= 3;
std::complex<T> r1, r2;
r1 = sinc_pi<T>(val);
r2 = static_cast<std::complex<T>>(sin(mp_t(val)) / mp_t(val));
BOOST_CHECK_CLOSE_FRACTION(arg(r1), arg(r2), tolerance);
BOOST_CHECK_CLOSE_FRACTION(abs(r1), abs(r2), tolerance);
}
}
}