CheckFlow_New Class Reference

#include <CheckFlow_New.h>

Inheritance diagram for CheckFlow_New:

Collaboration diagram for CheckFlow_New:

Public Member Functions
	CheckFlow_New (const std::string &name, ISvcLocator *pSvcLocator)
virtual StatusCode	initialize () override
virtual StatusCode	execute (const EventContext &ctx) override
	Execute method.
virtual StatusCode	finalize () override
virtual StatusCode	sysInitialize () override
	Override sysInitialize.
virtual const DataObjIDColl &	extraOutputDeps () const override
	Return the list of extra output dependencies.
bool	filterPassed (const EventContext &ctx) const
void	setFilterPassed (bool state, const EventContext &ctx) const
ServiceHandle< StoreGateSvc > &	evtStore ()
	The standard StoreGateSvc (event store) Returns (kind of) a pointer to the StoreGateSvc.
const ServiceHandle< StoreGateSvc > &	detStore () const
	The standard StoreGateSvc/DetectorStore Returns (kind of) a pointer to the StoreGateSvc.
virtual StatusCode	sysStart () override
	Handle START transition.
virtual std::vector< Gaudi::DataHandle * >	inputHandles () const override
	Return this algorithm's input handles.
virtual std::vector< Gaudi::DataHandle * >	outputHandles () const override
	Return this algorithm's output handles.
Gaudi::Details::PropertyBase &	declareProperty (Gaudi::Property< T, V, H > &t)
void	updateVHKA (Gaudi::Details::PropertyBase &)
MsgStream &	msg () const
bool	msgLvl (const MSG::Level lvl) const
const EventContext &	getContext () const
	Deprecated methods (use the ones with EventContext).
bool	filterPassed () const
void	setFilterPassed (bool state) const

Public Attributes
	InputCollections
	job = AlgSequence()
	EvtMax
	OutputLevel
	Output
	CheckFlow_New = job.CheckFlow_New
	McEventKey
	RapidityCutMax

Protected Member Functions
virtual bool	isReEntrant () const override final
	Legacy algorithms are not thread-safe.
void	renounceArray (SG::VarHandleKeyArray &handlesArray)
	remove all handles from I/O resolution
std::enable_if_t< std::is_void_v< std::result_of_t< decltype(&T::renounce)(T)> > &&!std::is_base_of_v< SG::VarHandleKeyArray, T > &&std::is_base_of_v< Gaudi::DataHandle, T >, void >	renounce (T &h)
void	extraDeps_update_handler (Gaudi::Details::PropertyBase &ExtraDeps)
	Add StoreName to extra input/output deps as needed.

Private Types
enum	{ n_ptbin =16 , n_etabin =8 }
typedef ServiceHandle< StoreGateSvc >	StoreGateSvc_t

Private Member Functions
Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
	specialization for handling Gaudi::Property<SG::VarHandleKey>

Private Attributes
StringProperty	m_key {this, "McEventKey", "FLOW_EVENT"}
BooleanProperty	m_produceHistogram {this, "HistogramFlag", true}
DoubleProperty	m_bcut_min {this, "ImpactCutMin", 0.}
DoubleProperty	m_bcut_max {this, "ImpactCutMax", 99.}
DoubleProperty	m_ptcut_min {this, "PtCutMin", 0.}
DoubleProperty	m_ptcut_max {this, "PtCutMax", 999999.}
DoubleProperty	m_rapcut_min {this, "RapidityCutMin", 0.}
DoubleProperty	m_rapcut_max {this, "RapidityCutMax", 5.5}
TH1D *	m_hist_Psi_n_true [6] {}
TH1D *	m_hist_Psi_n_reco [6] {}
TH1D *	m_hist_psi_corr_true [36] {}
TH1D *	m_hist_psi_corr_reco [36] {}
TH1D *	m_hist_Psi_n_ebe [6] {}
TH1D *	m_hist_Psi_n_ebe_pt [6] {}
TH1D *	m_hist_vn_ebe [6] {}
TProfile *	m_profile_pt_dep [6][n_etabin] {}
TProfile *	m_profile_eta_dep [6][n_ptbin] {}
TProfile *	m_profile_pt_dep_reco [6][n_etabin] {}
TProfile *	m_profile_eta_dep_reco [6][n_ptbin] {}
TProfile *	m_profile_resolution {}
SG::ReadHandleKey< HijingEventParams >	m_hijingKey {this, "HijingEventParmsKey","Hijing_event_params"}
TruthHelper::GenAccessIO *	m_tesIO {}
DataObjIDColl	m_extendedExtraObjects
StoreGateSvc_t	m_evtStore
	Pointer to StoreGate (event store by default).
StoreGateSvc_t	m_detStore
	Pointer to StoreGate (detector store by default).
std::vector< SG::VarHandleKeyArray * >	m_vhka
bool	m_varHandleArraysDeclared

Detailed Description

Definition at line 28 of file CheckFlow_New.h.

Member Typedef Documentation

StoreGateSvc_t

typedef ServiceHandle<StoreGateSvc> AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::StoreGateSvc_t

privateinherited

Definition at line 388 of file AthCommonDataStore.h.

Member Enumeration Documentation

anonymous enum

anonymous enum

private

Enumerator
n_ptbin
n_etabin

