Use generic deque to store strings : deque « deque « C++ Tutorial

#include <iostream>
#include <cassert>
#include <deque>
#include <algorithm>  // For find
using namespace std;


int main()
{
  string x[5] = {"1234", "2345", "3456","4567", "5678"};

  deque<string> deque1(&x[0], &x[5]);

  // Search for the first occurrence of the letter e:
  deque<string>::iterator i;

  cout.precision(10);

  for (i = deque1.begin(); i != deque1.end(); ++i)
    cout << *i << endl;
  return 0;
}

22.1.deque
	22.1.1.	Use generic deque to store integers
	22.1.2.	deque for char type
	22.1.3.	Use generic deque to store chars
	22.1.4.	Use generic deque to store strings
	22.1.5.	Initialize deque with 26 copies of the letter x
	22.1.6.	Create another deque that contains a subrange of dq
	22.1.7.	create a deque
	22.1.8.	Use std::copy to print out all elements in a deque
	22.1.9.	deque.push_back( value )
	22.1.10.	deque.push_front( value )
	22.1.11.	Create your own stack based on deque
	22.1.12.	Constructing a Container with Values from the Standard Input
	22.1.13.	Combine insert and end to add elements to a deque