]> git.proxmox.com Git - ceph.git/blame - ceph/src/boost/libs/math/include/boost/math/tools/detail/polynomial_horner3_14.hpp
projects / ceph.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
bump version to 12.2.2-pve1
[ceph.git] / ceph / src / boost / libs / math / include / boost / math / tools / detail / polynomial_horner3_14.hpp
CommitLineData
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_14_HPP
10#define BOOST_MATH_TOOLS_POLY_EVAL_14_HPP
11
12namespace boost{ namespace math{ namespace tools{ namespace detail{
13
14template <class T, class V>
15inline 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
20template <class T, class V>
21inline 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
26template <class T, class V>
27inline 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
32template <class T, class V>
33inline 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
38template <class T, class V>
39inline 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
44template <class T, class V>
45inline 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
57template <class T, class V>
58inline 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
72template <class T, class V>
73inline 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
89template <class T, class V>
90inline 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
108template <class T, class V>
109inline 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
129template <class T, class V>
130inline 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
152template <class T, class V>
153inline 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
177template <class T, class V>
178inline 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
204template <class T, class V>
205inline 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
233template <class T, class V>
234inline 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
265}}}} // namespaces
266
267#endif // include guard
268
Ceph