test.0.InsertSortedVector.cpp

Go to the documentation of this file.

#include "InsertSortedVector.h"

#include <iostream>

using namespace std;

int main() {
  vector< pair< int, int> > li_vct;
  map< int, int> li_map;
  int i;

  for (i=0; i<100; ++i) {
    li_vct.push_back( pair<int, int>( i, 100+i) );
  }

  tf_InsertSortedVector< int, int>( li_vct, li_map);

  for (i=0; i<100; ++i) {
    if (li_map.find( i) == li_map.end()) {
      cerr << "key = " << i << " was not found" << endl;
      return 1;
    }
  }

  for (i=0; i<100; ++i) {
    if (li_map[i] != (100+i)) {
      cerr << "key = " << i << " mapped to " << li_map[i] << " instead of " << i + 100 << endl;
      return 2;
    }
  }

  cout << "test passed" << endl;

  return 0;
}

---