1 | // $Id: utility_test.cc 2239 2010-04-10 23:05:12Z peter $ |
---|
2 | |
---|
3 | /* |
---|
4 | Copyright (C) 2006 Jari Häkkinen, Markus Ringnér |
---|
5 | Copyright (C) 2007, 2008 Jari Häkkinen, Peter Johansson |
---|
6 | Copyright (C) 2009, 2010 Peter Johansson |
---|
7 | |
---|
8 | This file is part of the yat library, http://dev.thep.lu.se/yat |
---|
9 | |
---|
10 | The yat library is free software; you can redistribute it and/or |
---|
11 | modify it under the terms of the GNU General Public License as |
---|
12 | published by the Free Software Foundation; either version 3 of the |
---|
13 | License, or (at your option) any later version. |
---|
14 | |
---|
15 | The yat library is distributed in the hope that it will be useful, |
---|
16 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
---|
17 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
---|
18 | General Public License for more details. |
---|
19 | |
---|
20 | You should have received a copy of the GNU General Public License |
---|
21 | along with yat. If not, see <http://www.gnu.org/licenses/>. |
---|
22 | */ |
---|
23 | |
---|
24 | #include "Suite.h" |
---|
25 | |
---|
26 | #include "yat/utility/Exception.h" |
---|
27 | #include "yat/utility/Matrix.h" |
---|
28 | #include "yat/utility/utility.h" |
---|
29 | #include "yat/utility/Vector.h" |
---|
30 | #include "yat/utility/VectorConstView.h" |
---|
31 | #include "yat/utility/sort_index.h" |
---|
32 | #include "yat/utility/stl_utility.h" |
---|
33 | |
---|
34 | #include <boost/concept_archetype.hpp> |
---|
35 | |
---|
36 | #include <cerrno> |
---|
37 | #include <fstream> |
---|
38 | #include <iostream> |
---|
39 | #include <limits> |
---|
40 | #include <list> |
---|
41 | #include <map> |
---|
42 | #include <string> |
---|
43 | #include <vector> |
---|
44 | |
---|
45 | using namespace theplu::yat; |
---|
46 | void test_errno_error(test::Suite& suite); |
---|
47 | void test_errno_error_func(void); |
---|
48 | void test_get_map(test::Suite&); |
---|
49 | void test_inverse(test::Suite&); |
---|
50 | |
---|
51 | template<typename InputIterator, typename Key> |
---|
52 | void test_inverse_validate(InputIterator first, InputIterator last, |
---|
53 | const std::map<Key, std::vector<size_t> >& m, |
---|
54 | test::Suite& suite); |
---|
55 | template<typename InputIterator, typename Key> |
---|
56 | void test_inverse_validate(InputIterator first, |
---|
57 | const std::multimap<Key, size_t>& m, |
---|
58 | test::Suite& suite); |
---|
59 | |
---|
60 | void test_sort_index(test::Suite& suite); |
---|
61 | void test_less_nan(test::Suite& suite); |
---|
62 | void test_ptr_compare(test::Suite& suite); |
---|
63 | |
---|
64 | int main(int argc, char* argv[]) |
---|
65 | { |
---|
66 | using namespace theplu::yat; |
---|
67 | test::Suite suite(argc, argv); |
---|
68 | suite.err() << "testing utility ... " << std::endl; |
---|
69 | |
---|
70 | // test float/double |
---|
71 | std::string s("1.2"); |
---|
72 | if (!utility::is<double>(s)){ |
---|
73 | suite.add(false); |
---|
74 | } |
---|
75 | else if (!utility::is<float>(s)) { |
---|
76 | suite.add(false); |
---|
77 | } |
---|
78 | else if (utility::is<int>(s)) { |
---|
79 | suite.add(false); |
---|
80 | } |
---|
81 | else if (utility::is_nan(s)) { |
---|
82 | suite.add(false); |
---|
83 | } |
---|
84 | |
---|
85 | // test int |
---|
86 | s="23"; |
---|
87 | if (!utility::is<double>(s)){ |
---|
88 | suite.add(false); |
---|
89 | } |
---|
90 | else if (!utility::is<float>(s)) { |
---|
91 | suite.add(false); |
---|
92 | } |
---|
93 | else if (!utility::is<int>(s)) { |
---|
94 | suite.add(false); |
---|
95 | } |
---|
96 | else if (utility::is_nan(s)) { |
---|
97 | suite.add(false); |
---|
98 | } |
---|
99 | |
---|
100 | // test nan |
---|
101 | s=" nAn "; |
---|
102 | if (!utility::is<double>(s)){ |
---|
103 | suite.add(false); |
---|
104 | suite.err() << "error: " << s << " is a double\n"; |
---|
105 | } |
---|
106 | /* we don't require NaN for float and int |
---|
107 | else if (!utility::is_float(s)) { |
---|
108 | suite.add(false); |
---|
109 | suite.err() << "error: " << s << " is a float\n"; |
---|
110 | } |
---|
111 | else if (!utility::is_int(s)) { |
---|
112 | suite.add(false); |
---|
113 | suite.err() << "error: " << s << " is a int\n"; |
---|
114 | } |
---|
115 | */ |
---|
116 | else if (!utility::is_nan(s)) { |
---|
117 | suite.add(false); |
---|
118 | suite.err() << "error: " << s << " is nan\n"; |
---|
119 | |
---|
120 | } |
---|
121 | |
---|
122 | // testing trailing values |
---|
123 | s=" 23 23 "; |
---|
124 | if (utility::is<double>(s)){ |
---|
125 | suite.add(false); |
---|
126 | } |
---|
127 | else if (utility::is<float>(s)) { |
---|
128 | suite.add(false); |
---|
129 | } |
---|
130 | else if (utility::is<int>(s)) { |
---|
131 | suite.add(false); |
---|
132 | } |
---|
133 | else if (utility::is_nan(s)) { |
---|
134 | suite.add(false); |
---|
135 | } |
---|
136 | |
---|
137 | if (utility::convert<double>("1.23")!=1.23) |
---|
138 | suite.add(false); |
---|
139 | utility::convert<double>("-inf"); |
---|
140 | utility::convert<double>("inf"); |
---|
141 | utility::convert<double>("NaN"); |
---|
142 | |
---|
143 | if (!suite.add(utility::is<double>("-inf"))) |
---|
144 | suite.err() << "is<double>(\"-inf\") should return true\n"; |
---|
145 | if (!suite.add(utility::is<double>("inf"))) |
---|
146 | suite.err() << "is<double>(\"inf\") should return true\n"; |
---|
147 | if (!suite.add(utility::is<double>("NaN"))) |
---|
148 | suite.err() << "is<double>(\"NaN\") should return true\n"; |
---|
149 | if (!suite.add(utility::is<double>("1.23"))) |
---|
150 | suite.err() << "is<double>(\"1.23\") should return true\n"; |
---|
151 | if (!suite.add(!utility::is<double>("1.23.2"))) |
---|
152 | suite.err() << "is<double>(\"1.23.2\") should return false\n"; |
---|
153 | if (!suite.add(!utility::is<int>("1.23"))) |
---|
154 | suite.err() << "is<int>(\"1.23\") should return false\n"; |
---|
155 | if (!suite.add(!utility::is<int>(""))) |
---|
156 | suite.err() << "is<int>(\"\") should return false\n"; |
---|
157 | |
---|
158 | { |
---|
159 | utility::Log<long double> f; |
---|
160 | utility::Log<double> f2(1.3); |
---|
161 | f(2.0); |
---|
162 | utility::Exp<double> e; |
---|
163 | e(3.2); |
---|
164 | } |
---|
165 | |
---|
166 | test_get_map(suite); |
---|
167 | test_inverse(suite); |
---|
168 | test_sort_index(suite); |
---|
169 | test_less_nan(suite); |
---|
170 | test_errno_error(suite); |
---|
171 | test_ptr_compare(suite); |
---|
172 | |
---|
173 | return suite.return_value(); |
---|
174 | } |
---|
175 | |
---|
176 | |
---|
177 | void test_errno_error_func(void) |
---|
178 | { |
---|
179 | errno=1; |
---|
180 | throw utility::errno_error(""); |
---|
181 | } |
---|
182 | |
---|
183 | |
---|
184 | void test_errno_error(test::Suite& suite) |
---|
185 | { |
---|
186 | suite.out() << "testing errno_error\n"; |
---|
187 | try { |
---|
188 | test_errno_error_func(); |
---|
189 | } |
---|
190 | catch ( utility::errno_error& e) { |
---|
191 | suite.out() << "catching expected exception with what():\n"; |
---|
192 | suite.out() << e.what() << "\n"; |
---|
193 | return; |
---|
194 | } |
---|
195 | suite.err() << "error: expected thrown exception\n"; |
---|
196 | suite.add(false); |
---|
197 | } |
---|
198 | |
---|
199 | |
---|
200 | void test_get_map(test::Suite& suite) |
---|
201 | { |
---|
202 | std::map<std::string, int> m; |
---|
203 | m["one"] = 1; |
---|
204 | m["two"] = 2; |
---|
205 | const std::map<std::string, int> m2(m); |
---|
206 | int i = utility::get(m2, static_cast<std::string>("one")); |
---|
207 | i = 0; // avoid compiler warning |
---|
208 | try { |
---|
209 | utility::get(m2, static_cast<std::string>("three")); |
---|
210 | suite.add(false); |
---|
211 | } |
---|
212 | catch (std::runtime_error& e) { |
---|
213 | suite.out() << "expected exception thrown with what() = " |
---|
214 | << e.what() << "\n"; |
---|
215 | } |
---|
216 | } |
---|
217 | |
---|
218 | void test_less_nan(test::Suite& suite) |
---|
219 | { |
---|
220 | bool prior_ok=suite.ok(); |
---|
221 | utility::less_nan<double> f; |
---|
222 | suite.add(f(2.7,3.14)); |
---|
223 | suite.add(!f(2.7,-3.14)); |
---|
224 | suite.add(!f(2.7,2.7)); |
---|
225 | suite.add(f(3.14, std::numeric_limits<double>::quiet_NaN())); |
---|
226 | suite.add(!f(std::numeric_limits<double>::quiet_NaN(), 2.7)); |
---|
227 | suite.add(!f(std::numeric_limits<double>::quiet_NaN(), |
---|
228 | std::numeric_limits<double>::quiet_NaN())); |
---|
229 | utility::less_nan<utility::DataWeight> fw; |
---|
230 | suite.add(fw(utility::DataWeight(2), utility::DataWeight(3))); |
---|
231 | |
---|
232 | bool post_ok=suite.ok(); |
---|
233 | if (!post_ok && prior_ok) |
---|
234 | suite.err() << "test_less_nan failed\n"; |
---|
235 | } |
---|
236 | |
---|
237 | |
---|
238 | void test_inverse(test::Suite& suite) |
---|
239 | { |
---|
240 | suite.err() << "Testing inverse\n"; |
---|
241 | std::vector<std::string> vec; |
---|
242 | vec.push_back("No"); |
---|
243 | vec.push_back("one"); |
---|
244 | vec.push_back("shall"); |
---|
245 | vec.push_back("be"); |
---|
246 | vec.push_back("subjected"); |
---|
247 | std::map<std::string, std::vector<size_t> > map; |
---|
248 | utility::inverse(vec.begin(), vec.end(), map); |
---|
249 | test_inverse_validate(vec.begin(), vec.end(), map, suite); |
---|
250 | utility::inverse(vec.begin()+1, vec.end(), map); |
---|
251 | test_inverse_validate(vec.begin()+1, vec.end(), map, suite); |
---|
252 | const std::vector<std::string> vec2(vec); |
---|
253 | utility::inverse(vec2.begin(), vec2.end(), map); |
---|
254 | test_inverse_validate(vec2.begin(), vec2.end(), map, suite); |
---|
255 | std::multimap<std::string, size_t> mmap; |
---|
256 | utility::inverse(vec.begin(), vec.end(), mmap); |
---|
257 | test_inverse_validate(vec.begin(), mmap, suite); |
---|
258 | utility::inverse(vec.begin()+1, vec.end(), mmap); |
---|
259 | test_inverse_validate(vec.begin()+1, mmap, suite); |
---|
260 | // do not run compile tests |
---|
261 | if (false) { |
---|
262 | std::map<std::string, std::vector<size_t> > m; |
---|
263 | boost::input_iterator_archetype<std::string> start; |
---|
264 | boost::input_iterator_archetype<std::string> end; |
---|
265 | utility::inverse(start, end, m); |
---|
266 | std::map<std::string, std::vector<size_t>, std::greater<std::string> > m2; |
---|
267 | utility::inverse(start, end, m2); |
---|
268 | std::multimap<std::string, size_t> m3; |
---|
269 | utility::inverse(start, end, m3); |
---|
270 | std::multimap<std::string, size_t, std::greater<std::string> > m4; |
---|
271 | utility::inverse(start, end, m4); |
---|
272 | } |
---|
273 | } |
---|
274 | |
---|
275 | |
---|
276 | template<typename InputIterator, typename Key> |
---|
277 | void test_inverse_validate(InputIterator first, InputIterator last, |
---|
278 | const std::map<Key, std::vector<size_t> >& m, |
---|
279 | test::Suite& suite) |
---|
280 | { |
---|
281 | typedef typename std::map<Key, std::vector<size_t> >::const_iterator Iter; |
---|
282 | for ( InputIterator iter=first; iter != last; ++iter) { |
---|
283 | Iter map_iter = m.find(*iter); |
---|
284 | if (!suite.add(map_iter!=m.end())) { |
---|
285 | suite.err() << "test_inverse_validate() failed\n"; |
---|
286 | suite.err() << " could not find: " << *first << " in map m\n"; |
---|
287 | } |
---|
288 | for (size_t i=0; i<map_iter->second.size(); ++i) |
---|
289 | if (!suite.add(map_iter->second[i] == |
---|
290 | static_cast<size_t>(distance(first, iter))) ) { |
---|
291 | suite.err() << "test_inverse_validate() failed\n"; |
---|
292 | suite.err() << " comparing: " << map_iter->second[i] |
---|
293 | << " and " << distance(first, iter) |
---|
294 | << " expected them to be equal\n"; |
---|
295 | } |
---|
296 | } |
---|
297 | } |
---|
298 | |
---|
299 | |
---|
300 | template<typename InputIterator, typename Key> |
---|
301 | void test_inverse_validate(InputIterator first, |
---|
302 | const std::multimap<Key, size_t>& m, |
---|
303 | test::Suite& suite) |
---|
304 | { |
---|
305 | for (typename std::multimap<Key, size_t>::const_iterator iter=m.begin(); |
---|
306 | iter!=m.end(); ++iter) { |
---|
307 | suite.add(*(first + iter->second) == iter->first); |
---|
308 | } |
---|
309 | |
---|
310 | } |
---|
311 | |
---|
312 | void test_sort_index(test::Suite& suite) |
---|
313 | { |
---|
314 | suite.err() << "testing sort_index" << std::endl; |
---|
315 | utility::Vector a(10); |
---|
316 | for (size_t i=0; i<a.size(); ++i) |
---|
317 | a(i) = std::pow(i-4.2,2); |
---|
318 | std::vector<size_t> vec; |
---|
319 | utility::sort_index(vec, a); |
---|
320 | |
---|
321 | std::vector<size_t> vec2; |
---|
322 | utility::sort_index(a.begin(), a.end(), vec2); |
---|
323 | if (vec.size()==vec2.size()) { |
---|
324 | if (!suite.equal_range(vec.begin(), vec.end(), vec2.begin())) { |
---|
325 | suite.add(false); |
---|
326 | } |
---|
327 | } |
---|
328 | else { |
---|
329 | suite.add(false); |
---|
330 | suite.err() << "size mismatch: vec.size()=" << vec.size() |
---|
331 | << "vec2.size()=" << vec2.size() << "\n"; |
---|
332 | } |
---|
333 | const utility::VectorConstView b(a, 0, 5, 2); |
---|
334 | |
---|
335 | std::vector<size_t> vec3; |
---|
336 | utility::sort_index(vec3, b); |
---|
337 | std::vector<size_t> vec4; |
---|
338 | utility::sort_index(b.begin(), b.end(), vec4); |
---|
339 | if (vec3.size()!=vec4.size()) { |
---|
340 | suite.add(false); |
---|
341 | suite.err() << "size mismatch: vec3.size()=" << vec3.size() |
---|
342 | << " vec4.size()=" << vec4.size() << "\n"; |
---|
343 | } |
---|
344 | else { |
---|
345 | if (!suite.equal_range(vec3.begin(), vec3.end(), vec4.begin())){ |
---|
346 | suite.add(false); |
---|
347 | } |
---|
348 | } |
---|
349 | |
---|
350 | std::list<double> list; |
---|
351 | for (size_t i=0; i<a.size(); ++i) |
---|
352 | list.push_back(a(i)); |
---|
353 | std::vector<size_t> vec5; |
---|
354 | utility::sort_index(list.begin(), list.end(), vec5); |
---|
355 | if (vec.size()!=vec5.size()) { |
---|
356 | suite.add(false); |
---|
357 | suite.err() << "size mismatch: vec.size()=" << vec.size() |
---|
358 | << " vec5.size()=" << vec5.size() << "\n"; |
---|
359 | } |
---|
360 | else { |
---|
361 | if (!suite.equal_range(vec.begin(), vec.end(), vec5.begin())){ |
---|
362 | suite.add(false); |
---|
363 | } |
---|
364 | } |
---|
365 | |
---|
366 | // do not run compiler tests |
---|
367 | if (false) { |
---|
368 | std::vector<size_t> vec; |
---|
369 | utility::sort_index(boost::forward_iterator_archetype<double>(), |
---|
370 | boost::forward_iterator_archetype<double>(), |
---|
371 | vec); |
---|
372 | } |
---|
373 | } |
---|
374 | |
---|
375 | void test_ptr_compare(test::Suite& suite) |
---|
376 | { |
---|
377 | double* a = new double(0); |
---|
378 | double* b = new double(1); |
---|
379 | |
---|
380 | utility::PtrCompare<double> ptr_less; |
---|
381 | if (!ptr_less(a, b)) { |
---|
382 | suite.out() << "ptr_less(a, b) returned false\n"; |
---|
383 | suite.add(false); |
---|
384 | } |
---|
385 | if (ptr_less(b, a)) { |
---|
386 | suite.out() << "ptr_less(b, a) returned true\n"; |
---|
387 | suite.add(false); |
---|
388 | } |
---|
389 | |
---|
390 | utility::PtrCompare<double, std::greater<double> > ptr_greater; |
---|
391 | if (ptr_greater(a, b)) { |
---|
392 | suite.out() << "ptr_greater(a, b) returned true\n"; |
---|
393 | suite.add(false); |
---|
394 | } |
---|
395 | if (!ptr_greater(b, a)) { |
---|
396 | suite.out() << "ptr_greater(b, a) returned false\n"; |
---|
397 | suite.add(false); |
---|
398 | } |
---|
399 | delete a; |
---|
400 | delete b; |
---|
401 | |
---|
402 | std::vector<double*> vec(10); |
---|
403 | std::greater<double> d_greater; |
---|
404 | utility::PtrCompare<double, std::greater<double> > ptr_greater2(d_greater); |
---|
405 | for (size_t i=0; i<vec.size(); ++i) |
---|
406 | vec[i] = new double(i); |
---|
407 | std::sort(vec.begin(), vec.end(), ptr_greater2); |
---|
408 | for (size_t i=1; i<vec.size(); ++i) { |
---|
409 | suite.add( *vec[i-1] > *vec[i]); |
---|
410 | } |
---|
411 | for (size_t i=0; i<vec.size(); ++i) |
---|
412 | delete vec[i]; |
---|
413 | |
---|
414 | } |
---|