test/time_measure_test.cc
author Peter Kovacs <kpeter@inf.elte.hu>
Mon, 12 Jan 2009 07:52:48 +0100
changeset 463 a2fd8b8d0b30
parent 209 765619b7cbb2
child 558 f53d641aa967
permissions -rw-r--r--
Greatly extend and improve the test file for adaptors (#67)

- Add concept checks for the alterable, extendable, erasable
and clearable adaptors.
- Add test cases for modifying the underlying graphs through adaptors
whenever it is possible.
- Check the conversions between Node, Arc and Edge types.
- Add more test cases for the adaptor-specific functions and maps:
enable(), disable(), status(), forward(), backward(), CombinedArcMap,
CombinedNodeMap, ResidualCapacity etc.
- Use checkGraphIncEdgeArcLists() to simplify the test cases for
undirected graphs.
- Add test cases that use static graph structure (GridGraph) with
several adaptors combined.
- Add comments for the test cases.
     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-2009
     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 using namespace lemon;
    22 
    23 void f()
    24 {
    25   double d=0;
    26   for(int i=0;i<1000;i++)
    27     d+=0.1;
    28 }
    29 
    30 void g()
    31 {
    32   static Timer T;
    33 
    34   for(int i=0;i<1000;i++)
    35     TimeStamp x(T);
    36 }
    37 
    38 int main()
    39 {
    40   Timer T;
    41   unsigned int n;
    42   for(n=0;T.realTime()<1.0;n++) ;
    43   std::cout << T << " (" << n << " time queries)\n";
    44   T.restart();
    45   while(T.realTime()<2.0) ;
    46   std::cout << T << '\n';
    47   TimeStamp full;
    48   TimeStamp t;
    49   t=runningTimeTest(f,1,&n,&full);
    50   std::cout << t << " (" << n << " tests)\n";
    51   std::cout << "Total: " << full << "\n";
    52 
    53   t=runningTimeTest(g,1,&n,&full);
    54   std::cout << t << " (" << n << " tests)\n";
    55   std::cout << "Total: " << full << "\n";
    56 
    57   return 0;
    58 }