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_text_modify_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/modify_test.hpp>
42#include <io/text_populate.hpp>
43#include <native_type/native_priority_queue.hpp>
44#include <iostream>
45#include <vector>
46
47void
48usage();
49
50void
51set_test_parameters(bool& b);
52
53int
54main(int argc, char* a_p_argv[])
55{
56  using namespace __gnu_pbds::test;
57
58  std::string f_name = "thirty_years_among_the_dead_preproc.txt";
59  size_t vn = 100;
60  size_t vs = 100;
61  size_t vm = 1100;
62  bool modify_up;
63
64  set_test_parameters(modify_up);
65
66  try
67    {
68      xml_test_performance_formatter fmt("Size", "Average time (sec.)");
69
70      typedef std::vector<std::pair<std::string, char> > vec_t;
71      vec_t a_v(vm);
72      text_populate(f_name, a_v);
73
74      typedef modify_test<vec_t::const_iterator> test_t;
75      vec_t::const_iterator b = a_v.begin();
76      test_t tst(b, vn, vs, vm, modify_up);
77      {
78	typedef pq_common_types<std::string>::performance_tl pq_tl_t;
79	pq_tl_t tl;
80	__gnu_cxx::typelist::apply(tst, tl);
81      }
82
83      {
84	typedef native_priority_queue<std::string, true> native_pq_t;
85	tst(native_pq_t());
86      }
87
88      {
89	typedef native_priority_queue<std::string, false> native_pq_t;
90	tst(native_pq_t());
91      }
92    }
93  catch (...)
94    {
95      std::cerr << "Test failed" << std::endl;
96      return -1;
97    }
98  return 0;
99}
100
101void
102usage()
103{
104  using namespace std;
105  cerr << "usage: priority_queue_text_modify_timing_test <f_name> <vn> <vs> <vm> <modify_up>" <<
106    endl << endl;
107
108  cerr <<
109    "This test checks the performance of various priority_queueiative containers "
110    "using their modify method. " << endl;
111  cerr << "Specifically, it does the following:" << endl;
112  cerr << "*  Creates a vector of text words " << endl;
113  cerr << "*  Pushes the elements into the container" << endl;
114  cerr << "*  Modifies the words in the container. If modify_up == 't', then" << endl;
115  cerr << "*      it modifies them to the largest word. If modify_up == 'f', then" << endl;
116  cerr << "*      it modifies them to the smallest word." << endl;
117  cerr << "*  Repeats the above test a number of times "
118	    << endl;
119
120  cerr << endl << endl;
121
122  cerr << "f_name = file name containing the text words. "
123    "Each line should contain one word." << endl;
124  cerr << "vn = minimum size of the vector" << endl;
125  cerr << "vs = step size of the vector" << endl;
126  cerr << "vm = maximum size of the vector" << endl;
127}
128