dqm_algorithms::MUCTPISLAnyHit Class Reference

#include <MUCTPISLAnyHit.h>

Inheritance diagram for dqm_algorithms::MUCTPISLAnyHit:

Collaboration diagram for dqm_algorithms::MUCTPISLAnyHit:

Public Member Functions
	MUCTPISLAnyHit ()
virtual	~MUCTPISLAnyHit ()=default
virtual dqm_core::Algorithm *	clone ()
virtual dqm_core::Result *	execute (const std::string &name, const TObject &data, const dqm_core::AlgorithmConfig &config)
virtual void	printDescription (std::ostream &out)

Private Attributes
std::string	m_name

Detailed Description

Definition at line 15 of file MUCTPISLAnyHit.h.

Constructor & Destructor Documentation

MUCTPISLAnyHit()

dqm_algorithms::MUCTPISLAnyHit::MUCTPISLAnyHit

(

)

Definition at line 34 of file MUCTPISLAnyHit.cxx.

  : m_name("MUCTPISLAnyHit")
{
  dqm_core::AlgorithmManager::instance().registerAlgorithm( m_name, this );
}

~MUCTPISLAnyHit()

virtual dqm_algorithms::MUCTPISLAnyHit::~MUCTPISLAnyHit ( )

virtualdefault

Member Function Documentation

clone()

dqm_core::Algorithm * dqm_algorithms::MUCTPISLAnyHit::clone ( )

virtual

Definition at line 41 of file MUCTPISLAnyHit.cxx.

{
  return new MUCTPISLAnyHit(*this);
}

execute()

dqm_core::Result * dqm_algorithms::MUCTPISLAnyHit::execute ( const std::string &  name, const TObject &  data, const dqm_core::AlgorithmConfig &  config  )

virtual

Definition at line 48 of file MUCTPISLAnyHit.cxx.

{
  using namespace std;
 
  const TH2 *hist{};
  
  //ensure that input histo is 2D
  if( object.IsA()->InheritsFrom( "TH2" ) ) {
    hist = static_cast<const TH2 *>(&object);
    if (hist->GetDimension() != 2 ){
      throw dqm_core::BadConfig( ERS_HERE, name, "dimension != 2 " );
    }
  } else {
    throw dqm_core::BadConfig( ERS_HERE, name, "does not inherit from TH2" );
  }   
 
  //Get Parameters and Thresholds
  double thresh=0.1;
 
  try {
      thresh     = dqm_algorithms::tools::GetFirstFromMap("thresh", config.getParameters(), 0.1);
  }
  catch ( dqm_core::Exception & ex ) {
    throw dqm_core::BadConfig( ERS_HERE, name, ex.what(), ex );
  }
 
 //Algo
 
  //project our 2D histogram to 1D (on the y-axis), thus summing up along x
  TH1* projection = hist->ProjectionY();
 
  dqm_core::Result* result = new dqm_core::Result();
  std::map<std::string,double> tags; //defined in https://gitlab.cern.ch/atlas-tdaq-software/dqm_core/-/blob/master/dqm_core/Result.h
 
  //assume all good, until find a bad one
  result->status_ = dqm_core::Result::Green;
  uint howmanybad=0;
 
  for(int iBin=1;iBin<=projection->GetNbinsX();iBin++)//foreach bin of the projection (0=underflow)
  {
      if( projection->GetBinContent(iBin) < thresh  ) //if bin content less than algorithm threshold => bad
      {
          result->status_ = dqm_core::Result::Yellow;
          howmanybad++;
      }
  }
  tags["howmanybad"] = howmanybad;
 
  //set the result tags
  result->tags_ = std::move(tags);
 
  // Return the result
  return result;
}

printDescription()

void dqm_algorithms::MUCTPISLAnyHit::printDescription ( std::ostream &  out )

virtual

Definition at line 105 of file MUCTPISLAnyHit.cxx.

                                               {
  std::string message;
  message += "\n";
  message += "Algorithm: \"" + m_name + "\"\n";
  message += "Description: Makes the ProjectionY of the 2D input histo. If any bin content is below the given threshold => warning.\n";
  message += "Optional Parameters: thresh = if any bin content in the ProjectionY is below this value => warning\n";
  out << message;
}

Member Data Documentation

m_name

std::string dqm_algorithms::MUCTPISLAnyHit::m_name

private

Definition at line 27 of file MUCTPISLAnyHit.h.

---

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

• MUCTPISLAnyHit.h
• MUCTPISLAnyHit.cxx