| 1 |
mzanetti |
1.1 |
//--------------------------------------------------------------------------------------------------
|
| 2 |
paus |
1.5 |
// $Id: PileupInfo.h,v 1.4 2011/10/22 15:05:05 bendavid Exp $
|
| 3 |
mzanetti |
1.1 |
//
|
| 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 |
mzanetti |
1.2 |
bunchCrossing(0),
|
| 26 |
bendavid |
1.4 |
num_PU_vertices(0),
|
| 27 |
|
|
num_PU_mean(0)
|
| 28 |
mzanetti |
1.1 |
{ };
|
| 29 |
|
|
|
| 30 |
paus |
1.5 |
Int_t GetBunchCrossing() const { return bunchCrossing; }
|
| 31 |
|
|
UInt_t GetPU_NumInteractions() const { return num_PU_vertices; }
|
| 32 |
|
|
Float_t GetPU_NumMean() const { return num_PU_mean; }
|
| 33 |
|
|
const FArrDouble32 &GetPU_zPositions() const { return zPositions; }
|
| 34 |
|
|
const FArrDouble32 &GetPU_sumpT_lowpT() const { return sumpT_lowpT; }
|
| 35 |
|
|
const FArrDouble32 &GetPU_sumpT_highpT() const { return sumpT_highpT; }
|
| 36 |
|
|
const FArrUInt &GetPU_ntrks_lowpT() const { return ntrks_lowpT; }
|
| 37 |
|
|
const FArrUInt &GetPU_ntrks_highpT() const { return ntrks_highpT; }
|
| 38 |
|
|
virtual PileupInfo *MakeCopy() const { return new PileupInfo(*this); }
|
| 39 |
mzanetti |
1.2 |
|
| 40 |
paus |
1.5 |
void SetBunchCrossing(Int_t i) { bunchCrossing = i; }
|
| 41 |
|
|
void SetPU_NumInteractions(UInt_t i) { num_PU_vertices = i; }
|
| 42 |
|
|
void SetPU_NumMean(Float_t x) { num_PU_mean = x; }
|
| 43 |
|
|
void PushPU_zPositions(Double32_t x) { zPositions.Add(x); }
|
| 44 |
|
|
void PushPU_sumpT_lowpT(Double32_t x) { sumpT_lowpT.Add(x); }
|
| 45 |
|
|
void PushPU_sumpT_highpT(Double32_t x) { sumpT_highpT.Add(x); }
|
| 46 |
|
|
void PushPU_ntrks_lowpT(UInt_t i) { ntrks_lowpT.Add(i); }
|
| 47 |
|
|
void PushPU_ntrks_highpT(UInt_t i) { ntrks_highpT.Add(i); }
|
| 48 |
mzanetti |
1.1 |
|
| 49 |
|
|
protected:
|
| 50 |
paus |
1.5 |
Int_t bunchCrossing; //bunch crossing
|
| 51 |
|
|
UInt_t num_PU_vertices; //number of PU vertices
|
| 52 |
|
|
FArrDouble32 zPositions; //||array positions along z
|
| 53 |
|
|
FArrDouble32 sumpT_lowpT; //||array sumpT for lowpT tracks
|
| 54 |
|
|
FArrDouble32 sumpT_highpT; //||array sumpT for highT tracks
|
| 55 |
|
|
FArrUInt ntrks_lowpT; //||array lowpT tracks
|
| 56 |
|
|
FArrUInt ntrks_highpT; //||array highpT tracks
|
| 57 |
|
|
Float_t num_PU_mean; //poisson mean from which npu was thrown
|
| 58 |
mzanetti |
1.1 |
|
| 59 |
bendavid |
1.4 |
ClassDef(PileupInfo, 3) // Pileup Information class
|
| 60 |
mzanetti |
1.1 |
};
|
| 61 |
|
|
}
|
| 62 |
|
|
|
| 63 |
|
|
#endif
|
