CMS 3D CMS Logo

 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Pages
LHERunInfo.cc
Go to the documentation of this file.
1 #include <algorithm>
2 #include <iostream>
3 #include <iomanip>
4 #include <string>
5 #include <cctype>
6 #include <vector>
7 #include <memory>
8 #include <cmath>
9 #include <cstring>
10 
11 #include <boost/bind.hpp>
12 
13 #include <xercesc/dom/DOM.hpp>
14 #include <xercesc/parsers/XercesDOMParser.hpp>
15 #include <xercesc/sax/HandlerBase.hpp>
16 
19 
21 
23 
24 #include "XMLUtils.h"
25 
26 XERCES_CPP_NAMESPACE_USE
27 
28 static int skipWhitespace(std::istream &in)
29 {
30  int ch;
31  do {
32  ch = in.get();
33  } while(std::isspace(ch));
34  if (ch != std::istream::traits_type::eof())
35  in.putback(ch);
36  return ch;
37 }
38 
39 namespace lhef {
40 
41 LHERunInfo::LHERunInfo(std::istream &in)
42 {
43  in >> heprup.IDBMUP.first >> heprup.IDBMUP.second
44  >> heprup.EBMUP.first >> heprup.EBMUP.second
45  >> heprup.PDFGUP.first >> heprup.PDFGUP.second
46  >> heprup.PDFSUP.first >> heprup.PDFSUP.second
47  >> heprup.IDWTUP >> heprup.NPRUP;
48  if (!in.good())
49  throw cms::Exception("InvalidFormat")
50  << "Les Houches file contained invalid"
51  " header in init section." << std::endl;
52 
53  heprup.resize();
54 
55  for(int i = 0; i < heprup.NPRUP; i++) {
56  in >> heprup.XSECUP[i] >> heprup.XERRUP[i]
57  >> heprup.XMAXUP[i] >> heprup.LPRUP[i];
58  if (!in.good())
59  throw cms::Exception("InvalidFormat")
60  << "Les Houches file contained invalid data"
61  " in header payload line " << (i + 1)
62  << "." << std::endl;
63  }
64 
65  while(skipWhitespace(in) == '#') {
66  std::string line;
67  std::getline(in, line);
68  comments.push_back(line + "\n");
69  }
70 
71  if (!in.eof())
72  edm::LogInfo("Generator|LHEInterface")
73  << "Les Houches file contained spurious"
74  " content after the regular data (this is normal for LHEv3 files for now)." << std::endl;
75 
76  init();
77 }
78 
80  heprup(heprup)
81 {
82  init();
83 }
84 
86  const std::vector<LHERunInfoProduct::Header> &headers,
87  const std::vector<std::string> &comments) :
88  heprup(heprup)
89 {
90  std::copy(headers.begin(), headers.end(),
91  std::back_inserter(this->headers));
92  std::copy(comments.begin(), comments.end(),
93  std::back_inserter(this->comments));
94 
95  init();
96 }
97 
99  heprup(product.heprup())
100 {
101  std::copy(product.headers_begin(), product.headers_end(),
102  std::back_inserter(headers));
103  std::copy(product.comments_begin(), product.comments_end(),
104  std::back_inserter(comments));
105 
106  init();
107 }
108 
110 {
111 }
112 
114 {
115  for(int i = 0; i < heprup.NPRUP; i++) {
116  Process proc;
117  proc.setProcess(heprup.LPRUP[i]);
118  proc.setHepRupIndex((unsigned int)i);
119  processes.push_back(proc);
120  }
121 
122  std::sort(processes.begin(), processes.end());
123 }
124 
126 {
127  processesLumi.clear();
128  for(int i = 0; i < heprup.NPRUP; i++) {
129 
130  Process proc;
131  proc.setProcess(heprup.LPRUP[i]);
132  proc.setHepRupIndex((unsigned int)i);
133  proc.setLHEXSec(heprup.XSECUP[i],heprup.XERRUP[i]);
134  processesLumi.push_back(proc);
135 
136  }
137 
138  std::sort(processesLumi.begin(), processesLumi.end());
139 }
140 
141 
142 bool LHERunInfo::operator == (const LHERunInfo &other) const
143 {
144  return heprup == other.heprup;
145 }
146 
147 void LHERunInfo::count(int process, CountMode mode, double eventWeight,
148  double brWeight, double matchWeight)
149 {
150  std::vector<Process>::iterator proc =
151  std::lower_bound(processes.begin(), processes.end(), process);
152  if (proc == processes.end() || proc->process() != process)
153  return;
154 
155  std::vector<Process>::iterator procLumi =
156  std::lower_bound(processesLumi.begin(), processesLumi.end(), process);
157  if (procLumi == processesLumi.end() || procLumi->process() != process)
158  return;
159 
160  switch(mode) {
161  case kAccepted:
162  proc->addAcceptedBr(eventWeight * brWeight * matchWeight);
163  proc->addAccepted(eventWeight * matchWeight);
164  procLumi->addAcceptedBr(eventWeight * brWeight * matchWeight);
165  procLumi->addAccepted(eventWeight * matchWeight);
166  case kKilled:
167  proc->addKilled(eventWeight * matchWeight);
168  procLumi->addKilled(eventWeight * matchWeight);
169  if(eventWeight>0)
170  {
171  proc->addNPassPos();
172  procLumi->addNPassPos();
173  }
174  else
175  {
176  proc->addNPassNeg();
177  procLumi->addNPassNeg();
178  }
179  case kSelected:
180  proc->addSelected(eventWeight);
181  procLumi->addSelected(eventWeight);
182  if(eventWeight>0)
183  {
184  proc->addNTotalPos();
185  procLumi->addNTotalPos();
186  }
187  else
188  {
189  proc->addNTotalNeg();
190  procLumi->addNTotalNeg();
191  }
192  case kTried:
193  proc->addTried(eventWeight);
194  procLumi->addTried(eventWeight);
195  }
196 }
197 
198 
200 {
201  double sigSelSum = 0.0;
202  double sigSum = 0.0;
203  double sigBrSum = 0.0;
204  double err2Sum = 0.0;
205  double errBr2Sum = 0.0;
206  int idwtup = std::abs(heprup.IDWTUP);
207  for(std::vector<Process>::const_iterator proc = processes.begin();
208  proc != processes.end(); ++proc) {
209  unsigned int idx = proc->heprupIndex();
210 
211  if (!proc->killed().n())
212  continue;
213 
214  double sigma2Sum, sigma2Err;
215  sigma2Sum = heprup.XSECUP[idx]* heprup.XSECUP[idx];
216  sigma2Err = heprup.XERRUP[idx]* heprup.XERRUP[idx];
217 
218  double sigmaAvg = heprup.XSECUP[idx];
219 
220  double fracAcc = 0;
221  double ntotal = proc->nTotalPos()-proc->nTotalNeg();
222  double npass = proc->nPassPos() -proc->nPassNeg();
223  switch(idwtup){
224  case 3: case -3:
225  fracAcc = ntotal > 1e-6? npass/ntotal: -1;
226  break;
227  default:
228  fracAcc = proc->selected().sum() > 1e-6? proc->killed().sum() / proc->selected().sum():-1;
229  break;
230  }
231 
232  if(fracAcc<1e-6)continue;
233 
234  double fracBr = proc->accepted().sum() > 0.0 ?
235  proc->acceptedBr().sum() / proc->accepted().sum() : 1;
236  double sigmaFin = sigmaAvg * fracAcc * fracBr;
237  double sigmaFinBr = sigmaFin * fracBr;
238 
239  double relErr = 1.0;
240  if (proc->killed().n() > 1) {
241 
242  double efferr2=0;
243  switch(idwtup) {
244  case 3: case -3:
245  {
246  double ntotal_pos = proc->nTotalPos();
247  double effp = ntotal_pos > 1e-6?
248  (double)proc->nPassPos()/ntotal_pos:0;
249  double effp_err2 = ntotal_pos > 1e-6?
250  (1-effp)*effp/ntotal_pos: 0;
251 
252  double ntotal_neg = proc->nTotalNeg();
253  double effn = ntotal_neg > 1e-6?
254  (double)proc->nPassNeg()/ntotal_neg:0;
255  double effn_err2 = ntotal_neg > 1e-6?
256  (1-effn)*effn/ntotal_neg: 0;
257 
258  efferr2 = ntotal > 0 ?
259  (ntotal_pos*ntotal_pos*effp_err2 +
260  ntotal_neg*ntotal_neg*effn_err2)/ntotal/ntotal:0;
261  break;
262  }
263  default:
264  {
265  double denominator = pow(proc->selected().sum(),4);
266  double passw = proc->killed().sum();
267  double passw2 = proc->killed().sum2();
268  double failw = proc->selected().sum() - passw;
269  double failw2 = proc->selected().sum2() - passw2;
270  double numerator = (passw2*failw*failw + failw2*passw*passw);
271 
272  efferr2 = denominator>1e-6?
273  numerator/denominator:0;
274  break;
275  }
276  }
277  double delta2Veto = efferr2/fracAcc/fracAcc;
278  double delta2Sum = delta2Veto
279  + sigma2Err / sigma2Sum;
280  relErr = (delta2Sum > 0.0 ?
281  std::sqrt(delta2Sum) : 0.0);
282  }
283  double deltaFin = sigmaFin * relErr;
284  double deltaFinBr = sigmaFinBr * relErr;
285 
286  sigSelSum += sigmaAvg;
287  sigSum += sigmaFin;
288  sigBrSum += sigmaFinBr;
289  err2Sum += deltaFin * deltaFin;
290  errBr2Sum += deltaFinBr * deltaFinBr;
291  }
292 
293  XSec result(sigBrSum,std::sqrt(errBr2Sum));
294 
295  return result;
296 }
297 
299 {
300  double sigSelSum = 0.0;
301  double sigSum = 0.0;
302  double sigBrSum = 0.0;
303  double errSel2Sum = 0.0;
304  double err2Sum = 0.0;
305  double errBr2Sum = 0.0;
306  double errMatch2Sum = 0.0;
307  unsigned long nAccepted = 0;
308  unsigned long nTried = 0;
309  unsigned long nAccepted_pos = 0;
310  unsigned long nTried_pos = 0;
311  unsigned long nAccepted_neg = 0;
312  unsigned long nTried_neg = 0;
313  int idwtup = std::abs(heprup.IDWTUP);
314 
315  std::cout << std::endl;
316  std::cout << "Process and cross-section statistics" << std::endl;
317  std::cout << "------------------------------------" << std::endl;
318  std::cout << "Process\t\txsec_before [pb]\t\tpassed\tnposw\tnnegw\ttried\tnposw\tnnegw \txsec_match [pb]\t\t\taccepted [%]\t event_eff [%]"
319  << std::endl;
320 
321  for(std::vector<Process>::const_iterator proc = processes.begin();
322  proc != processes.end(); ++proc) {
323  unsigned int idx = proc->heprupIndex();
324 
325  if (!proc->selected().n()) {
326  std::cout << proc->process() << "\t0\t0\tn/a\t\t\tn/a"
327  << std::endl;
328  continue;
329  }
330 
331  double sigma2Sum, sigma2Err;
332  sigma2Sum = heprup.XSECUP[idx]* heprup.XSECUP[idx];
333  sigma2Err = heprup.XERRUP[idx]* heprup.XERRUP[idx];
334 
335  double sigmaAvg = heprup.XSECUP[idx];
336 
337  double fracAcc = 0;
338  double ntotal = proc->nTotalPos()-proc->nTotalNeg();
339  double npass = proc->nPassPos() -proc->nPassNeg();
340  switch(idwtup){
341  case 3: case -3:
342  fracAcc = ntotal > 1e-6? npass/ntotal: -1;
343  break;
344  default:
345  fracAcc = proc->selected().sum() > 1e-6? proc->killed().sum() / proc->selected().sum():-1;
346  break;
347  }
348 
349  if(fracAcc<1e-6)continue;
350 
351  double fracBr = proc->accepted().sum() > 0.0 ?
352  proc->acceptedBr().sum() / proc->accepted().sum() : 1;
353  double sigmaFin = sigmaAvg * fracAcc;
354  double sigmaFinBr = sigmaFin * fracBr;
355 
356  double relErr = 1.0;
357  double relAccErr = 1.0;
358  double efferr2=0;
359 
360  if (proc->killed().n() > 1) {
361  switch(idwtup) {
362  case 3: case -3:
363  {
364  double ntotal_pos = proc->nTotalPos();
365  double effp = ntotal_pos > 1e-6?
366  (double)proc->nPassPos()/ntotal_pos:0;
367  double effp_err2 = ntotal_pos > 1e-6?
368  (1-effp)*effp/ntotal_pos: 0;
369 
370  double ntotal_neg = proc->nTotalNeg();
371  double effn = ntotal_neg > 1e-6?
372  (double)proc->nPassNeg()/ntotal_neg:0;
373  double effn_err2 = ntotal_neg > 1e-6?
374  (1-effn)*effn/ntotal_neg: 0;
375 
376  efferr2 = ntotal > 0 ?
377  (ntotal_pos*ntotal_pos*effp_err2 +
378  ntotal_neg*ntotal_neg*effn_err2)/ntotal/ntotal:0;
379  break;
380  }
381  default:
382  {
383  double denominator = pow(proc->selected().sum(),4);
384  double passw = proc->killed().sum();
385  double passw2 = proc->killed().sum2();
386  double failw = proc->selected().sum() - passw;
387  double failw2 = proc->selected().sum2() - passw2;
388  double numerator = (passw2*failw*failw + failw2*passw*passw);
389 
390  efferr2 = denominator>1e-6?
391  numerator/denominator:0;
392  break;
393  }
394  }
395  double delta2Veto = efferr2/fracAcc/fracAcc;
396  double delta2Sum = delta2Veto
397  + sigma2Err / sigma2Sum;
398  relErr = (delta2Sum > 0.0 ?
399  std::sqrt(delta2Sum) : 0.0);
400  relAccErr = (delta2Veto > 0.0 ?
401  std::sqrt(delta2Veto) : 0.0);
402  }
403  double deltaFin = sigmaFin * relErr;
404  double deltaFinBr = sigmaFinBr * relErr;
405 
406  double ntotal_proc = proc->nTotalPos()+proc->nTotalNeg();
407  double event_eff_proc = ntotal_proc>1e-6? (double)(proc->nPassPos()+ proc->nPassNeg())/ntotal_proc: -1;
408  double event_eff_err_proc = ntotal_proc>1e-6? std::sqrt((1-event_eff_proc)*event_eff_proc/ntotal_proc): -1;
409 
410  std::cout << proc->process() << "\t\t"
411  << std::scientific << std::setprecision(3)
412  << heprup.XSECUP[proc->heprupIndex()] << " +/- "
413  << heprup.XERRUP[proc->heprupIndex()] << "\t\t"
414  << proc->accepted().n() << "\t"
415  << proc->nPassPos() << "\t"
416  << proc->nPassNeg() << "\t"
417  << proc->tried().n() << "\t"
418  << proc->nTotalPos() << "\t"
419  << proc->nTotalNeg() << "\t"
420  << std::scientific << std::setprecision(3)
421  << sigmaFinBr << " +/- "
422  << deltaFinBr << "\t\t"
423  << std::fixed << std::setprecision(1)
424  << (fracAcc * 100) << " +/- " << ( std::sqrt(efferr2) * 100) << "\t"
425  << std::fixed << std::setprecision(1)
426  << (event_eff_proc * 100) << " +/- " << ( event_eff_err_proc * 100)
427  << std::endl;
428 
429  nAccepted += proc->accepted().n();
430  nTried += proc->tried().n();
431  nAccepted_pos += proc->nPassPos();
432  nTried_pos += proc->nTotalPos();
433  nAccepted_neg += proc->nPassNeg();
434  nTried_neg += proc->nTotalNeg();
435  sigSelSum += sigmaAvg;
436  sigSum += sigmaFin;
437  sigBrSum += sigmaFinBr;
438  errSel2Sum += sigma2Err;
439  err2Sum += deltaFin * deltaFin;
440  errBr2Sum += deltaFinBr * deltaFinBr;
441  errMatch2Sum += sigmaFin*relAccErr*sigmaFin*relAccErr;
442  }
443 
444  double ntotal_all = (nTried_pos+nTried_neg);
445  double event_eff_all = ntotal_all>1e-6? (double)(nAccepted_pos+nAccepted_neg)/ntotal_all: -1;
446  double event_eff_err_all = ntotal_all>1e-6? std::sqrt((1-event_eff_all)*event_eff_all/ntotal_all): -1;
447 
448  std::cout << "Total\t\t"
449  << std::scientific << std::setprecision(3)
450  << sigSelSum << " +/- " << std::sqrt(errSel2Sum) << "\t\t"
451  << nAccepted << "\t"
452  << nAccepted_pos << "\t"
453  << nAccepted_neg << "\t"
454  << nTried << "\t"
455  << nTried_pos << "\t"
456  << nTried_neg << "\t"
457  << std::scientific << std::setprecision(3)
458  << sigBrSum << " +/- "
459  << std::sqrt(errBr2Sum) << "\t\t"
460  << std::fixed << std::setprecision(1)
461  << (sigSum / sigSelSum * 100) << " +/- " << (std::sqrt(errMatch2Sum)/sigSelSum * 100) << "\t"
462  << std::fixed << std::setprecision(1)
463  << (event_eff_all * 100) << " +/- " << (event_eff_err_all * 100)
464  << std::endl;
465 }
466 
468  xmlDoc(0)
469 {
470 }
471 
472 LHERunInfo::Header::Header(const std::string &tag) :
473  LHERunInfoProduct::Header(tag), xmlDoc(0)
474 {
475 }
476 
478  LHERunInfoProduct::Header(orig), xmlDoc(0)
479 {
480 }
481 
483  LHERunInfoProduct::Header(orig), xmlDoc(0)
484 {
485 }
486 
488 {
489  if (xmlDoc)
490  xmlDoc->release();
491 }
492 
493 static void fillLines(std::vector<std::string> &lines, const char *data,
494  int len = -1)
495 {
496  const char *end = len >= 0 ? (data + len) : 0;
497  while(*data && (!end || data < end)) {
498  std::size_t len = std::strcspn(data, "\r\n");
499  if (end && data + len > end)
500  len = end - data;
501  if (data[len] == '\r' && data[len + 1] == '\n')
502  len += 2;
503  else if (data[len])
504  len++;
505  lines.push_back(std::string(data, len));
506  data += len;
507  }
508 }
509 
510 static std::vector<std::string> domToLines(const DOMNode *node)
511 {
512  std::vector<std::string> result;
513  DOMImplementation *impl =
514  DOMImplementationRegistry::getDOMImplementation(
515  XMLUniStr("Core"));
516  std::auto_ptr<DOMWriter> writer(
517  static_cast<DOMImplementationLS*>(impl)->createDOMWriter());
518 
519  writer->setEncoding(XMLUniStr("UTF-8"));
520  XMLSimpleStr buffer(writer->writeToString(*node));
521 
522  const char *p = std::strchr((const char*)buffer, '>') + 1;
523  const char *q = std::strrchr(p, '<');
524  fillLines(result, p, q - p);
525 
526  return result;
527 }
528 
529 std::vector<std::string> LHERunInfo::findHeader(const std::string &tag) const
530 {
531  const LHERunInfo::Header *header = 0;
532  for(std::vector<Header>::const_iterator iter = headers.begin();
533  iter != headers.end(); ++iter) {
534  if (iter->tag() == tag)
535  return std::vector<std::string>(iter->begin(),
536  iter->end());
537  if (iter->tag() == "header")
538  header = &*iter;
539  }
540 
541  if (!header)
542  return std::vector<std::string>();
543 
544  const DOMNode *root = header->getXMLNode();
545  if (!root)
546  return std::vector<std::string>();
547 
548  for(const DOMNode *iter = root->getFirstChild();
549  iter; iter = iter->getNextSibling()) {
550  if (iter->getNodeType() != DOMNode::ELEMENT_NODE)
551  continue;
552  if (tag == (const char*)XMLSimpleStr(iter->getNodeName()))
553  return domToLines(iter);
554  }
555 
556  return std::vector<std::string>();
557 }
558 
559 namespace {
560  class HeaderReader : public CBInputStream::Reader {
561  public:
562  HeaderReader(const LHERunInfo::Header *header) :
563  header(header), mode(kHeader),
564  iter(header->begin())
565  {
566  }
567 
568  const std::string &data()
569  {
570  switch(mode) {
571  case kHeader:
572  tmp = "<" + header->tag() + ">";
573  mode = kBody;
574  break;
575  case kBody:
576  if (iter != header->end())
577  return *iter++;
578  tmp = "</" + header->tag() + ">";
579  mode = kFooter;
580  break;
581  case kFooter:
582  tmp.clear();
583  }
584 
585  return tmp;
586  }
587 
588  private:
589  enum Mode {
590  kHeader,
591  kBody,
592  kFooter
593  };
594 
595  const LHERunInfo::Header *header;
596  Mode mode;
598  std::string tmp;
599  };
600 } // anonymous namespace
601 
602 const DOMNode *LHERunInfo::Header::getXMLNode() const
603 {
604  if (tag().empty())
605  return 0;
606 
607  if (!xmlDoc) {
608  XercesDOMParser parser;
609  parser.setValidationScheme(XercesDOMParser::Val_Auto);
610  parser.setDoNamespaces(false);
611  parser.setDoSchema(false);
612  parser.setValidationSchemaFullChecking(false);
613 
614  HandlerBase errHandler;
615  parser.setErrorHandler(&errHandler);
616  parser.setCreateEntityReferenceNodes(false);
617 
618  try {
619  std::auto_ptr<CBInputStream::Reader> reader(
620  new HeaderReader(this));
622  parser.parse(source);
623  xmlDoc = parser.adoptDocument();
624  } catch(const XMLException &e) {
625  throw cms::Exception("Generator|LHEInterface")
626  << "XML parser reported DOM error no. "
627  << (unsigned long)e.getCode()
628  << ": " << XMLSimpleStr(e.getMessage()) << "."
629  << std::endl;
630  } catch(const SAXException &e) {
631  throw cms::Exception("Generator|LHEInterface")
632  << "XML parser reported: "
633  << XMLSimpleStr(e.getMessage()) << "."
634  << std::endl;
635  }
636  }
637 
638  return xmlDoc->getDocumentElement();
639 }
640 
641 std::pair<int, int> LHERunInfo::pdfSetTranslation() const
642 {
643  int pdfA = -1, pdfB = -1;
644 
645  if (heprup.PDFGUP.first >= 0) {
646  pdfA = heprup.PDFSUP.first;
647  }
648 
649  if (heprup.PDFGUP.second >= 0) {
650  pdfB = heprup.PDFSUP.second;
651  }
652 
653  return std::make_pair(pdfA, pdfB);
654 }
655 
656 const bool operator == (const LHERunInfo::Process& lhs, const LHERunInfo::Process &rhs)
657 { return (lhs.process() == rhs.process()); }
658 
659 const bool operator < (const LHERunInfo::Process& lhs, const LHERunInfo::Process &rhs)
660 { return (lhs.process() < rhs.process()); }
661 
662 } // namespace lhef
static XERCES_CPP_NAMESPACE_USE int skipWhitespace(std::istream &in)
Definition: LHERunInfo.cc:28
int i
Definition: DBlmapReader.cc:9
void resize(int nrup)
Definition: LesHouches.h:52
const bool operator<(const LHERunInfo::Process &lhs, const LHERunInfo::Process &rhs)
Definition: LHERunInfo.cc:659
void setLHEXSec(double value, double error)
Definition: LHERunInfo.h:134
TrainProcessor *const proc
Definition: MVATrainer.cc:101
XMLInputSourceWrapper< CBInputStream > CBInputSource
Definition: XMLUtils.h:188
std::pair< double, double > EBMUP
Definition: LesHouches.h:78
comments_const_iterator comments_end() const
static std::vector< std::string > domToLines(const DOMNode *node)
Definition: LHERunInfo.cc:510
#define abs(x)
Definition: mlp_lapack.h:159
XSec xsec() const
Definition: LHERunInfo.cc:199
headers_const_iterator headers_end() const
std::pair< int, int > IDBMUP
Definition: LesHouches.h:73
std::vector< std::string >::const_iterator const_iterator
std::vector< Process > processes
Definition: LHERunInfo.h:166
tuple node
Definition: Node.py:50
std::pair< int, int > PDFGUP
Definition: LesHouches.h:84
headers_const_iterator headers_begin() const
T sqrt(T t)
Definition: SSEVec.h:46
tuple result
Definition: query.py:137
#define end
Definition: vmac.h:38
LHERunInfo(std::istream &in)
Definition: LHERunInfo.cc:41
std::vector< double > XERRUP
Definition: LesHouches.h:114
std::vector< double > XMAXUP
Definition: LesHouches.h:119
void setHepRupIndex(int id)
Definition: LHERunInfo.h:133
comments_const_iterator comments_begin() const
std::vector< Process > processesLumi
Definition: LHERunInfo.h:175
std::pair< int, int > pdfSetTranslation() const
Definition: LHERunInfo.cc:641
std::pair< int, int > PDFSUP
Definition: LesHouches.h:90
std::vector< std::string > comments
Definition: LHERunInfo.h:168
std::vector< std::vector< double > > tmp
Definition: MVATrainer.cc:100
#define begin
Definition: vmac.h:31
char data[epos_bytes_allocation]
Definition: EPOS_Wrapper.h:82
std::vector< Header > headers
Definition: LHERunInfo.h:167
void count(int process, CountMode count, double eventWeight=1.0, double brWeight=1.0, double matchWeight=1.0)
Definition: LHERunInfo.cc:147
tuple cout
Definition: gather_cfg.py:121
std::vector< std::string > findHeader(const std::string &tag) const
Definition: LHERunInfo.cc:529
bool operator==(const LHERunInfo &other) const
Definition: LHERunInfo.cc:142
std::vector< double > XSECUP
Definition: LesHouches.h:108
tuple process
Definition: LaserDQM_cfg.py:3
static void fillLines(std::vector< std::string > &lines, const char *data, int len=-1)
Definition: LHERunInfo.cc:493
Power< A, B >::type pow(const A &a, const B &b)
Definition: Power.h:40
void statistics() const
Definition: LHERunInfo.cc:298
std::vector< int > LPRUP
Definition: LesHouches.h:124
string root
initialization
Definition: dbtoconf.py:70