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