X-Git-Url: https://oss.titaniummirror.com/gitweb?a=blobdiff_plain;f=libstdc%2B%2B-v3%2Ftestsuite%2Fperformance%2F25_algorithms%2Fnth_element_worst_case.cc;fp=libstdc%2B%2B-v3%2Ftestsuite%2Fperformance%2F25_algorithms%2Fnth_element_worst_case.cc;h=a405f9ea9e9b896a8ad89411ba1d1cbdd33ef6ae;hb=6fed43773c9b0ce596dca5686f37ac3fc0fa11c0;hp=0000000000000000000000000000000000000000;hpb=27b11d56b743098deb193d510b337ba22dc52e5c;p=msp430-gcc.git

diff --git a/libstdc++-v3/testsuite/performance/25_algorithms/nth_element_worst_case.cc b/libstdc++-v3/testsuite/performance/25_algorithms/nth_element_worst_case.cc
new file mode 100644
index 00000000..a405f9ea
--- /dev/null
+++ b/libstdc++-v3/testsuite/performance/25_algorithms/nth_element_worst_case.cc
@@ -0,0 +1,53 @@
+// Copyright (C) 2006, 2009 Free Software Foundation, Inc.
+//
+// This file is part of the GNU ISO C++ Library.  This library is free
+// software; you can redistribute it and/or modify it under the
+// terms of the GNU General Public License as published by the
+// Free Software Foundation; either version 3, or (at your option)
+// any later version.
+
+// This library is distributed in the hope that it will be useful,
+// but WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+// GNU General Public License for more details.
+
+// You should have received a copy of the GNU General Public License along
+// with this library; see the file COPYING3.  If not see
+// <http://www.gnu.org/licenses/>.
+
+
+#include <vector>
+#include <algorithm>
+#include <testsuite_performance.h>
+
+int main()
+{
+  using namespace __gnu_test;
+
+  time_counter time;
+  resource_counter resource;
+
+  const int max_size = 8192;
+
+  std::vector<int> v[max_size];
+
+  for (int i = 0; i < max_size; ++i)
+    {
+      for (int j = 0; j < i; j += 4)
+	{
+	  v[i].push_back(j / 2);
+	  v[i].push_back((i - 2) - (j / 2));
+	}
+
+      for (int j = 1; j < i; j += 2)
+	v[i].push_back(j);
+    }
+
+  start_counters(time, resource);
+  for (int i = 0; i < max_size; ++i)
+    std::nth_element(v[i].begin(), v[i].begin() + i, v[i].end());
+  stop_counters(time, resource);
+  report_performance(__FILE__, "", time, resource);
+
+  return 0;
+}