CMS 3D CMS Logo
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Groups Pages
List of all members | Public Member Functions | Private Attributes
ConversionTrackMerger Class Reference
Inheritance diagram for ConversionTrackMerger:
edm::stream::EDProducer<>

Public Member Functions

 ConversionTrackMerger (const edm::ParameterSet &conf)
 
void produce (edm::Event &e, const edm::EventSetup &c) override
 
 ~ConversionTrackMerger () override
 
- Public Member Functions inherited from edm::stream::EDProducer<>
 EDProducer ()=default
 
 EDProducer (const EDProducer &)=delete
 
bool hasAbilityToProduceInBeginLumis () const final
 
bool hasAbilityToProduceInBeginProcessBlocks () const final
 
bool hasAbilityToProduceInBeginRuns () const final
 
bool hasAbilityToProduceInEndLumis () const final
 
bool hasAbilityToProduceInEndProcessBlocks () const final
 
bool hasAbilityToProduceInEndRuns () const final
 
const EDProducer & operator= (const EDProducer &)=delete
 

Private Attributes

edm::ParameterSet conf_
 
std::unique_ptr
< reco::ConversionTrackCollection > 		outputTrks
 
edm::EDGetTokenT
< reco::ConversionTrackCollection > 		trackProducer1
 
edm::EDGetTokenT
< reco::ConversionTrackCollection > 		trackProducer2
 

Additional Inherited Members

- Public Types inherited from edm::stream::EDProducer<>
using CacheTypes = CacheContexts< T...>
 
using GlobalCache = typename CacheTypes::GlobalCache
 
using HasAbility = AbilityChecker< T...>
 
using InputProcessBlockCache = typename CacheTypes::InputProcessBlockCache
 
using LuminosityBlockCache = typename CacheTypes::LuminosityBlockCache
 
using LuminosityBlockContext = LuminosityBlockContextT< LuminosityBlockCache, RunCache, GlobalCache >
 
using LuminosityBlockSummaryCache = typename CacheTypes::LuminosityBlockSummaryCache
 
using RunCache = typename CacheTypes::RunCache
 
using RunContext = RunContextT< RunCache, GlobalCache >
 
using RunSummaryCache = typename CacheTypes::RunSummaryCache
 

Detailed Description

Definition at line 32 of file ConversionTrackMerger.cc.

Constructor & Destructor Documentation

ConversionTrackMerger::ConversionTrackMerger ( const edm::ParameterSet &  conf)
explicit

Definition at line 52 of file ConversionTrackMerger.cc.

References conf_, edm::ParameterSet::getParameter(), trackProducer1, and trackProducer2.

52  : conf_(conf) {
53  // retrieve producer name of input TrackCollection(s)
54  trackProducer1 = consumes<reco::ConversionTrackCollection>(conf_.getParameter<edm::InputTag>("TrackProducer1"));
55  trackProducer2 = consumes<reco::ConversionTrackCollection>(conf_.getParameter<edm::InputTag>("TrackProducer2"));
56 
57  produces<reco::ConversionTrackCollection>();
58 }
ConversionTrackMerger::trackProducer1
edm::EDGetTokenT< reco::ConversionTrackCollection > trackProducer1
Definition: ConversionTrackMerger.cc:43
edm::ParameterSet::getParameter
T getParameter(std::string const &) const
Definition: ParameterSet.h:303
ConversionTrackMerger::trackProducer2
edm::EDGetTokenT< reco::ConversionTrackCollection > trackProducer2
Definition: ConversionTrackMerger.cc:44
ConversionTrackMerger::~ConversionTrackMerger ( )
override

Definition at line 61 of file ConversionTrackMerger.cc.

61 {}

Member Function Documentation

void ConversionTrackMerger::produce ( edm::Event &  e,
const edm::EventSetup &  c 
)
override

Definition at line 64 of file ConversionTrackMerger.cc.

