ATLAS Offline Software
Loading...
Searching...
No Matches
Public Member Functions | Private Attributes | List of all members
dqm_algorithms::BinDump Class Reference

#include <BinDump.h>

Inheritance diagram for dqm_algorithms::BinDump:
Collaboration diagram for dqm_algorithms::BinDump:

Public Member Functions

 BinDump ()
virtual ~BinDump ()
virtual dqm_core::Algorithm * clone ()
virtual dqm_core::Result * execute (const std::string &name, const TObject &object, const dqm_core::AlgorithmConfig &config)
virtual void printDescription (std::ostream &out)

Private Attributes

std::string m_name

Detailed Description

Definition at line 16 of file BinDump.h.

Constructor & Destructor Documentation

◆ BinDump()

dqm_algorithms::BinDump::BinDump ( )

Definition at line 37 of file BinDump.cxx.

39 : m_name("BinDump")
40{
41 dqm_core::AlgorithmManager::instance().registerAlgorithm( m_name, this );
42}
dqm_algorithms::BinDump::m_name
std::string m_name
Definition BinDump.h:29

◆ ~BinDump()

dqm_algorithms::BinDump::~BinDump ( )
virtual

Definition at line 45 of file BinDump.cxx.

47{
48}

Member Function Documentation

◆ clone()

dqm_core::Algorithm * dqm_algorithms::BinDump::clone ( )
virtual

Definition at line 52 of file BinDump.cxx.

54{
55 return new BinDump(*this);
56}
dqm_algorithms::BinDump::BinDump
BinDump()
Definition BinDump.cxx:38

◆ execute()

dqm_core::Result * dqm_algorithms::BinDump::execute ( const std::string & name,
const TObject & object,
const dqm_core::AlgorithmConfig & config )
virtual

Definition at line 60 of file BinDump.cxx.

