Demonstrate normal copy with queues - C++ STL

C++ examples for STL:deque

  1. HOME
  2. C++
  3. STL
  4. deque

Description

Demonstrate normal copy with queues

Demo Code

#include <iostream>
#include <deque>
#include <algorithm>
using namespace std;
int main()/*w w w  .  j a  v a  2 s  .c  om*/
{
   int arr1[] = { 1, 3, 5, 7, 9 };
   int arr2[] = { 2, 4, 6, 8, 10 };
   deque<int> d1;
   deque<int> d2;
   for(int j=0; j<5; j++)          //transfer arrays to deques
   {
      d1.push_back( arr1[j] );
      d2.push_back( arr2[j] );
   }                            //copy d1 to d2
   copy( d1.begin(), d1.end(), d2.begin() );
   for(int k=0; k<d2.size(); k++)  // display d2
      cout << d2[k] << ' ';
   cout << endl;
   return 0;
}

Result


Related Tutorials