std::inner_product

 

C++

Sprache

Concepts

Utilities-Bibliothek

Strings Bibliothek

Container-Bibliothek

Algorithmen-Bibliothek

Iteratoren Bibliothek

Numerik-Bibliothek

Input / Output-Bibliothek

Lokalisierungen Bibliothek

Reguläre Ausdrücke Bibliothek(C++11)

Atomare Operationen Bibliothek(C++11)

Thread Support-Bibliothek(C++11)

 

Algorithm Bibliothek

Funktionen Original: Functions The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
Nicht-modifizierende Sequenz Operationen Original: Non-modifying sequence operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
all_of any_of none_of (C++11) (C++11) (C++11) for_each count count_if mismatch equal	find find_if find_if_not (C++11) find_end find_first_of adjacent_find search search_n
Modifizierende Sequenz Operationen Original: Modifying sequence operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
copy copy_if (C++11) copy_n (C++11) copy_backward move (C++11) move_backward (C++11) fill fill_n transform generate generate_n remove remove_if remove_copy remove_copy_if	replace replace_if replace_copy replace_copy_if swap swap_ranges iter_swap reverse reverse_copy rotate rotate_copy random_shuffle shuffle   (C++11) unique unique_copy
Partitionierungsoperationen Original: Partitioning operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_partitioned (C++11) partition partition_copy (C++11)	stable_partition partition_point (C++11)
Sortierung Operationen (auf sortierten Bereiche) Original: Sorting operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_sorted (C++11) is_sorted_until (C++11) sort	partial_sort partial_sort_copy stable_sort nth_element
Binary Suchaktionen (auf sortierten Bereiche) Original: Binary search operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
lower_bound upper_bound	binary_search equal_range
Set-Operationen (auf sortierten Bereiche) Original: Set operations (on sorted ranges) The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
merge inplace_merge includes	set_difference set_intersection set_symmetric_difference set_union
Heap-Operationen Original: Heap operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
is_heap is_heap_until (C++11) make_heap	push_heap pop_heap sort_heap
Minimum / Maximum Operationen Original: Minimum/maximum operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
max max_element min min_element minmax (C++11) minmax_element (C++11)	lexicographical_compare is_permutation (C++11) next_permutation prev_permutation
Numerische Operationen Original: Numeric operations The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
iota (C++11) accumulate inner_product	adjacent_difference partial_sum
C-Bibliothek Original: C library The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
qsort	bsearch

 

definiert in Header <numeric>
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)

Berechnet innere Produkt (dh die Summe der Produkte) des Bereichs [first1, last1) und einen Bereich beginnend bei first2. Die erste Version verwendet operator* zum Produkt des Elements Paare und operator+ berechnen, summieren die Produkte verwendet die zweite Version op2 und op1 für diese Aufgaben bzw. .

Original:

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.

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

Parameter

first1, last1	-	die erste Reihe von Elementen Original: the first range of elements The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
first2	-	der Beginn der zweiten Reihe von Elementen Original: the beginning of the second range of elements The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
value	-	anfängliche Wert der Summe der Produkte Original: initial value of the sum of the products The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
op1	-	binary operation function object that will be applied. Diese Funktion übernimmt ein Wert, der durch op2 zurückgegeben und den aktuellen Wert des Akkumulators und produziert einen neuen Wert in dem Akkumulator gespeichert werden . Original: 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 text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. 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. Diese Funktion nimmt einen Wert aus jedem Bereich und erzeugt einen neuen Wert . Original: This function takes one value from each range and produces a new value. The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. 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 InputIt1 and InputIt2 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. ​
Type requirements
- InputIt1, InputIt2 must meet the requirements of InputIterator.
- T must meet the requirements of CopyAssignable and CopyConstructible.

Rückgabewert

Das innere Produkt von zwei Bereichen .

Original:

The inner product of two ranges.

The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

Mögliche Implementierung

First version
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;}
Second version
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;}

Beispiel

#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';}

Output:

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

Siehe auch

accumulate	fasst eine Reihe von Elementen Original: sums up a range of elements The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (Funktions-Template)
partial_sum	berechnet die Teilsumme von einer Reihe von Elementen Original: computes the partial sum of a range of elements The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (Funktions-Template)