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_POLY_EVAL_20_HPP
10 #define BOOST_MATH_TOOLS_POLY_EVAL_20_HPP
11
12 namespace boost{ namespace math{ namespace tools{ namespace detail{
13
14 template <class T, class V>
evaluate_polynomial_c_imp(const T *,const V &,const mpl::int_<0> *)15 inline V evaluate_polynomial_c_imp(const T*, const V&, const mpl::int_<0>*)
16 {
17 return static_cast<V>(0);
18 }
19
20 template <class T, class V>
evaluate_polynomial_c_imp(const T * a,const V &,const mpl::int_<1> *)21 inline V evaluate_polynomial_c_imp(const T* a, const V&, const mpl::int_<1>*)
22 {
23 return static_cast<V>(a[0]);
24 }
25
26 template <class T, class V>
evaluate_polynomial_c_imp(const T * a,const V & x,const mpl::int_<2> *)27 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<2>*)
28 {
29 return static_cast<V>(a[1] * x + a[0]);
30 }
31
32 template <class T, class V>
evaluate_polynomial_c_imp(const T * a,const V & x,const mpl::int_<3> *)33 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<3>*)
34 {
35 return static_cast<V>((a[2] * x + a[1]) * x + a[0]);
36 }
37
38 template <class T, class V>
evaluate_polynomial_c_imp(const T * a,const V & x,const mpl::int_<4> *)39 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<4>*)
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>
evaluate_polynomial_c_imp(const T * a,const V & x,const mpl::int_<5> *)45 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<5>*)
46 {
47 V x2 = x * x;
48 return static_cast<V>((a[4] * x2 + a[2]) * x2 + a[0] + (a[3] * x2 + a[1]) * x);
49 }
50
51 template <class T, class V>
evaluate_polynomial_c_imp(const T * a,const V & x,const mpl::int_<6> *)52 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<6>*)
53 {
54 V x2 = x * x;
55 return static_cast<V>(((a[5] * x2 + a[3]) * x2 + a[1]) * x + (a[4] * x2 + a[2]) * x2 + a[0]);
56 }
57
58 template <class T, class V>
evaluate_polynomial_c_imp(const T * a,const V & x,const mpl::int_<7> *)59 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<7>*)
60 {
61 V x2 = x * x;
62 return static_cast<V>(((a[6] * x2 + a[4]) * x2 + a[2]) * x2 + a[0] + ((a[5] * x2 + a[3]) * x2 + a[1]) * x);
63 }
64
65 template <class T, class V>
evaluate_polynomial_c_imp(const T * a,const V & x,const mpl::int_<8> *)66 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<8>*)
67 {
68 V x2 = x * x;
69 return static_cast<V>((((a[7] * x2 + a[5]) * x2 + a[3]) * x2 + a[1]) * x + ((a[6] * x2 + a[4]) * x2 + a[2]) * x2 + a[0]);
70 }
71
72 template <class T, class V>
evaluate_polynomial_c_imp(const T * a,const V & x,const mpl::int_<9> *)73 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<9>*)
74 {
75 V x2 = x * x;
76 return static_cast<V>((((a[8] * x2 + a[6]) * x2 + a[4]) * x2 + a[2]) * x2 + a[0] + (((a[7] * x2 + a[5]) * x2 + a[3]) * x2 + a[1]) * x);
77 }
78
79 template <class T, class V>
evaluate_polynomial_c_imp(const T * a,const V & x,const mpl::int_<10> *)80 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<10>*)
81 {
82 V x2 = x * x;
83 return static_cast<V>(((((a[9] * x2 + a[7]) * x2 + a[5]) * x2 + a[3]) * x2 + a[1]) * x + (((a[8] * x2 + a[6]) * x2 + a[4]) * x2 + a[2]) * x2 + a[0]);
84 }
85
86 template <class T, class V>
evaluate_polynomial_c_imp(const T * a,const V & x,const mpl::int_<11> *)87 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<11>*)
88 {
89 V x2 = x * x;
90 return static_cast<V>(((((a[10] * x2 + a[8]) * x2 + a[6]) * x2 + a[4]) * x2 + a[2]) * x2 + a[0] + ((((a[9] * x2 + a[7]) * x2 + a[5]) * x2 + a[3]) * x2 + a[1]) * x);
91 }
92
93 template <class T, class V>
evaluate_polynomial_c_imp(const T * a,const V & x,const mpl::int_<12> *)94 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<12>*)
95 {
96 V x2 = x * x;
97 return static_cast<V>((((((a[11] * x2 + a[9]) * x2 + a[7]) * x2 + a[5]) * x2 + a[3]) * x2 + a[1]) * x + ((((a[10] * x2 + a[8]) * x2 + a[6]) * x2 + a[4]) * x2 + a[2]) * x2 + a[0]);
98 }
99
100 template <class T, class V>
evaluate_polynomial_c_imp(const T * a,const V & x,const mpl::int_<13> *)101 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<13>*)
102 {
103 V x2 = x * x;
104 return static_cast<V>((((((a[12] * x2 + a[10]) * x2 + a[8]) * x2 + a[6]) * x2 + a[4]) * x2 + a[2]) * x2 + a[0] + (((((a[11] * x2 + a[9]) * x2 + a[7]) * x2 + a[5]) * x2 + a[3]) * x2 + a[1]) * x);
105 }
106
107 template <class T, class V>
evaluate_polynomial_c_imp(const T * a,const V & x,const mpl::int_<14> *)108 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<14>*)
109 {
110 V x2 = x * x;
111 return static_cast<V>(((((((a[13] * x2 + a[11]) * x2 + a[9]) * x2 + a[7]) * x2 + a[5]) * x2 + a[3]) * x2 + a[1]) * x + (((((a[12] * x2 + a[10]) * x2 + a[8]) * x2 + a[6]) * x2 + a[4]) * x2 + a[2]) * x2 + a[0]);
112 }
113
114 template <class T, class V>
evaluate_polynomial_c_imp(const T * a,const V & x,const mpl::int_<15> *)115 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<15>*)
116 {
117 V x2 = x * x;
118 return static_cast<V>(((((((a[14] * x2 + a[12]) * x2 + a[10]) * x2 + a[8]) * x2 + a[6]) * x2 + a[4]) * x2 + a[2]) * x2 + a[0] + ((((((a[13] * x2 + a[11]) * x2 + a[9]) * x2 + a[7]) * x2 + a[5]) * x2 + a[3]) * x2 + a[1]) * x);
119 }
120
121 template <class T, class V>
evaluate_polynomial_c_imp(const T * a,const V & x,const mpl::int_<16> *)122 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<16>*)
123 {
124 V x2 = x * x;
125 return static_cast<V>((((((((a[15] * x2 + a[13]) * x2 + a[11]) * x2 + a[9]) * x2 + a[7]) * x2 + a[5]) * x2 + a[3]) * x2 + a[1]) * x + ((((((a[14] * x2 + a[12]) * x2 + a[10]) * x2 + a[8]) * x2 + a[6]) * x2 + a[4]) * x2 + a[2]) * x2 + a[0]);
126 }
127
128 template <class T, class V>
evaluate_polynomial_c_imp(const T * a,const V & x,const mpl::int_<17> *)129 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<17>*)
130 {
131 V x2 = x * x;
132 return static_cast<V>((((((((a[16] * x2 + a[14]) * x2 + a[12]) * x2 + a[10]) * x2 + a[8]) * x2 + a[6]) * x2 + a[4]) * x2 + a[2]) * x2 + a[0] + (((((((a[15] * x2 + a[13]) * x2 + a[11]) * x2 + a[9]) * x2 + a[7]) * x2 + a[5]) * x2 + a[3]) * x2 + a[1]) * x);
133 }
134
135 template <class T, class V>
evaluate_polynomial_c_imp(const T * a,const V & x,const mpl::int_<18> *)136 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<18>*)
137 {
138 V x2 = x * x;
139 return static_cast<V>(((((((((a[17] * x2 + a[15]) * x2 + a[13]) * x2 + a[11]) * x2 + a[9]) * x2 + a[7]) * x2 + a[5]) * x2 + a[3]) * x2 + a[1]) * x + (((((((a[16] * x2 + a[14]) * x2 + a[12]) * x2 + a[10]) * x2 + a[8]) * x2 + a[6]) * x2 + a[4]) * x2 + a[2]) * x2 + a[0]);
140 }
141
142 template <class T, class V>
evaluate_polynomial_c_imp(const T * a,const V & x,const mpl::int_<19> *)143 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<19>*)
144 {
145 V x2 = x * x;
146 return static_cast<V>(((((((((a[18] * x2 + a[16]) * x2 + a[14]) * x2 + a[12]) * x2 + a[10]) * x2 + a[8]) * x2 + a[6]) * x2 + a[4]) * x2 + a[2]) * x2 + a[0] + ((((((((a[17] * x2 + a[15]) * x2 + a[13]) * x2 + a[11]) * x2 + a[9]) * x2 + a[7]) * x2 + a[5]) * x2 + a[3]) * x2 + a[1]) * x);
147 }
148
149 template <class T, class V>
evaluate_polynomial_c_imp(const T * a,const V & x,const mpl::int_<20> *)150 inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<20>*)
151 {
152 V x2 = x * x;
153 return static_cast<V>((((((((((a[19] * x2 + a[17]) * x2 + a[15]) * x2 + a[13]) * x2 + a[11]) * x2 + a[9]) * x2 + a[7]) * x2 + a[5]) * x2 + a[3]) * x2 + a[1]) * x + ((((((((a[18] * x2 + a[16]) * x2 + a[14]) * x2 + a[12]) * x2 + a[10]) * x2 + a[8]) * x2 + a[6]) * x2 + a[4]) * x2 + a[2]) * x2 + a[0]);
154 }
155
156
157 }}}} // namespaces
158
159 #endif // include guard
160
161