CMS 3D CMS Logo

 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Pages
PATPackedCandidateProducer.cc
Go to the documentation of this file.
1 #include <string>
2 
3 
22 
23 /*#include "TrackingTools/TrajectoryState/interface/TrajectoryStateTransform.h"
24 #include "TrackingTools/GeomPropagators/interface/AnalyticalImpactPointExtrapolator.h"
25 #include "MagneticField/Engine/interface/MagneticField.h"
26 #include "MagneticField/Records/interface/IdealMagneticFieldRecord.h"
27 #include "TrackingTools/TrajectoryState/interface/TrajectoryStateOnSurface.h"
28 #include "RecoVertex/VertexPrimitives/interface/ConvertToFromReco.h"
29 */
30 //#define CRAZYSORT
31 
32 namespace pat {
34  const static int qualityMap[8] = {1,0,1,1,4,4,5,6};
35 
37  public:
40 
41  virtual void produce(edm::StreamID, edm::Event&, const edm::EventSetup&) const override;
42 
43  //sorting of cands to maximize the zlib compression
45  if (std::abs(i.charge()) == std::abs(j.charge())) {
46  if(i.charge()!=0){
47  if(i.pt() > minPtForTrackProperties_ and j.pt() <= minPtForTrackProperties_ ) return true;
48  if(i.pt() <= minPtForTrackProperties_ and j.pt() > minPtForTrackProperties_ ) return false;
49  }
50  if(i.vertexRef() == j.vertexRef())
51  return i.eta() > j.eta();
52  else
53  return i.vertexRef().key() < j.vertexRef().key();
54  }
55  return std::abs(i.charge()) > std::abs(j.charge());
56  }
57  template <typename T>
58  std::vector<size_t> sort_indexes(const std::vector<T> &v ) const {
59  std::vector<size_t> idx(v.size());
60  for (size_t i = 0; i != idx.size(); ++i) idx[i] = i;
61  std::sort(idx.begin(), idx.end(),[&v,this](size_t i1, size_t i2) { return candsOrdering(v[i1],v[i2]);});
62  return idx;
63  }
64 
65  private:
78 
80 
81  // for debugging
82  float calcDxy(float dx, float dy, float phi) const {
83  return - dx * std::sin(phi) + dy * std::cos(phi);
84  }
86  return p.Z()-v.Z() - ((p.X()-v.X()) * c.px() + (p.Y()-v.Y())*c.py()) * c.pz()/(c.pt()*c.pt());
87  }
88  };
89 }
90 
92  Cands_(consumes<reco::PFCandidateCollection>(iConfig.getParameter<edm::InputTag>("inputCollection"))),
93  PVs_(consumes<reco::VertexCollection>(iConfig.getParameter<edm::InputTag>("inputVertices"))),
94  PVAsso_(consumes<edm::Association<reco::VertexCollection> >(iConfig.getParameter<edm::InputTag>("vertexAssociator"))),
95  PVAssoQuality_(consumes<edm::ValueMap<int> >(iConfig.getParameter<edm::InputTag>("vertexAssociator"))),
96  PVOrigs_(consumes<reco::VertexCollection>(iConfig.getParameter<edm::InputTag>("originalVertices"))),
97  TKOrigs_(consumes<reco::TrackCollection>(iConfig.getParameter<edm::InputTag>("originalTracks"))),
98  PuppiWeight_(consumes<edm::ValueMap<float> >(iConfig.getParameter<edm::InputTag>("PuppiSrc"))),
99  PuppiWeightNoLep_(consumes<edm::ValueMap<float> >(iConfig.getParameter<edm::InputTag>("PuppiNoLepSrc"))),
100  PuppiCandsMap_(consumes<edm::ValueMap<reco::CandidatePtr> >(iConfig.getParameter<edm::InputTag>("PuppiSrc"))),
101  PuppiCands_(consumes<std::vector< reco::PFCandidate > >(iConfig.getParameter<edm::InputTag>("PuppiSrc"))),
102  PuppiCandsNoLep_(consumes<std::vector< reco::PFCandidate > >(iConfig.getParameter<edm::InputTag>("PuppiNoLepSrc"))),
103  SVWhiteList_(consumes<edm::View< reco::CompositePtrCandidate > >(iConfig.getParameter<edm::InputTag>("secondaryVerticesForWhiteList"))),
104  minPtForTrackProperties_(iConfig.getParameter<double>("minPtForTrackProperties"))
105 {
106  produces< std::vector<pat::PackedCandidate> > ();
107  produces< edm::Association<pat::PackedCandidateCollection> > ();
108  produces< edm::Association<reco::PFCandidateCollection> > ();
109 }
110 
112 
113 
114 
116 
118  iEvent.getByToken( Cands_, cands );
119  std::vector<reco::Candidate>::const_iterator cand;
120 
121  edm::Handle< edm::ValueMap<float> > puppiWeight;
122  iEvent.getByToken( PuppiWeight_, puppiWeight );
124  iEvent.getByToken( PuppiCandsMap_, puppiCandsMap );
126  iEvent.getByToken( PuppiCands_, puppiCands );
127  std::vector<int> mappingPuppi(puppiCands->size());
128 
129  edm::Handle< edm::ValueMap<float> > puppiWeightNoLep;
130  iEvent.getByToken( PuppiWeightNoLep_, puppiWeightNoLep );
132  iEvent.getByToken( PuppiCandsNoLep_, puppiCandsNoLep );
133 
134  std::vector<reco::CandidatePtr> puppiCandsNoLepPtrs;
135  if (puppiCandsNoLep.isValid()){
136  for (auto pup : *puppiCandsNoLep){
137  puppiCandsNoLepPtrs.push_back(pup.sourceCandidatePtr(0));
138  }
139  }
140  auto const& puppiCandsNoLepV = puppiCandsNoLep.product();
141 
143  iEvent.getByToken( PVOrigs_, PVOrigs );
144 
146  iEvent.getByToken(PVAsso_,assoHandle);
147  edm::Handle<edm::ValueMap<int> > assoQualityHandle;
148  iEvent.getByToken(PVAssoQuality_,assoQualityHandle);
149  const edm::Association<reco::VertexCollection> & associatedPV=*(assoHandle.product());
150  const edm::ValueMap<int> & associationQuality=*(assoQualityHandle.product());
151 
153  iEvent.getByToken(SVWhiteList_,svWhiteListHandle);
154  const edm::View<reco::CompositePtrCandidate > & svWhiteList=*(svWhiteListHandle.product());
155  std::set<unsigned int> whiteList;
156  for(unsigned int i=0; i<svWhiteList.size();i++)
157  {
158  for(unsigned int j=0; j< svWhiteList[i].numberOfSourceCandidatePtrs(); j++) {
159  const edm::Ptr<reco::Candidate> & c = svWhiteList[i].sourceCandidatePtr(j);
160  if(c.id() == cands.id()) whiteList.insert(c.key());
161  }
162  }
163 
164 
166  iEvent.getByToken( PVs_, PVs );
167  reco::VertexRef PV(PVs.id());
168  math::XYZPoint PVpos;
169 
170 
172  iEvent.getByToken( TKOrigs_, TKOrigs );
173  std::auto_ptr< std::vector<pat::PackedCandidate> > outPtrP( new std::vector<pat::PackedCandidate> );
174  std::vector<int> mapping(cands->size());
175  std::vector<int> mappingReverse(cands->size());
176  std::vector<int> mappingTk(TKOrigs->size(), -1);
177 
178  for(unsigned int ic=0, nc = cands->size(); ic < nc; ++ic) {
179  const reco::PFCandidate &cand=(*cands)[ic];
180  float phiAtVtx = cand.phi();
181  const reco::Track *ctrack = 0;
182  if ((abs(cand.pdgId()) == 11 || cand.pdgId() == 22) && cand.gsfTrackRef().isNonnull()) {
183  ctrack = &*cand.gsfTrackRef();
184  } else if (cand.trackRef().isNonnull()) {
185  ctrack = &*cand.trackRef();
186  }
187  if (ctrack) {
188  float dist=1e99;
189  int pvi=-1;
190  for(size_t ii=0;ii<PVs->size();ii++){
191  float dz=std::abs(ctrack->dz( ((*PVs)[ii]).position()));
192  if(dz<dist) {pvi=ii;dist=dz; }
193  }
194  PV = reco::VertexRef(PVs, pvi);
195  math::XYZPoint vtx = cand.vertex();
197  const reco::VertexRef & PVOrig = associatedPV[reco::CandidatePtr(cands,ic)];
198  if(PVOrig.isNonnull()) PV = reco::VertexRef(PVs, PVOrig.key()); // WARNING: assume the PV slimmer is keeping same order
199  int quality=associationQuality[reco::CandidatePtr(cands,ic)];
200 // if ((size_t)pvi!=PVOrig.key()) std::cout << "not closest in Z" << pvi << " " << PVOrig.key() << " " << cand.pt() << " " << quality << std::endl;
201  // TrajectoryStateOnSurface tsos = extrapolator.extrapolate(trajectoryStateTransform::initialFreeState(*ctrack,&*magneticField), RecoVertex::convertPos(PV->position()));
202  // vtx = tsos.globalPosition();
203  // phiAtVtx = tsos.globalDirection().phi();
204  vtx = ctrack->referencePoint();
205  phiAtVtx = ctrack->phi();
207  if (nlost == 0) {
208  if (ctrack->hitPattern().hasValidHitInFirstPixelBarrel()) {
210  }
211  } else {
213  }
214 
215 
216  outPtrP->push_back( pat::PackedCandidate(cand.polarP4(), vtx, phiAtVtx, cand.pdgId(), PV));
217  outPtrP->back().setAssociationQuality(pat::PackedCandidate::PVAssociationQuality(qualityMap[quality]));
218  if(cand.trackRef().isNonnull() && PVOrig->trackWeight(cand.trackRef()) > 0.5 && quality == 7) {
219  outPtrP->back().setAssociationQuality(pat::PackedCandidate::UsedInFitTight);
220  }
221  // properties of the best track
222  outPtrP->back().setLostInnerHits( lostHits );
223  if(outPtrP->back().pt() > minPtForTrackProperties_ || whiteList.find(ic)!=whiteList.end()) {
224  outPtrP->back().setTrackProperties(*ctrack);
225  //outPtrP->back().setTrackProperties(*ctrack,tsos.curvilinearError());
226  }
227 
228  // these things are always for the CKF track
229  outPtrP->back().setTrackHighPurity( cand.trackRef().isNonnull() && cand.trackRef()->quality(reco::Track::highPurity) );
230  if (cand.muonRef().isNonnull()) {
231  outPtrP->back().setMuonID(cand.muonRef()->isStandAloneMuon(), cand.muonRef()->isGlobalMuon());
232  }
233  } else {
234 
235  if (!PVs->empty()) {
236  PV = reco::VertexRef(PVs, 0);
237  PVpos = PV->position();
238  }
239 
240  outPtrP->push_back( pat::PackedCandidate(cand.polarP4(), PVpos, cand.phi(), cand.pdgId(), PV));
242  }
243 
244  if (puppiWeight.isValid()){
245  reco::PFCandidateRef pkref( cands, ic );
246  // outPtrP->back().setPuppiWeight( (*puppiWeight)[pkref]);
247 
248  float puppiWeightVal = (*puppiWeight)[pkref];
249  float puppiWeightNoLepVal = 0.0;
250 
251  // Check the "no lepton" puppi weights.
252  // If present, then it is not a lepton, use stored weight
253  // If absent, it is a lepton, so set the weight to 1.0
254  if ( puppiWeightNoLep.isValid() ) {
255  // Look for the pointer inside the "no lepton" candidate collection.
256  auto pkrefPtr = pkref->sourceCandidatePtr(0);
257 
258  bool foundNoLep = false;
259  for ( size_t ipcnl = 0; ipcnl < puppiCandsNoLepPtrs.size(); ipcnl++){
260  if (puppiCandsNoLepPtrs[ipcnl] == pkrefPtr){
261  foundNoLep = true;
262  puppiWeightNoLepVal = puppiCandsNoLepV->at(ipcnl).pt()/cand.pt(); // a hack for now, should use the value map
263  break;
264  }
265  }
266  if ( !foundNoLep || puppiWeightNoLepVal > 1 ) {
267  puppiWeightNoLepVal = 1.0;
268  }
269  }
270  outPtrP->back().setPuppiWeight( puppiWeightVal, puppiWeightNoLepVal );
271 
272  mappingPuppi[((*puppiCandsMap)[pkref]).key()]=ic;
273  }
274 
275  mapping[ic] = ic; // trivial at the moment!
276  if (cand.trackRef().isNonnull() && cand.trackRef().id() == TKOrigs.id()) {
277  mappingTk[cand.trackRef().key()] = ic;
278  }
279 
280  }
281 
282  std::auto_ptr< std::vector<pat::PackedCandidate> > outPtrPSorted( new std::vector<pat::PackedCandidate> );
283  std::vector<size_t> order=sort_indexes(*outPtrP);
284  std::vector<size_t> reverseOrder(order.size());
285  for(size_t i=0,nc=cands->size();i<nc;i++) {
286  outPtrPSorted->push_back((*outPtrP)[order[i]]);
287  reverseOrder[order[i]] = i;
288  mappingReverse[order[i]]=i;
289  }
290 
291  // Fix track association for sorted candidates
292  for(size_t i=0,ntk=mappingTk.size();i<ntk;i++){
293  int origInd = mappingTk[i];
294  if (origInd>=0 ) mappingTk[i]=reverseOrder[origInd];
295  }
296 
297  for(size_t i=0,ntk=mappingPuppi.size();i<ntk;i++){
298  mappingPuppi[i]=reverseOrder[mappingPuppi[i]];
299  }
300 
301  edm::OrphanHandle<pat::PackedCandidateCollection> oh = iEvent.put( outPtrPSorted );
302 
303  // now build the two maps
304  std::auto_ptr<edm::Association<pat::PackedCandidateCollection> > pf2pc(new edm::Association<pat::PackedCandidateCollection>(oh ));
305  std::auto_ptr<edm::Association<reco::PFCandidateCollection > > pc2pf(new edm::Association<reco::PFCandidateCollection >(cands));
308  pf2pcFiller.insert(cands, mappingReverse.begin(), mappingReverse.end());
309  pc2pfFiller.insert(oh , order.begin(), order.end());
310  // include also the mapping track -> packed PFCand
311  pf2pcFiller.insert(TKOrigs, mappingTk.begin(), mappingTk.end());
312  pf2pcFiller.insert(puppiCands, mappingPuppi.begin(), mappingPuppi.end());
313 
314  pf2pcFiller.fill();
315  pc2pfFiller.fill();
316  iEvent.put(pf2pc);
317  iEvent.put(pc2pf);
318 
319 }
320 
321 
const Point & referencePoint() const
Reference point on the track.
Definition: TrackBase.h:634
int i
Definition: DBlmapReader.cc:9
virtual int pdgId() const
PDG identifier.
const edm::EDGetTokenT< edm::ValueMap< float > > PuppiWeight_
bool isNonnull() const
Checks for non-null.
Definition: Ref.h:250
key_type key() const
Definition: Ptr.h:169
ProductID id() const
Definition: HandleBase.cc:15
bool getByToken(EDGetToken token, Handle< PROD > &result) const
Definition: Event.h:449
virtual double pt() const =0
transverse momentum
#define DEFINE_FWK_MODULE(type)
Definition: MakerMacros.h:17
Sin< T >::type sin(const T &t)
Definition: Sin.h:22
virtual double pz() const =0
z coordinate of momentum vector
void insert(const H &h, I begin, I end)
Definition: ValueMap.h:52
std::vector< Track > TrackCollection
collection of Tracks
Definition: TrackFwd.h:13
size_type size() const
double phi() const
azimuthal angle of momentum vector
Definition: TrackBase.h:598
std::vector< Vertex > VertexCollection
collection of Vertex objects
Definition: VertexFwd.h:9
static const int qualityMap[8]
conversion map from quality flags used in PV association and miniAOD one
const edm::EDGetTokenT< reco::PFCandidateCollection > Cands_
virtual double pt() const
transverse momentum
key_type key() const
Accessor for product key.
Definition: Ref.h:266
int ii
Definition: cuy.py:588
virtual double eta() const
momentum pseudorapidity
const reco::VertexRef vertexRef() const
virtual double pt() const
transverse momentum
ProductID id() const
Accessor for product ID.
Definition: Ref.h:256
const edm::EDGetTokenT< edm::ValueMap< int > > PVAssoQuality_
reco::TrackRef trackRef() const
Definition: PFCandidate.cc:433
int iEvent
Definition: GenABIO.cc:230
PATPackedCandidateProducer(const edm::ParameterSet &)
OrphanHandle< PROD > put(std::auto_ptr< PROD > product)
Put a new product.
Definition: Event.h:113
Cos< T >::type cos(const T &t)
Definition: Cos.h:22
float calcDxy(float dx, float dy, float phi) const
Abs< T >::type abs(const T &t)
Definition: Abs.h:22
int j
Definition: DBlmapReader.cc:9
virtual int charge() const
electric charge
virtual const Point & vertex() const
vertex position (overwritten by PF...)
Definition: PFCandidate.cc:647
const edm::EDGetTokenT< reco::TrackCollection > TKOrigs_
const edm::EDGetTokenT< std::vector< reco::PFCandidate > > PuppiCands_
std::vector< size_t > sort_indexes(const std::vector< T > &v) const
virtual double py() const =0
y coordinate of momentum vector
const edm::EDGetTokenT< edm::ValueMap< reco::CandidatePtr > > PuppiCandsMap_
bool isValid() const
Definition: HandleBase.h:75
const edm::EDGetTokenT< edm::ValueMap< float > > PuppiWeightNoLep_
edm::Ref< VertexCollection > VertexRef
persistent reference to a Vertex
Definition: VertexFwd.h:13
virtual void produce(edm::StreamID, edm::Event &, const edm::EventSetup &) const override
reco::MuonRef muonRef() const
Definition: PFCandidate.cc:450
virtual double px() const =0
x coordinate of momentum vector
double dz() const
dz parameter (= dsz/cos(lambda)). This is the track z0 w.r.t (0,0,0) only if the refPoint is close to...
Definition: TrackBase.h:562
LostInnerHits
Enumerator specifying the.
std::vector< reco::PFCandidate > PFCandidateCollection
collection of PFCandidates
float calcDz(reco::Candidate::Point p, reco::Candidate::Point v, const reco::Candidate &c) const
edm::Ptr< Candidate > CandidatePtr
persistent reference to an object in a collection of Candidate objects
Definition: CandidateFwd.h:25
T const * product() const
Definition: Handle.h:81
const HitPattern & hitPattern() const
Access the hit pattern, indicating in which Tracker layers the track has hits.
Definition: TrackBase.h:411
const edm::EDGetTokenT< std::vector< reco::PFCandidate > > PuppiCandsNoLep_
XYZPointD XYZPoint
point in space with cartesian internal representation
Definition: Point3D.h:12
tuple idx
DEBUGGING if hasattr(process,&quot;trackMonIterativeTracking2012&quot;): print &quot;trackMonIterativeTracking2012 D...
ProductID id() const
Accessor for product ID.
Definition: Ptr.h:164
const edm::EDGetTokenT< reco::VertexCollection > PVOrigs_
int numberOfLostHits(HitCategory category) const
Definition: HitPattern.h:804
Particle reconstructed by the particle flow algorithm.
Definition: PFCandidate.h:39
virtual const PolarLorentzVector & polarP4() const
four-momentum Lorentz vector
reco::GsfTrackRef gsfTrackRef() const
Definition: PFCandidate.cc:471
math::XYZPoint Point
point in the space
Definition: Candidate.h:41
const edm::EDGetTokenT< edm::Association< reco::VertexCollection > > PVAsso_
bool hasValidHitInFirstPixelBarrel() const
Definition: HitPattern.cc:276
const edm::EDGetTokenT< reco::VertexCollection > PVs_
virtual double phi() const
momentum azimuthal angle
bool candsOrdering(pat::PackedCandidate i, pat::PackedCandidate j) const
Definition: DDAxes.h:10
const edm::EDGetTokenT< edm::View< reco::CompositePtrCandidate > > SVWhiteList_