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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
|
// 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 graph_comp_op.cpp}
C++ AD Graph Comparison Operators: Example and Test
###################################################
Source Code
***********
{xrst_literal
// BEGIN C++
// END C++
}
{xrst_end graph_comp_op.cpp}
*/
// BEGIN C++
# include <cppad/cppad.hpp>
bool comp_op(void)
{ bool ok = true;
using std::string;
double eps99 = 99.0 * std::numeric_limits<double>::epsilon();
//
// AD graph example
// node_1 : p[0]
// node_2 : x[0]
// : x[0] < p[0]
// node_3 : p[0] - x[0]
// node_4 : log( p[0] - x[0] )
// y[0] = log( p[0] - x[0] )
//
// C++ graph object
CppAD::cpp_graph graph_obj;
//
// operator being used
CppAD::graph::graph_op_enum op_enum;
//
// set scalars
graph_obj.function_name_set("comp_op example");
size_t n_dynamic_ind = 1;
graph_obj.n_dynamic_ind_set(n_dynamic_ind);
size_t n_variable_ind = 1;
graph_obj.n_variable_ind_set(n_variable_ind);
//
// x[0] < p[0]
op_enum = CppAD::graph::comp_lt_graph_op;
graph_obj.operator_vec_push_back(op_enum);
graph_obj.operator_arg_push_back(2);
graph_obj.operator_arg_push_back(1);
//
// node_3 : p[0] - x[0]
op_enum = CppAD::graph::sub_graph_op;
graph_obj.operator_vec_push_back(op_enum);
graph_obj.operator_arg_push_back(1);
graph_obj.operator_arg_push_back(2);
//
// node_4 : log( p[0] - x[0] )
op_enum = CppAD::graph::log_graph_op;
graph_obj.operator_vec_push_back(op_enum);
graph_obj.operator_arg_push_back(3);
//
// y[0] = log( p[0] - x[0] )
graph_obj.dependent_vec_push_back(4);
//
// f(x, p) = log( p[0] - x[0] )
CppAD::ADFun<double> f;
f.from_graph(graph_obj);
ok &= f.Domain() == 1;
ok &= f.Range() == 1;
ok &= f.size_dyn_ind() == 1;
//
// set independent variables and parameters
CPPAD_TESTVECTOR(double) p(1), x(1);
p[0] = 0.3;
x[0] = 0.2;
//
// compute y = f(x, p)
f.new_dynamic(p);
CPPAD_TESTVECTOR(double) y = f.Forward(0, x);
//
// x[0] < p[0] so comparison should not have changed
ok &= f.compare_change_number() == 0;
//
// check result
double check = std::log( p[0] - x[0] );
ok &= CppAD::NearEqual(y[0], check, eps99, eps99);
//
// case where comparison is false
f.check_for_nan(false); // suppress checking for nan for this test
x[0] = 0.4;
y = f.Forward(0, x);
ok &= f.compare_change_number() == 1;
//
// -----------------------------------------------------------------------
// Convert to Graph graph and back again
f.to_graph(graph_obj);
// std::cout << graph;
f.from_graph(graph_obj);
// -----------------------------------------------------------------------
//
// compute y = f(x, p)
f.new_dynamic(p);
x[0] = 0.2;
y = f.Forward(0, x);
//
// check result
ok &= CppAD::NearEqual(y[0], check, eps99, eps99);
//
// case where comparison is false
x[0] = 0.4;
y = f.Forward(0, x);
ok &= f.compare_change_number() == 1;
//
return ok;
}
// END C++
|
