File: time_test.cpp

package info (click to toggle)
cppad 2026.00.00.0-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 11,584 kB
  • sloc: cpp: 112,960; sh: 6,146; ansic: 179; python: 71; sed: 12; makefile: 10
file content (100 lines) | stat: -rw-r--r-- 2,392 bytes parent folder | download | duplicates (2)
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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
// SPDX-License-Identifier: EPL-2.0 OR GPL-2.0-or-later
// SPDX-FileCopyrightText: Bradley M. Bell <bradbell@seanet.com>
// SPDX-FileContributor: 2003-22 Bradley M. Bell
// ----------------------------------------------------------------------------
/*
{xrst_begin time_test.cpp}

time_test: Example and test
###########################

{xrst_literal
   // BEGIN C++
   // END C++
}

{xrst_end time_test.cpp}
*/
// BEGIN C++
# include <cppad/utility/time_test.hpp>
# include <cppad/utility/vector.hpp>

namespace { // empty namespace
   using CppAD::vector;

   // used to check size
   size_t size_;

   // used to check repeat
   size_t repeat_;

   vector<double> a, b, c;
   void test(size_t size, size_t repeat)
   {  // used for check
      size_   = size;
      repeat_ = repeat;

      // setup
      a.resize(size);
      b.resize(size);
      c.resize(size);
      size_t i  = size;;
      while(i)
      {  --i;
         a[i] = float(i);
         b[i] = float(2 * i);
         c[i] = 0.0;
      }
      // operations we are timing
      while(repeat--)
      {  i = size;;
         while(i)
         {  --i;
            c[i] += std::sqrt(a[i] * a[i] + b[i] * b[i]);
         }
      }
   }

}
bool time_test(void)
{  bool ok = true;
   using CppAD::time_test;

   // minimum amount of time to run test
   double time_min = 0.5;

   // size of first test case
   size_t test_size = 20;

   // run the first test case
   size_t repeat_first;
   double time_first = time_test(test, time_min, test_size, repeat_first);
   ok &= size_   == test_size;
   ok &= repeat_ == repeat_first;
   ok &= time_min <= double(repeat_first)  * time_first;

   // size of second test case is twice as large
   test_size = 2 * test_size;

   // run the second test case
   size_t repeat_second;
   double time_second = time_test(test, time_min, test_size, repeat_second);
   ok &= size_   == test_size;
   ok &= repeat_ == repeat_second;
   ok &= time_min <= double(repeat_second) * time_second;

   // test above should hold without exception, one below might not
   assert( ok );

   // for this case, time should be linear w.r.t size
   double rel_diff = 1. - 2. * time_first / time_second;
   ok             &= (std::fabs(rel_diff) <= .1);
   if( ! ok )
      std::cout << std::endl << "rel_diff = " << rel_diff  << std::endl;

   a.clear();
   b.clear();
   c.clear();
   return ok;
}
// END C++