update sources to v12.2.4

[ceph.git] / ceph / src / boost / libs / sort / example / reversestringsample.cpp

// spreadsort reverse string sorting example.\r
//\r
//  Copyright Steven Ross 2009-2014.\r
//\r
// Distributed under the Boost Software License, Version 1.0.\r
//    (See accompanying file LICENSE_1_0.txt or copy at\r
//          http://www.boost.org/LICENSE_1_0.txt)\r
\r
//  See http://www.boost.org/libs/sort for library home page.\r
\r
#include <boost/sort/spreadsort/string_sort.hpp>\r
#include <time.h>\r
#include <stdio.h>\r
#include <stdlib.h>\r
#include <algorithm>\r
#include <vector>\r
#include <iostream>\r
#include <fstream>\r
#include <string>\r
using std::string;\r
using namespace boost::sort::spreadsort;\r
\r
#define DATA_TYPE string\r
\r
//Pass in an argument to test std::sort\r
int main(int argc, const char ** argv) {\r
  std::ifstream indata;\r
  std::ofstream outfile;\r
  bool stdSort = false;\r
  unsigned loopCount = 1;\r
  for (int u = 1; u < argc; ++u) {\r
    if (std::string(argv[u]) == "-std")\r
      stdSort = true;\r
    else\r
      loopCount = atoi(argv[u]);\r
  }\r
  double total = 0.0;\r
  //Run multiple loops, if requested\r
  std::vector<DATA_TYPE> array;\r
  for (unsigned u = 0; u < loopCount; ++u) {\r
    indata.open("input.txt", std::ios_base::in | std::ios_base::binary);  \r
    if (!indata) {\r
      printf("input.txt could not be opened\n");\r
      return 1;\r
    }\r
    DATA_TYPE inval;\r
    indata >> inval;\r
    while (!indata.eof() ) {\r
      //testing substrings\r
      if (!(array.size() % 2))\r
        inval = "prefix" + inval;\r
      else\r
        inval += "suffix";\r
      array.push_back(inval);\r
      //Inserting embedded nulls and empty strings\r
      if (!(array.size() % 100)) {\r
        if (inval.empty() || !(array.size() % 1000))\r
          array.push_back("");\r
        else {\r
          inval[0] = '\0';\r
          array.push_back(inval);\r
        }\r
      }\r
      indata >> inval;\r
    }\r
      \r
    indata.close();\r
    clock_t start, end;\r
    double elapsed;\r
    start = clock();\r
    if (stdSort)\r
      //std::sort(&(array[0]), &(array[0]) + uCount);\r
      std::sort(array.begin(), array.end(), std::greater<string>());\r
    else\r
      //string_sort(&(array[0]), &(array[0]) + uCount);\r
      reverse_string_sort(array.begin(), array.end(), std::greater<string>());\r
    end = clock();\r
    elapsed = static_cast<double>(end - start);\r
    if (stdSort)\r
      outfile.open("standard_sort_out.txt", std::ios_base::out |\r
                   std::ios_base::binary | std::ios_base::trunc);\r
    else\r
      outfile.open("boost_sort_out.txt", std::ios_base::out |\r
                   std::ios_base::binary | std::ios_base::trunc);\r
    if (outfile.good()) {\r
      for (unsigned u = 0; u < array.size(); ++u)\r
        outfile << array[u] << "\n";\r
      outfile.close();\r
    }\r
    total += elapsed;\r
    array.clear();\r
  }\r
  if (stdSort)\r
    printf("std::sort elapsed time %f\n", total / CLOCKS_PER_SEC);\r
  else\r
    printf("spreadsort elapsed time %f\n", total / CLOCKS_PER_SEC);\r
  return 0;\r
}\r