2014-10-23 François Dumont <fdumont@gcc.gnu.org>
[official-gcc.git] / libstdc++-v3 / testsuite / 25_algorithms / make_heap / complexity.cc
blob97c1df343f2c07b5a68986175716252c5f7a1548
1 // Copyright (C) 2014 Free Software Foundation, Inc.
2 //
3 // This file is part of the GNU ISO C++ Library. This library is free
4 // software; you can redistribute it and/or modify it under the
5 // terms of the GNU General Public License as published by the
6 // Free Software Foundation; either version 3, or (at your option)
7 // any later version.
9 // This library is distributed in the hope that it will be useful,
10 // but WITHOUT ANY WARRANTY; without even the implied warranty of
11 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 // GNU General Public License for more details.
14 // You should have received a copy of the GNU General Public License along
15 // with this library; see the file COPYING3. If not see
16 // <http://www.gnu.org/licenses/>.
18 // { dg-options "-std=gnu++11" }
20 #include <random>
21 #include <vector>
22 #include <algorithm>
24 #include <testsuite_counter_type.h>
25 #include <testsuite_hooks.h>
27 void test01()
29 bool test __attribute__((unused)) = true;
31 using __gnu_test::counter_type;
32 const std::size_t nb_values = 1000;
34 std::random_device dev;
35 std::uniform_int_distribution<int> dist;
36 std::vector<counter_type> values;
37 values.reserve(nb_values);
38 for (std::size_t i = 0; i != nb_values; ++i)
39 values.push_back(dist(dev));
41 counter_type::reset();
43 std::make_heap(values.begin(), values.end());
45 VERIFY( counter_type::less_compare_count <= 3.0 * nb_values );
48 int main()
50 test01();
51 return 0;