]>
Commit | Line | Data |
---|---|---|
36fed23c | 1 | // -*- C++ -*- |
2 | ||
f1717362 | 3 | // Copyright (C) 2005-2016 Free Software Foundation, Inc. |
36fed23c | 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 | |
6bc9506f | 8 | // Foundation; either version 3, or (at your option) any later |
36fed23c | 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 | |
6bc9506f | 17 | // along with this library; see the file COPYING3. If not see |
18 | // <http://www.gnu.org/licenses/>. | |
36fed23c | 19 | |
36fed23c | 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 | ||
bc2c48ea | 37 | #include <iostream> |
38 | #include <vector> | |
59ae0c9c | 39 | #include <ext/typelist.h> |
bc2c48ea | 40 | #include <testsuite_allocator.h> |
36fed23c | 41 | #include <performance/io/xml_formatter.hpp> |
42 | #include <io/verified_cmd_line_input.hpp> | |
43 | #include <common_type/priority_queue/common_type.hpp> | |
44 | #include <performance/priority_queue/mem_usage/pop_test.hpp> | |
45 | #include <io/text_populate.hpp> | |
2661beb5 | 46 | #include <native_type/native_priority_queue.hpp> |
36fed23c | 47 | |
48 | void | |
49 | usage(); | |
50 | ||
51 | int | |
52 | main(int argc, char* a_p_argv[]) | |
53 | { | |
b34535d7 | 54 | using namespace __gnu_pbds::test; |
36fed23c | 55 | std::string f_name = "thirty_years_among_the_dead_preproc.txt"; |
56 | ||
57 | size_t vn = 200; | |
58 | size_t vs = 200; | |
59 | size_t vm = 2100; | |
60 | try | |
61 | { | |
62 | xml_test_performance_formatter fmt("Size", "Memory (bytes)"); | |
4f4a327e | 63 | typedef __gnu_test::tracker_allocator<char> allocator_type; |
64 | typedef std::char_traits<char> traits_type; | |
65 | typedef std::basic_string<char, traits_type, allocator_type> string_t; | |
66 | typedef std::less<string_t> cmp_type; | |
36fed23c | 67 | |
bc2c48ea | 68 | typedef std::vector<std::pair<string_t, char> > vec_t; |
36fed23c | 69 | vec_t a_v(vm); |
70 | text_populate(f_name, a_v); | |
71 | ||
72 | typedef pop_test<vec_t::const_iterator> test_t; | |
73 | vec_t::const_iterator b = a_v.begin(); | |
74 | test_t tst(b, vn, vs, vm); | |
75 | { | |
4f4a327e | 76 | typedef pq_common_types<string_t, cmp_type, allocator_type>::performance_tl pq_tl_t; |
36fed23c | 77 | pq_tl_t tl; |
59ae0c9c | 78 | __gnu_cxx::typelist::apply(tst, tl); |
36fed23c | 79 | } |
80 | ||
81 | { | |
4f4a327e | 82 | typedef native_priority_queue<string_t, true, cmp_type, |
83 | allocator_type> native_pq_t; | |
ce8b0a77 | 84 | tst(native_pq_t()); |
36fed23c | 85 | } |
86 | ||
87 | { | |
4f4a327e | 88 | typedef native_priority_queue<string_t, false, cmp_type, |
89 | allocator_type> native_pq_t; | |
ce8b0a77 | 90 | tst(native_pq_t()); |
36fed23c | 91 | } |
92 | } | |
93 | catch (...) | |
94 | { | |
95 | std::cerr << "Test failed" << std::endl; | |
96 | return -1; | |
97 | } | |
98 | return 0; | |
99 | } | |
100 | ||
101 | void | |
102 | usage() | |
103 | { | |
104 | using namespace std; | |
105 | cerr << "usage: priority_queue_text_pop_mem_usage_test <f_name> <vn> <vs> <vm>" << | |
106 | endl << endl; | |
107 | ||
108 | cerr << | |
109 | "This test checks the performance of various priority_queueiative containers " | |
110 | "using their push 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, then pops until it's empty." << endl; | |
114 | ||
115 | cerr << endl << endl; | |
116 | ||
117 | cerr << "f_name = file name containing the text words. " | |
118 | "Each line should contain one word." << endl; | |
119 | cerr << "vn = minimum size of the vector" << endl; | |
120 | cerr << "vs = step size of the vector" << endl; | |
121 | cerr << "vm = maximum size of the vector" << endl; | |
122 | } |