# GL Profile Suite / boost_1_51_0 / boost / math / tools / detail / polynomial_horner3_8.hpp

 ``` 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111``` ```// (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_8_HPP #define BOOST_MATH_TOOLS_POLY_EVAL_8_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]; } }}}} // namespaces #endif // include guard ```
Tip: Filter by directory path e.g. /media app.js to search for public/media/app.js.
Tip: Use camelCasing e.g. ProjME to search for ProjectModifiedEvent.java.
Tip: Filter by extension type e.g. /repo .js to search for all .js files in the /repo directory.
Tip: Separate your search with spaces e.g. /ssh pom.xml to search for src/ssh/pom.xml.
Tip: Use ↑ and ↓ arrow keys to navigate and return to view the file.
Tip: You can also navigate files with Ctrl+j (next) and Ctrl+k (previous) and view the file with Ctrl+o.
Tip: You can also navigate files with Alt+j (next) and Alt+k (previous) and view the file with Alt+o.