# GL Profile Suite / boost_1_51_0 / boost / math / tools / detail / polynomial_horner1_18.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 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131``` ```// (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 // Polynomial evaluation using Horners rule #ifndef BOOST_MATH_TOOLS_POLY_EVAL_18_HPP #define BOOST_MATH_TOOLS_POLY_EVAL_18_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>*) { return static_cast((((a[4] * x + 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_<6>*) { return static_cast(((((a[5] * x + a[4]) * x + 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_<7>*) { return static_cast((((((a[6] * x + a[5]) * x + a[4]) * x + 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_<8>*) { return static_cast(((((((a[7] * x + a[6]) * x + a[5]) * x + a[4]) * x + 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_<9>*) { return static_cast((((((((a[8] * x + a[7]) * x + a[6]) * x + a[5]) * x + a[4]) * x + 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_<10>*) { return static_cast(((((((((a[9] * x + a[8]) * x + a[7]) * x + a[6]) * x + a[5]) * x + a[4]) * x + 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_<11>*) { return static_cast((((((((((a[10] * x + a[9]) * x + a[8]) * x + a[7]) * x + a[6]) * x + a[5]) * x + a[4]) * x + 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_<12>*) { return static_cast(((((((((((a[11] * x + a[10]) * x + a[9]) * x + a[8]) * x + a[7]) * x + a[6]) * x + a[5]) * x + a[4]) * x + 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_<13>*) { return static_cast((((((((((((a[12] * x + a[11]) * x + a[10]) * x + a[9]) * x + a[8]) * x + a[7]) * x + a[6]) * x + a[5]) * x + a[4]) * x + 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_<14>*) { return static_cast(((((((((((((a[13] * x + a[12]) * x + a[11]) * x + a[10]) * x + a[9]) * x + a[8]) * x + a[7]) * x + a[6]) * x + a[5]) * x + a[4]) * x + 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_<15>*) { return static_cast((((((((((((((a[14] * x + a[13]) * x + a[12]) * x + a[11]) * x + a[10]) * x + a[9]) * x + a[8]) * x + a[7]) * x + a[6]) * x + a[5]) * x + a[4]) * x + 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_<16>*) { return static_cast(((((((((((((((a[15] * x + a[14]) * x + a[13]) * x + a[12]) * x + a[11]) * x + a[10]) * x + a[9]) * x + a[8]) * x + a[7]) * x + a[6]) * x + a[5]) * x + a[4]) * x + 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_<17>*) { return static_cast((((((((((((((((a[16] * x + a[15]) * x + a[14]) * x + a[13]) * x + a[12]) * x + a[11]) * x + a[10]) * x + a[9]) * x + a[8]) * x + a[7]) * x + a[6]) * x + a[5]) * x + a[4]) * x + 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_<18>*) { return static_cast(((((((((((((((((a[17] * x + a[16]) * x + a[15]) * x + a[14]) * x + a[13]) * x + a[12]) * x + a[11]) * x + a[10]) * x + a[9]) * x + a[8]) * x + a[7]) * x + a[6]) * x + a[5]) * x + a[4]) * x + a[3]) * x + a[2]) * x + a[1]) * x + a[0]); } }}}} // 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.