// test_print_template.cpp   a general template function to print a STL container

#include <iostream>
#include <algorithm>
#include <functional>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <queue>
#include <stack>
using namespace std;

// a template for a general STL container print function

template <class forward_iterator>
void print(forward_iterator first, forward_iterator last, const char* title)
{
  cout << title << endl;
  while (first != last)  cout << *first++ << "  ";
  cout << endl << endl;
}

int main()
{
  int i;
  int n; // size of container
  int data[4] = {3, 7, 5, 4};
  print(data, data+4, "normal integer array");
  
  vector<int> v1(4);
  v1[0] = 3;
  v1[1] = 7;
  v1[2] = 5;
  v1[3] = 4;
  print(v1.begin(), v1.end(), "vector<int> data");
  
  list<string> l1;
  l1.push_back("3");
  l1.push_back("7");
  l1.push_back("5");
  l1.push_back("4");
  print(l1.begin(), l1.end(), "list<string> data");
  
  set<int> s1;
  s1.insert(3);
  s1.insert(7);
  s1.insert(5);
  s1.insert(4);
  print(s1.begin(), s1.end(), "set<int> data - note sorted");

  multiset<int> ms;
  ms.insert(3);
  ms.insert(7);
  ms.insert(5);
  ms.insert(4);
  print(ms.begin(), ms.end(), "multiset<int> data - note sorted");
  
  queue<int> q1;
  q1.push(3);
  q1.push(7);
  q1.push(5);
  q1.push(4);
  // print(q1.begin(), q1.end(), "queue<int> data"); // won't work
  cout << "special print loop for queue<int>, destroys queue" << endl;
  n = q1.size(); // can not be in 'for' statement
  for(i=0; i<n; i++)  {cout << q1.front() << "  "; q1.pop();}
  cout << endl << endl;
  
  priority_queue<int> pq;
  pq.push(4);
  pq.push(5);
  pq.push(7);
  pq.push(3);
  // print(pq.begin(), pq.end(), "priority_queue<int> data"); // won't work
  cout << "special print loop for priority_queue<int> sorted, destroys priority_queue" << endl;
  n = pq.size(); // can not be in 'for' statement
  for(i=0; i<n; i++)  {cout << pq.top() << "  "; pq.pop();}
  cout << endl << endl;
  
  deque<int> dq;
  dq.push_front(4);
  dq.push_front(5);
  dq.push_front(7);
  dq.push_front(3);
  // print(dq.begin(), dq.end(), "deque<int> data"); // won't work
  cout << "special print loop for deque<int>, destroys deque" << endl;
  n = dq.size(); // can not be in 'for' statement
  for(i=0; i<n; i++)  {cout << dq.front() << "  "; dq.pop_front();}
  cout << endl << endl;
  
  stack<int> st;
  st.push(4);
  st.push(5);
  st.push(7);
  st.push(3);
  // print(st.begin(), st.end(), "stack<int> data"); won't work
  cout << "special print loop for stack<int>, destroys stack" << endl;
  n = st.size(); // can not be in 'for' statement
  for(i=0; i<n; i++)  {cout << st.top() << "  "; st.pop();}
  cout << endl << endl;
  
  return 0;
}

// output from execution is:
// normal integer array
// 3  7  5  4  
//
// vector<int> data
// 3  7  5  4  
// 
// list<string> data
// 3  7  5  4  
// 
// set<int> data - note sorted
// 3  4  5  7  
// 
// multiset<int> data - note sorted
// 3  4  5  7  
// 
// special print loop for queue<int>, destroys queue
// 3  7  5  4  
// 
// special print loop for priority_queue<int> sorted, destroys priority_queue
// 7  5  4  3  
// 
// special print loop for deque<int>, destroys deque
// 3  7  5  4  
// 
// special print loop for stack<int>, destroys stack
// 3  7  5  4  
//