]>
Commit | Line | Data |
---|---|---|
7c673cae FG |
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_18_HPP | |
10 | #define BOOST_MATH_TOOLS_POLY_EVAL_18_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 | template <class T, class V> | |
109 | inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<9>*) BOOST_MATH_NOEXCEPT(V) | |
110 | { | |
111 | V x2 = x * x; | |
112 | V t[2]; | |
113 | t[0] = static_cast<V>(a[8] * x2 + a[6]); | |
114 | t[1] = static_cast<V>(a[7] * x2 + a[5]); | |
115 | t[0] *= x2; | |
116 | t[1] *= x2; | |
117 | t[0] += static_cast<V>(a[4]); | |
118 | t[1] += static_cast<V>(a[3]); | |
119 | t[0] *= x2; | |
120 | t[1] *= x2; | |
121 | t[0] += static_cast<V>(a[2]); | |
122 | t[1] += static_cast<V>(a[1]); | |
123 | t[0] *= x2; | |
124 | t[0] += static_cast<V>(a[0]); | |
125 | t[1] *= x; | |
126 | return t[0] + t[1]; | |
127 | } | |
128 | ||
129 | template <class T, class V> | |
130 | inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<10>*) BOOST_MATH_NOEXCEPT(V) | |
131 | { | |
132 | V x2 = x * x; | |
133 | V t[2]; | |
134 | t[0] = a[9] * x2 + a[7]; | |
135 | t[1] = a[8] * x2 + a[6]; | |
136 | t[0] *= x2; | |
137 | t[1] *= x2; | |
138 | t[0] += static_cast<V>(a[5]); | |
139 | t[1] += static_cast<V>(a[4]); | |
140 | t[0] *= x2; | |
141 | t[1] *= x2; | |
142 | t[0] += static_cast<V>(a[3]); | |
143 | t[1] += static_cast<V>(a[2]); | |
144 | t[0] *= x2; | |
145 | t[1] *= x2; | |
146 | t[0] += static_cast<V>(a[1]); | |
147 | t[1] += static_cast<V>(a[0]); | |
148 | t[0] *= x; | |
149 | return t[0] + t[1]; | |
150 | } | |
151 | ||
152 | template <class T, class V> | |
153 | inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<11>*) BOOST_MATH_NOEXCEPT(V) | |
154 | { | |
155 | V x2 = x * x; | |
156 | V t[2]; | |
157 | t[0] = static_cast<V>(a[10] * x2 + a[8]); | |
158 | t[1] = static_cast<V>(a[9] * x2 + a[7]); | |
159 | t[0] *= x2; | |
160 | t[1] *= x2; | |
161 | t[0] += static_cast<V>(a[6]); | |
162 | t[1] += static_cast<V>(a[5]); | |
163 | t[0] *= x2; | |
164 | t[1] *= x2; | |
165 | t[0] += static_cast<V>(a[4]); | |
166 | t[1] += static_cast<V>(a[3]); | |
167 | t[0] *= x2; | |
168 | t[1] *= x2; | |
169 | t[0] += static_cast<V>(a[2]); | |
170 | t[1] += static_cast<V>(a[1]); | |
171 | t[0] *= x2; | |
172 | t[0] += static_cast<V>(a[0]); | |
173 | t[1] *= x; | |
174 | return t[0] + t[1]; | |
175 | } | |
176 | ||
177 | template <class T, class V> | |
178 | inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<12>*) BOOST_MATH_NOEXCEPT(V) | |
179 | { | |
180 | V x2 = x * x; | |
181 | V t[2]; | |
182 | t[0] = a[11] * x2 + a[9]; | |
183 | t[1] = a[10] * x2 + a[8]; | |
184 | t[0] *= x2; | |
185 | t[1] *= x2; | |
186 | t[0] += static_cast<V>(a[7]); | |
187 | t[1] += static_cast<V>(a[6]); | |
188 | t[0] *= x2; | |
189 | t[1] *= x2; | |
190 | t[0] += static_cast<V>(a[5]); | |
191 | t[1] += static_cast<V>(a[4]); | |
192 | t[0] *= x2; | |
193 | t[1] *= x2; | |
194 | t[0] += static_cast<V>(a[3]); | |
195 | t[1] += static_cast<V>(a[2]); | |
196 | t[0] *= x2; | |
197 | t[1] *= x2; | |
198 | t[0] += static_cast<V>(a[1]); | |
199 | t[1] += static_cast<V>(a[0]); | |
200 | t[0] *= x; | |
201 | return t[0] + t[1]; | |
202 | } | |
203 | ||
204 | template <class T, class V> | |
205 | inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<13>*) BOOST_MATH_NOEXCEPT(V) | |
206 | { | |
207 | V x2 = x * x; | |
208 | V t[2]; | |
209 | t[0] = static_cast<V>(a[12] * x2 + a[10]); | |
210 | t[1] = static_cast<V>(a[11] * x2 + a[9]); | |
211 | t[0] *= x2; | |
212 | t[1] *= x2; | |
213 | t[0] += static_cast<V>(a[8]); | |
214 | t[1] += static_cast<V>(a[7]); | |
215 | t[0] *= x2; | |
216 | t[1] *= x2; | |
217 | t[0] += static_cast<V>(a[6]); | |
218 | t[1] += static_cast<V>(a[5]); | |
219 | t[0] *= x2; | |
220 | t[1] *= x2; | |
221 | t[0] += static_cast<V>(a[4]); | |
222 | t[1] += static_cast<V>(a[3]); | |
223 | t[0] *= x2; | |
224 | t[1] *= x2; | |
225 | t[0] += static_cast<V>(a[2]); | |
226 | t[1] += static_cast<V>(a[1]); | |
227 | t[0] *= x2; | |
228 | t[0] += static_cast<V>(a[0]); | |
229 | t[1] *= x; | |
230 | return t[0] + t[1]; | |
231 | } | |
232 | ||
233 | template <class T, class V> | |
234 | inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<14>*) BOOST_MATH_NOEXCEPT(V) | |
235 | { | |
236 | V x2 = x * x; | |
237 | V t[2]; | |
238 | t[0] = a[13] * x2 + a[11]; | |
239 | t[1] = a[12] * x2 + a[10]; | |
240 | t[0] *= x2; | |
241 | t[1] *= x2; | |
242 | t[0] += static_cast<V>(a[9]); | |
243 | t[1] += static_cast<V>(a[8]); | |
244 | t[0] *= x2; | |
245 | t[1] *= x2; | |
246 | t[0] += static_cast<V>(a[7]); | |
247 | t[1] += static_cast<V>(a[6]); | |
248 | t[0] *= x2; | |
249 | t[1] *= x2; | |
250 | t[0] += static_cast<V>(a[5]); | |
251 | t[1] += static_cast<V>(a[4]); | |
252 | t[0] *= x2; | |
253 | t[1] *= x2; | |
254 | t[0] += static_cast<V>(a[3]); | |
255 | t[1] += static_cast<V>(a[2]); | |
256 | t[0] *= x2; | |
257 | t[1] *= x2; | |
258 | t[0] += static_cast<V>(a[1]); | |
259 | t[1] += static_cast<V>(a[0]); | |
260 | t[0] *= x; | |
261 | return t[0] + t[1]; | |
262 | } | |
263 | ||
264 | template <class T, class V> | |
265 | inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<15>*) BOOST_MATH_NOEXCEPT(V) | |
266 | { | |
267 | V x2 = x * x; | |
268 | V t[2]; | |
269 | t[0] = static_cast<V>(a[14] * x2 + a[12]); | |
270 | t[1] = static_cast<V>(a[13] * x2 + a[11]); | |
271 | t[0] *= x2; | |
272 | t[1] *= x2; | |
273 | t[0] += static_cast<V>(a[10]); | |
274 | t[1] += static_cast<V>(a[9]); | |
275 | t[0] *= x2; | |
276 | t[1] *= x2; | |
277 | t[0] += static_cast<V>(a[8]); | |
278 | t[1] += static_cast<V>(a[7]); | |
279 | t[0] *= x2; | |
280 | t[1] *= x2; | |
281 | t[0] += static_cast<V>(a[6]); | |
282 | t[1] += static_cast<V>(a[5]); | |
283 | t[0] *= x2; | |
284 | t[1] *= x2; | |
285 | t[0] += static_cast<V>(a[4]); | |
286 | t[1] += static_cast<V>(a[3]); | |
287 | t[0] *= x2; | |
288 | t[1] *= x2; | |
289 | t[0] += static_cast<V>(a[2]); | |
290 | t[1] += static_cast<V>(a[1]); | |
291 | t[0] *= x2; | |
292 | t[0] += static_cast<V>(a[0]); | |
293 | t[1] *= x; | |
294 | return t[0] + t[1]; | |
295 | } | |
296 | ||
297 | template <class T, class V> | |
298 | inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<16>*) BOOST_MATH_NOEXCEPT(V) | |
299 | { | |
300 | V x2 = x * x; | |
301 | V t[2]; | |
302 | t[0] = a[15] * x2 + a[13]; | |
303 | t[1] = a[14] * x2 + a[12]; | |
304 | t[0] *= x2; | |
305 | t[1] *= x2; | |
306 | t[0] += static_cast<V>(a[11]); | |
307 | t[1] += static_cast<V>(a[10]); | |
308 | t[0] *= x2; | |
309 | t[1] *= x2; | |
310 | t[0] += static_cast<V>(a[9]); | |
311 | t[1] += static_cast<V>(a[8]); | |
312 | t[0] *= x2; | |
313 | t[1] *= x2; | |
314 | t[0] += static_cast<V>(a[7]); | |
315 | t[1] += static_cast<V>(a[6]); | |
316 | t[0] *= x2; | |
317 | t[1] *= x2; | |
318 | t[0] += static_cast<V>(a[5]); | |
319 | t[1] += static_cast<V>(a[4]); | |
320 | t[0] *= x2; | |
321 | t[1] *= x2; | |
322 | t[0] += static_cast<V>(a[3]); | |
323 | t[1] += static_cast<V>(a[2]); | |
324 | t[0] *= x2; | |
325 | t[1] *= x2; | |
326 | t[0] += static_cast<V>(a[1]); | |
327 | t[1] += static_cast<V>(a[0]); | |
328 | t[0] *= x; | |
329 | return t[0] + t[1]; | |
330 | } | |
331 | ||
332 | template <class T, class V> | |
333 | inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<17>*) BOOST_MATH_NOEXCEPT(V) | |
334 | { | |
335 | V x2 = x * x; | |
336 | V t[2]; | |
337 | t[0] = static_cast<V>(a[16] * x2 + a[14]); | |
338 | t[1] = static_cast<V>(a[15] * x2 + a[13]); | |
339 | t[0] *= x2; | |
340 | t[1] *= x2; | |
341 | t[0] += static_cast<V>(a[12]); | |
342 | t[1] += static_cast<V>(a[11]); | |
343 | t[0] *= x2; | |
344 | t[1] *= x2; | |
345 | t[0] += static_cast<V>(a[10]); | |
346 | t[1] += static_cast<V>(a[9]); | |
347 | t[0] *= x2; | |
348 | t[1] *= x2; | |
349 | t[0] += static_cast<V>(a[8]); | |
350 | t[1] += static_cast<V>(a[7]); | |
351 | t[0] *= x2; | |
352 | t[1] *= x2; | |
353 | t[0] += static_cast<V>(a[6]); | |
354 | t[1] += static_cast<V>(a[5]); | |
355 | t[0] *= x2; | |
356 | t[1] *= x2; | |
357 | t[0] += static_cast<V>(a[4]); | |
358 | t[1] += static_cast<V>(a[3]); | |
359 | t[0] *= x2; | |
360 | t[1] *= x2; | |
361 | t[0] += static_cast<V>(a[2]); | |
362 | t[1] += static_cast<V>(a[1]); | |
363 | t[0] *= x2; | |
364 | t[0] += static_cast<V>(a[0]); | |
365 | t[1] *= x; | |
366 | return t[0] + t[1]; | |
367 | } | |
368 | ||
369 | template <class T, class V> | |
370 | inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<18>*) BOOST_MATH_NOEXCEPT(V) | |
371 | { | |
372 | V x2 = x * x; | |
373 | V t[2]; | |
374 | t[0] = a[17] * x2 + a[15]; | |
375 | t[1] = a[16] * x2 + a[14]; | |
376 | t[0] *= x2; | |
377 | t[1] *= x2; | |
378 | t[0] += static_cast<V>(a[13]); | |
379 | t[1] += static_cast<V>(a[12]); | |
380 | t[0] *= x2; | |
381 | t[1] *= x2; | |
382 | t[0] += static_cast<V>(a[11]); | |
383 | t[1] += static_cast<V>(a[10]); | |
384 | t[0] *= x2; | |
385 | t[1] *= x2; | |
386 | t[0] += static_cast<V>(a[9]); | |
387 | t[1] += static_cast<V>(a[8]); | |
388 | t[0] *= x2; | |
389 | t[1] *= x2; | |
390 | t[0] += static_cast<V>(a[7]); | |
391 | t[1] += static_cast<V>(a[6]); | |
392 | t[0] *= x2; | |
393 | t[1] *= x2; | |
394 | t[0] += static_cast<V>(a[5]); | |
395 | t[1] += static_cast<V>(a[4]); | |
396 | t[0] *= x2; | |
397 | t[1] *= x2; | |
398 | t[0] += static_cast<V>(a[3]); | |
399 | t[1] += static_cast<V>(a[2]); | |
400 | t[0] *= x2; | |
401 | t[1] *= x2; | |
402 | t[0] += static_cast<V>(a[1]); | |
403 | t[1] += static_cast<V>(a[0]); | |
404 | t[0] *= x; | |
405 | return t[0] + t[1]; | |
406 | } | |
407 | ||
408 | ||
409 | }}}} // namespaces | |
410 | ||
411 | #endif // include guard | |
412 |