]>
Commit | Line | Data |
---|---|---|
4569a895 AT |
1 | // -*- C++ -*- |
2 | ||
3 | // Copyright (C) 2005, 2006 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 2, 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 COPYING. If not, write to | |
18 | // the Free Software Foundation, 59 Temple Place - Suite 330, Boston, | |
19 | // MA 02111-1307, USA. | |
20 | ||
21 | // As a special exception, you may use this file as part of a free | |
22 | // software library without restriction. Specifically, if other files | |
23 | // instantiate templates or use macros or inline functions from this | |
24 | // file, or you compile this file and link it with other files to | |
25 | // produce an executable, this file does not by itself cause the | |
26 | // resulting executable to be covered by the GNU General Public | |
27 | // License. This exception does not however invalidate any other | |
28 | // reasons why the executable file might be covered by the GNU General | |
29 | // Public License. | |
30 | ||
31 | // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL. | |
32 | ||
33 | // Permission to use, copy, modify, sell, and distribute this software | |
34 | // is hereby granted without fee, provided that the above copyright | |
35 | // notice appears in all copies, and that both that copyright notice | |
36 | // and this permission notice appear in supporting documentation. None | |
37 | // of the above authors, nor IBM Haifa Research Laboratories, make any | |
38 | // representation about the suitability of this software for any | |
39 | // purpose. It is provided "as is" without express or implied | |
40 | // warranty. | |
41 | ||
42 | /** | |
43 | * @file find_test.hpp | |
44 | * Contains a generic find test. | |
45 | */ | |
46 | ||
47 | #ifndef PB_DS_FIND_TEST_HPP | |
48 | #define PB_DS_FIND_TEST_HPP | |
49 | ||
50 | #include <performance/time/timing_test_base.hpp> | |
51 | #include <performance/io/xml_formatter.hpp> | |
52 | #include <common_type/assoc/string_form.hpp> | |
53 | #include <iterator> | |
54 | ||
5e11f978 | 55 | namespace __gnu_pbds |
4569a895 | 56 | { |
4569a895 AT |
57 | namespace test |
58 | { | |
4569a895 AT |
59 | namespace detail |
60 | { | |
4569a895 AT |
61 | template<typename It, class Cntnr, bool LOR> |
62 | class find_find_functor | |
63 | { | |
64 | public: | |
3441f106 BK |
65 | find_find_functor(Cntnr& contnr, It fnd_it_b, It fnd_it_e) |
66 | : m_contnr(contnr), m_fnd_it_b(fnd_it_b), m_fnd_it_e(fnd_it_e) | |
4569a895 AT |
67 | { } |
68 | ||
69 | void | |
70 | operator()(std::size_t resolution) | |
71 | { | |
72 | for (std::size_t i = 0; i < resolution; ++i) | |
73 | { | |
74 | It fnd_it = m_fnd_it_b; | |
4569a895 | 75 | while (fnd_it != m_fnd_it_e) |
3441f106 | 76 | ++m_contnr.find((fnd_it++)->first)->second; |
4569a895 AT |
77 | } |
78 | } | |
79 | ||
80 | private: | |
3441f106 | 81 | Cntnr& m_contnr; |
4569a895 AT |
82 | const It m_fnd_it_b; |
83 | const It m_fnd_it_e; | |
84 | }; | |
85 | ||
86 | template<typename It, class Cntnr> | |
3441f106 | 87 | class find_find_functor<It, Cntnr, true> |
4569a895 AT |
88 | { |
89 | public: | |
3441f106 BK |
90 | find_find_functor(Cntnr& contnr, It fnd_it_b, It fnd_it_e) |
91 | : m_contnr(contnr), m_fnd_it_b(fnd_it_b), m_fnd_it_e(fnd_it_e) | |
4569a895 AT |
92 | { } |
93 | ||
94 | void | |
95 | operator()(std::size_t resolution) | |
96 | { | |
97 | It fnd_it = m_fnd_it_b; | |
4569a895 AT |
98 | while (fnd_it != m_fnd_it_e) |
99 | { | |
100 | for (std::size_t i = 0; i < resolution; ++i) | |
3441f106 | 101 | ++m_contnr.find(fnd_it->first)->second; |
4569a895 AT |
102 | ++fnd_it; |
103 | } | |
104 | } | |
105 | ||
106 | private: | |
3441f106 | 107 | Cntnr& m_contnr; |
4569a895 AT |
108 | const It m_fnd_it_b; |
109 | const It m_fnd_it_e; | |
110 | }; | |
4569a895 AT |
111 | } // namespace detail |
112 | ||
4569a895 | 113 | template<typename It, bool LOR = false> |
5e11f978 | 114 | class find_test : private __gnu_pbds::test::detail::timing_test_base |
4569a895 AT |
115 | { |
116 | public: | |
3441f106 BK |
117 | find_test(It ins_b, It fnd_it_b, size_t ins_vn, size_t ins_vs, |
118 | size_t ins_vm, size_t fnd_vn, size_t fnd_vs, size_t fnd_vm): | |
119 | m_ins_b(ins_b), m_fnd_it_b(fnd_it_b), m_ins_vn(ins_vn), m_ins_vs(ins_vs), | |
120 | m_ins_vm(ins_vm), m_fnd_vn(fnd_vn), m_fnd_vs(fnd_vs), m_fnd_vm(fnd_vm) | |
121 | { } | |
4569a895 AT |
122 | |
123 | template<typename Cntnr> | |
124 | void | |
3441f106 | 125 | operator()(Cntnr); |
4569a895 AT |
126 | |
127 | private: | |
128 | find_test(const find_test& ); | |
129 | ||
130 | private: | |
3441f106 BK |
131 | const It m_ins_b; |
132 | const It m_fnd_it_b; | |
133 | const size_t m_ins_vn; | |
134 | const size_t m_ins_vs; | |
135 | const size_t m_ins_vm; | |
136 | const size_t m_fnd_vn; | |
137 | const size_t m_fnd_vs; | |
138 | const size_t m_fnd_vm; | |
4569a895 AT |
139 | }; |
140 | ||
3441f106 | 141 | template<typename It, bool LOR> |
4569a895 AT |
142 | template<typename Cntnr> |
143 | void | |
3441f106 BK |
144 | find_test<It, LOR>:: |
145 | operator()(Cntnr) | |
4569a895 | 146 | { |
3441f106 BK |
147 | typedef string_form<Cntnr> sform_type; |
148 | typedef xml_result_set_performance_formatter formatter_type; | |
149 | formatter_type res_set_fmt(sform_type::name(), sform_type::desc()); | |
4569a895 | 150 | |
3441f106 | 151 | for (size_t i = 0; m_ins_vn + i * m_ins_vs < m_ins_vm; ++i) |
4569a895 | 152 | { |
3441f106 BK |
153 | const size_t v = m_ins_vn + i * m_ins_vs; |
154 | const size_t fnd_size = m_fnd_vn + i * m_fnd_vs; | |
4569a895 AT |
155 | It ins_it_b = m_ins_b; |
156 | It ins_it_e = m_ins_b; | |
157 | std::advance(ins_it_e, v); | |
158 | ||
159 | Cntnr test_container(ins_it_b, ins_it_e); | |
4569a895 AT |
160 | It fnd_it_b = m_fnd_it_b; |
161 | It fnd_it_e = m_fnd_it_b; | |
162 | std::advance(fnd_it_e, fnd_size); | |
163 | ||
5e11f978 | 164 | __gnu_pbds::test::detail::find_find_functor<It, Cntnr, LOR> |
4569a895 AT |
165 | fn(test_container, fnd_it_b, fnd_it_e); |
166 | ||
167 | const double res = | |
5e11f978 | 168 | __gnu_pbds::test::detail::timing_test_base::operator()(fn); |
4569a895 AT |
169 | res_set_fmt.add_res(v, res / fnd_size); |
170 | } | |
171 | } | |
4569a895 | 172 | } // namespace test |
5e11f978 | 173 | } // namespace __gnu_pbds |
4569a895 | 174 | |
3441f106 | 175 | #endif |
4569a895 | 176 |