Definition at line 47 of file CheckFlow_New.h.

      {
  n_ptbin=16,
  n_etabin=8
  };

Constructor & Destructor Documentation

CheckFlow_New()

CheckFlow_New::CheckFlow_New	(	const std::string &	name,
		ISvcLocator *	pSvcLocator )

Member Function Documentation

declareGaudiProperty()

Gaudi::Details::PropertyBase & AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::declareGaudiProperty ( Gaudi::Property< T, V, H > & hndl, const SG::VarHandleKeyType &  )

inlineprivateinherited

specialization for handling Gaudi::Property<SG::VarHandleKey>

Definition at line 156 of file AthCommonDataStore.h.

  {
    return *AthCommonDataStore<PBASE>::declareProperty(hndl.name(),
                                                       hndl.value(), 
                                                       hndl.documentation());
 
  }

declareProperty()

Gaudi::Details::PropertyBase & AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::declareProperty ( Gaudi::Property< T, V, H > & t )

inlineinherited

Definition at line 145 of file AthCommonDataStore.h.

                                                                     {
    typedef typename SG::HandleClassifier<T>::type htype;
    return AthCommonDataStore<PBASE>::declareGaudiProperty(t, htype());
  }

detStore()

const ServiceHandle< StoreGateSvc > & AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::detStore ( ) const

inlineinherited

The standard StoreGateSvc/DetectorStore Returns (kind of) a pointer to the StoreGateSvc.

Definition at line 95 of file AthCommonDataStore.h.

{ return m_detStore; }

evtStore()

ServiceHandle< StoreGateSvc > & AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::evtStore ( )

inlineinherited

The standard StoreGateSvc (event store) Returns (kind of) a pointer to the StoreGateSvc.

Definition at line 85 of file AthCommonDataStore.h.

{ return m_evtStore; }

execute()

StatusCode CheckFlow_New::execute ( const EventContext & ctx )

overridevirtual

Execute method.

Provides access to the EventContext if needed but is non-const as opposed to AthReentrantAlgorithm.

Implements AthAlgorithm.

