TTemporalTree.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 TTEMPORALTREE_H
#define TTEMPORALTREE_H
 
// ROOT
#include "TROOT.h"
#include "TTree.h"
#include "TNamed.h"
 
// Uranie
#include "DataServer.h"
#include "TDataServer.h"
 
namespace URANIE
{
namespace DataServer
{
class TTemporalTree : public TNamed {
 
private:
    TString        _sIter;              // The iterator attribute
    TString        _sTime;              // The time attribute    (nT \eq 1)
    TString        _sY;                 // The output attribute  (nY \eq 1)
    TString         _sXs;               // The vector of X attributes (nX \leq 1)
    TList * _lstOfYTAttributes;         // The list of Output (Y) and Time(T) attributes
    TList * _lstOfXAttributes;          // The list of X attributes
    TString         _sAdditional;       // The additional attribute to store
    Bool_t          _bHaveAdditionnal;  // Boolean if have additional attribute
    Bool_t          _bHaveXs;           // Boolean if have nX attributes
    Bool_t _bdrawProgressBar;           // Boolean to know if the progress bar has to be drawn
 
    TTree *        _tTree;              //-> TTree contain vector of time values and of sY values
    TTree *        _tStatTree;          //-> TTree contain vector of time values and of sY values
    TDataServer *  _tds;                // Pointer to a TDS
    Int_t          _nNMaxTime;          // The maximun number of time
    Int_t          _nNMinTime;          // The minimum number of time
    Bool_t         _blog;               // Log printing.
public:
    //---------------------------------------------
    TTemporalTree();
    TTemporalTree(TDataServer *tds, TString stime, TString sy, TString sXs = "");
   virtual ~TTemporalTree();
 
    //---------------------------------------------
   Bool_t buildTree(Option_t *option = "");
   void draw(Option_t *option = "");
 
   //---------------------------------------------
   void setIterator(TString siter);
   TString getIterator() { return _sIter;}
   Int_t getNMinTime() { return _nNMinTime;}
   Int_t getNMaxTime() { return _nNMaxTime;}
   TTree * getTTree();
   TTree * getStatTree();
   void setAdditinalAttribute(TString sname);
   TString getAdditinalAttribute() { return _sAdditional; }
 
   //---------------------------------------------
 
   void setDrawProgressBar(Bool_t bbool = kTRUE)
   {
       _bdrawProgressBar = bbool;
   }
 
 
   Bool_t getDrawProgressBar()
   {
       return _bdrawProgressBar;
   }
 
   //---------------------------------------------
   void setLog()
   {
       _blog = kTRUE;
   }
   void unsetLog()
   {
       _blog = kFALSE;
   }
   void changeLog()
   {
       _blog = _blog ? kFALSE : kTRUE;
   }
   Bool_t getLog()
   {
       return _blog;
   }
   virtual void printLog();
 
   ClassDef(URANIE::DataServer::TTemporalTree, ID_DATASERVER)  //TTemporalAttribute structure
};
 
} // Fin du namespace DataServer
} // Fin du namespace URANIE
#endif  // TTEMPORALTREE_H