Changeset 77e9ae1 in git for modules/VertexFinder.cc
- Timestamp:
- Feb 12, 2019, 9:48:36 PM (6 years ago)
- Branches:
- ImprovedOutputFile, Timing, llp, master
- Children:
- 899b162
- Parents:
- 6455202
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
modules/VertexFinder.cc
r6455202 r77e9ae1 115 115 // fewer than MinNDF tracks, release the tracks for other clusters to claim. 116 116 sort(clusterSumPT2.begin(), clusterSumPT2.end(), secondDescending); 117 for(vector<pair<UInt_t, Double_t> >::const_iterator cluster = clusterSumPT2.begin(); cluster != clusterSumPT2.end(); cluster++)117 for(vector<pair<UInt_t, Double_t> >::const_iterator cluster = clusterSumPT2.begin(); cluster != clusterSumPT2.end(); cluster++) 118 118 { 119 119 // Skip the cluster if it no longer has any tracks … … 130 130 if((Int_t)clusterIDToInt.at(cluster->first).at("ndf") < fMinNDF) 131 131 { 132 for(map<UInt_t, map<string, Int_t> >::iterator track = trackIDToInt.begin(); track != trackIDToInt.end(); track++)132 for(map<UInt_t, map<string, Int_t> >::iterator track = trackIDToInt.begin(); track != trackIDToInt.end(); track++) 133 133 { 134 134 if(track->second.at("clusterIndex") != (Int_t)cluster->first) … … 155 155 // descending sum(pt**2). 156 156 clusterSumPT2.clear(); 157 for(map<UInt_t, map<string, Int_t> >::const_iterator cluster = clusterIDToInt.begin(); cluster != clusterIDToInt.end(); cluster++)157 for(map<UInt_t, map<string, Int_t> >::const_iterator cluster = clusterIDToInt.begin(); cluster != clusterIDToInt.end(); cluster++) 158 158 { 159 159 … … 164 164 sort(clusterSumPT2.begin(), clusterSumPT2.end(), secondDescending); 165 165 166 for(vector<pair<UInt_t, Double_t> >::const_iterator cluster = clusterSumPT2.begin(); cluster != clusterSumPT2.end(); cluster++)166 for(vector<pair<UInt_t, Double_t> >::const_iterator cluster = clusterSumPT2.begin(); cluster != clusterSumPT2.end(); cluster++) 167 167 { 168 168 DelphesFactory *factory = GetFactory(); … … 213 213 // trackPT vector. 214 214 sort(trackPT.begin(), trackPT.end(), secondDescending); 215 for(vector<pair<UInt_t, Double_t> >::const_iterator track = trackPT.begin(); track != trackPT.end(); track++, maxSeeds++)215 for(vector<pair<UInt_t, Double_t> >::const_iterator track = trackPT.begin(); track != trackPT.end(); track++, maxSeeds++) 216 216 { 217 217 if(track->second < fSeedMinPT) … … 228 228 229 229 // Create the seeds from the SeedMinPT highest pt tracks. 230 for(vector<pair<UInt_t, Double_t> >::const_iterator track = trackPT.begin(); track != trackPT.end(); track++, clusterIndex++)230 for(vector<pair<UInt_t, Double_t> >::const_iterator track = trackPT.begin(); track != trackPT.end(); track++, clusterIndex++) 231 231 { 232 232 addTrackToCluster(track->first, clusterIndex); … … 261 261 { 262 262 263 for(map<UInt_t, map<string, Double_t> >::const_iterator track = trackIDToDouble.begin(); track != trackIDToDouble.end(); track++)263 for(map<UInt_t, map<string, Double_t> >::const_iterator track = trackIDToDouble.begin(); track != trackIDToDouble.end(); track++) 264 264 { 265 265 if(trackIDToBool.at(track->first).at("claimed") || trackIDToInt.at(track->first).at("clusterIndex") == (Int_t)clusterIndex)
Note:
See TracChangeset
for help on using the changeset viewer.