3 // Copyright (C) 2005, 2006 Free Software Foundation, Inc.
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
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.
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.
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
31 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
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
43 * @file priority_queue_random_int_push_pop_timing_test.cpp
44 * Contains test for finding random_int.
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_pop_test.hpp>
52 #include <native_type/priority_queue/native_priority_queue.hpp>
53 #include <rng/twister_rand_gen.hpp>
61 main(int argc
, char* a_p_argv
[])
63 using namespace __gnu_pbds::test
;
71 xml_test_performance_formatter
fmt("Size", "Average time (sec.)");
73 typedef std::vector
<std::pair
<int, char> > vector_type
;
77 for (size_t i
= 0; i
< vm
; ++i
)
78 a_v
[i
] = std::make_pair(static_cast<int>(g
.get_unsigned_long()), 0);
79 vector_type::const_iterator b
= a_v
.begin();
81 typedef push_pop_test
<vector_type::const_iterator
> test_type
;
82 test_type
tst(b
, vn
, vs
, vm
);
84 typedef pq_common_types
<int>::performance_tl pq_tl_t
;
86 __gnu_cxx::typelist::apply(tst
, tl
);
90 typedef native_priority_queue
<int, true> native_pq_t
;
95 typedef native_priority_queue
<int, false> native_pq_t
;
101 std::cerr
<< "Test failed" << std::endl
;
110 std::cerr
<< "usage: priority_queue_random_int_push_pop_timing_test <vn> <vs> <vm>" <<
111 std::endl
<< std::endl
;
114 "This test checks the performance of various priority_queue containers "
115 "using their push and pop method. " << std::endl
;
116 std::cerr
<< "Specifically, it does the following:" << std::endl
;
117 std::cerr
<< "* Creates a vector of random integers " << std::endl
;
118 std::cerr
<< "* Pushes the elements into the container" << std::endl
;
119 std::cerr
<< "* Pops the elements from the container" << std::endl
;
120 std::cerr
<< "* Repeats the above test a number of times "
123 std::cerr
<< std::endl
<< std::endl
;
125 std::cerr
<< "vn = minimum size of the vector" << std::endl
;
126 std::cerr
<< "vs = step size of the vector" << std::endl
;
127 std::cerr
<< "vm = maximum size of the vector" << std::endl
;