#include <iostream>
#include <set>
using namespace std;

#include <edgeT.h>
#include <edgeTtest.h>
#include <print.h>


void edgeTtest::test01()
{
  typedef edgeT<double> ed;

  ed ei[] = 
  { 
    ed(1,2,0.0),ed(1,7,0.6),ed(4,3,2.7),ed(2,1,9.7),ed(6,2,-2.4)
  };

  set<ed> s;
  s.insert(ei[0]);

  cout << (stringc)ei[1] << endl;
  cout << ei[2] << endl;
  cout << SHOW( ei[0]==ei[3] ) << endl;

  cout << "Testing the find" << endl;
  set<ed>::iterator i=s.find(ei[3]);
  if (i!=s.end())
    cout << "found the element" << endl;
  else
    cout << "element not in the set." << endl;

  cout << print(ei,ei+5,"\n") << endl;

  cout << "****" << endl;
  s.insert(ei+1,ei+5);
  cout << print(s.begin(),s.end(),"\n") << endl;



}