Adjoint Code Design Patterns
v0.1
U.Naumann
Main Page
Classes
Files
File List
MyACEnsemblePathwiseEvolutionRecursiveBisectionClient.cpp
1
#include<iostream>
2
#include<cassert>
3
#include<cstdlib>
4
using namespace
std
;
5
6
#include "MyACEnsemblePathwiseEvolutionRecursiveBisection.hpp"
7
11
int
main(
int
argc,
char
* argv[]) {
12
assert(argc==4);
13
size_t
p=atoi(argv[1]);
14
size_t
l=atoi(argv[2]);
15
size_t
c=atoi(argv[3]);
16
double
x=2.1, ax=1;
17
MyACEvolutionStepUserData<double>
d;
18
d.p_ref()=1;
19
MyACEnsemblePathwiseEvolutionRecursiveBisection<double>
m(p,l,c,d);
20
m.register_inoutput(x,ax,x,ax);
21
m.evaluate_joint_primal();
22
cout << x << endl;
23
m.evaluate_joint_adjoint();
24
cout << ax << endl;
25
cout << npe << endl;
26
return
0;
27
}
MyACEvolutionStepUserData
Definition:
MyACEnsemblePathwiseEvolutionRecursiveBisection.hpp:12
MyACEnsemblePathwiseEvolutionRecursiveBisection
Definition:
MyACEnsemblePathwiseEvolutionRecursiveBisection.hpp:83
std
Generated by
1.8.9.1