C++自定义容器排序规则

/*************************************************************************
    > File Name: MyComparator.cpp
    > Author: ma6174
    > Mail: [e-mail] 
    > Created Time: 2013年12月 2日 23:22:07
 ************************************************************************/
#include<iostream>
#include<set>
#include<iterator>
using namespace std;

template <class T>
class MyComparator {

  public :

	  enum compare_mode {normal,reverse};

  private:
	  compare_mode mode;
  public:
MyComparator(compare_mode m=normal):mode(m) {


}

bool operator()(const T &t1,const T &t2) {
  return mode==normal ? t1<t2 : t2<t1;

}

};

int main() {

   set<int> s1;

   for(int i=0;i<10;i++) {

	   s1.insert(i);
   }

   copy(s1.begin(),s1.end(),ostream_iterator<int>(cout," "));
   cout<<endl;

   MyComparator<int> com(MyComparator<int>::reverse);
   set<int,MyComparator<int> > s2(com);
   
   for(int i=0;i<10;i++) {

	   s2.insert(i);
   }
    cout<<"==========="<<endl;
   copy(s2.begin(),s2.end(),ostream_iterator<int>(cout," "));
   cout<<endl;


}