| 1 |
bendavid |
1.1 |
//--------------------------------------------------------------------------------------------------
|
| 2 |
paus |
1.10 |
// $Id: FillerPFCandidates.h,v 1.9 2012/03/11 23:11:55 pharris Exp $
|
| 3 |
bendavid |
1.1 |
//
|
| 4 |
|
|
// FillerPFCandidates
|
| 5 |
|
|
//
|
| 6 |
|
|
// Implementation of a filler to fill EDM PFCandidates into our mithep::PFCandidate data structure.
|
| 7 |
|
|
//
|
| 8 |
|
|
// Authors: J.Bendavid
|
| 9 |
|
|
//--------------------------------------------------------------------------------------------------
|
| 10 |
|
|
|
| 11 |
|
|
#ifndef MITPROD_TREEFILLER_FILLERPFCANDIDATES_H
|
| 12 |
|
|
#define MITPROD_TREEFILLER_FILLERPFCANDIDATES_H
|
| 13 |
|
|
|
| 14 |
loizides |
1.4 |
#include "MitAna/DataTree/interface/PFCandidateFwd.h"
|
| 15 |
|
|
#include "MitProd/TreeFiller/interface/AssociationMaps.h"
|
| 16 |
bendavid |
1.1 |
#include "MitProd/TreeFiller/interface/BaseFiller.h"
|
| 17 |
|
|
|
| 18 |
|
|
namespace mithep
|
| 19 |
|
|
{
|
| 20 |
|
|
class FillerPFCandidates : public BaseFiller
|
| 21 |
|
|
{
|
| 22 |
|
|
public:
|
| 23 |
|
|
FillerPFCandidates(const edm::ParameterSet &cfg, const char *name, bool active=1);
|
| 24 |
|
|
~FillerPFCandidates();
|
| 25 |
|
|
|
| 26 |
paus |
1.10 |
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 |
bendavid |
1.1 |
|
| 30 |
|
|
private:
|
| 31 |
bendavid |
1.8 |
|
| 32 |
|
|
const mithep::Track *getMitTrack(mitedm::TrackPtr ptr, bool allowmissing) const;
|
| 33 |
|
|
|
| 34 |
paus |
1.10 |
std::string edmName_; //edm name of PFCandidates coll
|
| 35 |
|
|
std::string edmPfNoPileupName_; //edm name of PFNoPileup coll
|
| 36 |
|
|
std::string mitName_; //name: PFCandidate branch in BAMBU
|
| 37 |
|
|
std::string globalTrackMapName_; //name: impo. map wrt global muons
|
| 38 |
|
|
std::string staTrackMapName_; //name: impo. map wrt sta muons
|
| 39 |
|
|
std::string staVtxTrackMapName_; //name: impo. map wrt sta vtx muons
|
| 40 |
|
|
std::vector<std::string> trackerTrackMapNames_; //name: impo. map wrt general tracks
|
| 41 |
|
|
std::string gsfTrackMapName_; //name: impo. map wrt pf gsf tracks
|
| 42 |
|
|
std::string muonMapName_; //name: impo. map wrt muons
|
| 43 |
|
|
std::string electronMapName_; //name: impo. map wrt electrons
|
| 44 |
|
|
std::string photonMapName_; //name: impo. map wrt photons
|
| 45 |
|
|
std::string barrelSuperClusterMapName_; //name: impo. map wrt SC
|
| 46 |
|
|
std::string endcapSuperClusterMapName_; //name: impo. map wrt SC
|
| 47 |
|
|
std::string pfElectronSuperClusterMapName_; //name: impo. map wrt SC
|
| 48 |
|
|
std::string conversionMapName_; //name: impo. map wrt conversions
|
| 49 |
|
|
std::string pfCandMapName_; //name: expo. pf candidate map
|
| 50 |
|
|
std::string pfNoPileupCandMapName_; //name: expo. PFnoPU candidate map
|
| 51 |
|
|
bool allowMissingTrackRef_; //allow missing track ref (tau emb)
|
| 52 |
|
|
bool fillPfNoPileup_;
|
| 53 |
|
|
std::vector<const mithep::TrackMap*>
|
| 54 |
|
|
trackerTrackMaps_; //maps wrt tracker tracks
|
| 55 |
|
|
const mithep::TrackMap *gsfTrackMap_; //map wrt pf gsf tracks
|
| 56 |
|
|
const mithep::MuonMap *muonMap_; //map wrt muons
|
| 57 |
|
|
const mithep::ElectronMap *electronMap_; //map wrt electrons
|
| 58 |
|
|
const mithep::PhotonMap *photonMap_; //map wrt photons
|
| 59 |
|
|
const mithep::SuperClusterMap *barrelSuperClusterMap_; //map wrt superclusters
|
| 60 |
|
|
const mithep::SuperClusterMap *endcapSuperClusterMap_; //map wrt superclusters
|
| 61 |
|
|
const mithep::SuperClusterMap *pfElectronSuperClusterMap_;//map wrt superclusters
|
| 62 |
|
|
const mithep::ConversionMap *conversionMap_; //map wrt conversions
|
| 63 |
|
|
mithep::PFCandidateMap *pfCandMap_; //exported map
|
| 64 |
|
|
mithep::PFCandidateMap *pfNoPileupCandMap_; //exported map for pf no pileup
|
| 65 |
|
|
mithep::PFCandidateArr *pfCands_; //array of PFCandidates
|
| 66 |
bendavid |
1.1 |
};
|
| 67 |
|
|
}
|
| 68 |
|
|
#endif
|
