1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
|
// -*- C++ -*-
// Copyright (C) 2005-2018 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the terms
// of the GNU General Public License as published by the Free Software
// Foundation; either version 3, or (at your option) any later
// version.
// This library is distributed in the hope that it will be useful, but
// WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// General Public License for more details.
// You should have received a copy of the GNU General Public License
// along with this library; see the file COPYING3. If not see
// <http://www.gnu.org/licenses/>.
// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
// Permission to use, copy, modify, sell, and distribute this software
// is hereby granted without fee, provided that the above copyright
// notice appears in all copies, and that both that copyright notice
// and this permission notice appear in supporting documentation. None
// of the above authors, nor IBM Haifa Research Laboratories, make any
// representation about the suitability of this software for any
// purpose. It is provided "as is" without express or implied
// warranty.
/**
* @file text_find_timing_test.cpp
* Contains test for finding text.
*/
#include <ext/typelist.h>
#include <performance/io/xml_formatter.hpp>
#include <io/verified_cmd_line_input.hpp>
#include <common_type/assoc/common_type.hpp>
#include <performance/assoc/timing/find_test.hpp>
#include <io/text_populate.hpp>
#include <hash_fn/string_hash_fn.hpp>
#include <native_type/native_hash_map.hpp>
#include <native_type/native_map.hpp>
#include <iostream>
#include <vector>
void
usage();
int
main(int argc, char* a_p_argv[])
{
using namespace __gnu_pbds::test;
std::string f_name = "thirty_years_among_the_dead_preproc.txt";
size_t vn = 200;
size_t vs = 200;
size_t vm = 2100;
try
{
xml_test_performance_formatter fmt("Size", "Average time (sec.)");
typedef std::vector<std::pair<std::string, char> > vec_t;
vec_t a_v(vm);
text_populate(f_name, a_v);
typedef find_test<vec_t::const_iterator, false> test_t;
vec_t::const_iterator b = a_v.begin();
test_t tst(b, b, vn, vs, vm, vn, vs, vm);
{
typedef trie_common_types<std::string, char>::performance_tl pat_trie_tl_t;
typedef tree_common_types<std::string, char>::performance_tl tree_tl_t;
typedef hash_common_types<std::string, char, string_hash_fn>::performance_tl hash_tl_t;
typedef __gnu_cxx::typelist::append<pat_trie_tl_t, __gnu_cxx::typelist::append<hash_tl_t, tree_tl_t>::type>::type tl_t;
tl_t tl;
__gnu_cxx::typelist::apply(tst, tl);
}
{
typedef native_map<std::string, char> native_map_t;
tst(native_map_t());
#ifdef PB_DS_USE_TR1
typedef native_hash_map<std::string, char, 8, string_hash_fn> native_hash_map_t;
tst(native_hash_map_t());
typedef
native_hash_map<
std::string,
char,
8,
string_hash_fn,
std::equal_to<
std::string>,
std::less<
std::string>,
std::allocator<
char>,
true>
sth_native_hash_map_t;
tst(sth_native_hash_map_t());
#endif
}
}
catch(...)
{
std::cerr << "Test failed" << std::endl;
return -1;
}
return 0;
}
void
usage()
{
using namespace std;
cerr << "usage: text_find_timing_test <f_name> <vn> <vs> <vm>" <<
endl << endl;
cerr <<
"This test checks the performance of various associative containers "
"using their find method. " << endl;
cerr << "Specifically, it does the following:" << endl;
cerr << "* Creates a vector of text words " << endl;
cerr << "* Inserts the elements into the container" << endl;
cerr << "* Performs a sequence of find operations. At each iteration, "
"it finds, for each word in the vector, its entry in the "
"container, using the find method" << endl;
cerr << "* Repeats the above test a number of times) "
<< endl;
cerr << endl << endl;
cerr << "f_name = file name containing the text words. "
"Each line should contain one word." << endl;
cerr << "vn = minimum size of the vector" << endl;
cerr << "vs = step size of the vector" << endl;
cerr << "vm = maximum size of the vector" << endl;
}
|
