///////////////////////////////////////////////////////////////
//  set3.cpp - demonstrate sets with user defined            //
//             predicate objects                             //
//                                                           //
//  Jim Fawcett, modified 4/4/2000                           //
///////////////////////////////////////////////////////////////

// disable truncation warnings
#pragma warning( disable : 4786 ) 
#include <vector>
#include <set>
#include <string>
/////////////////////////////////////////////////////////////
//  #include <iterator>                                    //
//  STL containers declare their own simple iterators so,  // 
//  you won't need this unless you are doing fancy stuff   //
/////////////////////////////////////////////////////////////
#include <iostream>
using namespace std;

// binary predicate functor equivalent to less
// - Uses std::string comparison to return true if first
//   argument is less than second.
// - Will sort set into increasing lexicographic order

template <class T> class increase {
  public:
    bool operator()(const T &t1, const T &t2) { return (t1<t2); }
};

// binary predicate functor equivlent to greater
// - Uses std::string comparison to return true if first
//   argument is greater than second.
// - Will sort set into decreasing lexicographic order

template <class T> class decrease {
  public:
    bool operator()(const T &t1, const T &t2) { return (t1>t2); }
};

void main(int argc, char *argv[]) {

  cout << "\nlist of command line arguments in arrival order\n";
  int i;
  for(i=1; i<argc; i++)
    cout << "  " << argv[i] << endl;

//

/////////////////////////////////////////////////////////
// declaring set with less ordering predicate function //
/////////////////////////////////////////////////////////

  set< string, increase<string> > sos;
  for(i=1; i<argc; i++)
    sos.insert(argv[i]);

  cout << "\nlist of command line arguments in "
       << "lexographic order:\n";

  set< string, increase<string> >::iterator si;
  for(si = sos.begin(); si != sos.end(); si++)
    cout << "  " << *si << endl;

////////////////////////////////////////////////////////////
// declaring set with greater ordering predicate function //
////////////////////////////////////////////////////////////

  set< string, decrease<string> > rsos;
  for(i=1; i<argc; i++)
    rsos.insert(argv[i]);

  cout << "\nlist of command line arguments in "
       << "reverse lexographic order:\n";

  set< string, decrease<string> >::iterator rsi;
  for(rsi = rsos.begin(); rsi != rsos.end(); rsi++)
    cout << "  " << *rsi << endl;

  cout << "\n\n";
}