libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_push_pop.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_text_push_pop_timing_test.cpp
  34  * Contains test for finding text.
  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 <io/text_populate.hpp>
  43 #include <native_type/native_priority_queue.hpp>
  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   std::string f_name = "thirty_years_among_the_dead_preproc.txt";
  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<std::string, char> > vec_t;
  64       vec_t a_v(vm);
  65       text_populate(f_name, a_v);
  66
  67       typedef push_pop_test<vec_t::const_iterator> test_t;
  68       vec_t::const_iterator b = a_v.begin();
  69       test_t tst(b, vn, vs, vm);
  70       {
  71         typedef pq_common_types<std::string>::performance_tl pq_tl_t;
  72         pq_tl_t tl;
  73         __gnu_cxx::typelist::apply(tst, tl);
  74       }
  75
  76       {
  77         typedef native_priority_queue<std::string, true> native_pq_t;
  78         tst(native_pq_t());
  79       }
  80
  81       {
  82         typedef native_priority_queue<std::string, false> native_pq_t;
  83         tst(native_pq_t());
  84       }
  85     }
  86   catch(...)
  87     {
  88       std::cerr << "Test failed" << std::endl;
  89       return -1;
  90     }
  91   return 0;
  92 }
  93
  94 void
  95 usage()
  96 {
  97   using namespace std;
  98   cerr << "usage: priority_queue_text_push_pop_timing_test "
  99           "<f_name> <vn> <vs> <vm>" << endl << endl;
 100
 101   cerr << "This test checks the performance of various"
 102     "priority_queue containers using their push method. " << endl;
 103   cerr << "Specifically, it does the following:" << endl;
 104   cerr << "*  Creates a vector of text words " << endl;
 105   cerr << "*  Pushes the elements into the container, then pops until it's empty." << endl;
 106   cerr << "*  Repeats the above test a number of times) "
 107             << endl;
 108
 109   cerr << endl << endl;
 110
 111   cerr << "f_name = file name containing the text words. "
 112     "Each line should contain one word." << endl;
 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 }