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- -> K+K-pi0
 10  class BESIII_2022_I2033007 : public Analysis {
 11  public:
 12
 13    /// Constructor
 14    RIVET_DEFAULT_ANALYSIS_CTOR(BESIII_2022_I2033007);
 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      // Book histograms
 26      for(unsigned int ix=0;ix<4;++ix) {
 27	stringstream ss;
 28	ss << "TMP/n" << ix;
 29	book(_nMeson[ix], ss.str());
 30      }
 31    }
 32
 33    void findChildren(const Particle & p,map<long,int> & nRes, int &ncount) {
 34      for (const Particle &child : p.children()) {
 35	if(child.children().empty()) {
 36	  nRes[child.pid()]-=1;
 37	  --ncount;
 38	}
 39	else
 40	  findChildren(child,nRes,ncount);
 41      }
 42    }
 43
 44    /// Perform the per-event analysis
 45    void analyze(const Event& event) {
 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      if(ntotal==3 && nCount[321]==1 &&
 55	 nCount[-321]==1 && nCount[111]==1)
 56	_nMeson[0]->fill();
 57      const FinalState& ufs = apply<FinalState>(event, "UFS");
 58      for (const Particle& p : ufs.particles(Cuts::abspid==323 or Cuts::abspid==325 or Cuts::pid==333)) {
 59	if(p.children().empty()) continue;
 60	map<long,int> nRes = nCount;
 61	int ncount = ntotal;
 62	findChildren(p,nRes,ncount);
 63	if(ncount!=1) continue;
 64	// phi pi0
 65	long id = p.pid()>0 ? -321 : 321;
 66	if (p.pid()==333) id = 111;
 67	bool matched = true;
 68	for(auto const & val : nRes) {
 69	  if(val.first==id) {
 70	    if(val.second!=1) {
 71	      matched = false;
 72	      break;
 73	    }
 74	  }
 75	  else if(val.second!=0) {
 76	    matched = false;
 77	    break;
 78	  }
 79	}
 80	if(matched) {
 81	  if(p.pid()==333)
 82	    _nMeson[1]->fill();
 83	  else if (p.abspid()==325)
 84	    _nMeson[2]->fill();
 85	  else
 86	    _nMeson[3]->fill();
 87	}
 88      }
 89    }
 90
 91
 92    /// Normalise histograms etc., after the run
 93    void finalize() {
 94      for(unsigned int ix=0;ix<4;++ix) {
 95	double sigma = _nMeson[ix]->val();
 96	double error = _nMeson[ix]->err();
 97    	sigma *= crossSection()/ sumOfWeights() /picobarn;
 98    	error *= crossSection()/ sumOfWeights() /picobarn; 
 99	Scatter2D temphisto(refData(ix+1, 1, 1));
100    	Scatter2DPtr  mult;
101        book(mult, ix+1, 1, 1);
102	for (size_t b = 0; b < temphisto.numPoints(); b++) {
103	  const double x  = temphisto.point(b).x();
104	  pair<double,double> ex = temphisto.point(b).xErrs();
105	  pair<double,double> ex2 = ex;
106	  if(ex2.first ==0.) ex2. first=0.0001;
107	  if(ex2.second==0.) ex2.second=0.0001;
108	  if (inRange(sqrtS()/GeV, x-ex2.first, x+ex2.second)) {
109	    mult->addPoint(x, sigma, ex, make_pair(error,error));
110	  }
111	  else {
112	    mult->addPoint(x, 0., ex, make_pair(0.,.0));
113	  }
114	}
115      }
116    }
117
118    /// @}
119
120
121    /// @name Histograms
122    /// @{
123    CounterPtr _nMeson[4];
124    /// @}
125
126
127  };
128
129
130  RIVET_DECLARE_PLUGIN(BESIII_2022_I2033007);
131
132}