blob: 535c8717f541938b10991e1e13b6658dcf8abfb6 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
|
// Copyright (C) 2006-2015 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;
}
|
