test/time_measure_test.cc
author Balazs Dezso <deba@google.com>
Fri, 22 Jan 2021 10:55:32 +0100
changeset 1208 c6aa2cc1af04
parent 1083 3e711ee55d31
permissions -rw-r--r--
Factor out recursion from weighted matching algorithms (#638)
     1 /* -*- mode: C++; indent-tabs-mode: nil; -*-
     2  *
     3  * This file is a part of LEMON, a generic C++ optimization library.
     4  *
     5  * Copyright (C) 2003-2013
     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 #include <lemon/concept_check.h>
    21 
    22 using namespace lemon;
    23 
    24 void f()
    25 {
    26   double d=0;
    27   for(int i=0;i<1000;i++)
    28     d+=0.1;
    29 }
    30 
    31 void g()
    32 {
    33   static Timer T;
    34 
    35   for(int i=0;i<1000;i++)
    36     {
    37       TimeStamp x(T);
    38       ::lemon::ignore_unused_variable_warning(x);
    39     }
    40 }
    41 
    42 int main()
    43 {
    44   Timer T;
    45   unsigned int n;
    46   for(n=0;T.realTime()<0.1;n++) ;
    47   std::cout << T << " (" << n << " time queries)\n";
    48 
    49   TimeStamp full;
    50   TimeStamp t;
    51   t=runningTimeTest(f,0.1,&n,&full);
    52   std::cout << t << " (" << n << " tests)\n";
    53   std::cout << "Total: " << full << "\n";
    54 
    55   t=runningTimeTest(g,0.1,&n,&full);
    56   std::cout << t << " (" << n << " tests)\n";
    57   std::cout << "Total: " << full << "\n";
    58 
    59   return 0;
    60 }