std::adjacent_difference

 

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 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.

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.

*(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:  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 an object of type iterator_traits<InputIt>::value_type can be implicitly converted to both of them. The type  Ret must be such that an object of type OutputIt can be dereferenced and assigned a value of type  Ret. ​
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.

Komplexität

Genau (last - first) - 1 Anwendungen der binären Operation

Original:

Exactly (last - first) - 1 applications of the binary operation

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 InputIt, class OutputIt> OutputIt adjacent_difference(InputIt first, InputIt last, OutputIt d_first){if(first == last)return d_first;   typedeftypenamestd::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;   typedeftypenamestd::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.

​#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

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)
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)