Create an empty deque and then assign it a sequence that is the reverse of another deque - C++ STL

C++ examples for STL:deque

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

Description

Create an empty deque and then assign it a sequence that is the reverse of another deque

Demo Code

#include <iostream>
#include <deque>
using namespace std;
void show(const char *msg, deque<int> q);
int main() {//from ww w.  j  av  a 2s.co  m
   //Declare a deque that has an initial capacity of 10.
   deque<int> dq(10);
   for(unsigned i=0; i < dq.size(); ++i)
      dq[i] = i*i;
   // Declare an iterator to a deque<int>.
   deque<int>::iterator itr;
   // Now, declare reverse iterator to a deque<int>
   deque<int>::reverse_iterator ritr;
   // Create another deque that contains a subrange of dq.
   deque<int> dq2(dq.begin()+2, dq.end()-4);
   // Create an empty deque and then assign it a sequence
   // that is the reverse of dq.
   deque<int> dq3;
   dq3.assign(dq.rbegin(), dq.rend());
   show("dq3 contains the reverse of dq: ", dq3);
   cout << endl;
   return 0;
}
// Display the contents of a deque<int>.
void show(const char *msg, deque<int> q) {
   cout << msg;
   for(unsigned i=0; i < q.size(); ++i)
      cout << q[i] << " ";
   cout << "\n";
}

Result


Related Tutorials