| 11 |
|
#ifndef MITPROD_TREEFILLER_FILLERPFCANDIDATES_H |
| 12 |
|
#define MITPROD_TREEFILLER_FILLERPFCANDIDATES_H |
| 13 |
|
|
| 14 |
< |
#include "FWCore/ParameterSet/interface/ParameterSet.h" |
| 15 |
< |
#include "MitAna/DataUtil/interface/TreeWriter.h" |
| 16 |
< |
#include "MitAna/DataTree/interface/Collections.h" |
| 17 |
< |
#include "MitProd/TreeFiller/interface/BaseFiller.h" |
| 14 |
> |
#include "MitAna/DataTree/interface/PFCandidateFwd.h" |
| 15 |
|
#include "MitProd/TreeFiller/interface/AssociationMaps.h" |
| 16 |
+ |
#include "MitProd/TreeFiller/interface/BaseFiller.h" |
| 17 |
|
|
| 18 |
|
namespace mithep |
| 19 |
|
{ |
| 23 |
|
FillerPFCandidates(const edm::ParameterSet &cfg, const char *name, bool active=1); |
| 24 |
|
~FillerPFCandidates(); |
| 25 |
|
|
| 26 |
< |
void BookDataBlock(TreeWriter &tws); |
| 27 |
< |
void FillDataBlock(const edm::Event &e, const edm::EventSetup &es); |
| 28 |
< |
void ResolveLinks (const edm::Event &e, const edm::EventSetup &es); |
| 26 |
> |
void BookDataBlock(TreeWriter &tws); |
| 27 |
> |
void FillDataBlock(const edm::Event &e, const edm::EventSetup &es); |
| 28 |
> |
void ResolveLinks (const edm::Event &e, const edm::EventSetup &es); |
| 29 |
|
|
| 30 |
|
private: |
| 31 |
< |
std::string edmName_; //edm name of PFCandidates collection |
| 32 |
< |
std::string mitName_; //name of PFCandidate branch in BAMBU |
| 33 |
< |
std::string globalTrackMapName_; //name of imported map wrt global muons |
| 34 |
< |
std::string staTrackMapName_; //name of imported map wrt sta muons |
| 35 |
< |
std::string staVtxTrackMapName_; //name of imported map wrt sta vtx muons |
| 36 |
< |
std::string trackerTrackMapName_; //name of imported map wrt general tracks |
| 37 |
< |
std::string gsfTrackMapName_; //name of imported map wrt pf gsf tracks |
| 38 |
< |
std::string muonMapName_; //name of imported map wrt muons |
| 39 |
< |
std::string conversionMapName_; //name of imported map wrt conversions |
| 40 |
< |
std::string pfCandMapName_; //name of exported pf candidate map |
| 41 |
< |
const mithep::TrackMap *trackerTrackMap_; //map wrt tracker tracks |
| 42 |
< |
const mithep::TrackMap *gsfTrackMap_; //map wrt pf gsf tracks |
| 43 |
< |
const mithep::MuonMap *muonMap_; //map wrt muons |
| 31 |
> |
|
| 32 |
> |
const mithep::Track *getMitTrack(mitedm::TrackPtr ptr, bool allowmissing) const; |
| 33 |
> |
|
| 34 |
> |
std::string edmName_; //edm name of PFCandidates collection |
| 35 |
> |
std::string edmPfNoPileupName_; //edm name of PFNoPileup collection |
| 36 |
> |
std::string mitName_; //name of PFCandidate branch in BAMBU |
| 37 |
> |
std::string globalTrackMapName_; //name of imported map wrt global muons |
| 38 |
> |
std::string staTrackMapName_; //name of imported map wrt sta muons |
| 39 |
> |
std::string staVtxTrackMapName_; //name of imported map wrt sta vtx muons |
| 40 |
> |
std::vector<std::string> trackerTrackMapNames_; //name of imported map wrt general tracks |
| 41 |
> |
std::string gsfTrackMapName_; //name of imported map wrt pf gsf tracks |
| 42 |
> |
std::string muonMapName_; //name of imported map wrt muons |
| 43 |
> |
std::string conversionMapName_; //name of imported map wrt conversions |
| 44 |
> |
std::string pfCandMapName_; //name of exported pf candidate map |
| 45 |
> |
std::string pfNoPileupCandMapName_; //name of exported pf no pileup candidate map |
| 46 |
> |
bool allowMissingTrackRef_; //allow missing track reference (needed for tau embedding samples) |
| 47 |
> |
bool fillPfNoPileup_; |
| 48 |
> |
std::vector<const mithep::TrackMap*> trackerTrackMaps_; //maps wrt tracker tracks |
| 49 |
> |
const mithep::TrackMap *gsfTrackMap_; //map wrt pf gsf tracks |
| 50 |
> |
const mithep::MuonMap *muonMap_; //map wrt muons |
| 51 |
|
const mithep::ConversionMap *conversionMap_; //map wrt conversions |
| 52 |
< |
mithep::PFCandidateMap *pfCandMap_; //exported map |
| 53 |
< |
mithep::PFCandidateArr *pfCands_; //array of PFCandidates |
| 52 |
> |
mithep::PFCandidateMap *pfCandMap_; //exported map |
| 53 |
> |
mithep::PFCandidateMap *pfNoPileupCandMap_; //exported map for pf no pileup |
| 54 |
> |
mithep::PFCandidateArr *pfCands_; //array of PFCandidates |
| 55 |
|
}; |
| 56 |
|
} |
| 57 |
|
#endif |
