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