libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_int_push.cc

   1 // -*- C++ -*-
   2
   3 // Copyright (C) 2005, 2006, 2009 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_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_test.hpp>
  42 #include <native_type/native_priority_queue.hpp>
  43 #include <testsuite_rng.h>
  44 #include <iostream>
  45 #include <vector>
  46
  47 void
  48 usage();
  49
  50 int
  51 main(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   try
  59     {
  60       xml_test_performance_formatter fmt("Size", "Average time (sec.)");
  61
  62       typedef std::vector<std::pair<int, char> > vec_t;
  63       vec_t a_v(vm);
  64       twister_rand_gen g;
  65       for (size_t i = 0; i < vm; ++i)
  66         a_v[i] = std::make_pair(static_cast<int>(g.get_unsigned_long()), 0);
  67
  68       typedef push_test<vec_t::const_iterator> test_t;
  69       vec_t::const_iterator b = a_v.begin();
  70       test_t tst(b, vn, vs, vm);
  71       {
  72         typedef pq_common_types<int>::performance_tl pq_tl_t;
  73         pq_tl_t tl;
  74         __gnu_cxx::typelist::apply(tst, tl);
  75       }
  76
  77       {
  78         typedef native_priority_queue<int, true> native_pq_t;
  79         tst(native_pq_t());
  80       }
  81
  82       {
  83         typedef native_priority_queue<int, false> native_pq_t;
  84         tst(native_pq_t());
  85       }
  86     }
  87   catch (...)
  88     {
  89       std::cerr << "Test failed" << std::endl;
  90       return -1;
  91     }
  92   return 0;
  93 }
  94
  95 void
  96 usage()
  97 {
  98   using namespace std;
  99   cerr << "usage: priority_queue_random_int_push_timing_test <vn> <vs> <vm>" <<
 100     endl << endl;
 101
 102   cerr <<
 103     "This test checks the performance of various priority_queue containers "
 104     "using their push method. " << endl;
 105   cerr << "Specifically, it does the following:" << endl;
 106   cerr << "*  Creates a vector of random integers " << endl;
 107   cerr << "*  Pushes the elements into the container" << endl;
 108   cerr << "*  Repeats the above test a number of times "
 109             << endl;
 110
 111   cerr << endl << endl;
 112
 113   cerr << "vn = minimum size of the vector" << endl;
 114   cerr << "vs = step size of the vector" << endl;
 115   cerr << "vm = maximum size of the vector" << endl;
 116 }