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