#include <PileupInfo.h>

Public Member Functions
void	Branches ()

void	Fill (const edm::Event &)

void	Fill ()

	PileupInfo ()

	PileupInfo (const edm::InputTag &, TTree *)

void	ReadFromEvent (const edm::Event &)

	~PileupInfo ()

Static Public Attributes
static const int	maxParticles = 1000

Protected Attributes
edm::InputTag	input_collection_

float	n_pu_

float	n_true_pu_

TTree *	tree_

Detailed Description

Definition at line 38 of file PileupInfo.h.

Constructor & Destructor Documentation

PileupInfo::PileupInfo ( )

Definition at line 32 of file PileupInfo.cc.

 {
    // default constructor
 }

PileupInfo::PileupInfo	(	const edm::InputTag &	tag,
		TTree *	tree
	)

Definition at line 37 of file PileupInfo.cc.

References input_collection_, and tree_.

 {
    input_collection_ = tag;
    tree_ = tree;
    
 }

PileupInfo::~PileupInfo ( )

Definition at line 44 of file PileupInfo.cc.

 {
    // do anything here that needs to be done at desctruction time
    // (e.g. close files, deallocate resources etc.)
 }

Member Function Documentation

void PileupInfo::Branches ( )

Definition at line 96 of file PileupInfo.cc.

References n_pu_, n_true_pu_, and tree_.

 {
    tree_->Branch("nTruePileup",  &this->n_true_pu_, "nTruePileup/F");
    tree_->Branch("nPileup",  &this->n_pu_, "nPileup/F");
 }

void PileupInfo::Fill ( const edm::Event & event )

Definition at line 89 of file PileupInfo.cc.

References Fill(), and ReadFromEvent().

 {
    ReadFromEvent(event);
    Fill();
 }

void PileupInfo::Fill ( )

Definition at line 84 of file PileupInfo.cc.

References tree_.

Referenced by Fill().

 {
    tree_->Fill();
 }

void PileupInfo::ReadFromEvent ( const edm::Event & event )

Definition at line 56 of file PileupInfo.cc.

References input_collection_, n_pu_, and n_true_pu_.

Referenced by Fill().

 {
    using namespace edm;
    
    // 
    edm::Handle<std::vector<PileupSummaryInfo> > handler;
    event.getByLabel(input_collection_, handler);
 
    std::vector<PileupSummaryInfo> pileup_infos = *(handler.product());
    
 // Take the first entry - should be enough
 //   for ( size_t i = 0 ; i < pileup_infos.size() ; ++i )
 //   {
    
       PileupSummaryInfo pileup_info = pileup_infos.at(0);
       
 //      if ( pileup_info.getBunchCrossing() != 0 ) continue;
       
       n_true_pu_ = pileup_info.getTrueNumInteractions();
       n_pu_ = pileup_info.getPU_NumInteractions();
       
 //      break;
 //   }
    
    
 }