Fork me on GitHub

Changeset 77e9ae1 in git for modules/VertexFinder.cc


Ignore:
Timestamp:
02/12/19 21:48:36 (18 months ago)
Author:
Pavel Demin <pavel-demin@…>
Branches:
ImprovedOutputFile, Timing, llp, master
Children:
899b162
Parents:
6455202
Message:

set Standard to Cpp03 in .clang-format

File:
1 edited

Legend:

Unmodified
Added
Removed
  • modules/VertexFinder.cc

    r6455202 r77e9ae1  
    115115  // fewer than MinNDF tracks, release the tracks for other clusters to claim.
    116116  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++)
    118118  {
    119119    // Skip the cluster if it no longer has any tracks
     
    130130    if((Int_t)clusterIDToInt.at(cluster->first).at("ndf") < fMinNDF)
    131131    {
    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++)
    133133      {
    134134        if(track->second.at("clusterIndex") != (Int_t)cluster->first)
     
    155155  // descending sum(pt**2).
    156156  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++)
    158158  {
    159159
     
    164164  sort(clusterSumPT2.begin(), clusterSumPT2.end(), secondDescending);
    165165
    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++)
    167167  {
    168168    DelphesFactory *factory = GetFactory();
     
    213213  // trackPT vector.
    214214  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++)
    216216  {
    217217    if(track->second < fSeedMinPT)
     
    228228
    229229  // 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++)
    231231  {
    232232    addTrackToCluster(track->first, clusterIndex);
     
    261261    {
    262262
    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++)
    264264      {
    265265        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.