CMS 3D CMS Logo

MEtoMEComparitor.cc
Go to the documentation of this file.
1 // -*- C++ -*-
2 //
3 // Package: MEtoMEComparitor
4 // Class: MEtoMEComparitor
5 //
13 //
14 // Original Author: jean-roch Vlimant,40 3-A28,+41227671209,
15 // Created: Tue Nov 30 18:55:50 CET 2010
16 //
17 //
18 
19 #include <iostream>
20 #include "MEtoMEComparitor.h"
21 
22 #include "classlib/utils/StringList.h"
23 #include "classlib/utils/StringOps.h"
26 
28 
29 {
30  _moduleLabel = iConfig.getParameter<std::string>("MEtoEDMLabel");
31 
32  _lumiInstance = iConfig.getParameter<std::string>("lumiInstance");
33  _runInstance = iConfig.getParameter<std::string>("runInstance");
34 
35  _process_ref = iConfig.getParameter<std::string>("processRef");
36  _process_new = iConfig.getParameter<std::string>("processNew");
37 
38  _autoProcess=iConfig.getParameter<bool>("autoProcess");
39 
40  _KSgoodness = iConfig.getParameter<double>("KSgoodness");
41  _diffgoodness = iConfig.getParameter<double>("Diffgoodness");
42  _dirDepth = iConfig.getParameter<unsigned int>("dirDepth");
43  _overallgoodness = iConfig.getParameter<double>("OverAllgoodness");
44 
46 
47 
48 }
49 
50 
52 
53 void
55 {
56 
57  compare<edm::LuminosityBlock,TH1S>(iLumi,_lumiInstance);
58  compare<edm::LuminosityBlock,TH1F>(iLumi,_lumiInstance);
59  compare<edm::LuminosityBlock,TH1D>(iLumi,_lumiInstance);
60 }
61 
62 void
64 {
65  if (_autoProcess)
66  {
67  const edm::ProcessHistory& iHistory=iRun.processHistory();
68 
69  auto hi=iHistory.rbegin();
70  _process_new=hi->processName();
71  hi++;
72  _process_ref=hi->processName();
73  std::cout<<_process_ref<<" vs "<<_process_new<<std::endl;
74  }
75 }
76 
77 void
79 {
80 
81  compare<edm::Run,TH1S>(iRun,_runInstance);
82  compare<edm::Run,TH1F>(iRun,_runInstance);
83  compare<edm::Run,TH1D>(iRun,_runInstance);
84 
85 }
86 
87 
88 template <class T>
90  _dbe->setCurrentFolder(type);
91  std::type_info const & tp = typeid(*h);
92  if (tp == typeid(TH1S))
93  _dbe->book1S(h->GetName(),dynamic_cast<TH1S*>(const_cast<T*>(h)));
94  else if (tp == typeid(TH1F))
95  _dbe->book1D(h->GetName(),dynamic_cast<TH1F*>(const_cast<T*>(h)));
96  else if (tp == typeid(TH1D))
97  _dbe->book1DD(h->GetName(),dynamic_cast<TH1D*>(const_cast<T*>(h)));
98 }
99 template <class T>
100 void MEtoMEComparitor::keepBadHistograms(const std::string & directory, const T * h_new, const T * h_ref){
101  //put it in a collection rather.
102 
103 
104  std::string d_n(h_new->GetName());
105  d_n+="_diff";
106  auto * difference = new T(d_n.c_str(),
107  h_new->GetTitle(),
108  h_new->GetNbinsX(),
109  h_new->GetXaxis()->GetXmin(),
110  h_new->GetXaxis()->GetXmax());
111  difference->Add(h_new);
112  difference->Add(h_ref,-1.);
113 
114  book(directory,"Ref",h_ref);
115  book(directory,"New",h_new);
116  book(directory,"Diff",difference);
117  delete difference;
118 
119 }
120 
121 
122 template <class W,
123  //class Wto,
124  class T>
125 void MEtoMEComparitor::compare(const W& where,const std::string & instance){
126 
127  edm::Handle<MEtoEDM<T> > metoedm_ref;
128  edm::Handle<MEtoEDM<T> > metoedm_new;
129  where.getByLabel(edm::InputTag(_moduleLabel,
130  instance,
131  _process_ref),
132  metoedm_ref);
133  where.getByLabel(edm::InputTag(_moduleLabel,
134  instance,
135  _process_new),
136  metoedm_new);
137 
138  if (metoedm_ref.failedToGet() || metoedm_new.failedToGet()){
139  edm::LogError("ProductNotFound")<<"MEtoMEComparitor did not find his products.";
140  return;
141  }
142 
143  using MEtoEDMObject = typename MEtoEDM<T>::MEtoEDMObject;
144 
145  const std::vector<MEtoEDMObject> & metoedmobject_ref = metoedm_ref->getMEtoEdmObject();
146  const std::vector<MEtoEDMObject> & metoedmobject_new = metoedm_new->getMEtoEdmObject();
147 
148  typedef std::map<std::string, std::pair<const MEtoEDMObject*, const MEtoEDMObject*> > Mapping;
149  typedef typename std::map<std::string, std::pair<const MEtoEDMObject*, const MEtoEDMObject*> >::iterator Mapping_iterator;
150 
151  Mapping mapping;
152 
153  LogDebug("MEtoMEComparitor")<<"going to do the mapping from "<<metoedmobject_ref.size()<<" x "<<metoedmobject_new.size();
154  unsigned int countMe=0;
155  for (unsigned int i_new=0; i_new!= metoedmobject_new.size(); ++i_new){
156  const std::string & pathname = metoedmobject_new[i_new].name;
157  if (metoedmobject_new[i_new].object.GetEntries()==0 ||
158  metoedmobject_new[i_new].object.Integral()==0){
159  countMe--;
160  continue;
161  }
162  mapping[pathname]=std::make_pair(&metoedmobject_new[i_new],(const MEtoEDMObject*)nullptr);
163  }
164  for (unsigned int i_ref=0; i_ref!= metoedmobject_ref.size() ; ++i_ref){
165  const std::string & pathname = metoedmobject_ref[i_ref].name;
166  auto there = mapping.find(pathname);
167  if (there != mapping.end()){
168  there->second.second = &metoedmobject_ref[i_ref];
169  }
170  }
171 
172  LogDebug("MEtoMEComparitor")<<"found "<<mapping.size()<<" pairs of plots";
173  countMe=0;
174 
175  unsigned int nNoMatch=0;
176  unsigned int nEmpty=0;
177  unsigned int nHollow=0;
178  unsigned int nGoodKS=0;
179  unsigned int nBadKS=0;
180  unsigned int nBadDiff=0;
181  unsigned int nGoodDiff=0;
182 
183  typedef std::map<std::string, std::pair<unsigned int,unsigned int> > Subs;
184  Subs subSystems;
185 
186  for (auto it = mapping.begin();
187  it!=mapping.end();
188  ++it){
189  if (!it->second.second){
190  //this is expected by how the map was created
191  nNoMatch++;
192  continue;
193  }
194  const T * h_ref = &it->second.second->object;
195  const T * h_new = &it->second.first->object;
196 
197  lat::StringList dir = lat::StringOps::split(it->second.second->name,"/");
198  std::string subsystem = dir[0];
199  if (dir.size()>=_dirDepth)
200  for (unsigned int iD=1;iD!=_dirDepth;++iD) subsystem+="/"+dir[iD];
201  subSystems[subsystem].first++;
202 
203  if (h_ref->GetEntries()!=0 && h_ref->Integral()!=0){
204  double KS=0;
205  bool cannotComputeKS=false;
206  try {
207  KS = h_new->KolmogorovTest(h_ref);
208  }
209  catch( cms::Exception& exception ){
210  cannotComputeKS=true;
211  }
212  if (KS<_KSgoodness){
213 
214  unsigned int total_ref=0;
215  unsigned int absdiff=0;
216  for (unsigned int iBin=0;
217  iBin!=(unsigned int)h_new->GetNbinsX()+1 ;
218  ++iBin){
219  total_ref+=h_ref->GetBinContent(iBin);
220  absdiff=std::abs(h_new->GetBinContent(iBin) - h_ref->GetBinContent(iBin));
221  }
222  double relativediff=1;
223  if (total_ref!=0){
224  relativediff=absdiff / (double) total_ref;
225  }
226  if (relativediff > _diffgoodness ){
227  edm::LogWarning("MEtoMEComparitor")<<"for "<<h_new->GetName()
228  <<" in "<<it->first
229  <<" the KS is "<<KS*100.<<" %"
230  <<" and the relative diff is: "<<relativediff*100.<<" %"
231  <<" KS"<<((cannotComputeKS)?" not valid":" is valid");
232  //std::string(" KolmogorovTest is not happy on : ")+h_new->GetName() : "";
233  //there you want to output the plots somewhere
234  keepBadHistograms(subsystem,h_new,h_ref);
235 
236  nBadDiff++;
237  subSystems[subsystem].second++;
238  }else{
239  nGoodDiff++;
240  }
241  nBadKS++;
242  }
243  else
244  nGoodKS++;
245  }
246  else{
247  if (h_ref->GetEntries()==0)
248  nEmpty++;
249  else
250  nHollow++;
251  LogDebug("MEtoMEComparitor")<<h_new->GetName() <<" in "<<it->first <<" is empty";
252  countMe--;
253  }
254 
255  }
256 
257  if (!mapping.empty()){
258  std::stringstream summary;
259  summary<<" Summary :"
260  <<"\n not matched : "<<nNoMatch
261  <<"\n empty : "<<nEmpty
262  <<"\n integral zero : "<<nHollow
263  <<"\n good KS : "<<nGoodKS
264  <<"\n bad KS : "<<nBadKS
265  <<"\n bad diff : "<<nBadDiff
266  <<"\n godd diff : "<<nGoodDiff;
267  bool tell=false;
268  for (auto & subSystem : subSystems){
269  double fraction = 1-(subSystem.second.second / (double)subSystem.second.first);
270  summary<<std::endl<<"Subsytem: "<<subSystem.first<<" has "<< fraction*100<<" % goodness";
271  if (fraction < _overallgoodness)
272  tell=true;
273  }
274  if (tell)
275  edm::LogWarning("MEtoMEComparitor")<<summary.str();
276  else
277  edm::LogInfo("MEtoMEComparitor")<<summary.str();
278  }
279 
280 }
281 
282 
283 // ------------ method called once each job just before starting event loop ------------
284 void
286 {
287 }
288 
289 // ------------ method called once each job just after ending the event loop ------------
290 void
292 }
293 
294 
#define LogDebug(id)
const_reverse_iterator rbegin() const
type
Definition: HCALResponse.h:21
T getParameter(std::string const &) const
std::string _lumiInstance
FWCore Framework interface EventSetupRecordImplementation h
Helper function to determine trigger accepts.
static PFTauRenderPlugin instance
void endLuminosityBlock(const edm::LuminosityBlock &, const edm::EventSetup &) override
MonitorElement * book1DD(char_string const &name, char_string const &title, int nchX, double lowX, double highX)
Book 1S histogram.
Definition: DQMStore.cc:1102
void endRun(const edm::Run &iRun, const edm::EventSetup &iSetup) override
MEtoMEComparitor(const edm::ParameterSet &)
void compare(const W &where, const std::string &instance)
MonitorElement * book1D(char_string const &name, char_string const &title, int const nchX, double const lowX, double const highX)
Book 1D histogram.
Definition: DQMStore.cc:1086
void endJob() override
void beginJob() override
void book(const std::string &directory, const std::string &type, const T *h)
std::string _process_ref
Abs< T >::type abs(const T &t)
Definition: Abs.h:22
ProcessHistory const & processHistory() const
Definition: Run.cc:121
std::string _process_new
~MEtoMEComparitor() override
bool failedToGet() const
Definition: HandleBase.h:78
void setCurrentFolder(std::string const &fullpath)
Definition: DQMStore.cc:565
void keepBadHistograms(const std::string &directory, const T *h_new, const T *h_ref)
MonitorElement * book1S(char_string const &name, char_string const &title, int nchX, double lowX, double highX)
Book 1S histogram.
Definition: DQMStore.cc:1094
void beginRun(const edm::Run &iRun, const edm::EventSetup &iSetup) override
unsigned int _dirDepth
std::string _runInstance
dbl *** dir
Definition: mlp_gen.cc:35
long double T
double split
Definition: MVATrainer.cc:139
Definition: Run.h:44
std::string _moduleLabel