//  (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_6_HPP

#define BOOST_MATH_TOOLS_POLY_RAT_6_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>*)

{

   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>*)

{

   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>*)

{

   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]));

   }

}



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_<3>*)

{

   if(x <= 1)

     return static_cast<V>(((a[2] * x + a[1]) * x + a[0]) / ((b[2] * x + b[1]) * x + b[0]));

   else

   {

      V z = 1 / x;

      return static_cast<V>(((a[0] * z + a[1]) * z + a[2]) / ((b[0] * z + b[1]) * z + b[2]));

   }

}



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_<4>*)

{

   if(x <= 1)

     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]));

   else

   {

      V z = 1 / x;

      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]));

   }

}



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_<5>*)

{

   if(x <= 1)

     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]));

   else

   {

      V z = 1 / x;

      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]));

   }

}



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_<6>*)

{

   if(x <= 1)

     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]));

   else

   {

      V z = 1 / x;

      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]));

   }

}





}}}} // namespaces



#endif // include guard



