Changeset 77e9ae1 in git
- Timestamp:
- Feb 12, 2019, 9:48:36 PM (6 years ago)
- Branches:
- ImprovedOutputFile, Timing, llp, master
- Children:
- 899b162
- Parents:
- 6455202
- Files:
-
- 27 edited
Legend:
- Unmodified
- Added
- Removed
-
.clang-format
r6455202 r77e9ae1 1 1 BasedOnStyle: LLVM 2 2 Language: Cpp 3 Standard: Cpp03 3 4 IndentWidth: 2 4 5 ConstructorInitializerIndentWidth: 2 -
classes/DelphesClasses.h
r6455202 r77e9ae1 614 614 615 615 Int_t NTimeHits; 616 std::vector<std::pair<Float_t, Float_t> > ECalEnergyTimePairs;616 std::vector<std::pair<Float_t, Float_t> > ECalEnergyTimePairs; 617 617 618 618 // Isolation variables -
classes/DelphesHepMCReader.cc
r6455202 r77e9ae1 110 110 TObjArray *partonOutputArray) 111 111 { 112 map<int, pair<int, int> >::iterator itMotherMap;113 map<int, pair<int, int> >::iterator itDaughterMap;112 map<int, pair<int, int> >::iterator itMotherMap; 113 map<int, pair<int, int> >::iterator itDaughterMap; 114 114 char key, momentumUnit[4], positionUnit[3]; 115 115 int i, rc, state; … … 433 433 { 434 434 Candidate *candidate; 435 map<int, pair<int, int> >::iterator itMotherMap;436 map<int, pair<int, int> >::iterator itDaughterMap;435 map<int, pair<int, int> >::iterator itMotherMap; 436 map<int, pair<int, int> >::iterator itDaughterMap; 437 437 int i; 438 438 -
classes/DelphesHepMCReader.h
r6455202 r77e9ae1 98 98 int fParticleCounter; 99 99 100 std::map<int, std::pair<int, int> > fMotherMap;101 std::map<int, std::pair<int, int> > fDaughterMap;100 std::map<int, std::pair<int, int> > fMotherMap; 101 std::map<int, std::pair<int, int> > fDaughterMap; 102 102 }; 103 103 -
classes/DelphesLHEFReader.cc
r6455202 r77e9ae1 256 256 { 257 257 LHEFWeight *element; 258 vector<pair<int, double> >::const_iterator itWeightList;258 vector<pair<int, double> >::const_iterator itWeightList; 259 259 260 260 for(itWeightList = fWeightList.begin(); itWeightList != fWeightList.end(); ++itWeightList) -
classes/DelphesLHEFReader.h
r6455202 r77e9ae1 82 82 double fPx, fPy, fPz, fE, fMass; 83 83 84 std::vector<std::pair<int, double> > fWeightList;84 std::vector<std::pair<int, double> > fWeightList; 85 85 }; 86 86 -
display/Delphes3DGeometry.cc
r6455202 r77e9ae1 173 173 for(std::vector<std::string>::const_iterator calo = calorimeters_.begin(); calo != calorimeters_.end(); ++calo) 174 174 { 175 set<pair<Double_t, Int_t> > caloBinning;175 set<pair<Double_t, Int_t> > caloBinning; 176 176 ExRootConfParam paramEtaBins, paramPhiBins; 177 177 ExRootConfParam param = confReader->GetParam(Form("%s::EtaPhiBins", calo->c_str())); … … 187 187 } 188 188 189 set<pair<Double_t, Int_t> > caloBinning = caloBinning_[*calorimeters_.begin()];189 set<pair<Double_t, Int_t> > caloBinning = caloBinning_[*calorimeters_.begin()]; 190 190 Double_t *etaBins = new Double_t[caloBinning.size()]; // note that this is the eta binning of the first calo 191 191 unsigned int ii = 0; 192 for(set<pair<Double_t, Int_t> >::const_iterator itEtaSet = caloBinning.begin(); itEtaSet != caloBinning.end(); ++itEtaSet)192 for(set<pair<Double_t, Int_t> >::const_iterator itEtaSet = caloBinning.begin(); itEtaSet != caloBinning.end(); ++itEtaSet) 193 193 { 194 194 etaBins[ii++] = itEtaSet->first; … … 252 252 253 253 std::pair<Double_t, Double_t> Delphes3DGeometry::addCalorimeter(TGeoVolume *top, const char *name, 254 Double_t innerBarrelRadius, Double_t innerBarrelLength, set<pair<Double_t, Int_t> > &caloBinning)254 Double_t innerBarrelRadius, Double_t innerBarrelLength, set<pair<Double_t, Int_t> > &caloBinning) 255 255 { 256 256 // parameters derived from the inputs … … 316 316 317 317 void Delphes3DGeometry::addCaloTowers(TGeoVolume *top, const char *name, 318 Double_t innerBarrelRadius, Double_t innerBarrelLength, set<pair<Double_t, Int_t> > &caloBinning)318 Double_t innerBarrelRadius, Double_t innerBarrelLength, set<pair<Double_t, Int_t> > &caloBinning) 319 319 { 320 320 … … 339 339 Int_t etaslice = 0; 340 340 std::map<std::pair<int, int>, TGeoRotation *> phirotations; 341 for(set<pair<Double_t, Int_t> >::const_iterator bin = caloBinning.begin(); bin != caloBinning.end(); ++bin)341 for(set<pair<Double_t, Int_t> >::const_iterator bin = caloBinning.begin(); bin != caloBinning.end(); ++bin) 342 342 { 343 343 if(abs(bin->first) > calo_endcap_etamin) continue; // only in the barrel … … 388 388 etaslice = 0; 389 389 phirotations.clear(); 390 for(set<pair<Double_t, Int_t> >::const_iterator bin = caloBinning.begin(); bin != caloBinning.end(); ++bin)390 for(set<pair<Double_t, Int_t> >::const_iterator bin = caloBinning.begin(); bin != caloBinning.end(); ++bin) 391 391 { 392 392 if(bin->first < calo_endcap_etamin) continue; // only in the + endcap -
display/Delphes3DGeometry.h
r6455202 r77e9ae1 60 60 private: 61 61 std::pair<Double_t, Double_t> addTracker(TGeoVolume *top); 62 std::pair<Double_t, Double_t> addCalorimeter(TGeoVolume *top, const char *name, Double_t innerBarrelRadius, Double_t innerBarrelLength, std::set<std::pair<Double_t, Int_t> > &caloBinning);62 std::pair<Double_t, Double_t> addCalorimeter(TGeoVolume *top, const char *name, Double_t innerBarrelRadius, Double_t innerBarrelLength, std::set<std::pair<Double_t, Int_t> > &caloBinning); 63 63 std::pair<Double_t, Double_t> addMuonDets(TGeoVolume *top, const char *name, Double_t innerBarrelRadius, Double_t innerBarrelLength); 64 void addCaloTowers(TGeoVolume *top, const char *name, Double_t innerBarrelRadius, Double_t innerBarrelLength, std::set<std::pair<Double_t, Int_t> > &caloBinning);64 void addCaloTowers(TGeoVolume *top, const char *name, Double_t innerBarrelRadius, Double_t innerBarrelLength, std::set<std::pair<Double_t, Int_t> > &caloBinning); 65 65 66 66 private: … … 90 90 91 91 std::map<std::string, Double_t> muonSystem_etamax_; 92 std::map<std::string, std::set<std::pair<Double_t, Int_t> >> caloBinning_;92 std::map<std::string, std::set<std::pair<Double_t, Int_t> > > caloBinning_; 93 93 }; 94 94 -
display/DelphesPlotSummary.cc
r6455202 r77e9ae1 181 181 { 182 182 // clear event histograms and markers 183 for(std::map<TString, std::vector<TH1F *> >::iterator hv = eventProfiles_.begin(); hv != eventProfiles_.end(); ++hv)183 for(std::map<TString, std::vector<TH1F *> >::iterator hv = eventProfiles_.begin(); hv != eventProfiles_.end(); ++hv) 184 184 { 185 185 for(std::vector<TH1F *>::iterator h = hv->second.begin(); h < hv->second.end(); ++h) … … 188 188 } 189 189 } 190 for(std::map<TString, std::vector<TMarker *> >::iterator mv = eventMarkers_.begin(); mv != eventMarkers_.end(); ++mv)190 for(std::map<TString, std::vector<TMarker *> >::iterator mv = eventMarkers_.begin(); mv != eventMarkers_.end(); ++mv) 191 191 { 192 192 for(std::vector<TMarker *>::iterator m = mv->second.begin(); m < mv->second.end(); ++m) -
display/DelphesPlotSummary.h
r6455202 r77e9ae1 45 45 TEveWindowTab *tab_; 46 46 std::map<TString, TCanvas *> canvases_; 47 std::map<TString, std::vector<TH1F *> > histograms_;47 std::map<TString, std::vector<TH1F *> > histograms_; 48 48 std::vector<DelphesBranchBase *> *elements_; 49 std::map<TString, std::vector<TMarker *> > eventMarkers_;50 std::map<TString, std::vector<TH1F *> > eventProfiles_;49 std::map<TString, std::vector<TMarker *> > eventMarkers_; 50 std::map<TString, std::vector<TH1F *> > eventProfiles_; 51 51 }; 52 52 -
examples/CaloGrid.cpp
r6455202 r77e9ae1 41 41 42 42 std::vector<std::string> calorimeters_; 43 std::map<std::string, std::set<std::pair<Double_t, Int_t> >> caloBinning_;43 std::map<std::string, std::set<std::pair<Double_t, Int_t> > > caloBinning_; 44 44 45 45 std::string s(argv[2]); … … 90 90 91 91 //first entry is eta bin, second is number of phi bins 92 set<pair<Double_t, Int_t> > caloBinning;92 set<pair<Double_t, Int_t> > caloBinning; 93 93 ExRootConfParam paramEtaBins, paramPhiBins; 94 94 ExRootConfParam param = confReader->GetParam(Form("%s::EtaPhiBins", calo->c_str())); … … 109 109 110 110 //loop over calo binning 111 std::set<std::pair<Double_t, Int_t> >::iterator it;111 std::set<std::pair<Double_t, Int_t> >::iterator it; 112 112 113 113 Int_t n = -1; … … 122 122 liney->Draw(); 123 123 124 set<std::pair<Double_t, Int_t> >::iterator it2 = it;124 set<std::pair<Double_t, Int_t> >::iterator it2 = it; 125 125 it2--; 126 126 -
external/ExRootAnalysis/ExRootFilter.cc
r6455202 r77e9ae1 21 21 22 22 typedef map<Int_t, TObjArray *> TCategoryMap; 23 typedef map<ExRootClassifier *, pair<Bool_t, TCategoryMap> > TClassifierMap;23 typedef map<ExRootClassifier *, pair<Bool_t, TCategoryMap> > TClassifierMap; 24 24 25 25 ExRootFilter::ExRootFilter(const TSeqCollection *collection) : -
external/ExRootAnalysis/ExRootFilter.h
r6455202 r77e9ae1 25 25 TIterator *fIter; //! 26 26 27 std::map<ExRootClassifier *, std::pair<Bool_t, std::map<Int_t, TObjArray *> >> fMap; //!27 std::map<ExRootClassifier *, std::pair<Bool_t, std::map<Int_t, TObjArray *> > > fMap; //! 28 28 }; 29 29 -
external/ExRootAnalysis/ExRootTreeReader.h
r6455202 r77e9ae1 36 36 Int_t fCurrentTree; //! current Tree number in a TChain 37 37 38 typedef std::map<TString, std::pair<TBranch *, TClonesArray *> > TBranchMap;38 typedef std::map<TString, std::pair<TBranch *, TClonesArray *> > TBranchMap; 39 39 40 40 TBranchMap fBranchMap; //! -
modules/Calorimeter.h
r6455202 r77e9ae1 50 50 51 51 private: 52 typedef std::map<Long64_t, std::pair<Double_t, Double_t> > TFractionMap; //!53 typedef std::map<Double_t, std::set<Double_t> > TBinMap; //!52 typedef std::map<Long64_t, std::pair<Double_t, Double_t> > TFractionMap; //! 53 typedef std::map<Double_t, std::set<Double_t> > TBinMap; //! 54 54 55 55 Candidate *fTower; -
modules/DenseTrackFilter.h
r6455202 r77e9ae1 49 49 50 50 private: 51 typedef std::map<Double_t, std::set<Double_t> > TBinMap; //!51 typedef std::map<Double_t, std::set<Double_t> > TBinMap; //! 52 52 53 53 Candidate *fBestTrack; -
modules/IdentificationMap.h
r6455202 r77e9ae1 46 46 47 47 private: 48 typedef std::multimap<Int_t, std::pair<Int_t, DelphesFormula *> > TMisIDMap; //!48 typedef std::multimap<Int_t, std::pair<Int_t, DelphesFormula *> > TMisIDMap; //! 49 49 50 50 TMisIDMap fEfficiencyMap; //! -
modules/OldCalorimeter.h
r6455202 r77e9ae1 36 36 37 37 private: 38 typedef std::map<Long64_t, std::pair<Double_t, Double_t> > TFractionMap; //!39 typedef std::map<Double_t, std::set<Double_t> > TBinMap; //!38 typedef std::map<Long64_t, std::pair<Double_t, Double_t> > TFractionMap; //! 39 typedef std::map<Double_t, std::set<Double_t> > TBinMap; //! 40 40 41 41 Candidate *fTower; -
modules/SimpleCalorimeter.h
r6455202 r77e9ae1 52 52 private: 53 53 typedef std::map<Long64_t, Double_t> TFractionMap; //! 54 typedef std::map<Double_t, std::set<Double_t> > TBinMap; //!54 typedef std::map<Double_t, std::set<Double_t> > TBinMap; //! 55 55 56 56 Candidate *fTower; -
modules/TreeWriter.h
r6455202 r77e9ae1 70 70 typedef void (TreeWriter::*TProcessMethod)(ExRootTreeBranch *, TObjArray *); //! 71 71 72 typedef std::map<ExRootTreeBranch *, std::pair<TProcessMethod, TObjArray *> > TBranchMap; //!72 typedef std::map<ExRootTreeBranch *, std::pair<TProcessMethod, TObjArray *> > TBranchMap; //! 73 73 74 74 TBranchMap fBranchMap; //! -
modules/UniqueObjectFinder.cc
r6455202 r77e9ae1 92 92 void UniqueObjectFinder::Finish() 93 93 { 94 vector<pair<TIterator *, TObjArray *> >::iterator itInputMap;94 vector<pair<TIterator *, TObjArray *> >::iterator itInputMap; 95 95 TIterator *iterator; 96 96 … … 108 108 { 109 109 Candidate *candidate; 110 vector<pair<TIterator *, TObjArray *> >::iterator itInputMap;110 vector<pair<TIterator *, TObjArray *> >::iterator itInputMap; 111 111 TIterator *iterator; 112 112 TObjArray *array; … … 132 132 //------------------------------------------------------------------------------ 133 133 134 Bool_t UniqueObjectFinder::Unique(Candidate *candidate, vector<pair<TIterator *, TObjArray *> >::iterator itInputMap)134 Bool_t UniqueObjectFinder::Unique(Candidate *candidate, vector<pair<TIterator *, TObjArray *> >::iterator itInputMap) 135 135 { 136 136 Candidate *previousCandidate; 137 vector<pair<TIterator *, TObjArray *> >::iterator previousItInputMap;137 vector<pair<TIterator *, TObjArray *> >::iterator previousItInputMap; 138 138 TObjArray *array; 139 139 -
modules/UniqueObjectFinder.h
r6455202 r77e9ae1 50 50 Bool_t fUseUniqueID; 51 51 52 Bool_t Unique(Candidate *candidate, std::vector<std::pair<TIterator *, TObjArray *> >::iterator itInputMap);52 Bool_t Unique(Candidate *candidate, std::vector<std::pair<TIterator *, TObjArray *> >::iterator itInputMap); 53 53 54 std::vector<std::pair<TIterator *, TObjArray *> > fInputMap; //!54 std::vector<std::pair<TIterator *, TObjArray *> > fInputMap; //! 55 55 56 56 ClassDef(UniqueObjectFinder, 1) -
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) -
modules/VertexFinder.h
r6455202 r77e9ae1 49 49 TObjArray *fVertexOutputArray; 50 50 51 std::map<UInt_t, std::map<std::string, Double_t> > trackIDToDouble;52 std::map<UInt_t, std::map<std::string, Int_t> > trackIDToInt;53 std::map<UInt_t, std::map<std::string, Bool_t> > trackIDToBool;51 std::map<UInt_t, std::map<std::string, Double_t> > trackIDToDouble; 52 std::map<UInt_t, std::map<std::string, Int_t> > trackIDToInt; 53 std::map<UInt_t, std::map<std::string, Bool_t> > trackIDToBool; 54 54 55 std::map<UInt_t, std::map<std::string, Double_t> > clusterIDToDouble;56 std::map<UInt_t, std::map<std::string, Int_t> > clusterIDToInt;57 std::map<UInt_t, std::map<std::string, Bool_t> > clusterIDToBool;58 std::vector<std::pair<UInt_t, Double_t> > trackPT;59 std::vector<std::pair<UInt_t, Double_t> > clusterSumPT2;55 std::map<UInt_t, std::map<std::string, Double_t> > clusterIDToDouble; 56 std::map<UInt_t, std::map<std::string, Int_t> > clusterIDToInt; 57 std::map<UInt_t, std::map<std::string, Bool_t> > clusterIDToBool; 58 std::vector<std::pair<UInt_t, Double_t> > trackPT; 59 std::vector<std::pair<UInt_t, Double_t> > clusterSumPT2; 60 60 61 61 ClassDef(VertexFinder, 1) -
modules/VertexFinderDA4D.cc
r6455202 r77e9ae1 1077 1077 // avoid left-right biases by splitting highest Tc first 1078 1078 1079 std::vector<std::pair<double, unsigned int> > critical;1079 std::vector<std::pair<double, unsigned int> > critical; 1080 1080 for(unsigned int ik = 0; ik < y.size(); ik++) 1081 1081 { … … 1085 1085 } 1086 1086 } 1087 std::stable_sort(critical.begin(), critical.end(), std::greater<std::pair<double, unsigned int> >());1087 std::stable_sort(critical.begin(), critical.end(), std::greater<std::pair<double, unsigned int> >()); 1088 1088 1089 1089 for(unsigned int ic = 0; ic < critical.size(); ic++) -
modules/VertexSorter.cc
r6455202 r77e9ae1 118 118 map<Int_t, Double_t> clusterIDToSumPT2; 119 119 map<Int_t, Double_t>::const_iterator itClusterIDToSumPT2; 120 vector<pair<Int_t, Double_t> > sortedClusterIDs;121 vector<pair<Int_t, Double_t> >::const_iterator itSortedClusterIDs;120 vector<pair<Int_t, Double_t> > sortedClusterIDs; 121 vector<pair<Int_t, Double_t> >::const_iterator itSortedClusterIDs; 122 122 123 123 for(Int_t iCluster = 0; iCluster < fInputArray->GetEntries(); iCluster++) -
readers/DelphesCMSFWLite.cpp
r6455202 r77e9ae1 71 71 fwlite::Handle<GenEventInfoProduct> handleGenEventInfo; 72 72 fwlite::Handle<LHEEventProduct> handleLHEEvent; 73 fwlite::Handle<vector<reco::GenParticle> > handleParticle;74 fwlite::Handle<vector<pat::PackedGenParticle> > handlePackedParticle;73 fwlite::Handle<vector<reco::GenParticle> > handleParticle; 74 fwlite::Handle<vector<pat::PackedGenParticle> > handlePackedParticle; 75 75 76 76 vector<reco::GenParticle>::const_iterator itParticle;
Note:
See TracChangeset
for help on using the changeset viewer.