| 1 | /*
|
|---|
| 2 | * Delphes: a framework for fast simulation of a generic collider experiment
|
|---|
| 3 | * Copyright (C) 2012-2014 Universite catholique de Louvain (UCL), Belgium
|
|---|
| 4 | *
|
|---|
| 5 | * This program is free software: you can redistribute it and/or modify
|
|---|
| 6 | * it under the terms of the GNU General Public License as published by
|
|---|
| 7 | * the Free Software Foundation, either version 3 of the License, or
|
|---|
| 8 | * (at your option) any later version.
|
|---|
| 9 | *
|
|---|
| 10 | * This program is distributed in the hope that it will be useful,
|
|---|
| 11 | * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|---|
| 12 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|---|
| 13 | * GNU General Public License for more details.
|
|---|
| 14 | *
|
|---|
| 15 | * You should have received a copy of the GNU General Public License
|
|---|
| 16 | * along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|---|
| 17 | */
|
|---|
| 18 |
|
|---|
| 19 | /** \class CscClusterEfficiency
|
|---|
| 20 | *
|
|---|
| 21 | * Selects candidates from the InputArray according to the CscClusterEfficiency formula.
|
|---|
| 22 | *
|
|---|
| 23 | * \author P. Demin - UCL, Louvain-la-Neuve
|
|---|
| 24 | *
|
|---|
| 25 | */
|
|---|
| 26 |
|
|---|
| 27 | #include "modules/CscClusterEfficiency.h"
|
|---|
| 28 |
|
|---|
| 29 | #include "classes/DelphesClasses.h"
|
|---|
| 30 | #include "classes/DelphesFactory.h"
|
|---|
| 31 | #include "classes/DelphesCscClusterFormula.h"
|
|---|
| 32 |
|
|---|
| 33 | #include "ExRootAnalysis/ExRootClassifier.h"
|
|---|
| 34 | #include "ExRootAnalysis/ExRootFilter.h"
|
|---|
| 35 | #include "ExRootAnalysis/ExRootResult.h"
|
|---|
| 36 |
|
|---|
| 37 | #include "TDatabasePDG.h"
|
|---|
| 38 | #include "TFormula.h"
|
|---|
| 39 | #include "TLorentzVector.h"
|
|---|
| 40 | #include "TMath.h"
|
|---|
| 41 | #include "TObjArray.h"
|
|---|
| 42 | #include "TRandom3.h"
|
|---|
| 43 | #include "TString.h"
|
|---|
| 44 |
|
|---|
| 45 | #include <algorithm>
|
|---|
| 46 | #include <iostream>
|
|---|
| 47 | #include <sstream>
|
|---|
| 48 | #include <stdexcept>
|
|---|
| 49 |
|
|---|
| 50 | using namespace std;
|
|---|
| 51 |
|
|---|
| 52 | //------------------------------------------------------------------------------
|
|---|
| 53 |
|
|---|
| 54 | CscClusterEfficiency::CscClusterEfficiency() :
|
|---|
| 55 | fFormula(0), fItInputArray(0)
|
|---|
| 56 | {
|
|---|
| 57 | fFormula = new DelphesCscClusterFormula;
|
|---|
| 58 | }
|
|---|
| 59 |
|
|---|
| 60 | //------------------------------------------------------------------------------
|
|---|
| 61 |
|
|---|
| 62 | CscClusterEfficiency::~CscClusterEfficiency()
|
|---|
| 63 | {
|
|---|
| 64 | if(fFormula) delete fFormula;
|
|---|
| 65 | }
|
|---|
| 66 |
|
|---|
| 67 | //------------------------------------------------------------------------------
|
|---|
| 68 |
|
|---|
| 69 | void CscClusterEfficiency::Init()
|
|---|
| 70 | {
|
|---|
| 71 | // read CscClusterEfficiency formula
|
|---|
| 72 | fFormula->Compile(GetString("EfficiencyFormula", "1.0"));
|
|---|
| 73 |
|
|---|
| 74 | // import input array
|
|---|
| 75 |
|
|---|
| 76 | fInputArray = ImportArray(GetString("InputArray", "ParticlePropagator/stableParticles"));
|
|---|
| 77 | fItInputArray = fInputArray->MakeIterator();
|
|---|
| 78 |
|
|---|
| 79 | // create output array
|
|---|
| 80 |
|
|---|
| 81 | fOutputArray = ExportArray(GetString("OutputArray", "stableParticles"));
|
|---|
| 82 | }
|
|---|
| 83 |
|
|---|
| 84 | //------------------------------------------------------------------------------
|
|---|
| 85 |
|
|---|
| 86 | void CscClusterEfficiency::Finish()
|
|---|
| 87 | {
|
|---|
| 88 | if(fItInputArray) delete fItInputArray;
|
|---|
| 89 | }
|
|---|
| 90 |
|
|---|
| 91 | //------------------------------------------------------------------------------
|
|---|
| 92 |
|
|---|
| 93 | void CscClusterEfficiency::Process()
|
|---|
| 94 | {
|
|---|
| 95 | Candidate *candidate;
|
|---|
| 96 | Double_t Ehad, Eem, decayR, decayZ;
|
|---|
| 97 |
|
|---|
| 98 | fItInputArray->Reset();
|
|---|
| 99 | while((candidate = static_cast<Candidate *>(fItInputArray->Next())))
|
|---|
| 100 | {
|
|---|
| 101 | const TLorentzVector &candidateDecayPosition = candidate->DecayPosition;
|
|---|
| 102 | decayZ = abs(candidateDecayPosition.Z());
|
|---|
| 103 | decayR = sqrt(pow(candidateDecayPosition.X(),2)+pow(candidateDecayPosition.Y(),2));
|
|---|
| 104 | Ehad = candidate->Ehad;
|
|---|
| 105 | Eem = candidate->Eem;
|
|---|
| 106 | // apply an efficency formula
|
|---|
| 107 | if(gRandom->Uniform() > fFormula->Eval(decayR, decayZ, Ehad, Eem)) continue;
|
|---|
| 108 |
|
|---|
| 109 |
|
|---|
| 110 | fOutputArray->Add(candidate);
|
|---|
| 111 | }
|
|---|
| 112 | }
|
|---|
| 113 |
|
|---|
| 114 | //------------------------------------------------------------------------------
|
|---|
