32#ifndef __VIZIR_SHARE__
33#define __VIZIR_SHARE__
40#include "Reoptimizer.h"
43#include "TDataServer.h"
64 void nodecode(Double_t *code, Double_t *phys);
65 void decode(Double_t *code, Double_t *phys);
66 void fillChoice(vector<URANIE::DataServer::UEntry*> *all,
double *out);
67 vector<URANIE::DataServer::UEntry *> *
fillData( vector<URANIE::DataServer::UEntry*> *in,
68 vector<URANIE::DataServer::UEntry*> *out);
69 void fillTrace(vector<URANIE::DataServer::UEntry*> *in,
70 vector<URANIE::DataServer::UEntry*> *out,
71 vector<URANIE::DataServer::UEntry*> *all);
73 void fill(
struct vzragent *ag);
74 void fill(
struct vzragent *ag,
int &decal);
objectifs et contraintes standards
methodes communes aux algo d optimisation
classe abstraite et racine pour les solvers de Vizir
Definition TOptimFit.h:48
Definition TOptimShare.h:53
Definition TVizirShare.h:54
int _obj
Definition TVizirShare.h:56
TVizirSolver * _solv
Definition TVizirShare.h:59
virtual ~TVizirShare()
Definition TVizirShare.cxx:70
TObjArray _crit
Definition TVizirShare.h:58
void decode(Double_t *code, Double_t *phys)
Definition TVizirShare.cxx:124
TMatrixD _minmax
Definition TVizirShare.h:57
virtual void addObjective(URANIE::DataServer::TAttribute *, TOptimFit *f=NULL)
Definition TVizirShare.cxx:108
void setFixedSeed()
Definition TVizirShare.cxx:102
vector< URANIE::DataServer::UEntry * > * fillData(vector< URANIE::DataServer::UEntry * > *in, vector< URANIE::DataServer::UEntry * > *out)
Definition TVizirShare.cxx:162
void fillTrace(vector< URANIE::DataServer::UEntry * > *in, vector< URANIE::DataServer::UEntry * > *out, vector< URANIE::DataServer::UEntry * > *all)
Definition TVizirShare.cxx:177
void fillChoice(vector< URANIE::DataServer::UEntry * > *all, double *out)
Definition TVizirShare.cxx:146
void build()
Definition TVizirShare.cxx:80
int _valid
Definition TVizirShare.h:56
void fill(struct vzragent *ag)
Definition TVizirShare.cxx:199
void nodecode(Double_t *code, Double_t *phys)
Definition TVizirShare.cxx:117
Definition TVizirSolver.h:66