Definition at line 203 of file CheckFlow_New.cxx.

                                                         {
  msg(MSG::INFO) << ">>> CheckFlow_New from execute" << endmsg;
 
  float pt_binvals[n_ptbin+1]={0.0,0.25,0.5,1.0,1.5,2.0,2.5,3.0,3.5,4.0,6.0,8.0,12.0,16.0,20.0,30.0,40.0};
  float eta_bin_max = 4.0;
 
  SG::ReadHandle<HijingEventParams> hijing_pars{m_hijingKey, ctx};
  float b = hijing_pars->get_b();
  float Psi_n[6]{},Psi_n_reco[6]{};
  float Psi_n_reco_pos[6]{},Psi_n_reco_neg[6]{};
  for(int ihar=0;ihar<6;ihar++){Psi_n[ihar]=hijing_pars->get_psi(ihar+1);}
  msg(MSG::INFO)<<"SOUMYA  "<<hijing_pars->get_psi(1)<<"   "<<hijing_pars->get_psi(2)<<"  "<<hijing_pars->get_psi(3)
                                  <<hijing_pars->get_psi(4)<<"   "<<hijing_pars->get_psi(5)<<"  "<<hijing_pars->get_psi(6)<<"    "<<b  << endmsg;
 
 
  // Check cut on impact parameter b
  if(b<m_bcut_min || b>m_bcut_max)  return StatusCode::SUCCESS;
 
  using TrigArr = std::array<double, 6>;
  double ngenerated_pos = 0,ngenerated_pt_pos=0;
  TrigArr cos_n_pos{},sin_n_pos{},cos_n_pt_pos{},sin_n_pt_pos{};
  double ngenerated_neg = 0,ngenerated_pt_neg=0;
  TrigArr cos_n_neg{},sin_n_neg{},cos_n_pt_neg{},sin_n_pt_neg{};
 
 
  // Iterate over all MC particles
  std::vector<HepMC::ConstGenParticlePtr> particles;
  StatusCode stat = m_tesIO->getMC(particles, false, m_key);
  if (stat.isFailure()) {
    msg(MSG::ERROR) << "Could not find " << m_key << endmsg;
    return stat;
  }
  for (auto pitr: particles) {
    int    pid    = pitr->pdg_id();
    double pt     = pitr->momentum().perp();
    double rapid  = pitr->momentum().pseudoRapidity();
    double phi    = pitr->momentum().phi();
    msg(MSG::DEBUG)
       << " PID = " << pid << " Status = " << pitr->status()
       << " Eta = " << rapid << "  Phi = " << phi<< endmsg;
 
    if( (std::abs(rapid) >= m_rapcut_min) && (std::abs(rapid) <= m_rapcut_max) &&
    (std::abs(pt) >= m_ptcut_min) && (std::abs(pt) <= m_ptcut_max) ) {
 
      for(int ihar=0;ihar<6;ihar++){
        float temp=(ihar+1)*(phi-Psi_n[ihar]);
 
        int ieta= (int)(std::abs(rapid)*n_etabin/eta_bin_max);
        if(ieta>=0 && ieta<n_etabin) m_profile_pt_dep [ihar][ieta]->Fill(pt/1000,cos(temp));
 
 
        float temp_pt=pt/1000;
        for(int ipt=0;ipt<n_ptbin;ipt++){
          if(temp_pt<pt_binvals[ipt+1]){
            m_profile_eta_dep[ihar][ipt]->Fill(rapid  ,cos(temp));
            break;
          }
        }
        //
        const auto cosTerm = std::cos(  (ihar+1)*phi);
        const auto sinTerm = std::sin(  (ihar+1)*phi);
        //
        if( rapid >3.2 && rapid< 4.9){
          cos_n_pos[ihar]+=cosTerm;
          sin_n_pos[ihar]+=sinTerm;
          ngenerated_pos++;
 
          cos_n_pt_pos[ihar]+=pt*cosTerm;
          sin_n_pt_pos[ihar]+=pt*sinTerm;
          ngenerated_pt_pos +=pt;
        }
        if( rapid <-3.2 && rapid >-4.9){
          cos_n_neg[ihar]+=cosTerm;
          sin_n_neg[ihar]+=sinTerm;
          ngenerated_neg++;
 
          cos_n_pt_neg[ihar]+=pt*cosTerm;
          sin_n_pt_neg[ihar]+=pt*sinTerm;
          ngenerated_pt_neg +=pt;
        }
 
      }
    }
  }
 
 
// Calculate the event by event vn and also the reconstructed Psi_n angles
// Also make correlation histos between Psi_n_truth and Psi_n_reco
  float cos_n[6]{},sin_n[6]{},cos_n_pt[6]{},sin_n_pt[6]{};
  const auto total = ngenerated_pos+ngenerated_neg;
  const auto nTotalPt =  ngenerated_pt_pos+ngenerated_pt_neg;
  if ((total != 0) and (nTotalPt !=0)) [[likely]]{
    for(int ihar=0;ihar<6;ihar++){
      //coverity[DIVIDE_BY_ZERO:FALSE]
      cos_n[ihar] = ( cos_n_pos[ihar]+ cos_n_neg[ihar] )  /  total;
      //coverity[DIVIDE_BY_ZERO:FALSE]
      sin_n[ihar] = ( sin_n_pos[ihar]+ sin_n_neg[ihar] )  /  total;
  
      float psi_reco=std::atan2(sin_n[ihar],cos_n[ihar])/(ihar+1);
      m_hist_Psi_n_ebe[ihar]->Fill( (ihar+1)*(psi_reco-Psi_n[ihar])  );
      m_hist_vn_ebe   [ihar]->Fill(std::sqrt(cos_n[ihar]*cos_n[ihar] +sin_n[ihar]*sin_n[ihar] ));
  
      Psi_n_reco_pos[ihar]=std::atan2(sin_n_pos[ihar],cos_n_pos[ihar])/ (ihar+1);
      Psi_n_reco_neg[ihar]=std::atan2(sin_n_neg[ihar],cos_n_neg[ihar])/ (ihar+1);
      Psi_n_reco    [ihar]=psi_reco;
  
      //coverity[DIVIDE_BY_ZERO:FALSE]
      cos_n_pt[ihar] = ( cos_n_pt_pos[ihar]+ cos_n_pt_neg[ihar] )  /  nTotalPt;
      //coverity[DIVIDE_BY_ZERO:FALSE]
      sin_n_pt[ihar] = ( sin_n_pt_pos[ihar]+ sin_n_pt_neg[ihar] )  /  nTotalPt;
  
      psi_reco=std::atan2(sin_n_pt[ihar],cos_n_pt[ihar])/(ihar+1);
      m_hist_Psi_n_ebe_pt[ihar]->Fill( (ihar+1)*(psi_reco-Psi_n[ihar])  );
    }
  }
 
// Make the plots for the correlation between Psi_n truth (for different n)  (same for Psi_n reco)
  for(int ihar=0;ihar<6;ihar++){
    m_hist_Psi_n_true[ihar]->Fill((ihar+1)*Psi_n[ihar]);
    m_hist_Psi_n_reco[ihar]->Fill((ihar+1)*Psi_n_reco[ihar]);
 
    float psi1,psi2;
    for(int ihar2=0;ihar2<6;ihar2++){
      psi1=(ihar+1)*Psi_n[ihar];psi2=(ihar2+1)*Psi_n[ihar2];
      m_hist_psi_corr_true[ihar*6+ihar2]->Fill(  std::atan2(  std::sin(psi1-psi2),std::cos(psi1-psi2) )  );
 
      psi1=(ihar+1)*Psi_n_reco[ihar];psi2=(ihar2+1)*Psi_n_reco[ihar2];
      m_hist_psi_corr_reco[ihar*6+ihar2]->Fill( std::atan2(  std::sin(psi1-psi2),std::cos(psi1-psi2) )  );
    }
  }
 
 
 
 
 
// calculate the pt and eta dependence using the Psi_reco angles also fill the resolution TProfile
  for(int ihar=0;ihar<6;ihar++){
    m_profile_resolution->Fill( ihar+1,  cos(  (ihar+1) * (Psi_n_reco_pos[ihar] - Psi_n_reco_neg[ihar]) ) );
  }
  for (auto pitr: particles) {
    double pt     = pitr->momentum().perp();
    double rapid  = pitr->momentum().pseudoRapidity();
    double phi    = pitr->momentum().phi();
    if( (std::abs(rapid) >= m_rapcut_min) && (std::abs(rapid) <= m_rapcut_max) &&
    (std::abs(pt) >= m_ptcut_min) && (std::abs(pt) <= m_ptcut_max) ) {
 
      for(int ihar=0;ihar<6;ihar++){
        float       temp=(ihar+1)*(phi-Psi_n_reco_pos[ihar]);
        if(rapid>0) temp=(ihar+1)*(phi-Psi_n_reco_neg[ihar]);
 
 
        int ieta= (int)(std::abs(rapid)*n_etabin/eta_bin_max);
        if(ieta>=0 && ieta<n_etabin) m_profile_pt_dep_reco [ihar][ieta]->Fill(pt/1000,std::cos(temp));
 
        float temp_pt=pt/1000;
        for(int ipt=0;ipt<n_ptbin;ipt++){
          if(temp_pt<pt_binvals[ipt+1]){
            m_profile_eta_dep_reco[ihar][ipt]->Fill(rapid  ,cos(temp));
            break;
          }
        }
      }
    }
  }
 
 
 
 
 
  return StatusCode::SUCCESS;
}

