Create an empty deque and then assign it a sequence that is the reverse of deque : deque iterator « deque « C++ Tutorial






  1. C++ Tutorial
  2. deque
  3. deque iterator
#include <iostream>
#include <deque>

using namespace std;

void show(const char *msg, deque<int> q);

int main() {

  deque<int> dq(10);

  for(unsigned i=0; i < dq.size(); ++i) dq[i] = i*i;

  show("Contents of dq: ", dq);

  // 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";
}








22.6.deque iterator
22.6.1.Define iterator for deque
22.6.2.deque::iterator and deque::reverse_iterator
22.6.3.Using the Front of a Deque
22.6.4.Use iterator and reverse_iterator with deque
22.6.5.Print the contents in reverse order using reverse_iterator and functions rbegin() and rend()
22.6.6.Create an empty deque and then assign it a sequence that is the reverse of deque
22.6.7.Use insert iterator adaptors to insert one deque into another by way of the copy() algorithm.