1// -*- C++ -*-
  2#include "Rivet/Analysis.hh"
  3#include "Rivet/Projections/FinalState.hh"
  4#include "Rivet/Projections/UnstableParticles.hh"
  5
  6namespace Rivet {
  7
  8
  9  /// @brief e+e- -> D_s* D_sJ
 10  class BESIII_2021_I1867196 : public Analysis {
 11  public:
 12
 13    /// Constructor
 14    RIVET_DEFAULT_ANALYSIS_CTOR(BESIII_2021_I1867196);
 15
 16
 17    /// @name Analysis methods
 18    ///@{
 19
 20    /// Book histograms and initialise projections before the run
 21    void init() {
 22      // Initialise and register projections
 23      declare(FinalState(), "FS");
 24      declare(UnstableParticles(), "UFS");
 25      // Histograms
 26      for(unsigned int ix=0;ix<3;++ix) {
 27        book(_numD[ix],"TMP/num_"+to_string(ix));
 28      }
 29    }
 30
 31    void findChildren(const Particle & p,map<long,int> & nRes, int &ncount) {
 32      for (const Particle &child : p.children()) {
 33        if(child.children().empty()) {
 34          nRes[child.pid()]-=1;
 35          --ncount;
 36        }
 37        else {
 38          findChildren(child,nRes,ncount);
 39        }
 40      }
 41    }
 42
 43    /// Perform the per-event analysis
 44    void analyze(const Event& event) {
 45
 46      const FinalState& fs = apply<FinalState>(event, "FS");
 47
 48      map<long,int> nCount;
 49      int ntotal(0);
 50      for (const Particle& p : fs.particles()) {
 51        nCount[p.pid()] += 1;
 52        ++ntotal;
 53      }
 54      const FinalState& ufs = apply<FinalState>(event, "UFS");
 55      // loop over D_s*
 56      for (const Particle & Dstar : ufs.particles(Cuts::abspid==433)) {
 57        map<long,int> nRes = nCount;
 58        int ncount = ntotal;
 59        findChildren(Dstar,nRes,ncount);
 60        bool matched=false;
 61        for (const Particle & p : ufs.particles(Cuts::abspid==10431 or
 62                                  Cuts::abspid==10433 or
 63                                  Cuts::abspid==20433)) {
 64          // check particle and antiparticle
 65          if(Dstar.pid()*p.pid()>0) continue;
 66          map<long,int> nRes2 = nRes;
 67          int ncount2 = ncount;
 68          findChildren(p,nRes2,ncount2);
 69          if(ncount2!=0) continue;
 70          matched=true;
 71          for (auto const & val : nRes2) {
 72            if(val.second!=0) {
 73              matched = false;
 74              break;
 75            }
 76          }
 77          if(matched) {
 78            if(p.abspid()==10431) _numD[0]->fill();
 79            else if(p.abspid()==20433) _numD[1]->fill();
 80            else if(p.abspid()==10433) _numD[2]->fill();
 81            break;
 82          }
 83        }
 84        if(matched) break;
 85      }
 86    }
 87
 88
 89    /// Normalise histograms etc., after the run
 90    void finalize() {
 91      double fact = crossSection()/picobarn/sumOfWeights();
 92      for (unsigned int ix=0;ix<3;++ix) {
 93        double sigma = _numD[ix]->val()*fact;
 94        double error = _numD[ix]->err()*fact;
 95        Estimate1DPtr  mult;
 96        book(mult, 1+ix, 1, 1);
 97        for (auto& b : mult->bins()) {
 98          if (inRange(sqrtS()/GeV, b.xMin(), b.xMax())) {
 99            b.set(sigma, error);
100          }
101        }
102      }
103    }
104
105    ///@}
106
107
108    /// @name Histograms
109    ///@{
110    CounterPtr _numD[3];
111    ///@}
112
113
114  };
115
116
117  RIVET_DECLARE_PLUGIN(BESIII_2021_I1867196);
118
119}