summaryrefslogtreecommitdiff
path: root/inference-engine/thirdparty/clDNN/common/boost/1.64.0/include/boost-1_64/boost/math/tools/detail/polynomial_horner3_19.hpp
diff options
context:
space:
mode:
Diffstat (limited to 'inference-engine/thirdparty/clDNN/common/boost/1.64.0/include/boost-1_64/boost/math/tools/detail/polynomial_horner3_19.hpp')
-rw-r--r--inference-engine/thirdparty/clDNN/common/boost/1.64.0/include/boost-1_64/boost/math/tools/detail/polynomial_horner3_19.hpp453
1 files changed, 0 insertions, 453 deletions
diff --git a/inference-engine/thirdparty/clDNN/common/boost/1.64.0/include/boost-1_64/boost/math/tools/detail/polynomial_horner3_19.hpp b/inference-engine/thirdparty/clDNN/common/boost/1.64.0/include/boost-1_64/boost/math/tools/detail/polynomial_horner3_19.hpp
deleted file mode 100644
index acffba6b4..000000000
--- a/inference-engine/thirdparty/clDNN/common/boost/1.64.0/include/boost-1_64/boost/math/tools/detail/polynomial_horner3_19.hpp
+++ /dev/null
@@ -1,453 +0,0 @@
-// (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_19_HPP
-#define BOOST_MATH_TOOLS_POLY_EVAL_19_HPP
-
-namespace boost{ namespace math{ namespace tools{ namespace detail{
-
-template <class T, class V>
-inline V evaluate_polynomial_c_imp(const T*, const V&, const mpl::int_<0>*) BOOST_MATH_NOEXCEPT(V)
-{
- return static_cast<V>(0);
-}
-
-template <class T, class V>
-inline V evaluate_polynomial_c_imp(const T* a, const V&, const mpl::int_<1>*) BOOST_MATH_NOEXCEPT(V)
-{
- return static_cast<V>(a[0]);
-}
-
-template <class T, class V>
-inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<2>*) BOOST_MATH_NOEXCEPT(V)
-{
- return static_cast<V>(a[1] * x + a[0]);
-}
-
-template <class T, class V>
-inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<3>*) BOOST_MATH_NOEXCEPT(V)
-{
- return static_cast<V>((a[2] * x + a[1]) * x + a[0]);
-}
-
-template <class T, class V>
-inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<4>*) BOOST_MATH_NOEXCEPT(V)
-{
- return static_cast<V>(((a[3] * x + a[2]) * x + a[1]) * x + a[0]);
-}
-
-template <class T, class V>
-inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<5>*) BOOST_MATH_NOEXCEPT(V)
-{
- V x2 = x * x;
- V t[2];
- t[0] = static_cast<V>(a[4] * x2 + a[2]);
- t[1] = static_cast<V>(a[3] * x2 + a[1]);
- t[0] *= x2;
- t[0] += static_cast<V>(a[0]);
- t[1] *= x;
- return t[0] + t[1];
-}
-
-template <class T, class V>
-inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<6>*) BOOST_MATH_NOEXCEPT(V)
-{
- 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<V>(a[1]);
- t[1] += static_cast<V>(a[0]);
- t[0] *= x;
- return t[0] + t[1];
-}
-
-template <class T, class V>
-inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<7>*) BOOST_MATH_NOEXCEPT(V)
-{
- V x2 = x * x;
- V t[2];
- t[0] = static_cast<V>(a[6] * x2 + a[4]);
- t[1] = static_cast<V>(a[5] * x2 + a[3]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[2]);
- t[1] += static_cast<V>(a[1]);
- t[0] *= x2;
- t[0] += static_cast<V>(a[0]);
- t[1] *= x;
- return t[0] + t[1];
-}
-
-template <class T, class V>
-inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<8>*) BOOST_MATH_NOEXCEPT(V)
-{
- 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<V>(a[3]);
- t[1] += static_cast<V>(a[2]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[1]);
- t[1] += static_cast<V>(a[0]);
- t[0] *= x;
- return t[0] + t[1];
-}
-
-template <class T, class V>
-inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<9>*) BOOST_MATH_NOEXCEPT(V)
-{
- V x2 = x * x;
- V t[2];
- t[0] = static_cast<V>(a[8] * x2 + a[6]);
- t[1] = static_cast<V>(a[7] * x2 + a[5]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[4]);
- t[1] += static_cast<V>(a[3]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[2]);
- t[1] += static_cast<V>(a[1]);
- t[0] *= x2;
- t[0] += static_cast<V>(a[0]);
- t[1] *= x;
- return t[0] + t[1];
-}
-
-template <class T, class V>
-inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<10>*) BOOST_MATH_NOEXCEPT(V)
-{
- 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<V>(a[5]);
- t[1] += static_cast<V>(a[4]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[3]);
- t[1] += static_cast<V>(a[2]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[1]);
- t[1] += static_cast<V>(a[0]);
- t[0] *= x;
- return t[0] + t[1];
-}
-
-template <class T, class V>
-inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<11>*) BOOST_MATH_NOEXCEPT(V)
-{
- V x2 = x * x;
- V t[2];
- t[0] = static_cast<V>(a[10] * x2 + a[8]);
- t[1] = static_cast<V>(a[9] * x2 + a[7]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[6]);
- t[1] += static_cast<V>(a[5]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[4]);
- t[1] += static_cast<V>(a[3]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[2]);
- t[1] += static_cast<V>(a[1]);
- t[0] *= x2;
- t[0] += static_cast<V>(a[0]);
- t[1] *= x;
- return t[0] + t[1];
-}
-
-template <class T, class V>
-inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<12>*) BOOST_MATH_NOEXCEPT(V)
-{
- 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<V>(a[7]);
- t[1] += static_cast<V>(a[6]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[5]);
- t[1] += static_cast<V>(a[4]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[3]);
- t[1] += static_cast<V>(a[2]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[1]);
- t[1] += static_cast<V>(a[0]);
- t[0] *= x;
- return t[0] + t[1];
-}
-
-template <class T, class V>
-inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<13>*) BOOST_MATH_NOEXCEPT(V)
-{
- V x2 = x * x;
- V t[2];
- t[0] = static_cast<V>(a[12] * x2 + a[10]);
- t[1] = static_cast<V>(a[11] * x2 + a[9]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[8]);
- t[1] += static_cast<V>(a[7]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[6]);
- t[1] += static_cast<V>(a[5]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[4]);
- t[1] += static_cast<V>(a[3]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[2]);
- t[1] += static_cast<V>(a[1]);
- t[0] *= x2;
- t[0] += static_cast<V>(a[0]);
- t[1] *= x;
- return t[0] + t[1];
-}
-
-template <class T, class V>
-inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<14>*) BOOST_MATH_NOEXCEPT(V)
-{
- 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<V>(a[9]);
- t[1] += static_cast<V>(a[8]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[7]);
- t[1] += static_cast<V>(a[6]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[5]);
- t[1] += static_cast<V>(a[4]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[3]);
- t[1] += static_cast<V>(a[2]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[1]);
- t[1] += static_cast<V>(a[0]);
- t[0] *= x;
- return t[0] + t[1];
-}
-
-template <class T, class V>
-inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<15>*) BOOST_MATH_NOEXCEPT(V)
-{
- V x2 = x * x;
- V t[2];
- t[0] = static_cast<V>(a[14] * x2 + a[12]);
- t[1] = static_cast<V>(a[13] * x2 + a[11]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[10]);
- t[1] += static_cast<V>(a[9]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[8]);
- t[1] += static_cast<V>(a[7]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[6]);
- t[1] += static_cast<V>(a[5]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[4]);
- t[1] += static_cast<V>(a[3]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[2]);
- t[1] += static_cast<V>(a[1]);
- t[0] *= x2;
- t[0] += static_cast<V>(a[0]);
- t[1] *= x;
- return t[0] + t[1];
-}
-
-template <class T, class V>
-inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<16>*) BOOST_MATH_NOEXCEPT(V)
-{
- 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<V>(a[11]);
- t[1] += static_cast<V>(a[10]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[9]);
- t[1] += static_cast<V>(a[8]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[7]);
- t[1] += static_cast<V>(a[6]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[5]);
- t[1] += static_cast<V>(a[4]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[3]);
- t[1] += static_cast<V>(a[2]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[1]);
- t[1] += static_cast<V>(a[0]);
- t[0] *= x;
- return t[0] + t[1];
-}
-
-template <class T, class V>
-inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<17>*) BOOST_MATH_NOEXCEPT(V)
-{
- V x2 = x * x;
- V t[2];
- t[0] = static_cast<V>(a[16] * x2 + a[14]);
- t[1] = static_cast<V>(a[15] * x2 + a[13]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[12]);
- t[1] += static_cast<V>(a[11]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[10]);
- t[1] += static_cast<V>(a[9]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[8]);
- t[1] += static_cast<V>(a[7]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[6]);
- t[1] += static_cast<V>(a[5]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[4]);
- t[1] += static_cast<V>(a[3]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[2]);
- t[1] += static_cast<V>(a[1]);
- t[0] *= x2;
- t[0] += static_cast<V>(a[0]);
- t[1] *= x;
- return t[0] + t[1];
-}
-
-template <class T, class V>
-inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<18>*) BOOST_MATH_NOEXCEPT(V)
-{
- 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<V>(a[13]);
- t[1] += static_cast<V>(a[12]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[11]);
- t[1] += static_cast<V>(a[10]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[9]);
- t[1] += static_cast<V>(a[8]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[7]);
- t[1] += static_cast<V>(a[6]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[5]);
- t[1] += static_cast<V>(a[4]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[3]);
- t[1] += static_cast<V>(a[2]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[1]);
- t[1] += static_cast<V>(a[0]);
- t[0] *= x;
- return t[0] + t[1];
-}
-
-template <class T, class V>
-inline V evaluate_polynomial_c_imp(const T* a, const V& x, const mpl::int_<19>*) BOOST_MATH_NOEXCEPT(V)
-{
- V x2 = x * x;
- V t[2];
- t[0] = static_cast<V>(a[18] * x2 + a[16]);
- t[1] = static_cast<V>(a[17] * x2 + a[15]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[14]);
- t[1] += static_cast<V>(a[13]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[12]);
- t[1] += static_cast<V>(a[11]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[10]);
- t[1] += static_cast<V>(a[9]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[8]);
- t[1] += static_cast<V>(a[7]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[6]);
- t[1] += static_cast<V>(a[5]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[4]);
- t[1] += static_cast<V>(a[3]);
- t[0] *= x2;
- t[1] *= x2;
- t[0] += static_cast<V>(a[2]);
- t[1] += static_cast<V>(a[1]);
- t[0] *= x2;
- t[0] += static_cast<V>(a[0]);
- t[1] *= x;
- return t[0] + t[1];
-}
-
-
-}}}} // namespaces
-
-#endif // include guard
-
generated by cgit v1.2.3 (git 2.25.1) at 2024-05-13 06:18:33 +0000