Fork me on GitHub

source: git/modules/TimeSmearing.cc@ adde560

ImprovedOutputFile Timing dual_readout llp
Last change on this file since adde560 was 043e5b3, checked in by GitHub <noreply@…>, 7 years ago

Update TimeSmearing.cc

Smear final time

  • Property mode set to 100644
File size: 3.4 KB
RevLine 
[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
[af88093]19
20/** \class TimeSmearing
21 *
22 * Performs transverse momentum resolution smearing.
23 *
24 * \author P. Demin - UCL, Louvain-la-Neuve
25 *
26 */
27
28#include "modules/TimeSmearing.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
[6cdc544]46#include <algorithm>
[af88093]47#include <stdexcept>
48#include <iostream>
49#include <sstream>
50
51using namespace std;
52
53//------------------------------------------------------------------------------
54
55TimeSmearing::TimeSmearing() :
56fItInputArray(0)
57{
58}
59
60//------------------------------------------------------------------------------
61
62TimeSmearing::~TimeSmearing()
63{
64}
65
66//------------------------------------------------------------------------------
67
68void TimeSmearing::Init()
69{
70 // read resolution formula
71
72 fTimeResolution = GetDouble("TimeResolution", 1.0E-10);
73 // import input array
74
75 fInputArray = ImportArray(GetString("InputArray", "MuonMomentumSmearing/muons"));
76 fItInputArray = fInputArray->MakeIterator();
77
78 // create output array
79
80 fOutputArray = ExportArray(GetString("OutputArray", "muons"));
81}
82
83//------------------------------------------------------------------------------
84
85void TimeSmearing::Finish()
86{
87 if(fItInputArray) delete fItInputArray;
88}
89
90//------------------------------------------------------------------------------
91
92void TimeSmearing::Process()
93{
94 Candidate *candidate, *mother;
[efc1546]95 Double_t ti, tf_smeared, tf;
[af88093]96 const Double_t c_light = 2.99792458E8;
[6cdc544]97
[af88093]98 fItInputArray->Reset();
99 while((candidate = static_cast<Candidate*>(fItInputArray->Next())))
100 {
[efc1546]101 const TLorentzVector &candidateInitialPosition = candidate->InitialPosition;
102 const TLorentzVector &candidateFinalPosition = candidate->Position;
103
104 ti = candidateInitialPosition.T()*1.0E-3/c_light;
105 tf = candidateFinalPosition.T()*1.0E-3/c_light;
[6cdc544]106
[af88093]107 // apply smearing formula
[efc1546]108 tf_smeared = gRandom->Gaus(tf, fTimeResolution);
109 ti = ti + tf_smeared - tf;
[043e5b3]110 tf = tf_smeared;
111
[af88093]112 mother = candidate;
113 candidate = static_cast<Candidate*>(candidate->Clone());
[efc1546]114 candidate->InitialPosition.SetT(ti*1.0E3*c_light);
115 candidate->Position.SetT(tf*1.0E3*c_light);
116
[a0629ab]117 candidate->ErrorT = fTimeResolution*1.0E3*c_light;
[6cdc544]118
[af88093]119 candidate->AddCandidate(mother);
[6cdc544]120
[af88093]121 fOutputArray->Add(candidate);
122 }
123}
124
125//------------------------------------------------------------------------------
Note: See TracBrowser for help on using the repository browser.