adjacent_difference
描述 (Description)
它计算相邻的范围差异。
声明 (Declaration)
以下是std :: adjacent_difference的声明。
C++98
template <class InputIterator, class OutputIterator>
OutputIterator adjacent_difference (InputIterator first, InputIterator last,
OutputIterator result);
template <class InputIterator, class OutputIterator, class BinaryOperation>
OutputIterator adjacent_difference ( InputIterator first, InputIterator last,
OutputIterator result, BinaryOperation binary_op );
C++11
template <class InputIterator, class OutputIterator>
OutputIterator adjacent_difference (InputIterator first, InputIterator last,
OutputIterator result);
template <class InputIterator, class OutputIterator, class BinaryOperation>
OutputIterator adjacent_difference ( InputIterator first, InputIterator last,
OutputIterator result, BinaryOperation binary_op );
first, last - 它迭代到序列中的初始和最终位置。
init - 它是累加器的初始值。
binary_op - 它是二进制操作。
返回值 (Return Value)
它返回一个迭代器，该迭代器指向目标序列的最后一个元素，其中存储了结果元素。
异常 (Exceptions)
如果任何binary_op，赋值或迭代器上的操作抛出，它都会抛出。
数据竞争 (Data races)
访问[first1，last1]范围内的元素。
例子 (Example)
在下面的示例中为std :: adjacent_difference。
#include <iostream>
#include <functional>
#include <numeric>
int myop (int x, int y) {return x+y;}
int main () {
int val[] = {10,20,30,50,60,70};
int result[7];
std::adjacent_difference (val, val+7, result);
std::cout << "Default adjacent_difference: ";
for (int i=0; i<7; i++) std::cout << result[i] << ' ';
std::cout << '\n';
std::adjacent_difference (val, val+7, result, std::multiplies<int>());
std::cout << "Functional operation multiplies: ";
for (int i=0; i<7; i++) std::cout << result[i] << ' ';
std::cout << '\n';
std::adjacent_difference (val, val+7, result, myop);
std::cout << "Custom function operation: ";
for (int i=0; i<7; i++) std::cout << result[i] << ' ';
std::cout << '\n';
return 0;
}
输出应该是这样的 -
Default adjacent_difference: 10 10 10 20 10 10 4197079
Functional operation multiplies: 10 200 600 1500 3000 4200 293800430
Custom function operation: 10 30 50 80 110 130 4197219
