std::adjacent_difference
Aus cppreference.com
 |
This page has been machine-translated from the English version of the wiki using Google Translate.
The translation may contain errors and awkward wording. Hover over text to see the original version. You can help to fix errors and improve the translation. For instructions click here. |
<metanoindex/>
<tbody> </tbody>| definiert in Header <numeric>
|
||
template< class InputIt, class OutputIt > OutputIt adjacent_difference( InputIt first, InputIt last, OutputIt d_first ); |
(1) | |
template< class InputIt, class OutputIt, class BinaryOperation > OutputIt adjacent_difference( InputIt first, InputIt last, OutputIt d_first, BinaryOperation op ); |
(2) | |
Berechnet die Unterschiede zwischen der zweiten und der ersten von jedem benachbarten Paar von Elementen des Bereichs
[first, last) und schreibt sie in dem Bereich beginnend bei d_first + 1. Unveränderte Kopie first wird d_first geschrieben. Die erste Version verwendet, um die Unterschiede operator- berechnen, verwendet die zweite Version des gegebenen binären Funktion op .Original:
Computes the differences between the second and the first of each adjacent pair of elements of the range
[first, last) and writes them to the range beginning at d_first + 1. Unmodified copy of first is written to d_first. The first version uses operator- to calculate the differences, the second version uses the given binary function op.The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
Equivalent Betrieb:
Original:
Equivalent operation:
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
*(d_first) = *first;
*(d_first+1) = (*first+1) - *(first);
*(d_first+2) = (*first+2) - *(first+1);
*(d_first+3) = (*first+3) - *(first+2);
...
Parameter
| first, last | - | das Spektrum der Elemente
Original: the 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. |
| d_first | - | der Beginn des Zielbereichs
Original: the beginning of the destination range The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
| op | - | binary operation function object that will be applied. The signature of the function should be equivalent to the following:
The signature does not need to have |
| Type requirements | ||
-InputIt must meet the requirements of InputIterator.
| ||
-OutputIt must meet the requirements of OutputIterator.
| ||
Rückgabewert
Es an das Element nach dem letzten Element geschrieben .
Original:
It to the element past the last element written.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
Komplexität
Genau
(last - first) - 1 Anwendungen der binären OperationOriginal:
Exactly
(last - first) - 1 applications of the binary operationThe text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
Mögliche Implementierung
| First version |
|---|
template<class InputIt, class OutputIt>
OutputIt adjacent_difference(InputIt first, InputIt last,
OutputIt d_first)
{
if (first == last) return d_first;
typedef typename std::iterator_traits<InputIt>::value_type value_t;
value_t acc = *first;
*d_first = acc;
while (++first != last) {
value_t val = *first;
*++d_first = val - acc;
acc = std::move(val);
}
return ++d_first;
}
|
| Second version |
template<class InputIt, class T, class BinaryOperation>
OutputIt adjacent_difference(InputIt first, InputIt last,
OutputIt d_first, BinaryOperation op)
{
if (first == last) return d_first;
typedef typename std::iterator_traits<InputIt>::value_type value_t;
value_t acc = *first;
*d_first = acc;
while (++first != last) {
value_t val = *first;
*++d_first = op(val, acc);
acc = std::move(val);
}
return ++d_first;
}
|
Beispiel
Der folgende Code konvertiert eine Folge von geraden Zahlen von Wiederholungen der Zahl 2 und wandelt eine Sequenz von Einsen mit einer Sequenz der Fibonacci-Zahlen .
Original:
The following code converts a sequence of even numbers to repetitions of the number 2 and converts a sequence of ones to a sequence of Fibonacci numbers.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
#include <numeric>
#include <vector>
#include <iostream>
#include <functional>
int main()
{
std::vector<int> v{2, 4, 6, 8, 10, 12, 14, 16, 18, 20};
std::adjacent_difference(v.begin(), v.end(), v.begin());
for(auto n: v) {
std::cout << n << ' ';
}
std::cout << '\n';
v = {1, 1, 1, 1, 1, 1, 1, 1, 1, 1};
std::adjacent_difference(v.begin(), v.end()-1, v.begin()+1, std::plus<int>()
for(auto n: v) {
std::cout << n << ' ';
}
std::cout << '\n';
}
Output:
2 2 2 2 2 2 2 2 2 2
1 1 2 3 5 8 13 21 34 55
Siehe auch
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) | |
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) | |