91 lines
3.2 KiB
Plaintext
91 lines
3.2 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_EVAL_11_HPP
|
||
|
|
#define BOOST_MATH_TOOLS_POLY_EVAL_11_HPP
|
||
|
|
|
||
|
|
namespace boost{ namespace math{ namespace tools{ namespace detail{
|
||
|
|
|
||
|
|
template <class T, class V>
|
||
|
|
inline V evaluate_polynomial_c_imp(const T*, const V&, const mpl::int_<0>*) BOOST_MATH_NOEXCEPT(V)
|
||
|
|
{
|
||
|
|
return static_cast<V>(0);
|
||
|
|
}
|
||
|
|
|
||
|
|
template <class T, class V>
|
||
|
|
inline V evaluate_polynomial_c_imp(const T* a, const V&, const mpl::int_<1>*) BOOST_MATH_NOEXCEPT(V)
|
||
|
|
{
|
||
|
|
return static_cast<V>(a[0]);
|
||
|
|
}
|
||
|
|
|
||
|
|
template <class T, class V>
|
||
|
|
inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<2>*) BOOST_MATH_NOEXCEPT(V)
|
||
|
|
{
|
||
|
|
return static_cast<V>(a[1] * x + a[0]);
|
||
|
|
}
|
||
|
|
|
||
|
|
template <class T, class V>
|
||
|
|
inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<3>*) BOOST_MATH_NOEXCEPT(V)
|
||
|
|
{
|
||
|
|
return static_cast<V>((a[2] * x + a[1]) * x + a[0]);
|
||
|
|
}
|
||
|
|
|
||
|
|
template <class T, class V>
|
||
|
|
inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<4>*) BOOST_MATH_NOEXCEPT(V)
|
||
|
|
{
|
||
|
|
return static_cast<V>(((a[3] * x + a[2]) * x + a[1]) * x + a[0]);
|
||
|
|
}
|
||
|
|
|
||
|
|
template <class T, class V>
|
||
|
|
inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<5>*) BOOST_MATH_NOEXCEPT(V)
|
||
|
|
{
|
||
|
|
return static_cast<V>((((a[4] * x + a[3]) * x + a[2]) * x + a[1]) * x + a[0]);
|
||
|
|
}
|
||
|
|
|
||
|
|
template <class T, class V>
|
||
|
|
inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<6>*) BOOST_MATH_NOEXCEPT(V)
|
||
|
|
{
|
||
|
|
return static_cast<V>(((((a[5] * x + a[4]) * x + a[3]) * x + a[2]) * x + a[1]) * x + a[0]);
|
||
|
|
}
|
||
|
|
|
||
|
|
template <class T, class V>
|
||
|
|
inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<7>*) BOOST_MATH_NOEXCEPT(V)
|
||
|
|
{
|
||
|
|
return static_cast<V>((((((a[6] * x + a[5]) * x + a[4]) * x + a[3]) * x + a[2]) * x + a[1]) * x + a[0]);
|
||
|
|
}
|
||
|
|
|
||
|
|
template <class T, class V>
|
||
|
|
inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<8>*) BOOST_MATH_NOEXCEPT(V)
|
||
|
|
{
|
||
|
|
return static_cast<V>(((((((a[7] * x + a[6]) * x + a[5]) * x + a[4]) * x + a[3]) * x + a[2]) * x + a[1]) * x + a[0]);
|
||
|
|
}
|
||
|
|
|
||
|
|
template <class T, class V>
|
||
|
|
inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<9>*) BOOST_MATH_NOEXCEPT(V)
|
||
|
|
{
|
||
|
|
return static_cast<V>((((((((a[8] * x + a[7]) * x + a[6]) * x + a[5]) * x + a[4]) * x + a[3]) * x + a[2]) * x + a[1]) * x + a[0]);
|
||
|
|
}
|
||
|
|
|
||
|
|
template <class T, class V>
|
||
|
|
inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<10>*) BOOST_MATH_NOEXCEPT(V)
|
||
|
|
{
|
||
|
|
return static_cast<V>(((((((((a[9] * x + a[8]) * x + a[7]) * x + a[6]) * x + a[5]) * x + a[4]) * x + a[3]) * x + a[2]) * x + a[1]) * x + a[0]);
|
||
|
|
}
|
||
|
|
|
||
|
|
template <class T, class V>
|
||
|
|
inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<11>*) BOOST_MATH_NOEXCEPT(V)
|
||
|
|
{
|
||
|
|
return static_cast<V>((((((((((a[10] * x + a[9]) * x + a[8]) * x + a[7]) * x + a[6]) * x + a[5]) * x + a[4]) * x + a[3]) * x + a[2]) * x + a[1]) * x + a[0]);
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
}}}} // namespaces
|
||
|
|
|
||
|
|
#endif // include guard
|
||
|
|
|