Fork me on GitHub

source: git/modules/ExampleModule.cc@ 1d42548

ImprovedOutputFile Timing dual_readout llp
Last change on this file since 1d42548 was 7c0fcd5, checked in by Pavel Demin <demin@…>, 10 years ago

delete duplicate license file and prepend GPLv3 header to all source code files

  • Property mode set to 100644
File size: 3.4 KB
RevLine 
[7c0fcd5]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
[d7d2da3]19
20/** \class ExampleModule
21 *
22 * Selects candidates from the InputArray according to the efficiency formula.
23 *
24 * $Date$
25 * $Revision$
26 *
27 *
28 * \author P. Demin - UCL, Louvain-la-Neuve
29 *
30 */
31
32#include "modules/ExampleModule.h"
33
34#include "classes/DelphesClasses.h"
35#include "classes/DelphesFactory.h"
36#include "classes/DelphesFormula.h"
37
38#include "ExRootAnalysis/ExRootResult.h"
39#include "ExRootAnalysis/ExRootFilter.h"
40#include "ExRootAnalysis/ExRootClassifier.h"
41
42#include "TMath.h"
43#include "TString.h"
44#include "TFormula.h"
45#include "TRandom3.h"
46#include "TObjArray.h"
47#include "TDatabasePDG.h"
48#include "TLorentzVector.h"
49
50#include <algorithm>
51#include <stdexcept>
52#include <iostream>
53#include <sstream>
54
55using namespace std;
56
57//------------------------------------------------------------------------------
58
59ExampleModule::ExampleModule() :
60 fFormula(0), fItInputArray(0)
61{
62 fFormula = new DelphesFormula;
63}
64
65//------------------------------------------------------------------------------
66
67ExampleModule::~ExampleModule()
68{
69 if(fFormula) delete fFormula;
70}
71
72//------------------------------------------------------------------------------
73
74void ExampleModule::Init()
75{
76 // read parameters
77
78 fIntParam = GetInt("IntParam", 10);
79
80 fDoubleParam = GetDouble("DoubleParam", 1.0);
81
82 fFormula->Compile(GetString("EfficiencyFormula", "0.4"));
83
84 ExRootConfParam param = GetParam("ArrayParam");
85 Long_t i, size;
86 fArrayParam.clear();
87
88 size = param.GetSize();
89 for(i = 0; i < size; ++i)
90 {
91 fArrayParam.push_back(param[i].GetDouble());
92 }
93
94 // import input array(s)
95
96 fInputArray = ImportArray(GetString("InputArray", "FastJetFinder/jets"));
97 fItInputArray = fInputArray->MakeIterator();
98
99 // create output array(s)
100
101 fOutputArray = ExportArray(GetString("OutputArray", "jets"));
102
103}
104
105//------------------------------------------------------------------------------
106
107void ExampleModule::Finish()
108{
109 if(fItInputArray) delete fItInputArray;
110}
111
112//------------------------------------------------------------------------------
113
114void ExampleModule::Process()
115{
116 Candidate *candidate;
117 TLorentzVector candidatePosition, candidateMomentum;
118
119 // loop over all input candidates
120 fItInputArray->Reset();
121 while((candidate = static_cast<Candidate*>(fItInputArray->Next())))
122 {
123 candidatePosition = candidate->Position;
124 candidateMomentum = candidate->Momentum;
125
126 // apply an efficency formula
127 if(gRandom->Uniform() <= fFormula->Eval(candidateMomentum.Pt(), candidatePosition.Eta()))
128 {
129 fOutputArray->Add(candidate);
130 }
131 }
132}
133
134//------------------------------------------------------------------------------
Note: See TracBrowser for help on using the repository browser.