[b443089] | 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 | *
|
---|
[b443089] | 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 | *
|
---|
[b443089] | 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 | *
|
---|
[b443089] | 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 |
|
---|
[d7d2da3] | 19 | /** \class TrackPileUpSubtractor
|
---|
| 20 | *
|
---|
| 21 | * Subtract pile-up contribution from tracks.
|
---|
| 22 | *
|
---|
| 23 | * \author P. Demin - UCL, Louvain-la-Neuve
|
---|
| 24 | *
|
---|
| 25 | */
|
---|
| 26 |
|
---|
| 27 | #include "modules/TrackPileUpSubtractor.h"
|
---|
| 28 |
|
---|
| 29 | #include "classes/DelphesClasses.h"
|
---|
| 30 | #include "classes/DelphesFactory.h"
|
---|
| 31 | #include "classes/DelphesFormula.h"
|
---|
| 32 |
|
---|
| 33 | #include "ExRootAnalysis/ExRootClassifier.h"
|
---|
[341014c] | 34 | #include "ExRootAnalysis/ExRootFilter.h"
|
---|
| 35 | #include "ExRootAnalysis/ExRootResult.h"
|
---|
[d7d2da3] | 36 |
|
---|
| 37 | #include "TDatabasePDG.h"
|
---|
[341014c] | 38 | #include "TFormula.h"
|
---|
[d7d2da3] | 39 | #include "TLorentzVector.h"
|
---|
[341014c] | 40 | #include "TMath.h"
|
---|
| 41 | #include "TObjArray.h"
|
---|
| 42 | #include "TRandom3.h"
|
---|
| 43 | #include "TString.h"
|
---|
[d7d2da3] | 44 |
|
---|
| 45 | #include <algorithm>
|
---|
| 46 | #include <iostream>
|
---|
| 47 | #include <sstream>
|
---|
[341014c] | 48 | #include <stdexcept>
|
---|
[d7d2da3] | 49 |
|
---|
| 50 | using namespace std;
|
---|
| 51 |
|
---|
| 52 | //------------------------------------------------------------------------------
|
---|
| 53 |
|
---|
[4de073b] | 54 | TrackPileUpSubtractor::TrackPileUpSubtractor() :
|
---|
[341014c] | 55 | fFormula(0)
|
---|
[d7d2da3] | 56 | {
|
---|
[4de073b] | 57 | fFormula = new DelphesFormula;
|
---|
[d7d2da3] | 58 | }
|
---|
| 59 |
|
---|
| 60 | //------------------------------------------------------------------------------
|
---|
| 61 |
|
---|
| 62 | TrackPileUpSubtractor::~TrackPileUpSubtractor()
|
---|
| 63 | {
|
---|
[4de073b] | 64 | if(fFormula) delete fFormula;
|
---|
[d7d2da3] | 65 | }
|
---|
| 66 |
|
---|
| 67 | //------------------------------------------------------------------------------
|
---|
| 68 |
|
---|
| 69 | void TrackPileUpSubtractor::Init()
|
---|
| 70 | {
|
---|
[715ab7c] | 71 | // import input array
|
---|
[22dc7fd] | 72 |
|
---|
| 73 | fVertexInputArray = ImportArray(GetString("VertexInputArray", "PileUpMerger/vertices"));
|
---|
| 74 | fItVertexInputArray = fVertexInputArray->MakeIterator();
|
---|
[715ab7c] | 75 |
|
---|
[4de073b] | 76 | // read resolution formula in m
|
---|
| 77 | fFormula->Compile(GetString("ZVertexResolution", "0.001"));
|
---|
[d7d2da3] | 78 |
|
---|
[e2d3977] | 79 | fPTMin = GetDouble("PTMin", 0.);
|
---|
[715ab7c] | 80 |
|
---|
[d7d2da3] | 81 | // import arrays with output from other modules
|
---|
[715ab7c] | 82 |
|
---|
[d7d2da3] | 83 | ExRootConfParam param = GetParam("InputArray");
|
---|
| 84 | Long_t i, size;
|
---|
| 85 | const TObjArray *array;
|
---|
| 86 | TIterator *iterator;
|
---|
| 87 |
|
---|
| 88 | size = param.GetSize();
|
---|
[341014c] | 89 | for(i = 0; i < size / 2; ++i)
|
---|
[d7d2da3] | 90 | {
|
---|
[341014c] | 91 | array = ImportArray(param[i * 2].GetString());
|
---|
[d7d2da3] | 92 | iterator = array->MakeIterator();
|
---|
| 93 |
|
---|
[341014c] | 94 | fInputMap[iterator] = ExportArray(param[i * 2 + 1].GetString());
|
---|
[d7d2da3] | 95 | }
|
---|
| 96 | }
|
---|
| 97 |
|
---|
| 98 | //------------------------------------------------------------------------------
|
---|
| 99 |
|
---|
| 100 | void TrackPileUpSubtractor::Finish()
|
---|
| 101 | {
|
---|
[341014c] | 102 | map<TIterator *, TObjArray *>::iterator itInputMap;
|
---|
[d7d2da3] | 103 | TIterator *iterator;
|
---|
| 104 |
|
---|
| 105 | for(itInputMap = fInputMap.begin(); itInputMap != fInputMap.end(); ++itInputMap)
|
---|
| 106 | {
|
---|
| 107 | iterator = itInputMap->first;
|
---|
| 108 |
|
---|
| 109 | if(iterator) delete iterator;
|
---|
| 110 | }
|
---|
[22dc7fd] | 111 |
|
---|
| 112 | if(fItVertexInputArray) delete fItVertexInputArray;
|
---|
[d7d2da3] | 113 | }
|
---|
| 114 |
|
---|
| 115 | //------------------------------------------------------------------------------
|
---|
| 116 |
|
---|
| 117 | void TrackPileUpSubtractor::Process()
|
---|
| 118 | {
|
---|
| 119 | Candidate *candidate, *particle;
|
---|
[341014c] | 120 | map<TIterator *, TObjArray *>::iterator itInputMap;
|
---|
[d7d2da3] | 121 | TIterator *iterator;
|
---|
| 122 | TObjArray *array;
|
---|
[341014c] | 123 | Double_t z, zvtx = 0;
|
---|
[4de073b] | 124 | Double_t pt, eta, phi, e;
|
---|
[22dc7fd] | 125 |
|
---|
| 126 | // find z position of primary vertex
|
---|
[715ab7c] | 127 |
|
---|
[22dc7fd] | 128 | fItVertexInputArray->Reset();
|
---|
[341014c] | 129 | while((candidate = static_cast<Candidate *>(fItVertexInputArray->Next())))
|
---|
[22dc7fd] | 130 | {
|
---|
[54b6dfc] | 131 | if(!candidate->IsPU)
|
---|
[22dc7fd] | 132 | {
|
---|
[715ab7c] | 133 | zvtx = candidate->Position.Z();
|
---|
| 134 | // break;
|
---|
[22dc7fd] | 135 | }
|
---|
| 136 | }
|
---|
| 137 |
|
---|
[d7d2da3] | 138 | // loop over all input arrays
|
---|
| 139 | for(itInputMap = fInputMap.begin(); itInputMap != fInputMap.end(); ++itInputMap)
|
---|
| 140 | {
|
---|
| 141 | iterator = itInputMap->first;
|
---|
| 142 | array = itInputMap->second;
|
---|
| 143 |
|
---|
| 144 | // loop over all candidates
|
---|
| 145 | iterator->Reset();
|
---|
[341014c] | 146 | while((candidate = static_cast<Candidate *>(iterator->Next())))
|
---|
[d7d2da3] | 147 | {
|
---|
[341014c] | 148 | particle = static_cast<Candidate *>(candidate->GetCandidates()->At(0));
|
---|
[4de073b] | 149 | const TLorentzVector &candidateMomentum = particle->Momentum;
|
---|
| 150 |
|
---|
| 151 | eta = candidateMomentum.Eta();
|
---|
| 152 | pt = candidateMomentum.Pt();
|
---|
| 153 | phi = candidateMomentum.Phi();
|
---|
| 154 | e = candidateMomentum.E();
|
---|
[341014c] | 155 |
|
---|
[d7d2da3] | 156 | z = particle->Position.Z();
|
---|
[715ab7c] | 157 |
|
---|
[d7d2da3] | 158 | // apply pile-up subtraction
|
---|
| 159 | // assume perfect pile-up subtraction for tracks outside fZVertexResolution
|
---|
[715ab7c] | 160 |
|
---|
[341014c] | 161 | if(candidate->Charge != 0 && candidate->IsPU && TMath::Abs(z - zvtx) > fFormula->Eval(pt, eta, phi, e) * 1.0e3)
|
---|
[715ab7c] | 162 | {
|
---|
| 163 | candidate->IsRecoPU = 1;
|
---|
| 164 | }
|
---|
| 165 | else
|
---|
[e2d3977] | 166 | {
|
---|
[715ab7c] | 167 | candidate->IsRecoPU = 0;
|
---|
| 168 | if(candidate->Momentum.Pt() > fPTMin) array->Add(candidate);
|
---|
[e2d3977] | 169 | }
|
---|
[d7d2da3] | 170 | }
|
---|
| 171 | }
|
---|
| 172 | }
|
---|