Demonstrate insert iterators with queues - C++ STL Algorithm

C++ examples for STL Algorithm:back_inserter

  1. HOME
  2. C++
  3. STL Algorithm
  4. back_inserter

Description

Demonstrate insert iterators with queues

Demo Code

#include <iostream>
#include <deque>
#include <iterator>
#include <algorithm>
using namespace std;
int main()/*from  w ww .j a v a2s . co m*/
{
   int arr1[] = { 1, 3, 5, 7, 9 };  //initialize d1
   int arr2[] = {2, 4, 6};          //initialize d2
   deque<int> d1;
   deque<int> d2;
   for(int i=0; i<5; i++)           //transfer arrays to deques
      d1.push_back( arr1[i] );
   for(int j=0; j<3; j++)
      d2.push_back( arr2[j] );
   //copy d1 to back of d2
   copy( d1.begin(), d1.end(), back_inserter(d2) );
   cout << "\nd2: ";
   for(int k=0; k<d2.size(); k++)
      cout << d2[k] << ' ';
   cout << endl;
   return 0;
}

Result


Related Tutorials