[ Web Proxy ]
URL:
Viewing: https://ru.cppreference.com/cpp/algorithm/inner_product [Back]  [Original]

std::inner_product cppreference.com
cppreference.com

std::inner_product

cppreference.com

<metanoindex/>

 
C++
(C++20)
(C++20)
(C++11)
(C++20)
/
(C++11)
(C++11)
(C++11)
(C++17)
 
(C++20)
, ranges::copy, ranges::sort, ...
(C++17)
(C++11)(C++11)(C++11)
(C++17)
(C++11)
( )
(C++11)
/
(C++11)
(C++17)

(C++17)
(C++17)
(C++17)
C
 
<tbody> </tbody>
template< class InputIt1, class InputIt2, class T > T inner_product( InputIt1 first1, InputIt1 last1, InputIt2 first2, T value );
(1)
template< class InputIt1, class InputIt2, class T, class BinaryOperation1, class BinaryOperation2 > T inner_product( InputIt1 first1, InputIt1 last1, InputIt2 first2, T value, BinaryOperation1 op1, BinaryOperation2 op2 );
(2)
(.. ) [first1, last1) first2. operator* operator+ , op2 op1 .
:
Computes inner product (i.e. sum of products) of the range [first1, last1) and another range beginning at first2. The first version uses operator* to compute product of the element pairs and operator+ to sum up the products, the second version uses op2 and op1 for these tasks respectively.
Google.
. .

first1, last1
:
the first range of elements
Google.
. .
first2
:
the beginning of the second range of elements
Google.
. .
value
:
initial value of the sum of the products
Google.
. .
op1 binary operation function object that will be applied.
, op2 .
:
This function takes a value returned by op2 and the current value of the accumulator and produces a new value to be stored in the accumulator.
Google.
. .

The signature of the function should be equivalent to the following:

Ret fun(const Type1 &a, const Type2 &b);

The signature does not need to have const &.
Type1 Type2 , T Type3 Type1 Type2 . Ret , T Ret.

op2 binary operation function object that will be applied.
.
:
This function takes one value from each range and produces a new value.
Google.
. .

The signature of the function should be equivalent to the following:

Ret fun(const Type1 &a, const Type2 &b);

The signature does not need to have const &.
Type1 Type2 , InputIt1 InputIt2 Type1 Type2 . Ret , Type3 Ret.

-
InputIt1, InputIt2 InputIterator.
-
T CopyAssignable CopyConstructible.

.
:
The inner product of two ranges.
Google.
. .

template<class InputIt1, class InputIt2, class T>
T inner_product(InputIt1 first1, InputIt1 last1,
                InputIt2 first2, T value)
{
    while (first1 != last1) {
         value = value + *first1 * *first2;
         ++first1;
         ++first2;
    }
    return value;
}
template<class InputIt1, class InputIt2,
         class T,
         class BinaryOperation1, class BinaryOperation2>
T inner_product(InputIt1 first1, InputIt1 last1,
                InputIt2 first2, T value,
                BinaryOperation1 op1
                BinaryOperation2 op2)
{
    while (first1 != last1) {
         value = op1(value, op2(*first1, *first2));
         ++first1;
         ++first2;
    }
    return value;
}

#include <numeric>
#include <iostream>
#include <vector>
#include <functional>
int main()
{
    std::vector<int> a{0, 1, 2, 3, 4};
    std::vector<int> b{5, 4, 2, 3, 1};

    int r1 = std::inner_product(a.begin(), a.end(), b.begin(), 0);
    std::cout << "Inner product of a and b: " << r1 << '\n';

    int r2 = std::inner_product(a.begin(), a.end(), b.begin(), 0,
                                std::plus<int>(), std::equal_to<int>());
    std::cout << "Number of pairwise matches between a and b: " <<  r2 << '\n';
}

:

Inner product of a and b: 21
Number of pairwise matches between a and b: 2

.


( ) []

( ) []

Web Proxy Viewer  |  New URL  |  Original Page