extraDeps_update_handler()

void AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::extraDeps_update_handler ( Gaudi::Details::PropertyBase & ExtraDeps )

protectedinherited

Add StoreName to extra input/output deps as needed.

use the logic of the VarHandleKey to parse the DataObjID keys supplied via the ExtraInputs and ExtraOuputs Properties to add the StoreName if it's not explicitly given

extraOutputDeps()

const DataObjIDColl & AthAlgorithm::extraOutputDeps ( ) const

overridevirtualinherited

Return the list of extra output dependencies.

This list is extended to include symlinks implied by inheritance relations.

Definition at line 50 of file AthAlgorithm.cxx.

{
  // If we didn't find any symlinks to add, just return the collection
  // from the base class.  Otherwise, return the extended collection.
  if (!m_extendedExtraObjects.empty()) {
    return m_extendedExtraObjects;
  }
  return Algorithm::extraOutputDeps();
}

filterPassed() [1/2]

bool AthAlgorithm::filterPassed ( ) const

inherited

Definition at line 94 of file AthAlgorithm.cxx.

                                      {
  return filterPassed( Gaudi::Hive::currentContext() );
}

filterPassed() [2/2]

bool AthAlgorithm::filterPassed ( const EventContext & ctx ) const

inherited

Definition at line 98 of file AthAlgorithm.cxx.

                                                             {
  return execState( ctx ).filterPassed();
}

finalize()

StatusCode CheckFlow_New::finalize ( )

overridevirtual

Definition at line 375 of file CheckFlow_New.cxx.

                                   {
  msg(MSG::INFO) << ">>> CheckFlow_New from finalize" << endmsg;
 
  return StatusCode::SUCCESS;
}

getContext()

const EventContext & AthAlgorithm::getContext ( ) const

inherited

Deprecated methods (use the ones with EventContext).

Definition at line 90 of file AthAlgorithm.cxx.

                                                   {
  return Gaudi::Hive::currentContext();
}

initialize()

StatusCode CheckFlow_New::initialize ( )

overridevirtual

