]> git.ipfire.org Git - thirdparty/gcc.git/blob - libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_random_int_push_timing.cc
*: Change namespace pb_ds to __gnu_pbds.
[thirdparty/gcc.git] / libstdc++-v3 / testsuite / performance / ext / pb_ds / priority_queue_random_int_push_timing.cc
1 // -*- C++ -*-
2
3 // Copyright (C) 2005, 2006 Free Software Foundation, Inc.
4 //
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the terms
7 // of the GNU General Public License as published by the Free Software
8 // Foundation; either version 2, or (at your option) any later
9 // version.
10
11 // This library is distributed in the hope that it will be useful, but
12 // WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 // General Public License for more details.
15
16 // You should have received a copy of the GNU General Public License
17 // along with this library; see the file COPYING. If not, write to
18 // the Free Software Foundation, 59 Temple Place - Suite 330, Boston,
19 // MA 02111-1307, USA.
20
21 // As a special exception, you may use this file as part of a free
22 // software library without restriction. Specifically, if other files
23 // instantiate templates or use macros or inline functions from this
24 // file, or you compile this file and link it with other files to
25 // produce an executable, this file does not by itself cause the
26 // resulting executable to be covered by the GNU General Public
27 // License. This exception does not however invalidate any other
28 // reasons why the executable file might be covered by the GNU General
29 // Public License.
30
31 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
32
33 // Permission to use, copy, modify, sell, and distribute this software
34 // is hereby granted without fee, provided that the above copyright
35 // notice appears in all copies, and that both that copyright notice
36 // and this permission notice appear in supporting documentation. None
37 // of the above authors, nor IBM Haifa Research Laboratories, make any
38 // representation about the suitability of this software for any
39 // purpose. It is provided "as is" without express or implied
40 // warranty.
41
42 /**
43 * @file priority_queue_random_int_push_timing_test.cpp
44 * Contains test for finding random_int.
45 */
46
47 #include <ext/typelist.h>
48 #include <performance/io/xml_formatter.hpp>
49 #include <io/verified_cmd_line_input.hpp>
50 #include <common_type/priority_queue/common_type.hpp>
51 #include <performance/priority_queue/timing/push_test.hpp>
52 #include <native_type/priority_queue/native_priority_queue.hpp>
53 #include <rng/twister_rand_gen.hpp>
54 #include <iostream>
55 #include <vector>
56
57 void
58 usage();
59
60 int
61 main(int argc, char* a_p_argv[])
62 {
63 using namespace __gnu_pbds::test;
64
65 size_t vn = 200;
66 size_t vs = 200;
67 size_t vm = 2100;
68 try
69 {
70 xml_test_performance_formatter fmt("Size", "Average time (sec.)");
71
72 typedef std::vector<std::pair<int, char> > vec_t;
73 vec_t a_v(vm);
74 twister_rand_gen g;
75 for (size_t i = 0; i < vm; ++i)
76 a_v[i] = std::make_pair(static_cast<int>(g.get_unsigned_long()), 0);
77
78 typedef push_test<vec_t::const_iterator> test_t;
79 vec_t::const_iterator b = a_v.begin();
80 test_t tst(b, vn, vs, vm);
81 {
82 typedef pq_common_types<int>::performance_tl pq_tl_t;
83 pq_tl_t tl;
84 __gnu_cxx::typelist::apply(tst, tl);
85 }
86
87 {
88 typedef native_priority_queue<int, true> native_pq_t;
89 tst(native_pq_t());
90 }
91
92 {
93 typedef native_priority_queue<int, false> native_pq_t;
94 tst(native_pq_t());
95 }
96 }
97 catch (...)
98 {
99 std::cerr << "Test failed" << std::endl;
100 return -1;
101 }
102 return 0;
103 }
104
105 void
106 usage()
107 {
108 using namespace std;
109 cerr << "usage: priority_queue_random_int_push_timing_test <vn> <vs> <vm>" <<
110 endl << endl;
111
112 cerr <<
113 "This test checks the performance of various priority_queue containers "
114 "using their push method. " << endl;
115 cerr << "Specifically, it does the following:" << endl;
116 cerr << "* Creates a vector of random integers " << endl;
117 cerr << "* Pushes the elements into the container" << endl;
118 cerr << "* Repeats the above test a number of times "
119 << endl;
120
121 cerr << endl << endl;
122
123 cerr << "vn = minimum size of the vector" << endl;
124 cerr << "vs = step size of the vector" << endl;
125 cerr << "vm = maximum size of the vector" << endl;
126 }