ceph/src/boost/libs/math/include/boost/math/tools/detail/rational_horner1_7.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 // Polynomial evaluation using Horners rule
   9 #ifndef BOOST_MATH_TOOLS_POLY_RAT_7_HPP
  10 #define BOOST_MATH_TOOLS_POLY_RAT_7_HPP
  11
  12 namespace boost{ namespace math{ namespace tools{ namespace detail{
  13
  14 template <class T, class U, class V>
  15 inline V evaluate_rational_c_imp(const T*, const U*, const V&, const mpl::int_<0>*) BOOST_MATH_NOEXCEPT(V)
  16 {
  17    return static_cast<V>(0);
  18 }
  19
  20 template <class T, class U, class V>
  21 inline V evaluate_rational_c_imp(const T* a, const U* b, const V&, const mpl::int_<1>*) BOOST_MATH_NOEXCEPT(V)
  22 {
  23    return static_cast<V>(a[0]) / static_cast<V>(b[0]);
  24 }
  25
  26 template <class T, class U, class V>
  27 inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const mpl::int_<2>*) BOOST_MATH_NOEXCEPT(V)
  28 {
  29    if(x <= 1)
  30      return static_cast<V>((a[1] * x + a[0]) / (b[1] * x + b[0]));
  31    else
  32    {
  33       V z = 1 / x;
  34       return static_cast<V>((a[0] * z + a[1]) / (b[0] * z + b[1]));
  35    }
  36 }
  37
  38 template <class T, class U, class V>
  39 inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const mpl::int_<3>*) BOOST_MATH_NOEXCEPT(V)
  40 {
  41    if(x <= 1)
  42      return static_cast<V>(((a[2] * x + a[1]) * x + a[0]) / ((b[2] * x + b[1]) * x + b[0]));
  43    else
  44    {
  45       V z = 1 / x;
  46       return static_cast<V>(((a[0] * z + a[1]) * z + a[2]) / ((b[0] * z + b[1]) * z + b[2]));
  47    }
  48 }
  49
  50 template <class T, class U, class V>
  51 inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const mpl::int_<4>*) BOOST_MATH_NOEXCEPT(V)
  52 {
  53    if(x <= 1)
  54      return static_cast<V>((((a[3] * x + a[2]) * x + a[1]) * x + a[0]) / (((b[3] * x + b[2]) * x + b[1]) * x + b[0]));
  55    else
  56    {
  57       V z = 1 / x;
  58       return static_cast<V>((((a[0] * z + a[1]) * z + a[2]) * z + a[3]) / (((b[0] * z + b[1]) * z + b[2]) * z + b[3]));
  59    }
  60 }
  61
  62 template <class T, class U, class V>
  63 inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const mpl::int_<5>*) BOOST_MATH_NOEXCEPT(V)
  64 {
  65    if(x <= 1)
  66      return static_cast<V>(((((a[4] * x + a[3]) * x + a[2]) * x + a[1]) * x + a[0]) / ((((b[4] * x + b[3]) * x + b[2]) * x + b[1]) * x + b[0]));
  67    else
  68    {
  69       V z = 1 / x;
  70       return static_cast<V>(((((a[0] * z + a[1]) * z + a[2]) * z + a[3]) * z + a[4]) / ((((b[0] * z + b[1]) * z + b[2]) * z + b[3]) * z + b[4]));
  71    }
  72 }
  73
  74 template <class T, class U, class V>
  75 inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const mpl::int_<6>*) BOOST_MATH_NOEXCEPT(V)
  76 {
  77    if(x <= 1)
  78      return static_cast<V>((((((a[5] * x + a[4]) * x + a[3]) * x + a[2]) * x + a[1]) * x + a[0]) / (((((b[5] * x + b[4]) * x + b[3]) * x + b[2]) * x + b[1]) * x + b[0]));
  79    else
  80    {
  81       V z = 1 / x;
  82       return static_cast<V>((((((a[0] * z + a[1]) * z + a[2]) * z + a[3]) * z + a[4]) * z + a[5]) / (((((b[0] * z + b[1]) * z + b[2]) * z + b[3]) * z + b[4]) * z + b[5]));
  83    }
  84 }
  85
  86 template <class T, class U, class V>
  87 inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const mpl::int_<7>*) BOOST_MATH_NOEXCEPT(V)
  88 {
  89    if(x <= 1)
  90      return static_cast<V>(((((((a[6] * x + a[5]) * x + a[4]) * x + a[3]) * x + a[2]) * x + a[1]) * x + a[0]) / ((((((b[6] * x + b[5]) * x + b[4]) * x + b[3]) * x + b[2]) * x + b[1]) * x + b[0]));
  91    else
  92    {
  93       V z = 1 / x;
  94       return static_cast<V>(((((((a[0] * z + a[1]) * z + a[2]) * z + a[3]) * z + a[4]) * z + a[5]) * z + a[6]) / ((((((b[0] * z + b[1]) * z + b[2]) * z + b[3]) * z + b[4]) * z + b[5]) * z + b[6]));
  95    }
  96 }
  97
  98
  99 }}}} // namespaces
 100
 101 #endif // include guard
 102