/////////////////////////////////////////////////////////////////////////////
// dataStr.cpp - demonstrate performance implications of STL containers
//
// Jim Fawcett, CSE691 - SW Modeling & Analysis, Fall 2000
/////////////////////////////////////////////////////////////////////////////
// Platform: Dell XPS1000, Windows 2000 Professional, SP1

#pragma warning(disable : 4786)
#include <iostream>
#include <list>
#include <set>
#include <vector>
#include "..\timer.h"
using namespace std;

/////////////////////////////////////////////////////////////////////////////
// function to time function calls

template<class cont, class elem> 
clock_t insertFunction(cont &c, elem &e, int N) {

  timer t;
  t.start();
  cont::const_iterator it = c.begin();
  int i;
  for(i=0; i<N; i++) {
    elem random = rand();
    c.insert(c.begin(),random);
  }
  t.stop();

  cout << "\n  type of container is \n  " << typeid(cont).name();

  cout << "\n  time to insert element at front " << N << " times = " 
       << t.elapsed() << " milliseconds" << endl;
  
  return t.elapsed();
}

//

/////////////////////////////////////////////////////////////////////////////
// test stub

void main() {

  cout << "\n  Demo Performance Issues with Standard Template Library "
       << "\n ========================================================\n";

  const int N = 20000;

  double d = 3.1415927;

// insert in front of list

  list<double> listCont;
  insertFunction<list<double>,double>(listCont,d,N);

// insert in multiset

  multiset<double> setCont;
  insertFunction<multiset<double>,double>(setCont,d,N);

// insert in front of vector

  vector<double> vectorCont;
  insertFunction<vector<double>,double>(vectorCont,d,N);

  vector<double> vectorContR;
  vectorContR.reserve(N);
  insertFunction<vector<double>,double>(vectorContR,d,N);

  cout << "\n\n";

}