Definition at line 45 of file CheckFlow_New.cxx.

                                    {
  ATH_CHECK(m_hijingKey.initialize());
 
  ATH_MSG_INFO(">>> CheckFlow_New from Initialize");
 
  float pt_binvals[n_ptbin+1]={0.0,0.25,0.5,1.0,1.5,2.0,2.5,3.0,3.5,4.0,6.0,8.0,12.0,16.0,20.0,30.0,40.0};
  float eta_bin_max = 4.0;
 
 
  SmartIF<ITHistSvc> rootHistSvc{Gaudi::svcLocator()->service("THistSvc")};
  if (!rootHistSvc) {
    ATH_MSG_ERROR( "Unable to locate THistSvc" );
    return StatusCode::FAILURE;
  }
 
  std::string histPath = "/FlowOutPut/";
  char name[100],name1[100];
  for (int ihar=0;ihar<6;ihar++){
 
// /*
    sprintf(name,"hist_Psi_%d_true",ihar+1);
    sprintf(name1,"Truth Psi_{%d} distribution;%dPsi_{%d} Truth;events",ihar+1,ihar+1,ihar+1);
    m_hist_Psi_n_true  [ihar]=new TH1D (name,name1,1000,-M_PI,M_PI);
    if ( rootHistSvc->regHist(histPath+m_hist_Psi_n_true[ihar]->GetName(),m_hist_Psi_n_true[ihar]).isFailure() ){
       msg(MSG::WARNING) << "Can't book "<< histPath+m_hist_Psi_n_true[ihar]->GetName() << endmsg;
    }
    m_hist_Psi_n_true[ihar]->GetXaxis()->CenterTitle();
    m_hist_Psi_n_true[ihar]->GetYaxis()->CenterTitle();
 
    sprintf(name,"hist_Psi_%d_reco",ihar+1);
    sprintf(name1,"Reconstructed Psi_{%d} distribution;%dPsi_{%d} Reco;events",ihar+1,ihar+1,ihar+1);
    m_hist_Psi_n_reco  [ihar]=new TH1D (name,name1,1000,-M_PI,M_PI);
    if ( rootHistSvc->regHist(histPath+m_hist_Psi_n_reco[ihar]->GetName(),m_hist_Psi_n_reco[ihar]).isFailure() ){
       msg(MSG::WARNING) << "Can't book "<< histPath+m_hist_Psi_n_reco[ihar]->GetName() << endmsg;
    }
    m_hist_Psi_n_reco[ihar]->GetXaxis()->CenterTitle();
    m_hist_Psi_n_reco[ihar]->GetYaxis()->CenterTitle();
 
 
    for (int ihar2=0;ihar2<6;ihar2++)
    {
      int ihar_i=ihar*6+ihar2;
 
      sprintf(name,"hist_Psi_corr_true_%d_%d",ihar+1,ihar2+1);
      sprintf(name1,"true Psi_{%d} -Psi_{%d};%dPsi_{%d} -%dPsi_{%d} ;events",ihar+1,ihar2+1,ihar+1,ihar+1,ihar2+1,ihar2+1);
      m_hist_psi_corr_true  [ihar_i]=new TH1D (name,name1,1000,-2*M_PI,2*M_PI);
      if ( rootHistSvc->regHist(histPath+m_hist_psi_corr_true[ihar_i]->GetName(),m_hist_psi_corr_true[ihar_i]).isFailure() ){
         msg(MSG::WARNING) << "Can't book "<< histPath+m_hist_psi_corr_true[ihar_i]->GetName() << endmsg;
      }
      m_hist_psi_corr_true[ihar_i]->GetXaxis()->CenterTitle();
      m_hist_psi_corr_true[ihar_i]->GetYaxis()->CenterTitle();
 
 
      sprintf(name,"hist_Psi_corr_reco_%d_%d",ihar+1,ihar2+1);
      sprintf(name1,"reco Psi_{%d} -Psi_{%d};%dPsi_{%d} -%dPsi_{%d} ;events",ihar+1,ihar2+1,ihar+1,ihar+1,ihar2+1,ihar2+1);
      m_hist_psi_corr_reco  [ihar_i]=new TH1D (name,name1,1000,-2*M_PI,2*M_PI);
      if ( rootHistSvc->regHist(histPath+m_hist_psi_corr_reco[ihar_i]->GetName(),m_hist_psi_corr_reco[ihar_i]).isFailure() ){
         msg(MSG::WARNING) << "Can't book "<< histPath+m_hist_psi_corr_reco[ihar_i]->GetName() << endmsg;
      }
      m_hist_psi_corr_reco[ihar_i]->GetXaxis()->CenterTitle();
      m_hist_psi_corr_reco[ihar_i]->GetYaxis()->CenterTitle();
    }
 
 
 
    //integrated vn event by event
    sprintf(name,"hist_v%d_ebe",ihar+1);
    sprintf(name1,"v%d;v%d;events",ihar+1,ihar+1);
    m_hist_vn_ebe   [ihar]=new TH1D (name,name1,1000,-0.5,0.5);
    if ( rootHistSvc->regHist(histPath+m_hist_vn_ebe[ihar]->GetName(),m_hist_vn_ebe[ihar]).isFailure() ){
       msg(MSG::WARNING) << "Can't book "<< histPath+m_hist_vn_ebe[ihar]->GetName() << endmsg;
    }
    m_hist_vn_ebe[ihar]->GetXaxis()->CenterTitle();
    m_hist_vn_ebe[ihar]->GetYaxis()->CenterTitle();
 
    sprintf(name ,"hist_Psi%d_ebe",ihar+1);
    sprintf(name1,"%d#Delta#Psi;%d(#Psi_{reco}-#Psi_{Truth});events",ihar+1,ihar+1);
    m_hist_Psi_n_ebe [ihar]=new TH1D (name,name1,1000,-M_PI,M_PI);
    if ( rootHistSvc->regHist(histPath+m_hist_Psi_n_ebe[ihar]->GetName(),m_hist_Psi_n_ebe[ihar]).isFailure() ){
      msg(MSG::WARNING) << "Can't book "<< histPath+m_hist_Psi_n_ebe[ihar]->GetName() << endmsg;
    }
    m_hist_Psi_n_ebe[ihar]->GetXaxis()->CenterTitle();
    m_hist_Psi_n_ebe[ihar]->GetYaxis()->CenterTitle();
 
    sprintf(name ,"hist_Psi%d_ebe_pt",ihar+1);
    sprintf(name1,"%d#Delta#Psi (pT weighted);%d(#Psi_{reco}-#Psi_{Truth});events",ihar+1,ihar+1);
    m_hist_Psi_n_ebe_pt [ihar]=new TH1D (name,name1,1000,-M_PI,M_PI);
    if ( rootHistSvc->regHist(histPath+m_hist_Psi_n_ebe_pt[ihar]->GetName(),m_hist_Psi_n_ebe_pt[ihar]).isFailure() ){
      msg(MSG::WARNING) << "Can't book "<< histPath+m_hist_Psi_n_ebe_pt[ihar]->GetName() << endmsg;
    }
    m_hist_Psi_n_ebe_pt[ihar]->GetXaxis()->CenterTitle();
    m_hist_Psi_n_ebe_pt[ihar]->GetYaxis()->CenterTitle();
 
 
 
 
 
 
    for(int ieta=0;ieta<n_etabin;ieta++){
      sprintf(name ,"profile_pt_dep_%d_eta%d" ,ihar+1,ieta);
      sprintf(name1,"v%d vs pT (eta%d);pT;v%d",ihar+1,ieta,ihar+1);
      m_profile_pt_dep [ihar][ieta]=new TProfile (name,name1,n_ptbin,pt_binvals);
      if ( rootHistSvc->regHist(histPath+m_profile_pt_dep[ihar][ieta]->GetName(),m_profile_pt_dep[ihar][ieta]).isFailure() ){
        msg(MSG::WARNING) << "Can't book "<< histPath+m_profile_pt_dep[ihar][ieta]->GetName() << endmsg;
      }
      m_profile_pt_dep [ihar][ieta]->GetXaxis()->CenterTitle();
      m_profile_pt_dep [ihar][ieta]->GetYaxis()->CenterTitle();
    }
 
    for(int ipt=0;ipt<n_ptbin;ipt++){
      sprintf(name ,"profile_eta_dep_%d_pt%d",ihar+1,ipt);
      sprintf(name1,"v%d vs #eta; (ipt%d)#eta;v%d",ihar+1,ipt,ihar+1);
      m_profile_eta_dep [ihar][ipt]=new TProfile (name,name1,2*n_etabin, -eta_bin_max,eta_bin_max);
      if ( rootHistSvc->regHist(histPath+m_profile_eta_dep[ihar][ipt]->GetName(),m_profile_eta_dep[ihar][ipt]).isFailure() ){
        msg(MSG::WARNING) << "Can't book "<< histPath+m_profile_eta_dep[ihar][ipt]->GetName() << endmsg;
      }
      m_profile_eta_dep [ihar][ipt]->GetXaxis()->CenterTitle();
      m_profile_eta_dep [ihar][ipt]->GetYaxis()->CenterTitle();
    }
 
 
    for(int ieta=0;ieta<n_etabin;ieta++){
      sprintf(name ,"profile_pt_dep_reco_%d_eta%d",ihar+1,ieta);
      sprintf(name1,"v%d vs pT (eta%d);pT;v%d",ihar+1,ieta,ihar+1);
      m_profile_pt_dep_reco [ihar][ieta]=new TProfile (name,name1,n_ptbin,pt_binvals);
      if ( rootHistSvc->regHist(histPath+m_profile_pt_dep_reco[ihar][ieta]->GetName(),m_profile_pt_dep_reco[ihar][ieta]).isFailure() ){
        msg(MSG::WARNING) << "Can't book "<< histPath+m_profile_pt_dep_reco[ihar][ieta]->GetName() << endmsg;
      }
      m_profile_pt_dep_reco [ihar][ieta]->GetXaxis()->CenterTitle();
      m_profile_pt_dep_reco [ihar][ieta]->GetYaxis()->CenterTitle();
    }
 
 
    for(int ipt=0;ipt<n_ptbin;ipt++){
      sprintf(name ,"profile_eta_dep_reco_%d_pt%d",ihar+1,ipt);
      sprintf(name1,"v%d vs #eta (pt%d);#eta;v%d",ihar+1,ipt,ihar+1);
      m_profile_eta_dep_reco [ihar][ipt]=new TProfile (name,name1,2*n_etabin, -eta_bin_max,eta_bin_max);
      if ( rootHistSvc->regHist(histPath+m_profile_eta_dep_reco[ihar][ipt]->GetName(),m_profile_eta_dep_reco[ihar][ipt]).isFailure() ){
        msg(MSG::WARNING) << "Can't book "<< histPath+m_profile_eta_dep_reco[ihar][ipt]->GetName() << endmsg;
      }
      m_profile_eta_dep_reco [ihar][ipt]->GetXaxis()->CenterTitle();
      m_profile_eta_dep_reco [ihar][ipt]->GetYaxis()->CenterTitle();
    }
 
 
  }
  m_profile_resolution=new TProfile("profile_resolution","vn resolution;n;resolution",6, 0.5,6.5);
  if(rootHistSvc->regHist(histPath+m_profile_resolution->GetName(),m_profile_resolution).isFailure() ){
    msg(MSG::WARNING) << "Can't book "<< histPath+m_profile_resolution->GetName() << endmsg;
  }
 
  msg(MSG::DEBUG) << "Histograms have been booked " << endmsg;
  m_tesIO = new TruthHelper::GenAccessIO();
  return StatusCode::SUCCESS;
}

