#include <iostream>
#include <vector>
#include <deque>
#include <algorithm>

using namespace std;

//------------------------------------------
// Utility methods (from empty.cc)
//------------------------------------------
template <class T>
void dumpContainer(const T c) {
  for (auto el : c) {
    cout << el << ' ';
  }
  cout << endl;
}

template <class T>
void reset(T &a, const T &b) {
  a = b;
}

//---------------------------------------------------------
// apply sorting-related methods to container class
//---------------------------------------------------------
template <class T>
void process(T &c) {
  cout << "Original container contents:" << endl;
  dumpContainer(c);

  //--------------------------
  // is_sorted() algorithm
  // (Relies on "<" operator)
  //--------------------------
  cout << "Container is "
       << (is_sorted(c.begin(), c.end()) ? "" : "not")
       << " sorted "
       << endl;

  //-------------------------
  // sort() algorithm
  //-------------------------
  cout << "Sorting..." << endl;
  sort(c.begin(), c.end());
  dumpContainer(c);
  cout << "Container is "
       << (is_sorted(c.begin(), c.end()) ? "" : "not ")
       << "sorted"
       << endl;
}

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

  //----------------------------------------------
  // Establish containers for sorting algorithms,
  // and then sort them
  //----------------------------------------------
  vector<string> stringVec = {"one", "two", "three", "four"};
  deque<int> intDeque = {4, 1, 3, 2};

  cout << "Sorting a vector<string>:" << endl;
  process(stringVec);

  cout << endl << "Sortings a deque<int>:" << endl;
  process(intDeque);

  //-------------------------------------------------------------------
  // Most algorithms can be applied to slices of sequential containers.
  // Here we use find().
  //-------------------------------------------------------------------
  auto beginIt = stringVec.begin();
  auto endIt = --(stringVec.end());
  cout << endl << "find() on a slice of a vector<string>: ";
  dumpContainer(stringVec);
  cout << "beginIt refers to " << *beginIt << endl << "endIt refers to " << *endIt << endl;

  cout << "Looking for 'one': ";
  auto foundIt = find(beginIt, endIt, "one");
  if ( foundIt != endIt ) 
    cout << "Found '" << *foundIt << "'" << endl;
  else
    cout << "Didn't find 'one'" << endl;

  cout << "Looing for 'two': ";
  foundIt = find(beginIt, endIt, "two");
  if ( foundIt != endIt ) 
    cout << "Found " << *foundIt << endl;
  else 
    cout << "Didn't find two" << endl;
  
  return 0;
}