-// spreadsort key and data 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/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
-struct DATA_TYPE {\r
- int key;\r
- std::string data;\r
- };\r
-//functor example\r
-struct lessthan {\r
- inline bool operator()(const DATA_TYPE &x, const DATA_TYPE &y) const {\r
- return x.key < y.key;\r
- }\r
-};\r
-\r
-struct rightshift {\r
- inline int operator()(const DATA_TYPE &x, const unsigned offset) {\r
- return x.key >> offset;\r
- }\r
-};\r
-\r
-//Pass in an argument to test std::sort\r
-int main(int argc, const char ** argv) {\r
- size_t uSize = sizeof(int);\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
- 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
- input.seekg (0, std::ios_base::end);\r
- size_t length = input.tellg();\r
- double total = 0.0;\r
- std::vector<DATA_TYPE> array;\r
- array.reserve(length/uSize);\r
- unsigned uCount = length/uSize;\r
- //Run multiple loops, if requested\r
- for (unsigned u = 0; u < loopCount; ++u) {\r
- input.seekg (0, std::ios_base::beg);\r
- unsigned v = 0;\r
- while (input.good() && v++ < uCount) { // EOF or failure stops the reading\r
- DATA_TYPE element;\r
- input.read(reinterpret_cast<char *>(&(element.key)), sizeof(element.key));\r
- std::stringstream intstr;\r
- intstr << element.key;\r
- element.data = intstr.str();\r
- array.push_back(element);\r
- } \r
- clock_t start, end;\r
- double elapsed;\r
- start = clock();\r
- if (stdSort)\r
- std::sort(array.begin(), array.end(), lessthan());\r
- else\r
- integer_sort(array.begin(), array.end(), rightshift(), lessthan());\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].key)), \r
- sizeof(array[v].key));\r
- ofile << array[v].data;\r
- }\r
- ofile.close();\r
- }\r
- total += elapsed;\r
- array.clear();\r
- }\r
- input.close();\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
+// spreadsort key and data sorting 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;
+
+struct DATA_TYPE {
+ int key;
+ std::string data;
+ };
+//functor example
+struct lessthan {
+ inline bool operator()(const DATA_TYPE &x, const DATA_TYPE &y) const {
+ return x.key < y.key;
+ }
+};
+
+struct rightshift {
+ inline int operator()(const DATA_TYPE &x, const unsigned offset) {
+ return x.key >> offset;
+ }
+};
+
+//Pass in an argument to test std::sort
+int main(int argc, const char ** argv) {
+ size_t uSize = sizeof(int);
+ 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]);
+ }
+ 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;
+ }
+ input.seekg (0, std::ios_base::end);
+ size_t length = input.tellg();
+ double total = 0.0;
+ std::vector<DATA_TYPE> array;
+ array.reserve(length/uSize);
+ unsigned uCount = length/uSize;
+ //Run multiple loops, if requested
+ for (unsigned u = 0; u < loopCount; ++u) {
+ input.seekg (0, std::ios_base::beg);
+ unsigned v = 0;
+ while (input.good() && v++ < uCount) { // EOF or failure stops the reading
+ DATA_TYPE element;
+ input.read(reinterpret_cast<char *>(&(element.key)), sizeof(element.key));
+ std::stringstream intstr;
+ intstr << element.key;
+ element.data = intstr.str();
+ array.push_back(element);
+ }
+ clock_t start, end;
+ double elapsed;
+ start = clock();
+ if (stdSort)
+ std::sort(array.begin(), array.end(), lessthan());
+ else
+ integer_sort(array.begin(), array.end(), rightshift(), lessthan());
+ 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].key)),
+ sizeof(array[v].key));
+ ofile << array[v].data;
+ }
+ ofile.close();
+ }
+ total += elapsed;
+ array.clear();
+ }
+ input.close();
+ 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;
+}
projects / ceph.git / blobdiff