1// -*- C++ -*-
  2#include "Rivet/Analysis.hh"
  3#include "Rivet/Projections/Beam.hh"
  4#include "Rivet/Projections/ChargedFinalState.hh"
  5#include <cmath>
  6
  7#define I_KNOW_THE_INITIAL_QUARKS_PROJECTION_IS_DODGY_BUT_NEED_TO_USE_IT
  8#include "Rivet/Projections/InitialQuarks.hh"
  9
 10namespace Rivet {
 11
 12
 13  /// @brief OPAL multiplicities at various energies
 14  ///
 15  /// @author Peter Richardson
 16  class OPAL_2002_I601225 : public Analysis {
 17  public:
 18
 19    RIVET_DEFAULT_ANALYSIS_CTOR(OPAL_2002_I601225);
 20
 21
 22    /// @name Analysis methods
 23    /// @{
 24
 25    void init() {
 26      // Projections
 27      declare(Beam(), "Beams");
 28      declare(ChargedFinalState(), "CFS");
 29      declare(InitialQuarks(), "IQF");
 30
 31      // Histograms
 32      book(_cLight, "TMP/CLIGHT" );
 33      book(_wLight, "TMP/WLIGHT" );
 34      book(_cCharm, "TMP/CCHARM" );
 35      book(_wCharm, "TMP/WCHARM" );
 36      book(_cBottom, "TMP/CBOTTOM");
 37      book(_wBottom, "TMP/WBOTTOM");
 38    }
 39
 40
 41    void analyze(const Event& event) {
 42      // Even if we only generate hadronic events, we still need a cut on numCharged >= 2.
 43      const FinalState& cfs = apply<FinalState>(event, "CFS");
 44      if (cfs.size() < 2) vetoEvent;
 45
 46      int flavour = 0;
 47      const InitialQuarks& iqf = apply<InitialQuarks>(event, "IQF");
 48
 49      // If we only have two quarks (qqbar), just take the flavour.
 50      // If we have more than two quarks, look for the highest energetic q-qbar pair.
 51      if (iqf.particles().size() == 2) {
 52        flavour = iqf.particles().front().abspid();
 53      }
 54      else {
 55        map<int, double> quarkmap;
 56        for (const Particle& p : iqf.particles()) {
 57          if (quarkmap[p.pid()] < p.E()) {
 58            quarkmap[p.pid()] = p.E();
 59          }
 60        }
 61        double maxenergy = 0.;
 62        for (int i = 1; i <= 5; ++i) {
 63          if (quarkmap[i]+quarkmap[-i] > maxenergy) {
 64            flavour = i;
 65          }
 66        }
 67      }
 68      const size_t numParticles = cfs.particles().size();
 69      switch (flavour) {
 70      case 1: case 2: case 3:
 71        _wLight ->fill();
 72        _cLight ->fill(numParticles);
 73        break;
 74      case 4:
 75        _wCharm ->fill();
 76        _cCharm ->fill(numParticles);
 77        break;
 78      case 5:
 79        _wBottom->fill();
 80        _cBottom->fill(numParticles);
 81        break;
 82      }
 83
 84    }
 85
 86
 87    void finalize() {
 88      // calculate the averages and diffs
 89      if(_wLight ->numEntries()) scale( _cLight, 1./_wLight->val());
 90      if(_wCharm ->numEntries()) scale( _cCharm, 1./_wCharm->val());
 91      if(_wBottom->numEntries()) scale(_cBottom,1./_wBottom->val());
 92      Counter _cDiff = *_cBottom - *_cLight;
 93
 94      // fill the histograms
 95      for (unsigned int ix=1;ix<5;++ix) {
 96        double val(0.), err(0.0);
 97        if(ix==1) {
 98          val = _cBottom->val();
 99          err = _cBottom->err();
100        }
101        else if(ix==2) {
102          val = _cCharm->val();
103          err = _cCharm->err();
104        }
105        else if(ix==3) {
106          val = _cLight->val();
107          err = _cLight->err();
108        }
109        else if(ix==4) {
110          val = _cDiff.val();
111          err = _cDiff.err();
112        }
113
114        Estimate1DPtr mult;
115        book(mult, 1, 1, ix);
116        for (auto& b : mult->bins()) {
117          if (inRange(sqrtS()/GeV, b.xMin(), b.xMax())) {
118            b.set(val, err);
119          }
120        }
121      }
122    }
123
124    /// @}
125
126
127  private:
128
129    /// @name Multiplicities
130    /// @todo Don't we have a Dbn1D-like type that can do both at once?
131    /// @{
132    CounterPtr _cLight, _wLight;
133    CounterPtr _cCharm, _wCharm;
134    CounterPtr _cBottom, _wBottom;
135    /// @}
136
137  };
138
139
140
141  RIVET_DECLARE_ALIASED_PLUGIN(OPAL_2002_I601225, OPAL_2002_S5361494);
142
143}