]>
Commit | Line | Data |
---|---|---|
1 | // -*- C++ -*- | |
2 | ||
3 | // Copyright (C) 2005, 2006, 2009 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 3, 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 COPYING3. If not see | |
18 | // <http://www.gnu.org/licenses/>. | |
19 | ||
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 random_int_subscript_find_timing_test.cpp | |
34 | * Contains test for subscripting random integers. | |
35 | */ | |
36 | ||
37 | #include <ext/typelist.h> | |
38 | #include <performance/io/xml_formatter.hpp> | |
39 | #include <native_type/native_hash_map.hpp> | |
40 | #include <native_type/native_map.hpp> | |
41 | #include <io/verified_cmd_line_input.hpp> | |
42 | #include <testsuite_rng.h> | |
43 | #include <common_type/assoc/common_type.hpp> | |
44 | #include <performance/assoc/timing/subscript_find_test.hpp> | |
45 | #include <iostream> | |
46 | #include <vector> | |
47 | ||
48 | void | |
49 | usage(); | |
50 | ||
51 | int | |
52 | main(int argc, char* a_p_argv[]) | |
53 | { | |
54 | using namespace __gnu_pbds::test; | |
55 | ||
56 | size_t vn = 200; | |
57 | size_t vs = 200; | |
58 | size_t vm = 2100; | |
59 | ||
60 | try | |
61 | { | |
62 | xml_test_performance_formatter fmt("Size", "Average time (sec.)"); | |
63 | ||
64 | typedef std::vector<std::pair<int, size_t> > vec_t; | |
65 | vec_t a_v(vm); | |
66 | twister_rand_gen g; | |
67 | for (size_t i = 0; i < vm; ++i) | |
68 | a_v[i] = std::make_pair(static_cast<int>(g.get_unsigned_long()), 0); | |
69 | vec_t::const_iterator b = a_v.begin(); | |
70 | ||
71 | typedef subscript_find_test<vec_t::const_iterator> test_t; | |
72 | test_t tst(b, b, vn, vs, vm, vn, vs, vm); | |
73 | { | |
74 | typedef hash_common_types<int, size_t>::performance_tl tl_t; | |
75 | tl_t tl; | |
76 | __gnu_cxx::typelist::apply(tst, tl); | |
77 | } | |
78 | ||
79 | { | |
80 | typedef tree_common_types<int, size_t>::performance_tl tl_t; | |
81 | tl_t tl; | |
82 | __gnu_cxx::typelist::apply(tst, tl); | |
83 | } | |
84 | ||
85 | { | |
86 | typedef native_hash_map<int, size_t> native_t; | |
87 | tst(native_t()); | |
88 | } | |
89 | ||
90 | { | |
91 | typedef native_map< int, size_t> native_t; | |
92 | tst(native_t()); | |
93 | } | |
94 | } | |
95 | catch (...) | |
96 | { | |
97 | std::cerr << "Test failed" << std::endl; | |
98 | return -1; | |
99 | } | |
100 | return 0; | |
101 | } | |
102 | ||
103 | void | |
104 | usage() | |
105 | { | |
106 | using namespace std; | |
107 | cerr << "usage: hash_random_int_subscript_find_timing_test <vn> <vs> <vm>" << | |
108 | endl << endl; | |
109 | ||
110 | cerr << | |
111 | "This test checks the performance of various associative containers " | |
112 | "using their find method. " << endl; | |
113 | cerr << "Specifically, it does the following:" << endl; | |
114 | cerr << "* Creates a vector of random integers " << endl; | |
115 | cerr << "* Inserts the elements into the container" << endl; | |
116 | cerr << "* Performs a sequence of find operations. At each iteration, " | |
117 | "it finds, for each integer in the vector, its entry in the " | |
118 | "container, using the subscript operator"; | |
119 | cerr << "* Repeats the above test a number of times" << endl; | |
120 | ||
121 | cerr << endl << endl; | |
122 | ||
123 | cerr << "vn = minimum size of the vector" << endl; | |
124 | cerr << "vs = step size of the vector" << endl; | |
125 | cerr << "vm = maximum size of the vector" << endl; | |
126 | } |