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