TMultiGenCode.h

Go to the documentation of this file.

// Copyright (C) 2013-2024 CEA/DES
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as published
// by the Free Software Foundation, either version 3 of the License, or any
// later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with this program. If not, see <http://www.gnu.org/licenses/>.
// $Id$
// $Author$
// $Date$
// $Revision
// $State$

#ifndef TMULTIGENCODE_H
#define TMULTIGENCODE_H

// ROOT
#include "Math/IFunction.h"
#include "TH1.h"
#include "TF1.h"
#include "TFile.h"
#include "TNtupleD.h"
#include "TTreeFormula.h"
#include "TPad.h"
#include "TRandom3.h"
#include "TStyle.h"

#include <vector>
#include <iostream>

// URANIE
#include "Optimizer.h"
#include "TCode.h"
#include "TDataServer.h"

namespace URANIE
{
namespace Optimizer
{
class TMultiGenCode: public ROOT::Math::IBaseFunctionMultiDim
{

public:
    //---------------------------------------------
    TMultiGenCode(URANIE::DataServer::TDataServer *tds,
            URANIE::Launcher::TCode *code, TString scost);
    ~TMultiGenCode();

    //---------------------------------------------
    void init();
    void clean();

    //---------------------------------------------
    TMultiGenCode * Clone() const
    {
        return new TMultiGenCode(_tds, _code, _sCost);
    }

    unsigned int NDim() const
    {
        return _ninput;
    }
    
    //---------------------------------------------
    void setLog()
    {
        _blog = kTRUE;
    }
    void unsetLog()
    {
        _blog = kFALSE;
    }
    
    void changeLog()
    {
        _blog = _blog ? kFALSE : kTRUE;
    }
    Bool_t getLog()
    {
        return _blog;
    }
    
    void doNotSaveSteps()
    {
        _bintermedstep = true;
    }
    

private:
    //---------------------------------------------
    double DoEval(const double * x) const;

    Bool_t _blog;                            
    int _ninput;
    TString _sinput;                          
    double *_dinputValue;
    double *_xin, *_codevalue;
    int *_codeindex ;
    int _noutput;
    int _ninformula;
    int _noutformula;
    TString _soutput;                         
    double * _doutputValue;                       
    TString _sCost; 
    Int_t _nCost; 
    URANIE::DataServer::TDataServer *_tds;              
    URANIE::Launcher::TCode *_code;    
    TNtupleD *_informTree; 
    vector<TTreeFormula*> _vinForm;
    bool _bintermedstep;
    
    ClassDef(URANIE::Optimizer::TMultiGenCode, ID_OPTIMIZER)
    //Classe de

};
} // Fin du namespace Optimizer
} // Fin du namespace URANIE

R__EXTERN URANIE::Optimizer::TMultiGenCode *gTMGC;

#endif