inputHandles()

virtual std::vector< Gaudi::DataHandle * > AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::inputHandles ( ) const

overridevirtualinherited

Return this algorithm's input handles.

We override this to include handle instances from key arrays if they have not yet been declared. See comments on updateVHKA.

isReEntrant()

virtual bool AthAlgorithm::isReEntrant ( ) const

inlinefinaloverrideprotectedvirtualinherited

Legacy algorithms are not thread-safe.

Definition at line 111 of file AthAlgorithm.h.

{ return false; }

msg()

MsgStream & AthCommonMsg< Gaudi::Algorithm >::msg ( ) const

inlineinherited

Definition at line 24 of file AthCommonMsg.h.

                                {
    return this->msgStream();
  }

msgLvl()

bool AthCommonMsg< Gaudi::Algorithm >::msgLvl ( const MSG::Level lvl ) const

inlineinherited

Definition at line 30 of file AthCommonMsg.h.

                                               {
    return this->msgLevel(lvl);
  }

outputHandles()

virtual std::vector< Gaudi::DataHandle * > AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::outputHandles ( ) const

overridevirtualinherited

Return this algorithm's output handles.

We override this to include handle instances from key arrays if they have not yet been declared. See comments on updateVHKA.

renounce()

std::enable_if_t< std::is_void_v< std::result_of_t< decltype(&T::renounce)(T)> > &&!std::is_base_of_v< SG::VarHandleKeyArray, T > &&std::is_base_of_v< Gaudi::DataHandle, T >, void > AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::renounce ( T & h )

