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 second order Horners rule
9 #ifndef BOOST_MATH_TOOLS_RAT_EVAL_5_HPP
10 #define BOOST_MATH_TOOLS_RAT_EVAL_5_HPP
11
12 namespace boost{ namespace math{ namespace tools{ namespace detail{
13
14 template <class T, class U, class V>
evaluate_rational_c_imp(const T *,const U *,const V &,const mpl::int_<0> *)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>
evaluate_rational_c_imp(const T * a,const U * b,const V &,const mpl::int_<1> *)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>
evaluate_rational_c_imp(const T * a,const U * b,const V & x,const mpl::int_<2> *)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 return static_cast<V>((a[1] * x + a[0]) / (b[1] * x + b[0]));
30 }
31
32 template <class T, class U, class V>
evaluate_rational_c_imp(const T * a,const U * b,const V & x,const mpl::int_<3> *)33 inline V evaluate_rational_c_imp(const T* a, const U* b, 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]) / ((b[2] * x + b[1]) * x + b[0]));
36 }
37
38 template <class T, class U, class V>
evaluate_rational_c_imp(const T * a,const U * b,const V & x,const mpl::int_<4> *)39 inline V evaluate_rational_c_imp(const T* a, const U* b, 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]) / (((b[3] * x + b[2]) * x + b[1]) * x + b[0]));
42 }
43
44 template <class T, class U, class V>
evaluate_rational_c_imp(const T * a,const U * b,const V & x,const mpl::int_<5> *)45 inline V evaluate_rational_c_imp(const T* a, const U* b, const V& x, const mpl::int_<5>*) BOOST_MATH_NOEXCEPT(V)
46 {
47 if(x <= 1)
48 {
49 V x2 = x * x;
50 V t[4];
51 t[0] = a[4] * x2 + a[2];
52 t[1] = a[3] * x2 + a[1];
53 t[2] = b[4] * x2 + b[2];
54 t[3] = b[3] * x2 + b[1];
55 t[0] *= x2;
56 t[2] *= x2;
57 t[0] += static_cast<V>(a[0]);
58 t[2] += static_cast<V>(b[0]);
59 t[1] *= x;
60 t[3] *= x;
61 return (t[0] + t[1]) / (t[2] + t[3]);
62 }
63 else
64 {
65 V z = 1 / x;
66 V z2 = 1 / (x * x);
67 V t[4];
68 t[0] = a[0] * z2 + a[2];
69 t[1] = a[1] * z2 + a[3];
70 t[2] = b[0] * z2 + b[2];
71 t[3] = b[1] * z2 + b[3];
72 t[0] *= z2;
73 t[2] *= z2;
74 t[0] += static_cast<V>(a[4]);
75 t[2] += static_cast<V>(b[4]);
76 t[1] *= z;
77 t[3] *= z;
78 return (t[0] + t[1]) / (t[2] + t[3]);
79 }
80 }
81
82
83 }}}} // namespaces
84
85 #endif // include guard
86
87