ViewVC Help
View File | Revision Log | Show Annotations | Root Listing
root/cvsroot/UserCode/MitAna/DataTree/interface/PileupInfo.h
Revision: 1.3
Committed: Fri Mar 25 16:51:56 2011 UTC (14 years, 1 month ago) by bendavid
Content type: text/plain
Branch: MAIN
CVS Tags: Mit_025, Mit_025pre2, Mit_024b, Mit_025pre1, Mit_024a, Mit_024, Mit_023, Mit_022a, Mit_022, Mit_020d, TMit_020d, Mit_020c, Mit_021, Mit_021pre2, Mit_021pre1, Mit_020b, Mit_020a, Mit_020, Mit_020pre1
Changes since 1.2: +2 -2 lines
Log Message:
increment class version

File Contents

# Content
1 //--------------------------------------------------------------------------------------------------
2 // $Id: PileupInfo.h,v 1.2 2011/03/25 15:40:54 mzanetti Exp $
3 //
4 // Met
5 //
6 // Class to store missing transverse energy information.
7 // This is the base class for various specific kinds of missing energy (CaloMet, PFMet, etc.),
8 // but can also be used directly.
9 //
10 // Authors: M. Zanetti
11 //--------------------------------------------------------------------------------------------------
12
13 #ifndef MITANA_DATATREE_PILEUPINFO_H
14 #define MITANA_DATATREE_PILEUPINFO_H
15
16 #include "MitAna/DataTree/interface/DataBase.h"
17 #include "MitAna/DataTree/interface/Particle.h"
18
19 namespace mithep
20 {
21 class PileupInfo : public DataBase
22 {
23 public:
24 PileupInfo():
25 bunchCrossing(0),
26 num_PU_vertices(0)
27 { };
28
29 const Int_t GetBunchCrossing() const { return bunchCrossing; }
30 const UInt_t GetPU_NumInteractions() const { return num_PU_vertices; }
31 const FArrDouble32 &GetPU_zPositions() const { return zPositions; }
32 const FArrDouble32 &GetPU_sumpT_lowpT() const { return sumpT_lowpT; }
33 const FArrDouble32 &GetPU_sumpT_highpT() const { return sumpT_highpT; }
34 const FArrUInt &GetPU_ntrks_lowpT() const { return ntrks_lowpT; }
35 const FArrUInt &GetPU_ntrks_highpT() const { return ntrks_highpT; }
36
37 virtual PileupInfo *MakeCopy() const { return new PileupInfo(*this); }
38
39 void SetBunchCrossing(Int_t i) { bunchCrossing = i; }
40 void SetPU_NumInteractions(UInt_t i) { num_PU_vertices = i; }
41 void PushPU_zPositions(Double32_t x) { zPositions.Add(x); }
42 void PushPU_sumpT_lowpT(Double32_t x) { sumpT_lowpT.Add(x); }
43 void PushPU_sumpT_highpT(Double32_t x) { sumpT_highpT.Add(x); }
44 void PushPU_ntrks_lowpT(UInt_t i) { ntrks_lowpT.Add(i); }
45 void PushPU_ntrks_highpT(UInt_t i) { ntrks_highpT.Add(i); }
46
47 protected:
48 Int_t bunchCrossing; //bunch crossing
49 UInt_t num_PU_vertices; //number of PU vertices
50 FArrDouble32 zPositions; //||array positions along z
51 FArrDouble32 sumpT_lowpT; //||array sumpT for lowpT tracks
52 FArrDouble32 sumpT_highpT; //||array sumpT for highT tracks
53 FArrUInt ntrks_lowpT; //||array lowpT tracks
54 FArrUInt ntrks_highpT; //||array highpT tracks
55
56
57 ClassDef(PileupInfo, 2) // Pileup Information class
58 };
59 }
60
61 #endif