libstdc++-v3/testsuite/performance/ext/pb_ds/priority_queue_text_pop_mem_usage.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_text_push_pop_timing_test.cpp
  44  * Contains test for finding text.
  45  */
  46
  47 #include <iostream>
  48 #include <vector>
  49 #include <ext/typelist.h>
  50 #include <testsuite_allocator.h>
  51 #include <performance/io/xml_formatter.hpp>
  52 #include <io/verified_cmd_line_input.hpp>
  53 #include <common_type/priority_queue/common_type.hpp>
  54 #include <performance/priority_queue/mem_usage/pop_test.hpp>
  55 #include <io/text_populate.hpp>
  56 #include <native_type/priority_queue/native_priority_queue.hpp>
  57
  58 void
  59 usage();
  60
  61 int
  62 main(int argc, char* a_p_argv[])
  63 {
  64   using namespace __gnu_pbds::test;
  65   std::string f_name = "thirty_years_among_the_dead_preproc.txt";
  66
  67   size_t vn = 200;
  68   size_t vs = 200;
  69   size_t vm = 2100;
  70   try
  71     {
  72       xml_test_performance_formatter fmt("Size", "Memory (bytes)");
  73       typedef __gnu_test::tracker_allocator<char> callocator_type;
  74       typedef __gnu_test::tracker_allocator<char> sallocator_type;
  75       typedef std::basic_string<char, std::char_traits<char>, callocator_type> string_t;
  76
  77       typedef std::vector<std::pair<string_t, char> > vec_t;
  78       vec_t a_v(vm);
  79       text_populate(f_name, a_v);
  80
  81       typedef pop_test<vec_t::const_iterator> test_t;
  82       vec_t::const_iterator b = a_v.begin();
  83       test_t tst(b, vn, vs, vm);
  84       {
  85         typedef pq_common_types<string_t, std::less<string_t>, callocator_type>::performance_tl pq_tl_t;
  86         pq_tl_t tl;
  87         __gnu_cxx::typelist::apply(tst, tl);
  88       }
  89
  90       {
  91         typedef native_priority_queue<string_t, true, std::less<string_t>, sallocator_type> native_pq_t;
  92         tst(native_pq_t());
  93       }
  94
  95       {
  96         typedef native_priority_queue<string_t, false, std::less<string_t>, sallocator_type> native_pq_t;
  97         tst(native_pq_t());
  98       }
  99     }
 100   catch (...)
 101     {
 102       std::cerr << "Test failed" << std::endl;
 103       return -1;
 104     }
 105   return 0;
 106 }
 107
 108 void
 109 usage()
 110 {
 111   using namespace std;
 112   cerr << "usage: priority_queue_text_pop_mem_usage_test <f_name> <vn> <vs> <vm>" <<
 113     endl << endl;
 114
 115   cerr <<
 116     "This test checks the performance of various priority_queueiative containers "
 117     "using their push method. " << endl;
 118   cerr << "Specifically, it does the following:" << endl;
 119   cerr << "*  Creates a vector of text words " << endl;
 120   cerr << "*  Pushes the elements into the container, then pops until it's empty." << endl;
 121
 122   cerr << endl << endl;
 123
 124   cerr << "f_name = file name containing the text words. "
 125     "Each line should contain one word." << endl;
 126   cerr << "vn = minimum size of the vector" << endl;
 127   cerr << "vs = step size of the vector" << endl;
 128   cerr << "vm = maximum size of the vector" << endl;
 129 }