Namespaces
Variants
Views
Actions

Difference between revisions of "cpp/algorithm/inner product"

From cppreference.com
< cpp‎ | algorithm
(example that uses both forms of this function instead of using the same form twice.)
(→‎Equivalent function: formatting)
Line 51: Line 51:
 
}
 
}
 
  | 2=
 
  | 2=
−
template<
+
template<class InputIterator1, class InputIterator2,
−
    class InputIterator1,
+
        class T,
−
    class InputIterator2,
+
        class BinaryOperation1, class BinaryOperation2>
−
    class T,
+
T inner_product(InputIterator1 first1, InputIterator1 last1,
−
    class BinaryOperation1
+
                InputIterator2 first2, T value,
−
    class BinaryOperation2
+
                BinaryOperation1 op1
−
> T inner_product(InputIterator1 first1, InputIterator1 last1,
+
                BinaryOperation2 op2)
−
                  InputIterator2 first2, T value,
+
−
                  BinaryOperation1 op1
+
−
                  BinaryOperation2 op2)
+
 
{
 
{
 
     while (first1 != last1) {
 
     while (first1 != last1) {

Revision as of 09:03, 24 August 2011

Template:cpp/algorithm/sidebar Template:ddcl list begin <tr class="t-dsc-header">

<td>
Defined in header <numeric>
</td>

<td></td> <td></td> </tr> <tr class="t-dcl ">

<td >
template< class InputIterator1, class InputIterator2 class T >

T inner_product( InputIterator1 first1, InputIterator1 last1,

                 InputIterator2 first2, T value );
</td>

<td > (1) </td> <td class="t-dcl-nopad"> </td> </tr> <tr class="t-dcl ">

<td >
template<

    class InputIterator1,
    class InputIterator2,
    class T,
    class BinaryOperation1
    class BinaryOperation2
> T inner_product( InputIterator1 first1, InputIterator1 last1,
                   InputIterator2 first2, T value,
                   BinaryOperation1 op1

                   BinaryOperation2 op2 );
</td>

<td > (2) </td> <td class="t-dcl-nopad"> </td> </tr> Template:ddcl list end

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.

Contents

Parameters

first1, last1 - the first range of elements
first2 - the beginning of the second range of elements
value - initial value of the sum of the products
op1 - binary operation function object that will be applied. 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.

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 &.
The types  Type1 and  Type2 must be such that objects of types T and Type3 can be implicitly converted to  Type1 and  Type2 respectively. The type Ret must be such that an object of type T can be assigned a value of type Ret. ​

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

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 &.
The types  Type1 and  Type2 must be such that objects of types InputIterator1 and InputIterator2 can be dereferenced and then implicitly converted to  Type1 and  Type2 respectively. The type Ret must be such that an object of type Type3 can be assigned a value of type Ret. ​

Return value

The inner product of two ranges.

Equivalent function

Template:eq fun cpp

Example

Template:example cpp

See also

Template:cpp/algorithm/dcl list accumulateTemplate:cpp/algorithm/dcl list partial sum
Retrieved from "https://en.cppreference.com/mwiki/index.php?title=cpp/algorithm/inner_product&oldid=9611"