ceph/src/boost/boost/math/tools/detail/polynomial_horner3_8.hpp

   1 //  (C) Copyright John Maddock 2007.
   2 //  Use, modification and distribution are subject to the
   3 //  Boost Software License, Version 1.0. (See accompanying file
   4 //  LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
   5 //
   6 //  This file is machine generated, do not edit by hand
   7
   8 // Unrolled polynomial evaluation using second order Horners rule
   9 #ifndef BOOST_MATH_TOOLS_POLY_EVAL_8_HPP
  10 #define BOOST_MATH_TOOLS_POLY_EVAL_8_HPP
  11
  12 namespace boost{ namespace math{ namespace tools{ namespace detail{
  13
  14 template <class T, class V>
  15 inline V evaluate_polynomial_c_imp(const T*, const V&, const mpl::int_<0>*) BOOST_MATH_NOEXCEPT(V)
  16 {
  17    return static_cast<V>(0);
  18 }
  19
  20 template <class T, class V>
  21 inline V evaluate_polynomial_c_imp(const T* a, const V&, const mpl::int_<1>*) BOOST_MATH_NOEXCEPT(V)
  22 {
  23    return static_cast<V>(a[0]);
  24 }
  25
  26 template <class T, class V>
  27 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<2>*) BOOST_MATH_NOEXCEPT(V)
  28 {
  29    return static_cast<V>(a[1] * x + a[0]);
  30 }
  31
  32 template <class T, class V>
  33 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<3>*) BOOST_MATH_NOEXCEPT(V)
  34 {
  35    return static_cast<V>((a[2] * x + a[1]) * x + a[0]);
  36 }
  37
  38 template <class T, class V>
  39 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<4>*) BOOST_MATH_NOEXCEPT(V)
  40 {
  41    return static_cast<V>(((a[3] * x + a[2]) * x + a[1]) * x + a[0]);
  42 }
  43
  44 template <class T, class V>
  45 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<5>*) BOOST_MATH_NOEXCEPT(V)
  46 {
  47    V x2 = x * x;
  48    V t[2];
  49    t[0] = static_cast<V>(a[4] * x2 + a[2]);
  50    t[1] = static_cast<V>(a[3] * x2 + a[1]);
  51    t[0] *= x2;
  52    t[0] += static_cast<V>(a[0]);
  53    t[1] *= x;
  54    return t[0] + t[1];
  55 }
  56
  57 template <class T, class V>
  58 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<6>*) BOOST_MATH_NOEXCEPT(V)
  59 {
  60    V x2 = x * x;
  61    V t[2];
  62    t[0] = a[5] * x2 + a[3];
  63    t[1] = a[4] * x2 + a[2];
  64    t[0] *= x2;
  65    t[1] *= x2;
  66    t[0] += static_cast<V>(a[1]);
  67    t[1] += static_cast<V>(a[0]);
  68    t[0] *= x;
  69    return t[0] + t[1];
  70 }
  71
  72 template <class T, class V>
  73 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<7>*) BOOST_MATH_NOEXCEPT(V)
  74 {
  75    V x2 = x * x;
  76    V t[2];
  77    t[0] = static_cast<V>(a[6] * x2 + a[4]);
  78    t[1] = static_cast<V>(a[5] * x2 + a[3]);
  79    t[0] *= x2;
  80    t[1] *= x2;
  81    t[0] += static_cast<V>(a[2]);
  82    t[1] += static_cast<V>(a[1]);
  83    t[0] *= x2;
  84    t[0] += static_cast<V>(a[0]);
  85    t[1] *= x;
  86    return t[0] + t[1];
  87 }
  88
  89 template <class T, class V>
  90 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<8>*) BOOST_MATH_NOEXCEPT(V)
  91 {
  92    V x2 = x * x;
  93    V t[2];
  94    t[0] = a[7] * x2 + a[5];
  95    t[1] = a[6] * x2 + a[4];
  96    t[0] *= x2;
  97    t[1] *= x2;
  98    t[0] += static_cast<V>(a[3]);
  99    t[1] += static_cast<V>(a[2]);
 100    t[0] *= x2;
 101    t[1] *= x2;
 102    t[0] += static_cast<V>(a[1]);
 103    t[1] += static_cast<V>(a[0]);
 104    t[0] *= x;
 105    return t[0] + t[1];
 106 }
 107
 108
 109 }}}} // namespaces
 110
 111 #endif // include guard
 112