[caba091] | 1 | /*
|
---|
| 2 | * Delphes: a framework for fast simulation of a generic collider experiment
|
---|
| 3 | * Copyright (C) 2012-2014 Universite catholique de Louvain (UCL), Belgium
|
---|
[1fa50c2] | 4 | *
|
---|
[caba091] | 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.
|
---|
[1fa50c2] | 9 | *
|
---|
[caba091] | 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.
|
---|
[1fa50c2] | 14 | *
|
---|
[caba091] | 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 |
|
---|
[cab38f6] | 19 | /** \class IdentificationMap
|
---|
| 20 | *
|
---|
| 21 | * Converts particles with some PDG code into another particle,
|
---|
| 22 | * according to parametrized probability.
|
---|
| 23 | *
|
---|
| 24 | * \author M. Selvaggi - UCL, Louvain-la-Neuve
|
---|
| 25 | *
|
---|
| 26 | */
|
---|
| 27 |
|
---|
| 28 | #include "modules/IdentificationMap.h"
|
---|
| 29 |
|
---|
| 30 | #include "classes/DelphesClasses.h"
|
---|
| 31 | #include "classes/DelphesFactory.h"
|
---|
| 32 | #include "classes/DelphesFormula.h"
|
---|
| 33 |
|
---|
| 34 | #include "ExRootAnalysis/ExRootClassifier.h"
|
---|
[341014c] | 35 | #include "ExRootAnalysis/ExRootFilter.h"
|
---|
| 36 | #include "ExRootAnalysis/ExRootResult.h"
|
---|
[cab38f6] | 37 |
|
---|
| 38 | #include "TDatabasePDG.h"
|
---|
[341014c] | 39 | #include "TFormula.h"
|
---|
[cab38f6] | 40 | #include "TLorentzVector.h"
|
---|
[341014c] | 41 | #include "TMath.h"
|
---|
| 42 | #include "TObjArray.h"
|
---|
| 43 | #include "TRandom3.h"
|
---|
| 44 | #include "TString.h"
|
---|
[cab38f6] | 45 |
|
---|
| 46 | #include <algorithm>
|
---|
| 47 | #include <iostream>
|
---|
| 48 | #include <sstream>
|
---|
[341014c] | 49 | #include <stdexcept>
|
---|
[cab38f6] | 50 |
|
---|
| 51 | using namespace std;
|
---|
| 52 |
|
---|
| 53 | //------------------------------------------------------------------------------
|
---|
| 54 |
|
---|
| 55 | IdentificationMap::IdentificationMap() :
|
---|
| 56 | fItInputArray(0)
|
---|
| 57 | {
|
---|
| 58 | }
|
---|
| 59 |
|
---|
| 60 | //------------------------------------------------------------------------------
|
---|
| 61 |
|
---|
| 62 | IdentificationMap::~IdentificationMap()
|
---|
| 63 | {
|
---|
| 64 | }
|
---|
| 65 |
|
---|
| 66 | //------------------------------------------------------------------------------
|
---|
| 67 |
|
---|
| 68 | void IdentificationMap::Init()
|
---|
| 69 | {
|
---|
| 70 | TMisIDMap::iterator itEfficiencyMap;
|
---|
| 71 | ExRootConfParam param;
|
---|
| 72 | DelphesFormula *formula;
|
---|
| 73 | Int_t i, size, pdg;
|
---|
| 74 |
|
---|
| 75 | // read efficiency formulas
|
---|
| 76 | param = GetParam("EfficiencyFormula");
|
---|
| 77 | size = param.GetSize();
|
---|
| 78 |
|
---|
| 79 | fEfficiencyMap.clear();
|
---|
[341014c] | 80 | for(i = 0; i < size / 3; ++i)
|
---|
[cab38f6] | 81 | {
|
---|
| 82 | formula = new DelphesFormula;
|
---|
[341014c] | 83 | formula->Compile(param[i * 3 + 2].GetString());
|
---|
| 84 | pdg = param[i * 3].GetInt();
|
---|
| 85 | fEfficiencyMap.insert(make_pair(pdg, make_pair(param[i * 3 + 1].GetInt(), formula)));
|
---|
[cab38f6] | 86 | }
|
---|
| 87 |
|
---|
| 88 | // set default efficiency formula
|
---|
| 89 | itEfficiencyMap = fEfficiencyMap.find(0);
|
---|
| 90 | if(itEfficiencyMap == fEfficiencyMap.end())
|
---|
| 91 | {
|
---|
| 92 | formula = new DelphesFormula;
|
---|
| 93 | formula->Compile("1.0");
|
---|
| 94 |
|
---|
[a5bbe8a] | 95 | fEfficiencyMap.insert(make_pair(0, make_pair(0, formula)));
|
---|
[cab38f6] | 96 | }
|
---|
| 97 |
|
---|
| 98 | // import input array
|
---|
| 99 |
|
---|
| 100 | fInputArray = ImportArray(GetString("InputArray", "ParticlePropagator/stableParticles"));
|
---|
| 101 | fItInputArray = fInputArray->MakeIterator();
|
---|
| 102 |
|
---|
| 103 | // create output array
|
---|
| 104 |
|
---|
| 105 | fOutputArray = ExportArray(GetString("OutputArray", "stableParticles"));
|
---|
| 106 | }
|
---|
| 107 |
|
---|
| 108 | //------------------------------------------------------------------------------
|
---|
| 109 |
|
---|
| 110 | void IdentificationMap::Finish()
|
---|
| 111 | {
|
---|
| 112 | if(fItInputArray) delete fItInputArray;
|
---|
| 113 |
|
---|
| 114 | TMisIDMap::iterator itEfficiencyMap;
|
---|
| 115 | DelphesFormula *formula;
|
---|
| 116 | for(itEfficiencyMap = fEfficiencyMap.begin(); itEfficiencyMap != fEfficiencyMap.end(); ++itEfficiencyMap)
|
---|
| 117 | {
|
---|
| 118 | formula = (itEfficiencyMap->second).second;
|
---|
| 119 | if(formula) delete formula;
|
---|
| 120 | }
|
---|
| 121 | }
|
---|
| 122 |
|
---|
| 123 | //------------------------------------------------------------------------------
|
---|
| 124 |
|
---|
| 125 | void IdentificationMap::Process()
|
---|
| 126 | {
|
---|
| 127 | Candidate *candidate;
|
---|
[95aa610] | 128 | Double_t pt, eta, phi, e;
|
---|
[cab38f6] | 129 | TMisIDMap::iterator itEfficiencyMap;
|
---|
[341014c] | 130 | pair<TMisIDMap::iterator, TMisIDMap::iterator> range;
|
---|
[cab38f6] | 131 | DelphesFormula *formula;
|
---|
[a5bbe8a] | 132 | Int_t pdgCodeIn, pdgCodeOut, charge;
|
---|
[cab38f6] | 133 |
|
---|
[a5bbe8a] | 134 | Double_t p, r, total;
|
---|
[cab38f6] | 135 |
|
---|
| 136 | fItInputArray->Reset();
|
---|
[341014c] | 137 | while((candidate = static_cast<Candidate *>(fItInputArray->Next())))
|
---|
[cab38f6] | 138 | {
|
---|
| 139 | const TLorentzVector &candidatePosition = candidate->Position;
|
---|
| 140 | const TLorentzVector &candidateMomentum = candidate->Momentum;
|
---|
| 141 | eta = candidatePosition.Eta();
|
---|
| 142 | phi = candidatePosition.Phi();
|
---|
| 143 | pt = candidateMomentum.Pt();
|
---|
[95aa610] | 144 | e = candidateMomentum.E();
|
---|
[341014c] | 145 |
|
---|
[a5bbe8a] | 146 | pdgCodeIn = candidate->PID;
|
---|
[cab38f6] | 147 | charge = candidate->Charge;
|
---|
| 148 |
|
---|
[a5bbe8a] | 149 | // first check that PID of this particle is specified in the map
|
---|
| 150 | // otherwise, look for PID = 0
|
---|
[cab38f6] | 151 |
|
---|
[a5bbe8a] | 152 | itEfficiencyMap = fEfficiencyMap.find(pdgCodeIn);
|
---|
[cab38f6] | 153 |
|
---|
[a5bbe8a] | 154 | range = fEfficiencyMap.equal_range(pdgCodeIn);
|
---|
| 155 | if(range.first == range.second) range = fEfficiencyMap.equal_range(-pdgCodeIn);
|
---|
[cab38f6] | 156 | if(range.first == range.second) range = fEfficiencyMap.equal_range(0);
|
---|
| 157 |
|
---|
[a5bbe8a] | 158 | r = gRandom->Uniform();
|
---|
| 159 | total = 0.0;
|
---|
[cab38f6] | 160 |
|
---|
[a5bbe8a] | 161 | // loop over sub-map for this PID
|
---|
| 162 | for(TMisIDMap::iterator it = range.first; it != range.second; ++it)
|
---|
| 163 | {
|
---|
[cab38f6] | 164 | formula = (it->second).second;
|
---|
[a5bbe8a] | 165 | pdgCodeOut = (it->second).first;
|
---|
[cab38f6] | 166 |
|
---|
[95aa610] | 167 | p = formula->Eval(pt, eta, phi, e);
|
---|
[cab38f6] | 168 |
|
---|
[a5bbe8a] | 169 | if(total <= r && r < total + p)
|
---|
[cab38f6] | 170 | {
|
---|
[a5bbe8a] | 171 | // change PID of particle
|
---|
[a3261d7] | 172 | candidate = static_cast<Candidate *>(candidate->Clone());
|
---|
[341014c] | 173 | if(pdgCodeOut != 0) candidate->PID = charge * pdgCodeOut;
|
---|
[a5bbe8a] | 174 | fOutputArray->Add(candidate);
|
---|
| 175 | break;
|
---|
[cab38f6] | 176 | }
|
---|
| 177 |
|
---|
[a5bbe8a] | 178 | total += p;
|
---|
[cab38f6] | 179 | }
|
---|
[a5bbe8a] | 180 | }
|
---|
[cab38f6] | 181 | }
|
---|
| 182 |
|
---|
| 183 | //------------------------------------------------------------------------------
|
---|