References HLT_FULL_cff::allowFirstHitShare, HLT_FULL_cff::checkCharge, ChiSquaredProbability(), conf_, edm::Event::getByToken(), edm::ParameterSet::getParameter(), mps_fire::i, edm::HandleBase::isValid(), TrackingRecHit::isValid(), dqmiolumiharvest::j, findQualityFiles::jj, min(), eostools::move(), outputTrks, edm::Handle< T >::product(), edm::Event::put(), HLT_FULL_cff::shareFrac, TrackingRecHit::sharesInput(), TrackingRecHit::some, HLT_FULL_cff::track, trackProducer1, and trackProducer2.

64  {
65  double shareFrac = conf_.getParameter<double>("ShareFrac");
66  bool allowFirstHitShare = conf_.getParameter<bool>("allowFirstHitShare");
67  bool checkCharge = conf_.getParameter<bool>("checkCharge");
68  double minProb = conf_.getParameter<double>("minProb");
69 
70  int outputPreferCollection = conf_.getParameter<int>("outputPreferCollection");
71  int trackerOnlyPreferCollection = conf_.getParameter<int>("trackerOnlyPreferCollection");
72  int arbitratedEcalSeededPreferCollection = conf_.getParameter<int>("arbitratedEcalSeededPreferCollection");
73  int arbitratedMergedPreferCollection = conf_.getParameter<int>("arbitratedMergedPreferCollection");
74  int arbitratedMergedEcalGeneralPreferCollection =
75  conf_.getParameter<int>("arbitratedMergedEcalGeneralPreferCollection");
76 
77  // get Inputs
78  // if 1 input list doesn't exist, make an empty list, issue a warning, and continue
79  // this allows ConversionTrackMerger to be used as a cleaner only if handed just one list
80  // if both input lists don't exist, will issue 2 warnings and generate an empty output collection
81  //
82  const reco::ConversionTrackCollection* TC1 = nullptr;
83  static const reco::ConversionTrackCollection s_empty1, s_empty2;
84  edm::Handle<reco::ConversionTrackCollection> trackCollection1;
85  e.getByToken(trackProducer1, trackCollection1);
86  if (trackCollection1.isValid()) {
87  TC1 = trackCollection1.product();
88  //std::cout << "1st collection " << trackProducer1 << " has "<< TC1->size() << " tracks" << std::endl ;
89  } else {
90  TC1 = &s_empty1;
91  edm::LogWarning("ConversionTrackMerger") << "1st TrackCollection not found;"
92  << " will only clean 2nd TrackCollection ";
93  }
94  reco::ConversionTrackCollection tC1 = *TC1;
95 
96  const reco::ConversionTrackCollection* TC2 = nullptr;
97  edm::Handle<reco::ConversionTrackCollection> trackCollection2;
98  e.getByToken(trackProducer2, trackCollection2);
99  if (trackCollection2.isValid()) {
100  TC2 = trackCollection2.product();
101  //std::cout << "2nd collection " << trackProducer2 << " has "<< TC2->size() << " tracks" << std::endl ;
102  } else {
103  TC2 = &s_empty2;
104  edm::LogWarning("ConversionTrackMerger") << "2nd TrackCollection not found;"
105  << " will only clean 1st TrackCollection ";
106  }
107  reco::ConversionTrackCollection tC2 = *TC2;
108 
109  // Step B: create empty output collection
110  outputTrks = std::make_unique<reco::ConversionTrackCollection>();
111  int i;
112 
113  std::vector<int> selected1;
114  for (unsigned int i = 0; i < tC1.size(); ++i) {
115  selected1.push_back(1);
116  }
117  std::vector<int> selected2;
118  for (unsigned int i = 0; i < tC2.size(); ++i) {
119  selected2.push_back(1);
120  }
121 
122  std::map<reco::ConversionTrackCollection::const_iterator, std::vector<const TrackingRecHit*> > rh1;
123  std::map<reco::ConversionTrackCollection::const_iterator, std::vector<const TrackingRecHit*> > rh2;
124  for (reco::ConversionTrackCollection::const_iterator track = tC1.begin(); track != tC1.end(); ++track) {
125  trackingRecHit_iterator itB = track->track()->recHitsBegin();
126  trackingRecHit_iterator itE = track->track()->recHitsEnd();
127  for (trackingRecHit_iterator it = itB; it != itE; ++it) {
128  const TrackingRecHit* hit = &(**it);
129  rh1[track].push_back(hit);
130  }
131  }
132  for (reco::ConversionTrackCollection::const_iterator track = tC2.begin(); track != tC2.end(); ++track) {
133  trackingRecHit_iterator jtB = track->track()->recHitsBegin();
134  trackingRecHit_iterator jtE = track->track()->recHitsEnd();
135  for (trackingRecHit_iterator jt = jtB; jt != jtE; ++jt) {
136  const TrackingRecHit* hit = &(**jt);
137  rh2[track].push_back(hit);
138  }
139  }
140 
141  if ((!tC1.empty()) && (!tC2.empty())) {
142  i = -1;
143  for (reco::ConversionTrackCollection::iterator track = tC1.begin(); track != tC1.end(); ++track) {
144  i++;
145 
146  //clear flags if preferCollection was set to 0
147  selected1[i] = selected1[i] && outputPreferCollection != 0;
148  track->setIsTrackerOnly(track->isTrackerOnly() && trackerOnlyPreferCollection != 0);
149  track->setIsArbitratedEcalSeeded(track->isArbitratedEcalSeeded() && arbitratedEcalSeededPreferCollection != 0);
150  track->setIsArbitratedMerged(track->isArbitratedMerged() && arbitratedMergedPreferCollection != 0);
151  track->setIsArbitratedMergedEcalGeneral(track->isArbitratedMergedEcalGeneral() &&
152  arbitratedMergedEcalGeneralPreferCollection != 0);
153 
154  std::vector<const TrackingRecHit*>& iHits = rh1[track];
155  unsigned nh1 = iHits.size();
156  int j = -1;
157  for (reco::ConversionTrackCollection::iterator track2 = tC2.begin(); track2 != tC2.end(); ++track2) {
158  j++;
159 
160  //clear flags if preferCollection was set to 0
161  selected2[j] = selected2[j] && outputPreferCollection != 0;
162  track2->setIsTrackerOnly(track2->isTrackerOnly() && trackerOnlyPreferCollection != 0);
163  track2->setIsArbitratedEcalSeeded(track2->isArbitratedEcalSeeded() &&
164  arbitratedEcalSeededPreferCollection != 0);
165  track2->setIsArbitratedMerged(track2->isArbitratedMerged() && arbitratedMergedPreferCollection != 0);
166  track2->setIsArbitratedMergedEcalGeneral(track2->isArbitratedMergedEcalGeneral() &&
167  arbitratedMergedEcalGeneralPreferCollection != 0);
168 
169  std::vector<const TrackingRecHit*>& jHits = rh2[track2];
170  unsigned nh2 = jHits.size();
171  int noverlap = 0;
172  int firstoverlap = 0;
173  for (unsigned ih = 0; ih < nh1; ++ih) {
174  const TrackingRecHit* it = iHits[ih];
175  if (it->isValid()) {
176  int jj = -1;
177  for (unsigned jh = 0; jh < nh2; ++jh) {
178  const TrackingRecHit* jt = jHits[jh];
179  jj++;
180  if (jt->isValid()) {
181  if (it->sharesInput(jt, TrackingRecHit::some)) {
182  noverlap++;
183  if (allowFirstHitShare && (ih == 0) && (jh == 0))
184  firstoverlap = 1;
185  }
186  }
187  }
188  }
189  }
190  int nhit1 = track->track()->numberOfValidHits();
191  int nhit2 = track2->track()->numberOfValidHits();
192  //if (noverlap>0) printf("noverlap = %i, firstoverlap = %i, nhit1 = %i, nhit2 = %i, algo1 = %i, algo2 = %i, q1 = %i, q2 = %i\n",noverlap,firstoverlap,nhit1,nhit2,track->track()->algo(),track2->track()->algo(),track->track()->charge(),track2->track()->charge());
193  //std::cout << " trk1 trk2 nhits1 nhits2 nover " << i << " " << j << " " << track->numberOfValidHits() << " " << track2->numberOfValidHits() << " " << noverlap << " " << fi << " " << fj <<std::endl;
194  if ((noverlap - firstoverlap) > (std::min(nhit1, nhit2) - firstoverlap) * shareFrac &&
195  (!checkCharge || track->track()->charge() * track2->track()->charge() > 0)) {
196  //printf("overlapping tracks\n");
197  //printf ("ndof1 = %5f, chisq1 = %5f, ndof2 = %5f, chisq2 = %5f\n",track->track()->ndof(),track->track()->chi2(),track2->track()->ndof(),track2->track()->chi2());
198 
199  double probFirst = ChiSquaredProbability(track->track()->chi2(), track->track()->ndof());
200  double probSecond = ChiSquaredProbability(track2->track()->chi2(), track2->track()->ndof());
201 
202  //arbitrate by number of hits and reduced chisq
203  bool keepFirst = (nhit1 > nhit2 ||
204  (nhit1 == nhit2 && track->track()->normalizedChi2() < track2->track()->normalizedChi2()));
205 
206  //override decision in case one track is radically worse quality than the other
207  keepFirst |= (probFirst > minProb && probSecond <= minProb);
208  keepFirst &= !(probFirst <= minProb && probSecond > minProb);
209 
210  bool keepSecond = !keepFirst;
211 
212  //set flags based on arbitration decision and precedence settings
213 
214  selected1[i] = selected1[i] && ((keepFirst && outputPreferCollection == 3) || outputPreferCollection == -1 ||
215  outputPreferCollection == 1);
216  track->setIsTrackerOnly(track->isTrackerOnly() &&
217  ((keepFirst && trackerOnlyPreferCollection == 3) ||
218  trackerOnlyPreferCollection == -1 || trackerOnlyPreferCollection == 1));
219  track->setIsArbitratedEcalSeeded(track->isArbitratedEcalSeeded() &&
220  ((keepFirst && arbitratedEcalSeededPreferCollection == 3) ||
221  arbitratedEcalSeededPreferCollection == -1 ||
222  arbitratedEcalSeededPreferCollection == 1));
223  track->setIsArbitratedMerged(track->isArbitratedMerged() &&
224  ((keepFirst && arbitratedMergedPreferCollection == 3) ||
225  arbitratedMergedPreferCollection == -1 ||
226  arbitratedMergedPreferCollection == 1));
227  track->setIsArbitratedMergedEcalGeneral(track->isArbitratedMergedEcalGeneral() &&
228  ((keepFirst && arbitratedMergedEcalGeneralPreferCollection == 3) ||
229  arbitratedMergedEcalGeneralPreferCollection == -1 ||
230  arbitratedMergedEcalGeneralPreferCollection == 1));
231 
232  selected2[j] = selected2[j] && ((keepSecond && outputPreferCollection == 3) || outputPreferCollection == -1 ||
233  outputPreferCollection == 2);
234  track2->setIsTrackerOnly(track2->isTrackerOnly() &&
235  ((keepSecond && trackerOnlyPreferCollection == 3) ||
236  trackerOnlyPreferCollection == -1 || trackerOnlyPreferCollection == 2));
237  track2->setIsArbitratedEcalSeeded(track2->isArbitratedEcalSeeded() &&
238  ((keepSecond && arbitratedEcalSeededPreferCollection == 3) ||
239  arbitratedEcalSeededPreferCollection == -1 ||
240  arbitratedEcalSeededPreferCollection == 2));
241  track2->setIsArbitratedMerged(track2->isArbitratedMerged() &&
242  ((keepSecond && arbitratedMergedPreferCollection == 3) ||
243  arbitratedMergedPreferCollection == -1 ||
244  arbitratedMergedPreferCollection == 2));
245  track2->setIsArbitratedMergedEcalGeneral(track2->isArbitratedMergedEcalGeneral() &&
246  ((keepSecond && arbitratedMergedEcalGeneralPreferCollection == 3) ||
247  arbitratedMergedEcalGeneralPreferCollection == -1 ||
248  arbitratedMergedEcalGeneralPreferCollection == 2));
249 
250  } //end got a duplicate
251  } //end track2 loop
252  } //end track loop
253  } //end more than 1 track
254 
255  //
256  // output selected tracks - if any
257  //
258 
259  if (!tC1.empty()) {
260  i = 0;
261  for (reco::ConversionTrackCollection::const_iterator track = tC1.begin(); track != tC1.end(); ++track, ++i) {
262  //don't store tracks rejected as duplicates
263  if (!selected1[i]) {
264  continue;
265  }
266  //fill the TrackCollection
267  outputTrks->push_back(*track);
268  } //end faux loop over tracks
269  } //end more than 0 track
270 
271  //Fill the trajectories, etc. for 1st collection
272 
273  if (!tC2.empty()) {
274  i = 0;
275  for (reco::ConversionTrackCollection::const_iterator track = tC2.begin(); track != tC2.end(); ++track, ++i) {
276  //don't store tracks rejected as duplicates
277  if (!selected2[i]) {
278  continue;
279  }
280  //fill the TrackCollection
281  outputTrks->push_back(*track);
282  } //end faux loop over tracks
283  } //end more than 0 track
284 
285  e.put(std::move(outputTrks));
286  return;
287 
288 } //end produce
edm::Event::put
OrphanHandle< PROD > put(std::unique_ptr< PROD > product)
Put a new product.
Definition: Event.h:133
mps_fire.i
i
Definition: mps_fire.py:428
edm::Event::getByToken
bool getByToken(EDGetToken token, Handle< PROD > &result) const
Definition: Event.h:539
TrackingRecHit::sharesInput
virtual bool sharesInput(const TrackingRecHit *other, SharedInputType what) const
Definition: TrackingRecHit.cc:12
HLT_FULL_cff.track
tuple track
Definition: HLT_FULL_cff.py:11953
ConversionTrackMerger::trackProducer1
edm::EDGetTokenT< reco::ConversionTrackCollection > trackProducer1
Definition: ConversionTrackMerger.cc:43
reco::ConversionTrackCollection
std::vector< ConversionTrack > ConversionTrackCollection
collection of ConversionTracks
Definition: ConversionTrackFwd.h:6
HLT_FULL_cff.shareFrac
tuple shareFrac
Definition: HLT_FULL_cff.py:85542
ConversionTrackMerger::outputTrks
std::unique_ptr< reco::ConversionTrackCollection > outputTrks
Definition: ConversionTrackMerger.cc:46
eostools.move
def move
Definition: eostools.py:511
ChiSquaredProbability
float ChiSquaredProbability(double chiSquared, double nrDOF)
Definition: ChiSquaredProbability.cc:13
min
T min(T a, T b)
Definition: MathUtil.h:58
edm::HandleBase::isValid
bool isValid() const
Definition: HandleBase.h:70
HLT_FULL_cff.checkCharge
tuple checkCharge
Definition: HLT_FULL_cff.py:26644
edm::Handle::product
T const * product() const
Definition: Handle.h:70
edm::ParameterSet::getParameter
T getParameter(std::string const &) const
Definition: ParameterSet.h:303
TrackingRecHit::isValid
bool isValid() const
Definition: TrackingRecHit.h:141
edm::OwnVector::const_iterator
Definition: OwnVector.h:41
edm::LogWarning
Log< level::Warning, false > LogWarning
Definition: MessageLogger.h:122
ConversionTrackMerger::trackProducer2
edm::EDGetTokenT< reco::ConversionTrackCollection > trackProducer2
Definition: ConversionTrackMerger.cc:44
HLT_FULL_cff.allowFirstHitShare
tuple allowFirstHitShare
Definition: HLT_FULL_cff.py:10469

Member Data Documentation

edm::ParameterSet ConversionTrackMerger::conf_
private

Definition at line 41 of file ConversionTrackMerger.cc.

Referenced by ConversionTrackMerger(), and produce().

std::unique_ptr<reco::ConversionTrackCollection> ConversionTrackMerger::outputTrks
private

Definition at line 46 of file ConversionTrackMerger.cc.

Referenced by produce().

edm::EDGetTokenT<reco::ConversionTrackCollection> ConversionTrackMerger::trackProducer1
private

Definition at line 43 of file ConversionTrackMerger.cc.

Referenced by ConversionTrackMerger(), and produce().

edm::EDGetTokenT<reco::ConversionTrackCollection> ConversionTrackMerger::trackProducer2
private

Definition at line 44 of file ConversionTrackMerger.cc.

Referenced by ConversionTrackMerger(), and produce().

Generated for CMSSW Reference Manual by doxygen 1.8.5