|
1 /* -*- C++ -*- |
|
2 * |
|
3 * This file is a part of LEMON, a generic C++ optimization library |
|
4 * |
|
5 * Copyright (C) 2003-2008 |
|
6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
|
7 * (Egervary Research Group on Combinatorial Optimization, EGRES). |
|
8 * |
|
9 * Permission to use, modify and distribute this software is granted |
|
10 * provided that this copyright notice appears in all copies. For |
|
11 * precise terms see the accompanying LICENSE file. |
|
12 * |
|
13 * This software is provided "AS IS" with no warranty of any kind, |
|
14 * express or implied, and with no claim as to its suitability for any |
|
15 * purpose. |
|
16 * |
|
17 */ |
|
18 |
|
19 #include <lemon/time_measure.h> |
|
20 |
|
21 ///\file \brief Test cases for time_measure.h |
|
22 /// |
|
23 ///\todo To be extended |
|
24 |
|
25 |
|
26 using namespace lemon; |
|
27 |
|
28 void f() |
|
29 { |
|
30 double d=0; |
|
31 for(int i=0;i<1000;i++) |
|
32 d+=0.1; |
|
33 } |
|
34 |
|
35 void g() |
|
36 { |
|
37 static Timer T; |
|
38 |
|
39 for(int i=0;i<1000;i++) |
|
40 TimeStamp x(T); |
|
41 } |
|
42 |
|
43 int main() |
|
44 { |
|
45 Timer T; |
|
46 unsigned int n; |
|
47 for(n=0;T.realTime()<1.0;n++) ; |
|
48 std::cout << T << " (" << n << " time queries)\n"; |
|
49 T.restart(); |
|
50 while(T.realTime()<2.0) ; |
|
51 std::cout << T << '\n'; |
|
52 TimeStamp full; |
|
53 TimeStamp t; |
|
54 t=runningTimeTest(f,1,&n,&full); |
|
55 std::cout << t << " (" << n << " tests)\n"; |
|
56 std::cout << "Total: " << full << "\n"; |
|
57 |
|
58 t=runningTimeTest(g,1,&n,&full); |
|
59 std::cout << t << " (" << n << " tests)\n"; |
|
60 std::cout << "Total: " << full << "\n"; |
|
61 |
|
62 return 0; |
|
63 } |