]>
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 subscript_find_test.hpp | |
44 | * Contains a generic subscript_find_test test. | |
45 | */ | |
46 | ||
47 | #ifndef PB_DS_SUBSCRIPT_TEST_HPP | |
48 | #define PB_DS_SUBSCRIPT_TEST_HPP | |
49 | ||
50 | #include <performance/time/timing_test_base.hpp> | |
51 | #include <common_type/assoc/string_form.hpp> | |
52 | #include <iterator> | |
53 | ||
54 | namespace pb_ds | |
55 | { | |
4569a895 AT |
56 | namespace test |
57 | { | |
4569a895 AT |
58 | namespace detail |
59 | { | |
4569a895 AT |
60 | template<typename It, class Cntnr> |
61 | class subscript_find_functor | |
62 | { | |
63 | public: | |
3441f106 BK |
64 | subscript_find_functor(Cntnr& container, It fnd_it_b, It fnd_it_e) |
65 | : m_r_container(container), m_fnd_it_b(fnd_it_b), m_fnd_it_e(fnd_it_e) | |
4569a895 AT |
66 | { } |
67 | ||
68 | void | |
69 | operator()(std::size_t resolution) | |
70 | { | |
71 | for (std::size_t i = 0; i < resolution; ++i) | |
72 | { | |
73 | It fnd_it = m_fnd_it_b; | |
4569a895 AT |
74 | while (fnd_it != m_fnd_it_e) |
75 | ++m_r_container[(fnd_it++)->first]; | |
4569a895 AT |
76 | ++fnd_it; |
77 | } | |
78 | } | |
79 | ||
80 | private: | |
81 | Cntnr& m_r_container; | |
82 | const It m_fnd_it_b; | |
83 | const It m_fnd_it_e; | |
84 | }; | |
85 | ||
86 | } // namespace detail | |
87 | ||
4569a895 AT |
88 | template<typename It> |
89 | class subscript_find_test : private pb_ds::test::detail::timing_test_base | |
90 | { | |
91 | public: | |
3441f106 BK |
92 | subscript_find_test(It ins_b, It b, size_t ins_vn, size_t ins_vs, |
93 | size_t ins_vm, size_t vn, size_t vs, size_t vm) | |
94 | : m_ins_b(ins_b), m_fnd_b(b), m_ins_vn(ins_vn), m_ins_vs(ins_vs), | |
95 | m_ins_vm(ins_vm), m_fnd_vn(vn), m_fnd_vs(vs), m_fnd_vm(vm) | |
96 | { } | |
4569a895 AT |
97 | |
98 | template<typename Cntnr> | |
99 | void | |
3441f106 | 100 | operator()(Cntnr); |
4569a895 AT |
101 | |
102 | private: | |
3441f106 | 103 | subscript_find_test(const subscript_find_test&); |
4569a895 AT |
104 | |
105 | private: | |
106 | const It m_ins_b; | |
4569a895 | 107 | const It m_fnd_b; |
4569a895 AT |
108 | const size_t m_ins_vn; |
109 | const size_t m_ins_vs; | |
110 | const size_t m_ins_vm; | |
4569a895 AT |
111 | const size_t m_fnd_vn; |
112 | const size_t m_fnd_vs; | |
113 | const size_t m_fnd_vm; | |
114 | }; | |
115 | ||
3441f106 BK |
116 | template<typename It> |
117 | template<typename Cntnr> | |
4569a895 | 118 | void |
3441f106 BK |
119 | subscript_find_test<It>:: |
120 | operator()(Cntnr) | |
4569a895 | 121 | { |
3441f106 BK |
122 | typedef xml_result_set_performance_formatter formatter_type; |
123 | formatter_type res_set_fmt(string_form<Cntnr>::name(), | |
124 | string_form<Cntnr>::desc()); | |
4569a895 | 125 | |
3441f106 | 126 | for (size_t i = 0; m_ins_vn + i* m_ins_vs < m_ins_vm; ++i) |
4569a895 | 127 | { |
3441f106 BK |
128 | const size_t v = m_ins_vn + i* m_ins_vs; |
129 | const size_t fnd_size = m_fnd_vn + i* m_fnd_vs; | |
4569a895 AT |
130 | |
131 | It ins_it_b = m_ins_b; | |
132 | It ins_it_e = m_ins_b; | |
133 | std::advance(ins_it_e, v); | |
134 | ||
135 | Cntnr test_container(ins_it_b, ins_it_e); | |
136 | ||
137 | It fnd_it_b = m_fnd_b; | |
138 | It fnd_it_e = m_fnd_b; | |
139 | std::advance(fnd_it_e, fnd_size); | |
140 | ||
141 | pb_ds::test::detail::subscript_find_functor<It, Cntnr> | |
142 | fn(test_container, fnd_it_b, fnd_it_e); | |
143 | ||
144 | const double res = | |
145 | pb_ds::test::detail::timing_test_base::operator()(fn); | |
146 | ||
147 | res_set_fmt.add_res(v, res / fnd_size); | |
148 | } | |
149 | } | |
4569a895 | 150 | } // namespace test |
4569a895 AT |
151 | } // namespace pb_ds |
152 | ||
3441f106 | 153 | #endif |
4569a895 | 154 |