]>
Commit | Line | Data |
---|---|---|
4569a895 AT |
1 | // -*- C++ -*- |
2 | ||
a945c346 | 3 | // Copyright (C) 2005-2024 Free Software Foundation, Inc. |
4569a895 AT |
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 | |
748086b7 | 8 | // Foundation; either version 3, or (at your option) any later |
4569a895 AT |
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 | |
748086b7 JJ |
17 | // along with this library; see the file COPYING3. If not see |
18 | // <http://www.gnu.org/licenses/>. | |
4569a895 | 19 | |
4569a895 AT |
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 | ||
171af358 JW |
32 | // { dg-additional-files "thirty_years_among_the_dead_preproc.txt" } |
33 | ||
4569a895 AT |
34 | /** |
35 | * @file text_find_timing_test.cpp | |
36 | * Contains test for finding text. | |
37 | */ | |
38 | ||
d7f245b1 | 39 | #include <ext/typelist.h> |
4569a895 AT |
40 | #include <performance/io/xml_formatter.hpp> |
41 | #include <io/verified_cmd_line_input.hpp> | |
42 | #include <common_type/assoc/common_type.hpp> | |
43 | #include <performance/assoc/timing/find_test.hpp> | |
44 | #include <io/text_populate.hpp> | |
4569a895 | 45 | #include <hash_fn/string_hash_fn.hpp> |
2e3f9c21 BK |
46 | #include <native_type/native_hash_map.hpp> |
47 | #include <native_type/native_map.hpp> | |
4569a895 AT |
48 | #include <iostream> |
49 | #include <vector> | |
50 | ||
51 | void | |
52 | usage(); | |
53 | ||
54 | int | |
55 | main(int argc, char* a_p_argv[]) | |
56 | { | |
5e11f978 | 57 | using namespace __gnu_pbds::test; |
4569a895 AT |
58 | std::string f_name = "thirty_years_among_the_dead_preproc.txt"; |
59 | size_t vn = 200; | |
60 | size_t vs = 200; | |
61 | size_t vm = 2100; | |
62 | ||
63 | try | |
64 | { | |
65 | xml_test_performance_formatter fmt("Size", "Average time (sec.)"); | |
66 | typedef std::vector<std::pair<std::string, char> > vec_t; | |
67 | ||
68 | vec_t a_v(vm); | |
69 | text_populate(f_name, a_v); | |
70 | typedef find_test<vec_t::const_iterator, false> test_t; | |
71 | vec_t::const_iterator b = a_v.begin(); | |
72 | test_t tst(b, b, vn, vs, vm, vn, vs, vm); | |
73 | { | |
74 | typedef trie_common_types<std::string, char>::performance_tl pat_trie_tl_t; | |
75 | ||
76 | typedef tree_common_types<std::string, char>::performance_tl tree_tl_t; | |
77 | ||
78 | typedef hash_common_types<std::string, char, string_hash_fn>::performance_tl hash_tl_t; | |
79 | ||
d7f245b1 | 80 | typedef __gnu_cxx::typelist::append<pat_trie_tl_t, __gnu_cxx::typelist::append<hash_tl_t, tree_tl_t>::type>::type tl_t; |
4569a895 AT |
81 | |
82 | tl_t tl; | |
d7f245b1 | 83 | __gnu_cxx::typelist::apply(tst, tl); |
4569a895 AT |
84 | } |
85 | ||
86 | { | |
87 | typedef native_map<std::string, char> native_map_t; | |
3441f106 | 88 | tst(native_map_t()); |
4569a895 | 89 | |
d7f245b1 | 90 | #ifdef PB_DS_USE_TR1 |
4569a895 | 91 | typedef native_hash_map<std::string, char, 8, string_hash_fn> native_hash_map_t; |
3441f106 | 92 | tst(native_hash_map_t()); |
4569a895 | 93 | |
4569a895 AT |
94 | typedef |
95 | native_hash_map< | |
96 | std::string, | |
97 | char, | |
98 | 8, | |
99 | string_hash_fn, | |
100 | std::equal_to< | |
101 | std::string>, | |
102 | std::less< | |
103 | std::string>, | |
104 | std::allocator< | |
105 | char>, | |
106 | true> | |
107 | sth_native_hash_map_t; | |
108 | ||
3441f106 | 109 | tst(sth_native_hash_map_t()); |
d7f245b1 | 110 | #endif |
4569a895 AT |
111 | } |
112 | } | |
113 | catch(...) | |
114 | { | |
115 | std::cerr << "Test failed" << std::endl; | |
116 | return -1; | |
117 | } | |
118 | return 0; | |
119 | } | |
120 | ||
121 | void | |
122 | usage() | |
123 | { | |
124 | using namespace std; | |
125 | cerr << "usage: text_find_timing_test <f_name> <vn> <vs> <vm>" << | |
126 | endl << endl; | |
127 | ||
128 | cerr << | |
129 | "This test checks the performance of various associative containers " | |
130 | "using their find method. " << endl; | |
131 | cerr << "Specifically, it does the following:" << endl; | |
132 | cerr << "* Creates a vector of text words " << endl; | |
133 | cerr << "* Inserts the elements into the container" << endl; | |
134 | cerr << "* Performs a sequence of find operations. At each iteration, " | |
135 | "it finds, for each word in the vector, its entry in the " | |
136 | "container, using the find method" << endl; | |
137 | cerr << "* Repeats the above test a number of times) " | |
138 | << endl; | |
139 | ||
140 | cerr << endl << endl; | |
141 | ||
142 | cerr << "f_name = file name containing the text words. " | |
143 | "Each line should contain one word." << endl; | |
144 | cerr << "vn = minimum size of the vector" << endl; | |
145 | cerr << "vs = step size of the vector" << endl; | |
146 | cerr << "vm = maximum size of the vector" << endl; | |
147 | } |