-// spreadsort string functor reverse 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/string_sort.hpp>
-#include <time.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <algorithm>
-#include <vector>
-#include <iostream>
-#include <fstream>
-#include <string>
-using std::string;
-using namespace boost::sort::spreadsort;
-
-struct DATA_TYPE {
- string a;
- };
-
-struct greaterthan {
- inline bool operator()(const DATA_TYPE &x, const DATA_TYPE &y) const {
- return x.a > y.a;
- }
-};
-
-struct bracket {
- inline unsigned char operator()(const DATA_TYPE &x, size_t offset) const {
- return x.a[offset];
- }
-};
-
-struct getsize {
- inline size_t operator()(const DATA_TYPE &x) const{ return x.a.size(); }
-};
-
-//Pass in an argument to test std::sort
-int main(int argc, const char ** argv) {
- std::ifstream indata;
- std::ofstream outfile;
- 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]);
- }
- double total = 0.0;
- //Run multiple loops, if requested
- std::vector<DATA_TYPE> array;
- for (unsigned u = 0; u < loopCount; ++u) {
- indata.open("input.txt", std::ios_base::in | std::ios_base::binary);
- if (!indata) {
- printf("input.txt could not be opened\n");
- return 1;
- }
- DATA_TYPE inval;
- indata >> inval.a;
- while (!indata.eof() ) {
- array.push_back(inval);
- //Inserting embedded nulls and empty strings
- if (!(array.size() % 100)) {
- if (inval.a.empty() || !(array.size() % 1000)) {
- inval.a = "";
- array.push_back(inval);
- }
- else {
- inval.a[0] = '\0';
- array.push_back(inval);
- }
- }
- indata >> inval.a;
- }
-
- indata.close();
- clock_t start, end;
- double elapsed;
- start = clock();
- if (stdSort)
- std::sort(array.begin(), array.end(), greaterthan());
- else
- reverse_string_sort(array.begin(), array.end(), bracket(), getsize(),
- greaterthan());
- end = clock();
- elapsed = static_cast<double>(end - start);
- if (stdSort)
- outfile.open("standard_sort_out.txt", std::ios_base::out |
- std::ios_base::binary | std::ios_base::trunc);
- else
- outfile.open("boost_sort_out.txt", std::ios_base::out |
- std::ios_base::binary | std::ios_base::trunc);
- if (outfile.good()) {
- for (unsigned u = 0; u < array.size(); ++u)
- outfile << array[u].a << "\n";
- outfile.close();
- }
- total += elapsed;
- array.clear();
- }
- 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 string functor reverse 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
+struct DATA_TYPE {\r
+ string a;\r
+ };\r
+\r
+struct greaterthan {\r
+ inline bool operator()(const DATA_TYPE &x, const DATA_TYPE &y) const {\r
+ return x.a > y.a;\r
+ }\r
+};\r
+\r
+struct bracket {\r
+ inline unsigned char operator()(const DATA_TYPE &x, size_t offset) const {\r
+ return x.a[offset];\r
+ }\r
+};\r
+\r
+struct getsize {\r
+ inline size_t operator()(const DATA_TYPE &x) const{ return x.a.size(); }\r
+};\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.a;\r
+ while (!indata.eof() ) {\r
+ array.push_back(inval);\r
+ //Inserting embedded nulls and empty strings\r
+ if (!(array.size() % 100)) {\r
+ if (inval.a.empty() || !(array.size() % 1000)) {\r
+ inval.a = "";\r
+ array.push_back(inval);\r
+ }\r
+ else {\r
+ inval.a[0] = '\0';\r
+ array.push_back(inval);\r
+ }\r
+ }\r
+ indata >> inval.a;\r
+ }\r
+ \r
+ indata.close();\r
+ clock_t start, end;\r
+ double elapsed;\r
+ start = clock();\r
+ if (stdSort)\r
+ std::sort(array.begin(), array.end(), greaterthan());\r
+ else\r
+ reverse_string_sort(array.begin(), array.end(), bracket(), getsize(),\r
+ greaterthan());\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].a << "\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
projects / ceph.git / blobdiff