inlineprotectedinherited

Definition at line 380 of file AthCommonDataStore.h.

  {
    h.renounce();
    PBASE::renounce (h);
  }

renounceArray()

void AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::renounceArray ( SG::VarHandleKeyArray & handlesArray )

inlineprotectedinherited

remove all handles from I/O resolution

Definition at line 364 of file AthCommonDataStore.h.

                                                          {
    handlesArray.renounce();
  }

setFilterPassed() [1/2]

void AthAlgorithm::setFilterPassed ( bool state ) const

inherited

Definition at line 102 of file AthAlgorithm.cxx.

                                                     {
  setFilterPassed( state, Gaudi::Hive::currentContext() );
}

setFilterPassed() [2/2]

void AthAlgorithm::setFilterPassed ( bool state, const EventContext & ctx ) const

inherited

Definition at line 106 of file AthAlgorithm.cxx.

                                                                              {
  execState( ctx ).setFilterPassed(state);
}

sysInitialize()

StatusCode AthAlgorithm::sysInitialize ( )

overridevirtualinherited

Override sysInitialize.

Override sysInitialize from the base class.

Loop through all output handles, and if they're WriteCondHandles, automatically register them and this Algorithm with the CondSvc.

Scan through all outputHandles, and if they're WriteCondHandles, register them with the CondSvc

Reimplemented from AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >.

Reimplemented in AthAnalysisAlgorithm, AthFilterAlgorithm, AthHistogramAlgorithm, and PyAthena::Alg.

Definition at line 66 of file AthAlgorithm.cxx.

                                       {
  StatusCode sc=AthCommonDataStore<AthCommonMsg<Algorithm>>::sysInitialize();
 
  if (sc.isFailure()) {
    return sc;
  }
  ServiceHandle<ICondSvc> cs("CondSvc",name());
  for (auto h : outputHandles()) {
    if (h->isCondition() && h->mode() == Gaudi::DataHandle::Writer) {
      // do this inside the loop so we don't create the CondSvc until needed
      if ( cs.retrieve().isFailure() ) {
        ATH_MSG_WARNING("no CondSvc found: won't autoreg WriteCondHandles");
        return StatusCode::SUCCESS;
      }
      if (cs->regHandle(this,*h).isFailure()) {
        sc = StatusCode::FAILURE;
        ATH_MSG_ERROR("unable to register WriteCondHandle " << h->fullKey()
                      << " with CondSvc");
      }
    }
  }
  return sc;
}

sysStart()

virtual StatusCode AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::sysStart ( )

overridevirtualinherited

Handle START transition.

We override this in order to make sure that conditions handle keys can cache a pointer to the conditions container.

updateVHKA()

void AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::updateVHKA ( Gaudi::Details::PropertyBase & )

inlineinherited

Definition at line 308 of file AthCommonDataStore.h.

                                               {
    // debug() << "updateVHKA for property " << p.name() << " " << p.toString() 
    //         << "  size: " << m_vhka.size() << endmsg;
    for (auto &a : m_vhka) {
      std::vector<SG::VarHandleKey*> keys = a->keys();
      for (auto k : keys) {
        k->setOwner(this);
      }
    }
  }

Member Data Documentation

CheckFlow_New

CheckFlow_New.CheckFlow_New = job.CheckFlow_New

Todo

Migrate to a GenBase class or at least AthAlgorithm

Definition at line 54 of file CheckFlow_New.py.

EvtMax

CheckFlow_New.EvtMax

Definition at line 38 of file CheckFlow_New.py.

InputCollections

CheckFlow_New.InputCollections

Definition at line 16 of file CheckFlow_New.py.

job

CheckFlow_New.job = AlgSequence()

Definition at line 30 of file CheckFlow_New.py.

m_bcut_max

DoubleProperty CheckFlow_New::m_bcut_max {this, "ImpactCutMax", 99.}

private

Definition at line 41 of file CheckFlow_New.h.

{this, "ImpactCutMax", 99.};

m_bcut_min

DoubleProperty CheckFlow_New::m_bcut_min {this, "ImpactCutMin", 0.}

private

Definition at line 40 of file CheckFlow_New.h.

{this, "ImpactCutMin", 0.};

m_detStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::m_detStore

privateinherited

Pointer to StoreGate (detector store by default).

Definition at line 393 of file AthCommonDataStore.h.

m_evtStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::m_evtStore

privateinherited

