#include <CountsBinsGreaterThan.h>
◆ CountsBinsGreaterThan()
dqm_algorithms::CountsBinsGreaterThan::CountsBinsGreaterThan |
( |
| ) |
|
◆ ~CountsBinsGreaterThan()
dqm_algorithms::CountsBinsGreaterThan::~CountsBinsGreaterThan |
( |
| ) |
|
|
virtual |
◆ clone()
dqm_core::Algorithm * dqm_algorithms::CountsBinsGreaterThan::clone |
( |
| ) |
|
|
virtual |
◆ execute()
dqm_core::Result * dqm_algorithms::CountsBinsGreaterThan::execute |
( |
const std::string & |
name, |
|
|
const TObject & |
object, |
|
|
const dqm_core::AlgorithmConfig & |
config |
|
) |
| |
|
virtual |
Definition at line 55 of file DataQuality/dqm_algorithms/src/CountsBinsGreaterThan.cxx.
60 if(
object.
IsA()->InheritsFrom(
"TH1" ) ) {
63 throw dqm_core::BadConfig( ERS_HERE,
name,
"dimension > 2 " );
66 throw dqm_core::BadConfig( ERS_HERE,
name,
"does not inherit from TH1" );
80 catch ( dqm_core::Exception & ex ) {
81 throw dqm_core::BadConfig( ERS_HERE,
name, ex.what(), ex );
92 int binSize = binEnd-binStart+1;
96 for(
int i=0;
i<binSize;
i++) {
97 int binx = binStart+
i;
99 for (
int j = 1; j <= nbiny; ++j ) {
107 ERS_DEBUG(1,
"Number of entries for bins is "<<
count );
108 ERS_DEBUG(1,
"Green: "<< gmin <<
" entries; Red: " << rmin <<
" entries ");
114 if (
count >= gmin ) {
116 }
else if (
count > rmin ) {
117 result->status_ = dqm_core::Result::Yellow;
◆ printDescription()
void dqm_algorithms::CountsBinsGreaterThan::printDescription |
( |
std::ostream & |
out | ) |
|
|
virtual |
◆ m_name
std::string dqm_algorithms::CountsBinsGreaterThan::m_name |
|
private |
The documentation for this class was generated from the following files:
void contents(std::vector< std::string > &keys, TDirectory *td, const std::string &directory, const std::string &pattern, const std::string &path)