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
|
// 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 ipopt_ode_speed.cpp dev}
Speed Test for Both Simple and Fast Representations
###################################################
{xrst_literal
// BEGIN C++
// END C++
}
{xrst_end ipopt_ode_speed.cpp}
*/
// BEGIN C++
# include "../example/ode_run.hpp"
# include "../example/ode_simple.hpp"
# include "../example/ode_fast.hpp"
# include <cassert>
# include <cstring>
# if CPPAD_HAS_GETTIMEOFDAY & CPPAD_NO_MICROSOFT
# include <sys/time.h>
# else
# include <ctime>
# endif
namespace {
double current_second(void)
{
# if CPPAD_HAS_GETTIMEOFDAY & CPPAD_NOT_MICOROSOFT
struct timeval value;
gettimeofday(&value, 0);
return double(value.tv_sec) + double(value.tv_usec) * 1e-6;
# else
return (double) clock() / (double) CLOCKS_PER_SEC;
# endif
}
}
double ode_speed(const char* name, size_t& count)
{
// determine simple and retape flags
bool simple = true, retape = true;
if( std::strcmp(name, "simple_retape_no") == 0 )
{ simple = true; retape = false; }
else if( std::strcmp(name, "simple_retape_yes") == 0 )
{ simple = true; retape = true; }
else if( std::strcmp(name, "fast_retape_no") == 0 )
{ simple = false; retape = false; }
else if( std::strcmp(name, "fast_retape_yes") == 0 )
{ simple = false; retape = true; }
else
assert(false);
size_t i;
double s0, s1;
size_t c0, c1;
// solution vector
NumberVector x;
// number of time grid intervals between measurement values
SizeVector N(Nz + 1);
N[0] = 0;
for(i = 1; i <= Nz; i++)
{ N[i] = 10;
// n += N[i] * Ny;
}
// n += Na;
s0 = current_second();
c0 = count_eval_r();
if( simple )
ipopt_ode_case<FG_simple>(retape, N, x);
else
ipopt_ode_case<FG_fast>(retape, N, x);
s1 = current_second();
c1 = count_eval_r();
count = c1 - c0 - 1;
return s1 - s0;
}
// END C++
|
