// 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_cexp_op.cpp}

C++ AD Graph Conditional Expressions: Example and Test
######################################################

Source Code
***********
{xrst_literal
   // BEGIN C++
   // END C++
}

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

bool cexp_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]
   // node_3 : c[0]
   // node_4 : cexp_le(p[0], x[0], p[0], x[0])
   // y[0]   = cexp_le(p[0], x[0], 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("cexp_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);
   graph_obj.constant_vec_push_back(-0.1);
   //
   // node_4 : cexp_le(p[0], x[0], p[0], x[0])
   op_enum = CppAD::graph::cexp_le_graph_op;
   graph_obj.operator_vec_push_back(op_enum);
   graph_obj.operator_arg_push_back(1);
   graph_obj.operator_arg_push_back(2);
   graph_obj.operator_arg_push_back(1);
   graph_obj.operator_arg_push_back(2);
   //
   // y[0]   = cexp_le(p[0], x[0], p[0], x[0])
   graph_obj.dependent_vec_push_back(4);
   //
   // f(x, p) = cexp_le(p[0], x[0], 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.2;
   x[0] = 0.3;
   //
   // compute y = f(x, p)
   f.new_dynamic(p);
   CPPAD_TESTVECTOR(double) y = f.Forward(0, x);
   //
   // check result
   double check;
   if( p[0] <= x[0] )
      check= p[0];
   else
      check = x[0];
   //
   // check result
   ok &= CppAD::NearEqual(y[0], check, eps99, eps99);
   // ----------------------------------------------------------------------
   // Convert to Graph graph and back again
   f.to_graph(graph_obj);
   f.from_graph(graph_obj);
   // ----------------------------------------------------------------------
   //
   // compute y = f(x, p)
   f.new_dynamic(p);
   y = f.Forward(0, x);
   //
   // check result
   ok &= CppAD::NearEqual(y[0], check, eps99, eps99);
   //
   return ok;
}
// END C++
