Gammon Forum

// disable warnings about long names
#ifdef WIN32
  #pragma warning( disable : 4786)
#endif

#include <string>
#include <vector>
#include <iostream>
#include <functional>
#include <iterator>
#include <algorithm>

using namespace std;

// case-independent (ci) string less_than
// returns true if s1 < s2
struct ci_less : binary_function<string, string, bool>
  {

  // case-independent (ci) compare_less binary function
  struct nocase_compare : public binary_function<unsigned char,unsigned char,bool> 
    {
    bool operator() (const unsigned char& c1, const unsigned char& c2) const 
      { return tolower (c1) < tolower (c2); }
    };

  bool operator() (const string & s1, const string & s2) const
    {
  
    return lexicographical_compare 
          (s1.begin (), s1.end (),   // source range
           s2.begin (), s2.end (),   // dest range
                nocase_compare ());  // comparison
    }
  }; // end of ci_less

void showv (const string s, const vector<string> & v)
  {
  cout << s << endl;
  copy(v.begin(), v.end(), ostream_iterator<string>(cout, " "));
  cout << endl << endl;
  } // end of showv

int main (void)
  {
  // vector of strings
  vector<string> v;

  // make a back insert iterator to safely add to the back of the vector
  back_insert_iterator<vector<string> > i(v);
  
// Insert items into the vector. 
// Strictly speaking, the "++" is not needed, as the
// assignment to the iterator is what advances it.

  *i++ = "The";
  *i++ = "quick";
  *i++ = "brown";
  *i++ = "fox";
  *i++ = "jumped";
  *i++ = "over";
  *i++ = "the";
  *i++ = "lazy";
  *i++ = "dog";

  showv ("initial vector...", v);

  // sort ascending
  sort (v.begin (), v.end ());
  showv ("after sort (ascending)...", v);

  // sort descending by using greater function to compare less
  sort (v.begin (), v.end (), greater<string> ());
  showv ("after sort (descending)...", v);

  // sort case-independent by using our own compare-less
  sort (v.begin (), v.end (), ci_less ());
  showv ("after case-independent sort (ascending)...", v);

  // reverse that by doing a "not" on the result
  sort (v.begin (), v.end (), not2 (ci_less ()));
  showv ("after case-independent sort (descending)...", v);
 
  // shuffle the words
  random_shuffle (v.begin (), v.end ());
  showv ("after shuffle...", v);

  // rotate them
  rotate (v.begin (), v.begin () + 1, v.end ());
  showv ("after rotate 1 to the left...", v);

  // reverse their order
  reverse (v.begin (), v.end ());
  showv ("after reverse...", v);

  // add "(" to the beginning of each one
  transform (v.begin (), v.end (),
             v.begin (),
             bind1st (plus<string> (), "("));

  // add ")" to the end of each one
  transform (v.begin (), v.end (),
             v.begin (),
             bind2nd (plus<string> (), ")"));
  showv ("after transforms...", v);

  return 0;
  } // end of main

  vector<string> v (9);

  v [0] = "The";   
  v [1] = "quick"; 
  v [2] = "brown"; 
  v [3] = "fox";   
  v [4] = "jumped";
  v [5] = "over";  
  v [6] = "the";   
  v [7] = "lazy";  
  v [8] = "dog";   

  vector<string> v;

  v.push_back ("The");   
  v.push_back ("quick"); 
  v.push_back ("brown"); 
  v.push_back ("fox");   
  v.push_back ("jumped");
  v.push_back ("over");  
  v.push_back ("the");   
  v.push_back ("lazy");  
  v.push_back ("dog");   

  // vector of strings
  vector<string> v;

  // initial values
  char * s []  = { "The", "quick", "brown", "fox", "jumped", "over", 
                   "the", "lazy", "dog" };

  // copy into vector
  copy (s, &s [ sizeof s / sizeof s [0] ], back_inserter (v));

  back_insert_iterator<vector<string> > i(v);
  
  *i = "The";
  *i = "quick";
  *i = "brown";
  *i = "fox";
  *i = "jumped";
  *i = "over";
  *i = "the";
  *i = "lazy";
  *i = "dog";

// disable warnings about long names
#ifdef WIN32
  #pragma warning( disable : 4786)
#endif

#include <string>
#include <vector>
#include <iostream>
#include <algorithm>
#include <iterator>
#include <functional>

using namespace std;

#define NUMITEMS(x) (sizeof(x) / sizeof(x[0]))

int main (void)
  {

  // vector of strings
  vector<string> v;

  char * cs [] = { "the", "dog", "and", "the", "cat", "went",
    "to", "the", "shop" };

  // set up vector
  copy (cs, & cs [ NUMITEMS (cs) ], back_inserter (v));

  // remove the word "the"
  remove_if (v.begin (), v.end (), bind2nd (equal_to<string> (), "the"));

  // display results
  copy (v.begin(), v.end(), ostream_iterator<string> (cout, " "));
  cout << endl;

  return 0;
  } // end of main

// disable warnings about long names
#ifdef WIN32
  #pragma warning( disable : 4786)
#endif

#include <string>
#include <vector>
#include <iostream>
#include <algorithm>
#include <iterator>
#include <functional>

using namespace std;

#define NUMITEMS(x) (sizeof(x) / sizeof(x[0]))

int main (void)
  {

  // vector of strings
  vector<string> v;

  char * cs [] = { "the", "dog", "and", "the", "cat", "went",
    "to", "the", "shop" };

  // set up vector
  copy (cs, & cs [ NUMITEMS (cs) ], back_inserter (v));

  // iterator to hold the new end
  vector<string>::iterator i;

  // remove the word "the"
  i = remove_if (v.begin (), v.end (), bind2nd (equal_to<string> (), "the"));

  // adjust vector size
  v.erase (i, v.end ());

  // display results
  copy (v.begin(), v.end(), ostream_iterator<string> (cout, " "));
  cout << endl;

  return 0;
  } // end of main

// disable warnings about long names
#ifdef WIN32
  #pragma warning( disable : 4786)
#endif

#include <string>
#include <vector>
#include <iostream>
#include <algorithm>
#include <iterator>
#include <functional>

using namespace std;

#define NUMITEMS(x) (sizeof(x) / sizeof(x[0]))

int main (void)
  {

  // vector of strings
  vector<string> v;

  char * cs [] = { "the", "dog", "and", "the", "cat", "went",
    "to", "the", "shop" };

  // set up vector
  copy (cs, & cs [ NUMITEMS (cs) ], back_inserter (v));

  // remove the word "the" and adjust the length as well
  v.erase (remove_if (v.begin (), v.end (), bind2nd (equal_to<string> (), "the")),
         v.end ());

  // display results
  copy (v.begin(), v.end(), ostream_iterator<string> (cout, " "));
  cout << endl;

  return 0;
  } // end of main