Pointer to StoreGate (event store by default).

Definition at line 390 of file AthCommonDataStore.h.

m_extendedExtraObjects

DataObjIDColl AthAlgorithm::m_extendedExtraObjects

privateinherited

Definition at line 114 of file AthAlgorithm.h.

m_hijingKey

SG::ReadHandleKey<HijingEventParams> CheckFlow_New::m_hijingKey {this, "HijingEventParmsKey","Hijing_event_params"}

private

Definition at line 69 of file CheckFlow_New.h.

{this, "HijingEventParmsKey","Hijing_event_params"};

m_hist_psi_corr_reco

TH1D* CheckFlow_New::m_hist_psi_corr_reco[36] {}

private

Definition at line 56 of file CheckFlow_New.h.

{};

m_hist_psi_corr_true

TH1D* CheckFlow_New::m_hist_psi_corr_true[36] {}

private

Definition at line 55 of file CheckFlow_New.h.

{};

m_hist_Psi_n_ebe

TH1D* CheckFlow_New::m_hist_Psi_n_ebe[6] {}

private

Definition at line 58 of file CheckFlow_New.h.

{};

m_hist_Psi_n_ebe_pt

TH1D* CheckFlow_New::m_hist_Psi_n_ebe_pt[6] {}

private

Definition at line 59 of file CheckFlow_New.h.

{};

m_hist_Psi_n_reco

TH1D* CheckFlow_New::m_hist_Psi_n_reco[6] {}

private

Definition at line 54 of file CheckFlow_New.h.

{};

m_hist_Psi_n_true

TH1D* CheckFlow_New::m_hist_Psi_n_true[6] {}

private

Definition at line 53 of file CheckFlow_New.h.

{};

m_hist_vn_ebe

TH1D* CheckFlow_New::m_hist_vn_ebe[6] {}

private

Definition at line 60 of file CheckFlow_New.h.

{};

m_key

StringProperty CheckFlow_New::m_key {this, "McEventKey", "FLOW_EVENT"}

private

Definition at line 37 of file CheckFlow_New.h.

{this, "McEventKey", "FLOW_EVENT"};

m_produceHistogram

BooleanProperty CheckFlow_New::m_produceHistogram {this, "HistogramFlag", true}

private

Definition at line 38 of file CheckFlow_New.h.

{this, "HistogramFlag", true};

m_profile_eta_dep

TProfile* CheckFlow_New::m_profile_eta_dep[6][n_ptbin] {}

private

Definition at line 63 of file CheckFlow_New.h.

{};

m_profile_eta_dep_reco

TProfile* CheckFlow_New::m_profile_eta_dep_reco[6][n_ptbin] {}

private

Definition at line 65 of file CheckFlow_New.h.

{};

m_profile_pt_dep

TProfile* CheckFlow_New::m_profile_pt_dep[6][n_etabin] {}

private

Definition at line 62 of file CheckFlow_New.h.

{};

m_profile_pt_dep_reco

TProfile* CheckFlow_New::m_profile_pt_dep_reco[6][n_etabin] {}

private

Definition at line 64 of file CheckFlow_New.h.

{};

m_profile_resolution

TProfile* CheckFlow_New::m_profile_resolution {}

private

Definition at line 67 of file CheckFlow_New.h.

{};

m_ptcut_max

DoubleProperty CheckFlow_New::m_ptcut_max {this, "PtCutMax", 999999.}

private

Definition at line 43 of file CheckFlow_New.h.

{this, "PtCutMax", 999999.};

m_ptcut_min

DoubleProperty CheckFlow_New::m_ptcut_min {this, "PtCutMin", 0.}

private

Definition at line 42 of file CheckFlow_New.h.

{this, "PtCutMin", 0.};

m_rapcut_max

DoubleProperty CheckFlow_New::m_rapcut_max {this, "RapidityCutMax", 5.5}

private

Definition at line 45 of file CheckFlow_New.h.

{this, "RapidityCutMax", 5.5};

m_rapcut_min

DoubleProperty CheckFlow_New::m_rapcut_min {this, "RapidityCutMin", 0.}

private

Definition at line 44 of file CheckFlow_New.h.

{this, "RapidityCutMin", 0.};

m_tesIO

TruthHelper::GenAccessIO* CheckFlow_New::m_tesIO {}

private

Definition at line 70 of file CheckFlow_New.h.

{};

m_varHandleArraysDeclared

bool AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::m_varHandleArraysDeclared

privateinherited

Definition at line 399 of file AthCommonDataStore.h.

m_vhka

std::vector<SG::VarHandleKeyArray*> AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::m_vhka

privateinherited

Definition at line 398 of file AthCommonDataStore.h.

McEventKey

CheckFlow_New.McEventKey

Definition at line 55 of file CheckFlow_New.py.

Output

CheckFlow_New.Output

Definition at line 47 of file CheckFlow_New.py.

OutputLevel

CheckFlow_New.OutputLevel

Definition at line 39 of file CheckFlow_New.py.

RapidityCutMax

CheckFlow_New.RapidityCutMax

Definition at line 56 of file CheckFlow_New.py.

---

The documentation for this class was generated from the following files:

• CheckFlow_New.h
• CheckFlow_New.py
• CheckFlow_New.cxx