// Copyright John Maddock 2007. // Use, modification and distribution are subject to the // Boost Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) #ifndef BOOST_MATH_ROUND_HPP #define BOOST_MATH_ROUND_HPP #ifdef _MSC_VER #pragma once #endif #include #include #include #include namespace boost{ namespace math{ namespace detail{ template inline typename tools::promote_args::type round(const T& v, const Policy& pol, const mpl::false_) { BOOST_MATH_STD_USING typedef typename tools::promote_args::type result_type; if(!(boost::math::isfinite)(v)) return policies::raise_rounding_error("boost::math::round<%1%>(%1%)", 0, static_cast(v), static_cast(v), pol); // // The logic here is rather convoluted, but avoids a number of traps, // see discussion here https://github.com/boostorg/math/pull/8 // if (-0.5 < v && v < 0.5) { // special case to avoid rounding error on the direct // predecessor of +0.5 resp. the direct successor of -0.5 in // IEEE floating point types return static_cast(0); } else if (v > 0) { // subtract v from ceil(v) first in order to avoid rounding // errors on largest representable integer numbers result_type c(ceil(v)); return 0.5 < c - v ? c - 1 : c; } else { // see former branch result_type f(floor(v)); return 0.5 < v - f ? f + 1 : f; } } template inline typename tools::promote_args::type round(const T& v, const Policy&, const mpl::true_) { return v; } } // namespace detail template inline typename tools::promote_args::type round(const T& v, const Policy& pol) { return detail::round(v, pol, mpl::bool_::value>()); } template inline typename tools::promote_args::type round(const T& v) { return round(v, policies::policy<>()); } // // The following functions will not compile unless T has an // implicit convertion to the integer types. For user-defined // number types this will likely not be the case. In that case // these functions should either be specialized for the UDT in // question, or else overloads should be placed in the same // namespace as the UDT: these will then be found via argument // dependent lookup. See our concept archetypes for examples. // template inline int iround(const T& v, const Policy& pol) { BOOST_MATH_STD_USING T r = boost::math::round(v, pol); if((r > (std::numeric_limits::max)()) || (r < (std::numeric_limits::min)())) return static_cast(policies::raise_rounding_error("boost::math::iround<%1%>(%1%)", 0, v, 0, pol)); return static_cast(r); } template inline int iround(const T& v) { return iround(v, policies::policy<>()); } template inline long lround(const T& v, const Policy& pol) { BOOST_MATH_STD_USING T r = boost::math::round(v, pol); if((r > (std::numeric_limits::max)()) || (r < (std::numeric_limits::min)())) return static_cast(policies::raise_rounding_error("boost::math::lround<%1%>(%1%)", 0, v, 0L, pol)); return static_cast(r); } template inline long lround(const T& v) { return lround(v, policies::policy<>()); } #ifdef BOOST_HAS_LONG_LONG template inline boost::long_long_type llround(const T& v, const Policy& pol) { BOOST_MATH_STD_USING T r = boost::math::round(v, pol); if((r > (std::numeric_limits::max)()) || (r < (std::numeric_limits::min)())) return static_cast(policies::raise_rounding_error("boost::math::llround<%1%>(%1%)", 0, v, static_cast(0), pol)); return static_cast(r); } template inline boost::long_long_type llround(const T& v) { return llround(v, policies::policy<>()); } #endif }} // namespaces #endif // BOOST_MATH_ROUND_HPP