-// spreadsort on a mostly sorted array example.
-//
-// Copyright Steven Ross 2009-2014.
-//
-// Distributed under the Boost Software License, Version 1.0.
-// (See accompanying file LICENSE_1_0.txt or copy at
-// http://www.boost.org/LICENSE_1_0.txt)
-
-// See http://www.boost.org/libs/sort for library home page.
-
-#include <boost/sort/spreadsort/spreadsort.hpp>
-#include <time.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <algorithm>
-#include <vector>
-#include <string>
-#include <fstream>
-#include <sstream>
-#include <iostream>
-using namespace boost::sort::spreadsort;
-
-#define DATA_TYPE int
-
-unsigned
-get_index(unsigned count)
-{
- unsigned result = unsigned((rand() % (1 << 16))*uint64_t(count)/(1 << 16));
- if (result >= count || result < 0)
- result = count - 1;
- return result;
-}
-
-//Pass in an argument to test std::sort
-int main(int argc, const char ** argv) {
- srand(1);
- size_t uCount,uSize=sizeof(DATA_TYPE);
- bool stdSort = false;
- unsigned loopCount = 1;
- for (int u = 1; u < argc; ++u) {
- if (std::string(argv[u]) == "-std")
- stdSort = true;
- else
- loopCount = atoi(argv[u]);
- }
- //Sorts the data once, then times sorting of already-sorted data
- loopCount += 1;
- std::ifstream input("input.txt", std::ios_base::in | std::ios_base::binary);
- if (input.fail()) {
- printf("input.txt could not be opened\n");
- return 1;
- }
- double total = 0.0;
- std::vector<DATA_TYPE> array;
- input.seekg (0, std::ios_base::end);
- size_t length = input.tellg();
- uCount = length/uSize;
- input.seekg (0, std::ios_base::beg);
- //Conversion to a vector
- array.resize(uCount);
- unsigned v = 0;
- while (input.good() && v < uCount) // EOF or failure stops the reading
- input.read(reinterpret_cast<char *>(&(array[v++])), uSize );
- //Run multiple loops, if requested
- for (unsigned u = 0; u < loopCount; ++u) {
- for (unsigned v = 0; v < uCount/10; ++v)
- std::swap(array[get_index(uCount)], array[get_index(uCount)]);
- clock_t start, end;
- double elapsed;
- start = clock();
- if (stdSort)
- //std::sort(&(array[0]), &(array[0]) + uCount);
- std::sort(array.begin(), array.end());
- else
- //integer_sort(&(array[0]), &(array[0]) + uCount);
- integer_sort(array.begin(), array.end());
- end = clock();
- elapsed = static_cast<double>(end - start) ;
- std::ofstream ofile;
- if (stdSort)
- ofile.open("standard_sort_out.txt", std::ios_base::out |
- std::ios_base::binary | std::ios_base::trunc);
- else
- ofile.open("boost_sort_out.txt", std::ios_base::out |
- std::ios_base::binary | std::ios_base::trunc);
- if (ofile.good()) {
- for (unsigned v = 0; v < array.size(); ++v) {
- ofile.write(reinterpret_cast<char *>(&(array[v])), sizeof(array[v]) );
- }
- ofile.close();
- }
- if (u)
- total += elapsed;
- }
- if (stdSort)
- printf("std::sort elapsed time %f\n", total / CLOCKS_PER_SEC);
- else
- printf("spreadsort elapsed time %f\n", total / CLOCKS_PER_SEC);
- return 0;
-}
+// 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
projects / ceph.git / blobdiff