test/counter_test.cc
changeset 182 9c6dfb5141d3
parent 119 82a2639a05bb
child 209 765619b7cbb2
equal deleted inserted replaced
0:d4f7b97605a4 1:b2d72d734a3f
    15  * purpose.
    15  * purpose.
    16  *
    16  *
    17  */
    17  */
    18 
    18 
    19 #include <lemon/counter.h>
    19 #include <lemon/counter.h>
       
    20 #include <vector>
    20 
    21 
    21 ///\file \brief Test cases for time_measure.h
    22 using namespace lemon;
    22 ///
       
    23 ///\todo To be extended
       
    24 
    23 
       
    24 template <typename T>
       
    25 void bubbleSort(std::vector<T>& v) {
       
    26   Counter op("Bubble Sort - Operations: ");
       
    27   Counter::NoSubCounter as(op, "Assignments: ");
       
    28   Counter::NoSubCounter co(op, "Comparisons: ");
       
    29   for (int i = v.size()-1; i > 0; --i) {
       
    30     for (int j = 0; j < i; ++j) {
       
    31       if (v[j] > v[j+1]) {
       
    32         T tmp = v[j];
       
    33         v[j] = v[j+1];
       
    34         v[j+1] = tmp;
       
    35         as += 3;
       
    36       }
       
    37       ++co;
       
    38     }
       
    39   }
       
    40 }
    25 
    41 
    26 int fibonacci(int f) 
    42 template <typename T>
    27 {
    43 void insertionSort(std::vector<T>& v) {
    28   static lemon::Counter count("Fibonacci steps: ");
    44   Counter op("Insertion Sort - Operations: ");
    29   count++;
    45   Counter::NoSubCounter as(op, "Assignments: ");
    30   if(f<1) return 0;
    46   Counter::NoSubCounter co(op, "Comparisons: ");
    31   else if(f==1) return 1;
    47   for (int i = 1; i < int(v.size()); ++i) {
    32   else return fibonacci(f-1)+fibonacci(f-2);
    48     T value = v[i];
       
    49     ++as;
       
    50     int j = i;
       
    51     while (j > 0 && v[j-1] > value) {
       
    52       v[j] = v[j-1];
       
    53       --j;
       
    54       ++co; ++as;
       
    55     }
       
    56     v[j] = value;
       
    57     ++as;
       
    58   }
       
    59 }
       
    60 
       
    61 template <typename MyCounter>
       
    62 void counterTest() {
       
    63   MyCounter c("Main Counter: ");
       
    64   c++;
       
    65   typename MyCounter::SubCounter d(c, "SubCounter: ");
       
    66   d++;
       
    67   typename MyCounter::SubCounter::NoSubCounter e(d, "SubSubCounter: ");
       
    68   e++;
       
    69   d+=3;
       
    70   c-=4;
       
    71   e-=2;
       
    72   c.reset(2);
       
    73   c.reset();
       
    74 }
       
    75 
       
    76 void init(std::vector<int>& v) {
       
    77   v[0] = 10; v[1] = 60; v[2] = 20; v[3] = 90; v[4] = 100;
       
    78   v[5] = 80; v[6] = 40; v[7] = 30; v[8] = 50; v[9] = 70; 
    33 }
    79 }
    34 
    80 
    35 int main()
    81 int main()
    36 {
    82 {
    37   fibonacci(10);
    83   counterTest<Counter>();
       
    84   counterTest<NoCounter>();
    38   
    85   
    39   {  
    86   std::vector<int> x(10);
    40     typedef lemon::Counter MyCounter;
    87   init(x); bubbleSort(x);
    41     MyCounter c("Main counter: ");
    88   init(x); insertionSort(x);
    42     c++;
       
    43     c++;
       
    44     MyCounter::SubCounter d(c,"Subcounter: ");
       
    45     d++;
       
    46     d++;
       
    47     MyCounter::SubCounter::SubCounter e(d,"SubSubCounter: ");
       
    48     e++;
       
    49     e++;
       
    50   }
       
    51   
       
    52   {
       
    53     typedef lemon::NoCounter MyCounter;
       
    54     MyCounter c("Main counter: ");
       
    55     c++;
       
    56     c++;
       
    57     MyCounter::SubCounter d(c,"Subcounter: ");
       
    58     d++;
       
    59     d++;
       
    60     MyCounter::SubCounter::SubCounter e(d,"SubSubCounter: ");
       
    61     e++;
       
    62     e++;
       
    63   }
       
    64 
    89 
    65   return 0;
    90   return 0;
    66 }
    91 }