adjacent_difference( ) returns a new sequence in which each element is the difference between adjacent elements in the original sequence. : adjacent_difference « STL Algorithms Helper « C++

1.	Bitset
2.	Class
3.	Console
4.	Data Structure
5.	Data Type
6.	Deque
7.	Development
8.	File
9.	Function
10.	Generic
11.	Language
12.	List
13.	Map Multimap
14.	Overload
15.	Pointer
16.	Qt
17.	Queue Stack
18.	Set Multiset
19.	STL Algorithms Binary search
20.	STL Algorithms Heap
21.	STL Algorithms Helper
22.	STL Algorithms Iterator
23.	STL Algorithms Merge
24.	STL Algorithms Min Max
25.	STL Algorithms Modifying sequence operations
26.	STL Algorithms Non modifying sequence operations
27.	STL Algorithms Sorting
28.	STL Basics
29.	String
30.	Valarray
31.	Vector

C / ANSI-C

C Tutorial

C++ Tutorial

Visual C++ .NET

C++ » STL Algorithms Helper » adjacent_difference

Screenshots

adjacent_difference( ) returns a new sequence in which each element is the difference between adjacent elements in the original sequence.

  

#include <iostream>

#include <vector>

#include <numeric>

using namespace std;

   

int main()

{

  vector<int> v(10), r(10);

  int i;

   

  for(i=0; i<10; i++) {

    v[i] = i*2;

    cout << v[i] << endl;

  }  

   

  adjacent_difference(v.begin(), v.end(), r.begin());

   

  for(i=0; i<10; i++)

    cout << r[i] << endl;

   

  return 0;

}

Related examples in the same category

1.	adjacent_difference: print all differences between elements
2.	adjacent_difference: print all sums with the predecessors
3.	adjacent_difference: print all products between elements
4.	Use adjacent_difference to convert elements in a container into relative values

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.