43 lines
1.3 KiB
Plaintext
43 lines
1.3 KiB
Plaintext
// (C) 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)
|
|
//
|
|
// This file is machine generated, do not edit by hand
|
|
|
|
// Polynomial evaluation using Horners rule
|
|
#ifndef BOOST_MATH_TOOLS_POLY_RAT_2_HPP
|
|
#define BOOST_MATH_TOOLS_POLY_RAT_2_HPP
|
|
|
|
namespace boost{ namespace math{ namespace tools{ namespace detail{
|
|
|
|
template <class T, class U, class V>
|
|
inline V evaluate_rational_c_imp(const T*, const U*, const V&, const mpl::int_<0>*) BOOST_MATH_NOEXCEPT(V)
|
|
{
|
|
return static_cast<V>(0);
|
|
}
|
|
|
|
template <class T, class U, class V>
|
|
inline V evaluate_rational_c_imp(const T* a, const U* b, const V&, const mpl::int_<1>*) BOOST_MATH_NOEXCEPT(V)
|
|
{
|
|
return static_cast<V>(a[0]) / static_cast<V>(b[0]);
|
|
}
|
|
|
|
template <class T, class U, class V>
|
|
inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const mpl::int_<2>*) BOOST_MATH_NOEXCEPT(V)
|
|
{
|
|
if(x <= 1)
|
|
return static_cast<V>((a[1] * x + a[0]) / (b[1] * x + b[0]));
|
|
else
|
|
{
|
|
V z = 1 / x;
|
|
return static_cast<V>((a[0] * z + a[1]) / (b[0] * z + b[1]));
|
|
}
|
|
}
|
|
|
|
|
|
}}}} // namespaces
|
|
|
|
#endif // include guard
|
|
|