Adjoint Code Design Patterns
v0.1
U.Naumann
|
#include <MyACEnsemblePathwiseEvolutionRecursiveBisection.hpp>
Public Member Functions | |
MyACEnsemblePathwiseEvolutionRecursiveBisection (size_t npaths, size_t nsteps, size_t ncheckpoints, MyACEvolutionStepUserData< T > &d) | |
![]() | |
ACEnsemblePathwise (size_t npaths) | |
void | evaluate_primal () |
void | evaluate_split_primal () |
void | evaluate_split_adjoint () |
![]() | |
ACEnsemble (size_t npaths) | |
![]() | |
void | register_input (T &v, T &a) |
void | register_input (VarRefs< T > &v, VarRefs< T > &a) |
void | register_output (T &v, T &a) |
void | register_output (VarRefs< T > &v, VarRefs< T > &a) |
void | register_inoutput (T &xv, T &xa, T &yv, T &ya) |
void | register_inoutput (VarRefs< T > &xv, VarRefs< T > &xa, VarRefs< T > &yv, VarRefs< T > &ya) |
void | reset_inoutput () |
virtual void | push_arguments () |
virtual void | read_arguments () |
virtual void | pop_arguments () |
virtual void | evaluate_joint_primal () |
virtual void | evaluate_joint_adjoint () |
Additional Inherited Members | |
![]() | |
VarRefs< T > | x |
VarRefs< T > | ax |
VarRefs< T > | y |
VarRefs< T > | ay |
![]() | |
size_t | npaths |
ACModule< T > * | path |
![]() | |
stack< vector< T > > | argument_checkpoint |
Top-level adjoint logic of ensemble over evolutions uses default implementation from ACDesignPatterns library;
Definition at line 83 of file MyACEnsemblePathwiseEvolutionRecursiveBisection.hpp.