1// -*- C++ -*-
2
3// Copyright (C) 2005-2015 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 3, 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 COPYING3.  If not see
18// <http://www.gnu.org/licenses/>.
19
20
21// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
22
23// Permission to use, copy, modify, sell, and distribute this software
24// is hereby granted without fee, provided that the above copyright
25// notice appears in all copies, and that both that copyright notice
26// and this permission notice appear in supporting documentation. None
27// of the above authors, nor IBM Haifa Research Laboratories, make any
28// representation about the suitability of this software for any
29// purpose. It is provided "as is" without express or implied
30// warranty.
31
32/**
33 * @file priority_queue_random_int_push_pop_timing_test.cpp
34 * Contains test for finding random_int.
35 */
36
37#include <ext/typelist.h>
38#include <performance/io/xml_formatter.hpp>
39#include <io/verified_cmd_line_input.hpp>
40#include <common_type/priority_queue/common_type.hpp>
41#include <performance/priority_queue/timing/push_pop_test.hpp>
42#include <native_type/native_priority_queue.hpp>
43#include <testsuite_rng.h>
44#include <iostream>
45#include <vector>
46
47void
48usage();
49
50int
51main(int argc, char* a_p_argv[])
52{
53  using namespace __gnu_pbds::test;
54
55  size_t vn = 200;
56  size_t vs = 200;
57  size_t vm = 2100;
58
59  try
60    {
61      xml_test_performance_formatter fmt("Size", "Average time (sec.)");
62
63      typedef std::vector<std::pair<int, char> > vector_type;
64      vector_type a_v(vm);
65      twister_rand_gen g;
66
67      for (size_t i = 0; i < vm; ++i)
68	a_v[i] = std::make_pair(static_cast<int>(g.get_unsigned_long()), 0);
69      vector_type::const_iterator b = a_v.begin();
70
71      typedef push_pop_test<vector_type::const_iterator> test_type;
72      test_type tst(b, vn, vs, vm);
73      {
74	typedef pq_common_types<int>::performance_tl pq_tl_t;
75	pq_tl_t tl;
76	__gnu_cxx::typelist::apply(tst, tl);
77      }
78
79      {
80	typedef native_priority_queue<int, true> native_pq_t;
81	tst(native_pq_t());
82      }
83
84      {
85	typedef native_priority_queue<int, false> native_pq_t;
86	tst(native_pq_t());
87      }
88    }
89  catch(...)
90    {
91      std::cerr << "Test failed" << std::endl;
92      return -1;
93    }
94  return 0;
95}
96
97void
98usage()
99{
100  std::cerr << "usage: priority_queue_random_int_push_pop_timing_test <vn> <vs> <vm>" <<
101    std::endl << std::endl;
102
103  std::cerr <<
104    "This test checks the performance of various priority_queue containers "
105    "using their push and pop method. " << std::endl;
106  std::cerr << "Specifically, it does the following:" << std::endl;
107  std::cerr << "*  Creates a vector of random integers " << std::endl;
108  std::cerr << "*  Pushes the elements into the container" << std::endl;
109  std::cerr << "*  Pops the elements from the container" << std::endl;
110  std::cerr << "*  Repeats the above test a number of times "
111	    << std::endl;
112
113  std::cerr << std::endl << std::endl;
114
115  std::cerr << "vn = minimum size of the vector" << std::endl;
116  std::cerr << "vs = step size of the vector" << std::endl;
117  std::cerr << "vm = maximum size of the vector" << std::endl;
118}
119