x
Yes
No
Do you want to visit DriveHQ English website?
首页
产品服务
价格
免费试用
下载客户端
关于我们
云文件服务
|
云备份服务
|
FTP服务
|
企业邮箱服务
|
网站托管
|
客户端软件
云文件服务
云备份服务
FTP服务
企业级邮箱服务
网站托管
客户端软件
polynomial_horner3_20.hpp - Hosted on DriveHQ Cloud IT Platform
返回上层目录
上传
下载
共享
发布
新建文件夹
新建文件
复制
剪切
删除
粘贴
评论
升级服务
路径: \\game3dprogramming\materials\GameFactory\GameFactoryDemo\references\boost_1_35_0\boost\math\tools\detail\polynomial_horner3_20.hpp
旋转
特效
属性
历史版本
// (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 // Unrolled polynomial evaluation using second order Horners rule #ifndef BOOST_MATH_TOOLS_POLY_EVAL_20_HPP #define BOOST_MATH_TOOLS_POLY_EVAL_20_HPP namespace boost{ namespace math{ namespace tools{ namespace detail{ template
inline V evaluate_polynomial_c_imp(const T* a, const V&, const mpl::int_<0>*) { return static_cast
(0); } template
inline V evaluate_polynomial_c_imp(const T* a, const V&, const mpl::int_<1>*) { return static_cast
(a[0]); } template
inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<2>*) { return static_cast
(a[1] * x + a[0]); } template
inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<3>*) { return static_cast
((a[2] * x + a[1]) * x + a[0]); } template
inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<4>*) { return static_cast
(((a[3] * x + a[2]) * x + a[1]) * x + a[0]); } template
inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<5>*) { V x2 = x * x; V t[2]; t[0] = static_cast
(a[4] * x2 + a[2]); t[1] = static_cast
(a[3] * x2 + a[1]); t[0] *= x2; t[0] += static_cast
(a[0]); t[1] *= x; return t[0] + t[1]; } template
inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<6>*) { V x2 = x * x; V t[2]; t[0] = a[5] * x2 + a[3]; t[1] = a[4] * x2 + a[2]; t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[1]); t[1] += static_cast
(a[0]); t[0] *= x; return t[0] + t[1]; } template
inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<7>*) { V x2 = x * x; V t[2]; t[0] = static_cast
(a[6] * x2 + a[4]); t[1] = static_cast
(a[5] * x2 + a[3]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[2]); t[1] += static_cast
(a[1]); t[0] *= x2; t[0] += static_cast
(a[0]); t[1] *= x; return t[0] + t[1]; } template
inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<8>*) { V x2 = x * x; V t[2]; t[0] = a[7] * x2 + a[5]; t[1] = a[6] * x2 + a[4]; t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[3]); t[1] += static_cast
(a[2]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[1]); t[1] += static_cast
(a[0]); t[0] *= x; return t[0] + t[1]; } template
inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<9>*) { V x2 = x * x; V t[2]; t[0] = static_cast
(a[8] * x2 + a[6]); t[1] = static_cast
(a[7] * x2 + a[5]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[4]); t[1] += static_cast
(a[3]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[2]); t[1] += static_cast
(a[1]); t[0] *= x2; t[0] += static_cast
(a[0]); t[1] *= x; return t[0] + t[1]; } template
inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<10>*) { V x2 = x * x; V t[2]; t[0] = a[9] * x2 + a[7]; t[1] = a[8] * x2 + a[6]; t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[5]); t[1] += static_cast
(a[4]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[3]); t[1] += static_cast
(a[2]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[1]); t[1] += static_cast
(a[0]); t[0] *= x; return t[0] + t[1]; } template
inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<11>*) { V x2 = x * x; V t[2]; t[0] = static_cast
(a[10] * x2 + a[8]); t[1] = static_cast
(a[9] * x2 + a[7]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[6]); t[1] += static_cast
(a[5]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[4]); t[1] += static_cast
(a[3]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[2]); t[1] += static_cast
(a[1]); t[0] *= x2; t[0] += static_cast
(a[0]); t[1] *= x; return t[0] + t[1]; } template
inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<12>*) { V x2 = x * x; V t[2]; t[0] = a[11] * x2 + a[9]; t[1] = a[10] * x2 + a[8]; t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[7]); t[1] += static_cast
(a[6]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[5]); t[1] += static_cast
(a[4]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[3]); t[1] += static_cast
(a[2]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[1]); t[1] += static_cast
(a[0]); t[0] *= x; return t[0] + t[1]; } template
inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<13>*) { V x2 = x * x; V t[2]; t[0] = static_cast
(a[12] * x2 + a[10]); t[1] = static_cast
(a[11] * x2 + a[9]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[8]); t[1] += static_cast
(a[7]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[6]); t[1] += static_cast
(a[5]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[4]); t[1] += static_cast
(a[3]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[2]); t[1] += static_cast
(a[1]); t[0] *= x2; t[0] += static_cast
(a[0]); t[1] *= x; return t[0] + t[1]; } template
inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<14>*) { V x2 = x * x; V t[2]; t[0] = a[13] * x2 + a[11]; t[1] = a[12] * x2 + a[10]; t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[9]); t[1] += static_cast
(a[8]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[7]); t[1] += static_cast
(a[6]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[5]); t[1] += static_cast
(a[4]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[3]); t[1] += static_cast
(a[2]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[1]); t[1] += static_cast
(a[0]); t[0] *= x; return t[0] + t[1]; } template
inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<15>*) { V x2 = x * x; V t[2]; t[0] = static_cast
(a[14] * x2 + a[12]); t[1] = static_cast
(a[13] * x2 + a[11]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[10]); t[1] += static_cast
(a[9]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[8]); t[1] += static_cast
(a[7]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[6]); t[1] += static_cast
(a[5]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[4]); t[1] += static_cast
(a[3]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[2]); t[1] += static_cast
(a[1]); t[0] *= x2; t[0] += static_cast
(a[0]); t[1] *= x; return t[0] + t[1]; } template
inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<16>*) { V x2 = x * x; V t[2]; t[0] = a[15] * x2 + a[13]; t[1] = a[14] * x2 + a[12]; t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[11]); t[1] += static_cast
(a[10]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[9]); t[1] += static_cast
(a[8]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[7]); t[1] += static_cast
(a[6]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[5]); t[1] += static_cast
(a[4]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[3]); t[1] += static_cast
(a[2]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[1]); t[1] += static_cast
(a[0]); t[0] *= x; return t[0] + t[1]; } template
inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<17>*) { V x2 = x * x; V t[2]; t[0] = static_cast
(a[16] * x2 + a[14]); t[1] = static_cast
(a[15] * x2 + a[13]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[12]); t[1] += static_cast
(a[11]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[10]); t[1] += static_cast
(a[9]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[8]); t[1] += static_cast
(a[7]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[6]); t[1] += static_cast
(a[5]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[4]); t[1] += static_cast
(a[3]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[2]); t[1] += static_cast
(a[1]); t[0] *= x2; t[0] += static_cast
(a[0]); t[1] *= x; return t[0] + t[1]; } template
inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<18>*) { V x2 = x * x; V t[2]; t[0] = a[17] * x2 + a[15]; t[1] = a[16] * x2 + a[14]; t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[13]); t[1] += static_cast
(a[12]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[11]); t[1] += static_cast
(a[10]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[9]); t[1] += static_cast
(a[8]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[7]); t[1] += static_cast
(a[6]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[5]); t[1] += static_cast
(a[4]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[3]); t[1] += static_cast
(a[2]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[1]); t[1] += static_cast
(a[0]); t[0] *= x; return t[0] + t[1]; } template
inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<19>*) { V x2 = x * x; V t[2]; t[0] = static_cast
(a[18] * x2 + a[16]); t[1] = static_cast
(a[17] * x2 + a[15]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[14]); t[1] += static_cast
(a[13]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[12]); t[1] += static_cast
(a[11]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[10]); t[1] += static_cast
(a[9]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[8]); t[1] += static_cast
(a[7]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[6]); t[1] += static_cast
(a[5]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[4]); t[1] += static_cast
(a[3]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[2]); t[1] += static_cast
(a[1]); t[0] *= x2; t[0] += static_cast
(a[0]); t[1] *= x; return t[0] + t[1]; } template
inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<20>*) { V x2 = x * x; V t[2]; t[0] = a[19] * x2 + a[17]; t[1] = a[18] * x2 + a[16]; t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[15]); t[1] += static_cast
(a[14]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[13]); t[1] += static_cast
(a[12]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[11]); t[1] += static_cast
(a[10]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[9]); t[1] += static_cast
(a[8]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[7]); t[1] += static_cast
(a[6]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[5]); t[1] += static_cast
(a[4]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[3]); t[1] += static_cast
(a[2]); t[0] *= x2; t[1] *= x2; t[0] += static_cast
(a[1]); t[1] += static_cast
(a[0]); t[0] *= x; return t[0] + t[1]; } }}}} // namespaces #endif // include guard
polynomial_horner3_20.hpp
网页地址
文件地址
上一页
50/114
下一页
下载
( 12 KB )
Comments
Total ratings:
0
Average rating:
无评论
of 10
Would you like to comment?
Join now
, or
Logon
if you are already a member.