Fork me on GitHub

source: git/modules/TrackPileUpSubtractor.cc@ b62c2da

ImprovedOutputFile Timing dual_readout llp
Last change on this file since b62c2da was b62c2da, checked in by Michele Selvaggi <michele.selvaggi@…>, 10 years ago

added isolation variables to Candidate and Electrons, Muons, Photons classes

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