update sources to v12.2.4

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

// spreadsort on a mostly sorted array 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/spreadsort.hpp>\r
#include <time.h>\r
#include <stdio.h>\r
#include <stdlib.h>\r
#include <algorithm>\r
#include <vector>\r
#include <string>\r
#include <fstream>\r
#include <sstream>\r
#include <iostream>\r
using namespace boost::sort::spreadsort;\r
\r
#define DATA_TYPE int\r
\r
unsigned\r
get_index(unsigned count)\r
{\r
  unsigned result = unsigned((rand() % (1 << 16))*uint64_t(count)/(1 << 16));\r
  if (result >= count || result < 0)\r
    result = count - 1;\r
  return result;\r
}\r
\r
//Pass in an argument to test std::sort\r
int main(int argc, const char ** argv) {\r
  srand(1);\r
  size_t uCount,uSize=sizeof(DATA_TYPE);\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
  //Sorts the data once, then times sorting of already-sorted data\r
  loopCount += 1;\r
  std::ifstream input("input.txt", std::ios_base::in | std::ios_base::binary);\r
  if (input.fail()) {\r
    printf("input.txt could not be opened\n");\r
    return 1;\r
  }\r
  double total = 0.0;\r
  std::vector<DATA_TYPE> array;\r
  input.seekg (0, std::ios_base::end);\r
    size_t length = input.tellg();\r
  uCount = length/uSize;\r
  input.seekg (0, std::ios_base::beg);\r
  //Conversion to a vector\r
  array.resize(uCount);\r
  unsigned v = 0;\r
  while (input.good() && v < uCount) // EOF or failure stops the reading\r
    input.read(reinterpret_cast<char *>(&(array[v++])), uSize );\r
  //Run multiple loops, if requested\r
  for (unsigned u = 0; u < loopCount; ++u) {\r
    for (unsigned v = 0; v < uCount/10; ++v)\r
      std::swap(array[get_index(uCount)], array[get_index(uCount)]);\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());\r
    else\r
      //integer_sort(&(array[0]), &(array[0]) + uCount);\r
      integer_sort(array.begin(), array.end());\r
    end = clock();\r
    elapsed = static_cast<double>(end - start) ;\r
    std::ofstream ofile;\r
    if (stdSort)\r
      ofile.open("standard_sort_out.txt", std::ios_base::out |\r
                 std::ios_base::binary | std::ios_base::trunc);\r
    else\r
      ofile.open("boost_sort_out.txt", std::ios_base::out |\r
                 std::ios_base::binary | std::ios_base::trunc);\r
    if (ofile.good()) {\r
      for (unsigned v = 0; v < array.size(); ++v) {\r
        ofile.write(reinterpret_cast<char *>(&(array[v])), sizeof(array[v]) );\r
      }\r
      ofile.close();\r
    }\r
    if (u)\r
      total += elapsed;\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