1 | /* -*- C++ -*- |
---|

2 | * |
---|

3 | * This file is a part of LEMON, a generic C++ optimization library |
---|

4 | * |
---|

5 | * Copyright (C) 2003-2006 |
---|

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 | double d=0; |
---|

40 | for(int i=0;i<1000;i++) |
---|

41 | TimeStamp x(T); |
---|

42 | } |
---|

43 | |
---|

44 | int main() |
---|

45 | { |
---|

46 | Timer T; |
---|

47 | int n; |
---|

48 | for(n=0;T.realTime()<1.0;n++) ; |
---|

49 | std::cout << T << " (" << n << " time queries)\n"; |
---|

50 | T.restart(); |
---|

51 | while(T.realTime()<2.0) ; |
---|

52 | std::cout << T << '\n'; |
---|

53 | TimeStamp full; |
---|

54 | TimeStamp t; |
---|

55 | t=runningTimeTest(f,1,&n,&full); |
---|

56 | std::cout << t << " (" << n << " tests)\n"; |
---|

57 | std::cout << "Total: " << full << "\n"; |
---|

58 | |
---|

59 | t=runningTimeTest(g,1,&n,&full); |
---|

60 | std::cout << t << " (" << n << " tests)\n"; |
---|

61 | std::cout << "Total: " << full << "\n"; |
---|

62 | |
---|

63 | return 0; |
---|

64 | } |
---|