62{
63 const TH1 * histogram;
64
65 if( object.IsA()->InheritsFrom( "TH1" ) ) {
66 histogram = static_cast<const TH1*>(&object);
67 if (histogram->GetDimension() > 2 ){
68 throw dqm_core::BadConfig( ERS_HERE, name, "dimension > 2 " );
69 }
70 } else {
71 throw dqm_core::BadConfig( ERS_HERE, name, "does not inherit from TH1" );
72 }
73
74 int binStart, binEnd;
75 int method;
76 double gmin;
77 double rmin;
78 try {
79 binStart = (int) dqm_algorithms::tools::GetFirstFromMap("BinStart", config.getParameters() );
80 binEnd = (int) dqm_algorithms::tools::GetFirstFromMap("BinEnd", config.getParameters() );
81 method = (int) dqm_algorithms::tools::GetFirstFromMap("Method", config.getParameters() );
82 rmin = dqm_algorithms::tools::GetFromMap( "NEntries", config.getRedThresholds());
83 gmin = dqm_algorithms::tools::GetFromMap( "NEntries", config.getGreenThresholds() );
84 }
85 catch ( dqm_core::Exception & ex ) {
86 throw dqm_core::BadConfig( ERS_HERE, name, ex.what(), ex );
87 }
88
89 if (rmin < gmin) {
90 std::swap(rmin, gmin);
91 }
92
93 double count = 0;
94 int nbinx = histogram -> GetNbinsX();
95 int nbiny = histogram -> GetNbinsY();
96 if(binStart>binEnd) {
97 binStart= 1;
98 binEnd = histogram -> GetNbinsX();
99 }
100 int binSize = binEnd-binStart+1;
101
102 std::vector<double> contents(binSize);
103 //contents.resize(binSize);
104 for(int i=0;i<binSize;i++) {
105 int binx = binStart+i;
106 contents[i]=0;
107 for ( int j = 1; j <= nbiny; ++j ) {
108 double content= histogram -> GetBinContent(binx,j);
109 contents[i]+=content;
110 count+=content;
111 }
112 }
113
114 ERS_DEBUG(1,"Number of entries for bins is "
115<< count );
116 ERS_DEBUG(1,"Green: "<< gmin << " entries; Red: " << rmin << " entries ");
117
118
119 const TAxis *axis = histogram->GetXaxis();
120 dqm_core::Result* result = new dqm_core::Result();
121 if(axis) {
122 for(int i=0;i<binSize;i++) {
123 char tag[256];
124 const char *label;
125 if(binStart+i==0) sprintf(tag,"Underflows");
126 else if(binStart+i==nbinx+1) sprintf(tag,"Overflows");
127 else {
128 label=axis->GetBinLabel(binStart+i);
129 // remove space in names to help handy.py
130 if(label) {
131 int l=strlen(label);
132 int j=0;
133
134 char *mylabel=new char[l+1];
135 if(mylabel) {
136 for(int k=0;k<l;k++)
137 if(label[k]!=' ') mylabel[j++]=label[k];
138 mylabel[j]='\0';
139 if (mylabel[0]!=0) sprintf(tag,"%s",mylabel);
140 else sprintf(tag,"Bin%d",binStart+i);
141 delete[] mylabel;
142 }
143 else sprintf(tag,"Bin%d",binStart+i);
144 }
145 else sprintf(tag,"Bin%d",binStart+i);
146 }
147 result->tags_[tag] = contents[i];
148 }
149 } else {
150 for(int i=0;i<binSize;i++) {
151 char tag[256];
152 if(binStart+i==0) sprintf(tag,"Underflows");
153 else if(binStart+i==nbinx+1) sprintf(tag,"Overflows");
154 else sprintf(tag,"Bin%d",binStart+i);
155 result->tags_[tag] = contents[i];
156 }
157 }
158
159 if(method==0) { // Check on bin sums
160 if ( count <= gmin ) {
161 result->status_ = dqm_core::Result::Green;
162 } else if ( count > rmin ) {
163 result->status_ = dqm_core::Result::Red;
164 } else {
165 result->status_ = dqm_core::Result::Yellow;
166 }
167 result->tags_["Total"] = count;
168 }
169 else if(method>0) { // Check on maximum bin
170 count = 0;
171 for(int i=0;i<binSize;i++) {
172 if(contents[i]>count) count = contents[i];
173 }
174 if ( count <= gmin ) {
175 result->status_ = dqm_core::Result::Green;
176 } else if ( count > rmin ) {
177 result->status_ = dqm_core::Result::Red;
178 } else {
179 result->status_ = dqm_core::Result::Yellow;
180 }
181 result->tags_["Highest"] = count;
182 }
183 else if(method<0) { // Check on minimum bin
184 count = 1e30;
185 for(int i=0;i<binSize;i++) {
186 if(contents[i]<count) count = contents[i];
187 }
188 if ( count <= gmin ) {
189 result->status_ = dqm_core::Result::Green;
190 } else if ( count > rmin ) {
191 result->status_ = dqm_core::Result::Red;
192 } else {
193 result->status_ = dqm_core::Result::Yellow;
194 }
195 result->tags_["Lowest"] = count;
196 }
197
198 return result;
199}
histogram
std::string histogram
Definition chains.cxx:52
contents
void contents(std::vector< std::string > &keys, TDirectory *td, const std::string &directory, const std::string &pattern, const std::string &path)
Definition computils.cxx:321
count
int count(std::string s, const std::string &regx)
count how many occurances of a regx are in a string
Definition hcg.cxx:146
label
std::string label(const std::string &format, int i)
Definition label.h:19
CaloCondBlobAlgs_fillNoiseFromASCII.tag
str tag
Definition CaloCondBlobAlgs_fillNoiseFromASCII.py:23
PrintTrkAnaSummary.l
l
Printing final latex table to .tex output file.
Definition PrintTrkAnaSummary.py:370
dqm_algorithms::tools::GetFirstFromMap
double GetFirstFromMap(const std::string &paramName, const std::map< std::string, double > &params)
Definition AlgorithmHelper.cxx:339
dqm_algorithms::tools::GetFromMap
const T & GetFromMap(const std::string &pname, const std::map< std::string, T > &params)
Definition AlgorithmHelper.h:114
get_generator_info.result
result
Definition get_generator_info.py:21
grepfile.content
str content
Definition grepfile.py:56
python.base_data.config
config
Definition base_data.py:20
std::swap
void swap(ElementLinkVector< DOBJ > &lhs, ElementLinkVector< DOBJ > &rhs)
Definition AthLinks/ElementLinkVector.h:485
yodamerge_tmp.axis
list axis
Definition yodamerge_tmp.py:241
IsA
#define IsA
Declare the TObject style functions.
Definition xAODTEventBranch.h:59

◆ printDescription()

void dqm_algorithms::BinDump::printDescription ( std::ostream & out)
virtual

Definition at line 203 of file BinDump.cxx.

205{
206 std::string message;
207 message += "\n";
208 message += "Algorithm: \"" + m_name + "\"\n";
209 message += "Description: Check the number of entries in listed bins\n";
210 message += "Parameters: BinStart first bin to be checked (0=underflows)\n";
211 message += " BinEnd last bin to be checked (nbin+1=overflows)\n";
212 message += " Method=0 check is performed on bin sum\n";
213 message += " Method<0 check is performed on lowest bin\n";
214 message += " Method>0 check is performed on highest bin\n";
215 message += " Nentries Green/Red minimums";
216 message += "\n";
217
218 out << message;
219}

Member Data Documentation

◆ m_name

std::string dqm_algorithms::BinDump::m_name
private

Definition at line 29 of file BinDump.h.

The documentation for this class was generated from the following files:
Generated on for ATLAS Offline Software by doxygen 1.14.0