Project CMSSW displayed by LXR CMSSW_15_1_X_2025-07-15-2300/​Calibration/​HcalCalibAlgos/​macros/​CalibSort.C	Source navigation Diff markup Identifier search General search
	Version: CMSSW_15_1_X_2025-07-15-2300 CMSSW_15_1_X_2025-07-14-2300 CMSSW_15_1_X_2025-07-13-2300 CMSSW_15_1_X_2025-07-11-2300 CMSSW_15_1_X_2025-07-10-2300 CMSSW_15_1_X_2025-07-08-2300 CMSSW_15_0_4 CMSSW_15_0_3_patch1 CMSSW_14_0_21_patch1 Revert   Change

File indexing completed on 2024-04-06 11:58:52

 //////////////////////////////////////////////////////////////////////////////
 // Usage:
 // .L CalibSort.C+g (for the tree "CalibTree")
 //  CalibSort c1(fname, dirname, prefix, flag, mipCut);
 //  c1.Loop("events.txt");
 //  findDuplicate(infile, outfile, debug)
 //
 // .L CalibSort.C+g (for the tree "EventInfo")
 //  CalibSortEvent c2(fname, dirname, prefix, append);
 //  c2.Loop();
 //  findDuplicateEvent(infile, outfile, debug)
 //
 //  This will prepare a list of dupliate entries from comombined data sets
 //
 //   where:
 //
 //   fname    (const char*)    = file name of the input ROOT tree
 //                               or name of the file containing a list of
 //                               file names of input ROOT trees
 //   dirname  (std::string)    = name of the directory where Tree resides
 //                               (default "HcalIsoTrkAnalyzer")
 //   prefix  (std::string)     = String to be added to the name
 //                               (usually a 4 character string; default="")
 //   flag    (int)             = 2 digit integer (do) with specific control
 //                               information (d = 0/1 for debug off/on;
 //                               o = 0/1 for creating the output "events.txt"
 //                               file in append/output mode. Default = 0
 //   mipCut   (double)         = cut off on ECAL energy (default = 2.0)
 //
 //   infile   (std::string)    = name of the input file containing run, event,
 //                               information (created by CalibSort)
 //   outfile  (std::string)    = name of the file containing the entry numbers
 //                               of duplicate events
 //   debug    (bool)           = true/false for getting or not debug printouts
 //                               (default = false)
 //   append   (bool)           = flag used for opening o/p file. Default=false
 //
 //
 // .L CalibSort.C+g
 //  combine(fname1, fname2, fname0, outfile, debug)
 //
 //  Combines the 2 files created by isotrackApplyRegressor.py from
 //  Models 1 (endcap) and 2 (barrel)
 //
 //   fname1/2 (std::string)    = file names for endcap/barrel correction
 //                               factors
 //   fname0   (std::string)    = output combined file
 //   outfile  (std::string)    = root file name for storing histograms if
 //                               a vlaid name is given (default = "")
 //   debug    (int)            = verbosity flag (default = 1)
 //
 // .L CalibSort.C+g
 //  plotCombine(infile, flag, drawStatBox, save)
 //
 //   infile       (const char*)= name of input ROOT file
 //   flag         (int)        = indicates the source of the file.
 //                               -1 : created by the method combine
 //                               >=0 : created by CalibPlotCombine with
 //                                     the same meaning as in that method
 //   drawStatBox  (bool)       = flag to draw the statistics box (true)
 //   save         (bool)       = save the plots (true)
 //
 // .L CalibSort.C+g (for the tree "CalibTree")
 //  CalibPlotCombine c1(fname, corrFileName, dirname, flag);
 //  c1.Loop()
 //  c1.savePlot(histFileName,append)
 //
 //   fname        (const char*)= file name of the input ROOT tree
 //                               or name of the file containing a list of
 //                               file names of input ROOT trees
 //   corrFileName (const char*)= name of the text file having the correction
 //                               factors as a function of entry number
 //   dirname      (std::string)= name of the directory where Tree resides
 //                               ("HcalIsoTrkAnalyzer")
 //   flag         (int)        = two digit number "to". o: specifies if
 //                               charge isolation to be applied (1) or not
 //                               (0); t: if all tracks to be included (0)
 //                               or only with momentum 40-60 GeV (1)
 //                               Default (10)
 //   histFileName (std::string)= name of the histogram file
 //   append       (bool)       = true/false if the histogram file to be opened
 //                               in append/output mode
 //
 // .L CalibSort.C+g (for the o/p of isotrackRootTreeMaker.py)
 //  CalibFitPU c1(fname);
 //  c1.Loop(extractPUparams, fileName, dumpEntry);
 //
 //   fname        (const char*)= file name of the input ROOT tree which is
 //                               output of isotrackRootTreeMaker.py
 //   extractPUparams (bool)    = flag to see if extraction is needed
 //   filename     (std::string)= root name of all files to be created/read
 //                               (_par2d.txt, _parProf.txt, _parGraph.txt
 //                               will be names of files of parameters from
 //                               2D, profile, graphs; .root for storing all
 //                               histograms created)
 //   dumpEntry    (int)          Entries to be dumped.  Default (0)
 //
 // .L CalibSort.C+g (for merging information from PU and NoPU files)
 //  CalibMerge c1;
 //  c1.LoopNoPU(fileNameNoPU, dirnm);
 //  c1.LoopPU(fileNamePU, fname, dirnm);
 //  c1.close();
 //
 //   fileNameNoPU (const char*)= file name of the input ROOT tree for the
 //                               no PileUP Monte Carlo
 //   fileNamePU   (const char*)= file name of the input ROOT tree for the
 //                               PileUP Monte Carlo
 //   fname        (const char*)= file name of the output ROOT tree where the
 //                               combined information is written
 //   dirnm        (std::string) = name of the directory where Tree resides
 //                               (default "HcalIsoTrkAnalyzer")
 //
 // .L CalibSort.C+g
 //  combineML(inputFileList, outfile);
 //
 //  Combines the ML values otained from the analysis of muon analysis to
 //  determine depth dependent correction factors
 //
 //   inputFileList (const char*) = file containing filenames having the ML
 //                                 values for a given depth
 //   outfile       (const char*) = name of the output file where the
 //                                 depth dependent correction factors
 //                                 will be stored
 //   Example of a inputFileList:
 //      depth Name of the file
 //          1 ml_values_depth1.txt
 //          2 ml_values_depth2.txt
 //          3 ml_values_depth3.txt
 //          4 ml_values_depth4.txt
 //   where each file conatins
 //   (4 quantities per line with no tab separating each item):
 //   #ieta depth  ml    uncertainity-in-ml
 //
 // .L CalibSort.C+g
 //  calCorrCombine(inFileCorr, inFileDepth, outFileCorr, truncateFlag, etaMax);
 //
 //  Combines the correction factors obtained from CalibTree and the depth
 //  dependent correction factors used in the CalibTree command
 //
 //   inputFileCorr  (const char*) = file containing correction factors obtained
 //                                  from the CalibTree
 //   inputFileDepth (const char*) = file containing depth dependent correction
 //                                  factors used in the CalibTree step
 //   outfileCorr    (const char*) = name of the output file where the combined
 //                                  correction factors
 //   truncateFlag   (int)         = Truncate flag used in the CalibTree step
 //   etaMax         (int)         = Maximum eta value
 //
 //////////////////////////////////////////////////////////////////////////////
 
 #include <TCanvas.h>
 #include <TChain.h>
 #include <TF1.h>
 #include <TFile.h>
 #include <TFitResult.h>
 #include <TFitResultPtr.h>
 #include <TGraph.h>
 #include <TH1D.h>
 #include <TH2D.h>
 #include <TLegend.h>
 #include <TPaveStats.h>
 #include <TPaveText.h>
 #include <TProfile.h>
 #include <TROOT.h>
 #include <TStyle.h>
 
 #include <algorithm>
 #include <fstream>
 #include <iomanip>
 #include <iostream>
 #include <map>
 #include <sstream>
 #include <string>
 #include <vector>
 
 #include "CalibCorr.C"
 
 struct record {
   record(int ser = 0, int ent = 0, int r = 0, int ev = 0, int ie = 0, double p = 0)
       : serial_(ser), entry_(ent), run_(r), event_(ev), ieta_(ie), p_(p) {}
 
   int serial_, entry_, run_, event_, ieta_;
   double p_;
 };
 
 struct recordLess {
   bool operator()(const record &a, const record &b) {
     return ((a.run_ < b.run_) || ((a.run_ == b.run_) && (a.event_ < b.event_)) ||
             ((a.run_ == b.run_) && (a.event_ == b.event_) && (a.ieta_ < b.ieta_)));
   }
 };
 
 struct recordEvent {
   recordEvent(unsigned int ser = 0, unsigned int ent = 0, unsigned int r = 0, unsigned int ev = 0)
       : serial_(ser), entry_(ent), run_(r), event_(ev) {}
 
   unsigned int serial_, entry_, run_, event_;
 };
 
 struct recordEventLess {
   bool operator()(const recordEvent &a, const recordEvent &b) {
     return ((a.run_ < b.run_) || ((a.run_ == b.run_) && (a.event_ < b.event_)));
   }
 };
 
 struct listML {
   listML(int dep = 0, double ml = 0, double dml = 0) : depth_(dep), ml_(ml), dml_(dml) {}
 
   int depth_;
   double ml_, dml_;
 };
 
 class CalibSort {
 public:
   CalibSort(const char *fname,
             std::string dirname = "HcalIsoTrkAnalyzer",
             std::string prefix = "",
             bool allEvent = false,
             int flag = 0,
             double mipCut = 2.0);
   virtual ~CalibSort();
   virtual Int_t Cut(Long64_t entry);
   virtual Int_t GetEntry(Long64_t entry);
   virtual Long64_t LoadTree(Long64_t entry);
   virtual void Init(TChain *);
   virtual void Loop(const char *);
   virtual Bool_t Notify();
   virtual void Show(Long64_t entry = -1);
 
 private:
   TChain *fChain;  //!pointer to the analyzed TTree or TChain
   Int_t fCurrent;  //!current Tree number in a TChain
 
   // Declaration of leaf types
   Int_t t_Run;
   Int_t t_Event;
   Int_t t_DataType;
   Int_t t_ieta;
   Int_t t_iphi;
   Double_t t_EventWeight;
   Int_t t_nVtx;
   Int_t t_nTrk;
   Int_t t_goodPV;
   Double_t t_l1pt;
   Double_t t_l1eta;
   Double_t t_l1phi;
   Double_t t_l3pt;
   Double_t t_l3eta;
   Double_t t_l3phi;
   Double_t t_p;
   Double_t t_pt;
   Double_t t_phi;
   Double_t t_mindR1;
   Double_t t_mindR2;
   Double_t t_eMipDR;
   Double_t t_eHcal;
   Double_t t_eHcal10;
   Double_t t_eHcal30;
   Double_t t_hmaxNearP;
   Double_t t_rhoh;
   Bool_t t_selectTk;
   Bool_t t_qltyFlag;
   Bool_t t_qltyMissFlag;
   Bool_t t_qltyPVFlag;
   Double_t t_gentrackP;
   std::vector<unsigned int> *t_DetIds;
   std::vector<double> *t_HitEnergies;
   std::vector<bool> *t_trgbits;
   std::vector<unsigned int> *t_DetIds1;
   std::vector<unsigned int> *t_DetIds3;
   std::vector<double> *t_HitEnergies1;
   std::vector<double> *t_HitEnergies3;
 
   // List of branches
   TBranch *b_t_Run;           //!
   TBranch *b_t_Event;         //!
   TBranch *b_t_DataType;      //!
   TBranch *b_t_ieta;          //!
   TBranch *b_t_iphi;          //!
   TBranch *b_t_EventWeight;   //!
   TBranch *b_t_nVtx;          //!
   TBranch *b_t_nTrk;          //!
   TBranch *b_t_goodPV;        //!
   TBranch *b_t_l1pt;          //!
   TBranch *b_t_l1eta;         //!
   TBranch *b_t_l1phi;         //!
   TBranch *b_t_l3pt;          //!
   TBranch *b_t_l3eta;         //!
   TBranch *b_t_l3phi;         //!
   TBranch *b_t_p;             //!
   TBranch *b_t_pt;            //!
   TBranch *b_t_phi;           //!
   TBranch *b_t_mindR1;        //!
   TBranch *b_t_mindR2;        //!
   TBranch *b_t_eMipDR;        //!
   TBranch *b_t_eHcal;         //!
   TBranch *b_t_eHcal10;       //!
   TBranch *b_t_eHcal30;       //!
   TBranch *b_t_hmaxNearP;     //!
   TBranch *b_t_rhoh;          //!
   TBranch *b_t_selectTk;      //!
   TBranch *b_t_qltyFlag;      //!
   TBranch *b_t_qltyMissFlag;  //!
   TBranch *b_t_qltyPVFlag;    //!
   TBranch *b_t_gentrackP;     //!
   TBranch *b_t_DetIds;        //!
   TBranch *b_t_HitEnergies;   //!
   TBranch *b_t_trgbits;       //!
   TBranch *b_t_DetIds1;       //!
   TBranch *b_t_DetIds3;       //!
   TBranch *b_t_HitEnergies1;  //!
   TBranch *b_t_HitEnergies3;  //!
 
   std::string fname_, dirnm_, prefix_;
   bool allEvent_;
   int flag_;
   double mipCut_;
 };
 
 CalibSort::CalibSort(const char *fname, std::string dirnm, std::string prefix, bool allEvent, int flag, double mipCut)
     : fname_(fname), dirnm_(dirnm), prefix_(prefix), allEvent_(allEvent), flag_(flag), mipCut_(mipCut) {
   char treeName[400];
   sprintf(treeName, "%s/CalibTree", dirnm.c_str());
   TChain *chain = new TChain(treeName);
   std::cout << "Create a chain for " << treeName << " from " << fname << std::endl;
   if (!fillChain(chain, fname)) {
     std::cout << "*****No valid tree chain can be obtained*****" << std::endl;
   } else {
     std::cout << "Proceed with a tree chain with " << chain->GetEntries() << " entries" << std::endl;
     Init(chain);
   }
 }
 
 CalibSort::~CalibSort() {
   if (!fChain)
     return;
   delete fChain->GetCurrentFile();
 }
 
 Int_t CalibSort::GetEntry(Long64_t entry) {
   // Read contents of entry.
   if (!fChain)
     return 0;
   return fChain->GetEntry(entry);
 }
 
 Long64_t CalibSort::LoadTree(Long64_t entry) {
   // Set the environment to read one entry
   if (!fChain)
     return -5;
   Long64_t centry = fChain->LoadTree(entry);
   if (centry < 0)
     return centry;
   if (!fChain->InheritsFrom(TChain::Class()))
     return centry;
   TChain *chain = (TChain *)fChain;
   if (chain->GetTreeNumber() != fCurrent) {
     fCurrent = chain->GetTreeNumber();
     Notify();
   }
   return centry;
 }
 
 void CalibSort::Init(TChain *tree) {
   // The Init() function is called when the selector needs to initialize
   // a new tree or chain. Typically here the branch addresses and branch
   // pointers of the tree will be set.
   // It is normally not necessary to make changes to the generated
   // code, but the routine can be extended by the user if needed.
   // Init() will be called many times when running on PROOF
   // (once per file to be processed).
 
   // Set object pointer
   t_DetIds = 0;
   t_DetIds1 = 0;
   t_DetIds3 = 0;
   t_HitEnergies = 0;
   t_HitEnergies1 = 0;
   t_HitEnergies3 = 0;
   t_trgbits = 0;
   // Set branch addresses and branch pointers
   fChain = tree;
   fCurrent = -1;
   if (!tree)
     return;
   fChain->SetMakeClass(1);
 
   fChain->SetBranchAddress("t_Run", &t_Run, &b_t_Run);
   fChain->SetBranchAddress("t_Event", &t_Event, &b_t_Event);
   fChain->SetBranchAddress("t_DataType", &t_DataType, &b_t_DataType);
   fChain->SetBranchAddress("t_ieta", &t_ieta, &b_t_ieta);
   fChain->SetBranchAddress("t_iphi", &t_iphi, &b_t_iphi);
   fChain->SetBranchAddress("t_EventWeight", &t_EventWeight, &b_t_EventWeight);
   fChain->SetBranchAddress("t_nVtx", &t_nVtx, &b_t_nVtx);
   fChain->SetBranchAddress("t_nTrk", &t_nTrk, &b_t_nTrk);
   fChain->SetBranchAddress("t_goodPV", &t_goodPV, &b_t_goodPV);
   fChain->SetBranchAddress("t_l1pt", &t_l1pt, &b_t_l1pt);
   fChain->SetBranchAddress("t_l1eta", &t_l1eta, &b_t_l1eta);
   fChain->SetBranchAddress("t_l1phi", &t_l1phi, &b_t_l1phi);
   fChain->SetBranchAddress("t_l3pt", &t_l3pt, &b_t_l3pt);
   fChain->SetBranchAddress("t_l3eta", &t_l3eta, &b_t_l3eta);
   fChain->SetBranchAddress("t_l3phi", &t_l3phi, &b_t_l3phi);
   fChain->SetBranchAddress("t_p", &t_p, &b_t_p);
   fChain->SetBranchAddress("t_pt", &t_pt, &b_t_pt);
   fChain->SetBranchAddress("t_phi", &t_phi, &b_t_phi);
   fChain->SetBranchAddress("t_mindR1", &t_mindR1, &b_t_mindR1);
   fChain->SetBranchAddress("t_mindR2", &t_mindR2, &b_t_mindR2);
   fChain->SetBranchAddress("t_eMipDR", &t_eMipDR, &b_t_eMipDR);
   fChain->SetBranchAddress("t_eHcal", &t_eHcal, &b_t_eHcal);
   fChain->SetBranchAddress("t_eHcal10", &t_eHcal10, &b_t_eHcal10);
   fChain->SetBranchAddress("t_eHcal30", &t_eHcal30, &b_t_eHcal30);
   fChain->SetBranchAddress("t_hmaxNearP", &t_hmaxNearP, &b_t_hmaxNearP);
   fChain->SetBranchAddress("t_rhoh", &t_rhoh, &b_t_rhoh);
   fChain->SetBranchAddress("t_selectTk", &t_selectTk, &b_t_selectTk);
   fChain->SetBranchAddress("t_qltyFlag", &t_qltyFlag, &b_t_qltyFlag);
   fChain->SetBranchAddress("t_qltyMissFlag", &t_qltyMissFlag, &b_t_qltyMissFlag);
   fChain->SetBranchAddress("t_qltyPVFlag", &t_qltyPVFlag, &b_t_qltyPVFlag);
   fChain->SetBranchAddress("t_gentrackP", &t_gentrackP, &b_t_gentrackP);
   fChain->SetBranchAddress("t_DetIds", &t_DetIds, &b_t_DetIds);
   fChain->SetBranchAddress("t_HitEnergies", &t_HitEnergies, &b_t_HitEnergies);
   fChain->SetBranchAddress("t_trgbits", &t_trgbits, &b_t_trgbits);
   fChain->SetBranchAddress("t_DetIds1", &t_DetIds1, &b_t_DetIds1);
   fChain->SetBranchAddress("t_DetIds3", &t_DetIds3, &b_t_DetIds3);
   fChain->SetBranchAddress("t_HitEnergies1", &t_HitEnergies1, &b_t_HitEnergies1);
   fChain->SetBranchAddress("t_HitEnergies3", &t_HitEnergies3, &b_t_HitEnergies3);
 
   Notify();
 }
 
 Bool_t CalibSort::Notify() {
   // The Notify() function is called when a new file is opened. This
   // can be either for a new TTree in a TChain or when when a new TTree
   // is started when using PROOF. It is normally not necessary to make changes
   // to the generated code, but the routine can be extended by the
   // user if needed. The return value is currently not used.
 
   return kTRUE;
 }
 
 void CalibSort::Show(Long64_t entry) {
   // Print contents of entry.
   // If entry is not specified, print current entry
   if (!fChain)
     return;
   fChain->Show(entry);
 }
 
 Int_t CalibSort::Cut(Long64_t) {
   // This function may be called from Loop.
   // returns  1 if entry is accepted.
   // returns -1 otherwise.
   return 1;
 }
 
 void CalibSort::Loop(const char *outFile) {
   //   In a ROOT session, you can do:
   //      Root > .L CalibSort.C
   //      Root > CalibSort t
   //      Root > t.GetEntry(12); // Fill t data members with entry number 12
   //      Root > t.Show();       // Show values of entry 12
   //      Root > t.Show(16);     // Read and show values of entry 16
   //      Root > t.Loop();       // Loop on all entries
   //
 
   //   This is the loop skeleton where:
   //      jentry is the global entry number in the chain
   //      ientry is the entry number in the current Tree
   //   Note that the argument to GetEntry must be:
   //      jentry for TChain::GetEntry
   //      ientry for TTree::GetEntry and TBranch::GetEntry
   //
   //       To read only selected branches, Insert statements like:
   // METHOD1:
   //    fChain->SetBranchStatus("*",0);  // disable all branches
   //    fChain->SetBranchStatus("branchname",1);  // activate branchname
   // METHOD2: replace line
   //    fChain->GetEntry(jentry);       //read all branches
   //by  b_branchname->GetEntry(ientry); //read only this branch
   if (fChain == 0)
     return;
 
   std::ofstream fileout;
   if ((flag_ % 10) == 1) {
     fileout.open(outFile, std::ofstream::out);
     std::cout << "Opens " << outFile << " in output mode" << std::endl;
   } else {
     fileout.open(outFile, std::ofstream::app);
     std::cout << "Opens " << outFile << " in append mode" << std::endl;
   }
   if (!allEvent_)
     fileout << "Input file: " << fname_ << " Directory: " << dirnm_ << " Prefix: " << prefix_ << std::endl;
   Int_t runLow(99999999), runHigh(0);
   Long64_t nbytes(0), nb(0), good(0);
   Long64_t nentries = fChain->GetEntriesFast();
   for (Long64_t jentry = 0; jentry < nentries; jentry++) {
     Long64_t ientry = LoadTree(jentry);
     if (ientry < 0)
       break;
     nb = fChain->GetEntry(jentry);
     nbytes += nb;
     if (t_Run > 200000 && t_Run < 800000) {
       if (t_Run < runLow)
         runLow = t_Run;
       if (t_Run > runHigh)
         runHigh = t_Run;
     }
     double cut = (t_p > 20) ? 10.0 : 0.0;
     if ((flag_ / 10) % 10 > 0)
       std::cout << "Entry " << jentry << " p " << t_p << " Cuts " << t_qltyFlag << "|" << t_selectTk << "|"
                 << (t_hmaxNearP < cut) << "|" << (t_eMipDR < mipCut_) << std::endl;
     if ((t_qltyFlag && t_selectTk && (t_hmaxNearP < cut) && (t_eMipDR < mipCut_)) || allEvent_) {
       good++;
       fileout << good << " " << jentry << " " << t_Run << " " << t_Event << " " << t_ieta << " " << t_p << std::endl;
     }
   }
   fileout.close();
   std::cout << "Writes " << good << " events in the file " << outFile << " from " << nentries
             << " entries in run range " << runLow << ":" << runHigh << std::endl;
 }
 
 class CalibSortEvent {
 public:
   TChain *fChain;  //!pointer to the analyzed TTree/TChain
   Int_t fCurrent;  //!current Tree number in a TChain
 
   // Declaration of leaf types
   UInt_t t_RunNo;
   UInt_t t_EventNo;
   Int_t t_Tracks;
   Int_t t_TracksProp;
   Int_t t_TracksSaved;
   Int_t t_TracksLoose;
   Int_t t_TracksTight;
   Int_t t_allvertex;
   Bool_t t_TrigPass;
   Bool_t t_TrigPassSel;
   Bool_t t_L1Bit;
   std::vector<Bool_t> *t_hltbits;
   std::vector<int> *t_ietaAll;
   std::vector<int> *t_ietaGood;
   std::vector<int> *t_trackType;
 
   // List of branches
   TBranch *b_t_RunNo;        //!
   TBranch *b_t_EventNo;      //!
   TBranch *b_t_Tracks;       //!
   TBranch *b_t_TracksProp;   //!
   TBranch *b_t_TracksSaved;  //!
   TBranch *b_t_TracksLoose;  //!
   TBranch *b_t_TracksTight;  //!
   TBranch *b_t_allvertex;    //!
   TBranch *b_t_TrigPass;     //!
   TBranch *b_t_TrigPassSel;  //!
   TBranch *b_t_L1Bit;        //!
   TBranch *b_t_hltbits;      //!
   TBranch *b_t_ietaAll;      //!
   TBranch *b_t_ietaGood;     //!
   TBranch *b_t_trackType;    //!
 
   CalibSortEvent(const char *fname, std::string dirname, std::string prefix = "", bool append = false);
   virtual ~CalibSortEvent();
   virtual Int_t Cut(Long64_t entry);
   virtual Int_t GetEntry(Long64_t entry);
   virtual Long64_t LoadTree(Long64_t entry);
   virtual void Init(TChain *tree);
   virtual void Loop();
   virtual Bool_t Notify();
   virtual void Show(Long64_t entry = -1);
 
 private:
   std::string fname_, dirnm_, prefix_;
   bool append_;
 };
 
 CalibSortEvent::CalibSortEvent(const char *fname, std::string dirnm, std::string prefix, bool append)
     : fname_(fname), dirnm_(dirnm), prefix_(prefix), append_(append) {
   char treeName[400];
   sprintf(treeName, "%s/EventInfo", dirnm.c_str());
   TChain *chain = new TChain(treeName);
   std::cout << "Create a chain for " << treeName << " from " << fname << std::endl;
   if (!fillChain(chain, fname)) {
     std::cout << "*****No valid tree chain can be obtained*****" << std::endl;
   } else {
     std::cout << "Proceed with a tree chain with " << chain->GetEntries() << " entries" << std::endl;
     Init(chain);
   }
 }
 
 CalibSortEvent::~CalibSortEvent() {
   if (!fChain)
     return;
   delete fChain->GetCurrentFile();
 }
 
 Int_t CalibSortEvent::GetEntry(Long64_t entry) {
   // Read contents of entry.
   if (!fChain)
     return 0;
   return fChain->GetEntry(entry);
 }
 
 Long64_t CalibSortEvent::LoadTree(Long64_t entry) {
   // Set the environment to read one entry
   if (!fChain)
     return -5;
   Long64_t centry = fChain->LoadTree(entry);
   if (centry < 0)
     return centry;
   if (!fChain->InheritsFrom(TChain::Class()))
     return centry;
   TChain *chain = (TChain *)fChain;
   if (chain->GetTreeNumber() != fCurrent) {
     fCurrent = chain->GetTreeNumber();
     Notify();
   }
   return centry;
 }
 
 void CalibSortEvent::Init(TChain *tree) {
   // The Init() function is called when the selector needs to initialize
   // a new tree or chain. Typically here the branch addresses and branch
   // pointers of the tree will be set.
   // It is normally not necessary to make changes to the generated
   // code, but the routine can be extended by the user if needed.
   // Init() will be called many times when running on PROOF
   // (once per file to be processed).
 
   // Set branch addresses and branch pointers
   // Set object pointer
   t_hltbits = 0;
   t_ietaAll = 0;
   t_ietaGood = 0;
   t_trackType = 0;
   t_L1Bit = false;
   fChain = tree;
   fCurrent = -1;
   if (!tree)
     return;
   fChain->SetMakeClass(1);
   fChain->SetBranchAddress("t_RunNo", &t_RunNo, &b_t_RunNo);
   fChain->SetBranchAddress("t_EventNo", &t_EventNo, &b_t_EventNo);
   fChain->SetBranchAddress("t_Tracks", &t_Tracks, &b_t_Tracks);
   fChain->SetBranchAddress("t_TracksProp", &t_TracksProp, &b_t_TracksProp);
   fChain->SetBranchAddress("t_TracksSaved", &t_TracksSaved, &b_t_TracksSaved);
   fChain->SetBranchAddress("t_TracksLoose", &t_TracksLoose, &b_t_TracksLoose);
   fChain->SetBranchAddress("t_TracksTight", &t_TracksTight, &b_t_TracksTight);
   fChain->SetBranchAddress("t_allvertex", &t_allvertex, &b_t_allvertex);
   fChain->SetBranchAddress("t_TrigPass", &t_TrigPass, &b_t_TrigPass);
   fChain->SetBranchAddress("t_TrigPassSel", &t_TrigPassSel, &b_t_TrigPassSel);
   fChain->SetBranchAddress("t_L1Bit", &t_L1Bit, &b_t_L1Bit);
   fChain->SetBranchAddress("t_hltbits", &t_hltbits, &b_t_hltbits);
   fChain->SetBranchAddress("t_ietaAll", &t_ietaAll, &b_t_ietaAll);
   fChain->SetBranchAddress("t_ietaGood", &t_ietaGood, &b_t_ietaGood);
   fChain->SetBranchAddress("t_trackType", &t_trackType, &b_t_trackType);
   Notify();
 }
 
 Bool_t CalibSortEvent::Notify() {
   // The Notify() function is called when a new file is opened. This
   // can be either for a new TTree in a TChain or when when a new TTree
   // is started when using PROOF. It is normally not necessary to make changes
   // to the generated code, but the routine can be extended by the
   // user if needed. The return value is currently not used.
 
   return kTRUE;
 }
 
 void CalibSortEvent::Show(Long64_t entry) {
   // Print contents of entry.
   // If entry is not specified, print current entry
   if (!fChain)
     return;
   fChain->Show(entry);
 }
 
 Int_t CalibSortEvent::Cut(Long64_t) {
   // This function may be called from Loop.
   // returns  1 if entry is accepted.
   // returns -1 otherwise.
   return 1;
 }
 
 void CalibSortEvent::Loop() {
   //   In a ROOT session, you can do:
   //      Root > .L CalibMonitor.C+g
   //      Root > CalibSortEvent t
   //      Root > t.GetEntry(12); // Fill t data members with entry number 12
   //      Root > t.Show();       // Show values of entry 12
   //      Root > t.Show(16);     // Read and show values of entry 16
   //      Root > t.Loop();       // Loop on all entries
   //
 
   //     This is the loop skeleton where:
   //    jentry is the global entry number in the chain
   //    ientry is the entry number in the current Tree
   //  Note that the argument to GetEntry must be:
   //    jentry for TChain::GetEntry
   //    ientry for TTree::GetEntry and TBranch::GetEntry
   //
   //       To read only selected branches, Insert statements like:
   // METHOD1:
   //    fChain->SetBranchStatus("*",0);  // disable all branches
   //    fChain->SetBranchStatus("branchname",1);  // activate branchname
   // METHOD2: replace line
   //    fChain->GetEntry(jentry);       //read all branches
   //by  b_branchname->GetEntry(ientry); //read only this branch
   if (fChain == 0)
     return;
 
   std::ofstream fileout;
   if (!append_) {
     fileout.open("runevents.txt", std::ofstream::out);
     std::cout << "Opens runevents.txt in output mode" << std::endl;
   } else {
     fileout.open("runevents.txt", std::ofstream::app);
     std::cout << "Opens runevents.txt in append mode" << std::endl;
   }
   fileout << "Input file: " << fname_ << " Directory: " << dirnm_ << " Prefix: " << prefix_ << std::endl;
   UInt_t runLow(99999999), runHigh(0);
   Long64_t nbytes(0), nb(0), good(0);
   Long64_t nentries = fChain->GetEntriesFast();
   for (Long64_t jentry = 0; jentry < nentries; jentry++) {
     Long64_t ientry = LoadTree(jentry);
     if (ientry < 0)
       break;
     nb = fChain->GetEntry(jentry);
     nbytes += nb;
     if (t_RunNo > 200000 && t_RunNo < 800000) {
       if (t_RunNo < runLow)
         runLow = t_RunNo;
       if (t_RunNo > runHigh)
         runHigh = t_RunNo;
     }
     good++;
     fileout << good << " " << jentry << " " << t_RunNo << " " << t_EventNo << std::endl;
   }
   fileout.close();
   std::cout << "Writes " << good << " events in the file events.txt from " << nentries << " entries in run range "
             << runLow << ":" << runHigh << std::endl;
 }
 
 void readRecords(std::string fname, std::vector<record> &records, bool debug) {
   records.clear();
   ifstream infile(fname.c_str());
   if (!infile.is_open()) {
     std::cout << "Cannot open " << fname << std::endl;
   } else {
     while (1) {
       int ser, ent, r, ev, ie;
       double p;
       infile >> ser >> ent >> r >> ev >> ie >> p;
       if (!infile.good())
         break;
       record rec(ser, ent, r, ev, ie, p);
       records.push_back(rec);
     }
     infile.close();
   }
   std::cout << "Reads " << records.size() << " records from " << fname << std::endl;
   if (debug) {
     for (unsigned int k = 0; k < records.size(); ++k) {
       if (k % 100 == 0)
         std::cout << "[" << records[k].serial_ << ":" << records[k].entry_ << "] " << records[k].run_ << ":"
                   << records[k].event_ << " " << records[k].ieta_ << " " << records[k].p_ << std::endl;
     }
   }
 }
 
 void readMap(std::string fname, std::map<std::pair<int, int>, int> &records, bool debug) {
   records.clear();
   ifstream infile(fname.c_str());
   if (!infile.is_open()) {
     std::cout << "Cannot open " << fname << std::endl;
   } else {
     while (1) {
       int ser, ent, r, ev, ie;
       double p;
       infile >> ser >> ent >> r >> ev >> ie >> p;
       if (!infile.good())
         break;
       std::pair<int, int> key(r, ev);
       if (records.find(key) == records.end())
         records[key] = ent;
     }
     infile.close();
   }
   std::cout << "Reads " << records.size() << " records from " << fname << std::endl;
   if (debug) {
     unsigned k(0);
     for (std::map<std::pair<int, int>, int>::iterator itr = records.begin(); itr != records.end(); ++itr, ++k) {
       if (k % 100 == 0)
         std::cout << "[" << k << "] " << itr->second << ":" << (itr->first).first << ":" << (itr->first).second << "\n";
     }
   }
 }
 
 void sort(std::vector<record> &records, bool debug) {
   // Use std::sort
   std::sort(records.begin(), records.end(), recordLess());
   if (debug) {
     for (unsigned int k = 0; k < records.size(); ++k) {
       std::cout << "[" << k << ":" << records[k].serial_ << ":" << records[k].entry_ << "] " << records[k].run_ << ":"
                 << records[k].event_ << " " << records[k].ieta_ << " " << records[k].p_ << std::endl;
     }
   }
 }
 
 void duplicate(std::string fname, std::vector<record> &records, bool debug) {
   std::ofstream file;
   file.open(fname.c_str(), std::ofstream::out);
   std::cout << "List of entry names of duplicate events" << std::endl;
   int duplicate(0), dupl40(0);
   for (unsigned int k = 1; k < records.size(); ++k) {
     if ((records[k].run_ == records[k - 1].run_) && (records[k].event_ == records[k - 1].event_) &&
         (records[k].ieta_ == records[k - 1].ieta_) && (fabs(records[k].p_ - records[k - 1].p_) < 0.0001)) {
       // This is a duplicate event - reject the one with larger serial #
       if (records[k].entry_ < records[k - 1].entry_) {
         record swap = records[k - 1];
         records[k - 1] = records[k];
         records[k] = swap;
       }
       if (debug) {
         std::cout << "Serial " << records[k - 1].serial_ << ":" << records[k].serial_ << " Entry "
                   << records[k - 1].entry_ << ":" << records[k].entry_ << " Run " << records[k - 1].run_ << ":"
                   << records[k].run_ << " Event " << records[k - 1].event_ << " " << records[k].event_ << " Eta "
                   << records[k - 1].ieta_ << " " << records[k].ieta_ << " p " << records[k - 1].p_ << ":"
                   << records[k].p_ << std::endl;
       }
       file << records[k].entry_ << std::endl;
       duplicate++;
       if (records[k].p_ >= 40.0 && records[k].p_ <= 60.0)
         dupl40++;
     }
   }
   file.close();
   std::cout << "Total # of duplcate events " << duplicate << " (" << dupl40 << " with p 40:60)" << std::endl;
 }
 
 void findDuplicate(std::string infile, std::string outfile, bool debug = false) {
   std::vector<record> records;
   readRecords(infile, records, debug);
   sort(records, debug);
   duplicate(outfile, records, debug);
 }
 
 void findCommon(std::string infile1, std::string infile2, std::string infile3, std::string outfile, bool debug = false) {
   std::map<std::pair<int, int>, int> map1, map2, map3;
   readMap(infile1, map1, debug);
   readMap(infile2, map2, debug);
   readMap(infile3, map3, debug);
   bool check3 = (map3.size() > 0);
   std::ofstream file;
   file.open(outfile.c_str(), std::ofstream::out);
   unsigned int k(0), good(0);
   for (std::map<std::pair<int, int>, int>::iterator itr = map1.begin(); itr != map1.end(); ++itr, ++k) {
     std::pair<int, int> key = itr->first;
     bool ok = (map2.find(key) != map2.end());
     if (ok && check3)
       ok = (map3.find(key) != map3.end());
     if (debug && k % 100 == 0)
       std::cout << "[" << k << "] Run " << key.first << " Event " << key.second << " Flag " << ok << std::endl;
     if (ok) {
       ++good;
       file << key.first << "   " << key.second << std::endl;
     }
   }
   file.close();
   std::cout << "Total # of common events " << good << " written to o/p file " << outfile << std::endl;
 }
 
 void readRecordEvents(std::string fname, std::vector<recordEvent> &records, bool debug) {
   records.clear();
   ifstream infile(fname.c_str());
   if (!infile.is_open()) {
     std::cout << "Cannot open " << fname << std::endl;
   } else {
     while (1) {
       unsigned int ser, ent, r, ev;
       infile >> ser >> ent >> r >> ev;
       if (!infile.good())
         break;
       recordEvent rec(ser, ent, r, ev);
       records.push_back(rec);
     }
     infile.close();
   }
   std::cout << "Reads " << records.size() << " records from " << fname << std::endl;
   if (debug) {
     for (unsigned int k = 0; k < records.size(); ++k) {
       if (k % 100 == 0)
         std::cout << "[" << records[k].serial_ << ":" << records[k].entry_ << "] " << records[k].run_ << ":"
                   << records[k].event_ << std::endl;
     }
   }
 }
 
 void sortEvent(std::vector<recordEvent> &records, bool debug) {
   // Use std::sort
   std::sort(records.begin(), records.end(), recordEventLess());
   if (debug) {
     for (unsigned int k = 0; k < records.size(); ++k) {
       std::cout << "[" << k << ":" << records[k].serial_ << ":" << records[k].entry_ << "] " << records[k].run_ << ":"
                 << records[k].event_ << std::endl;
     }
   }
 }
 
 void duplicateEvent(std::string fname, std::vector<recordEvent> &records, bool debug) {
   std::ofstream file;
   file.open(fname.c_str(), std::ofstream::out);
   std::cout << "List of entry names of duplicate events" << std::endl;
   int duplicate(0);
   for (unsigned int k = 1; k < records.size(); ++k) {
     if ((records[k].run_ == records[k - 1].run_) && (records[k].event_ == records[k - 1].event_)) {
       // This is a duplicate event - reject the one with larger serial #
       if (records[k].entry_ < records[k - 1].entry_) {
         recordEvent swap = records[k - 1];
         records[k - 1] = records[k];
         records[k] = swap;
       }
       if (debug) {
         std::cout << "Serial " << records[k - 1].serial_ << ":" << records[k].serial_ << " Entry "
                   << records[k - 1].entry_ << ":" << records[k].entry_ << " Run " << records[k - 1].run_ << ":"
                   << records[k].run_ << " Event " << records[k - 1].event_ << " " << records[k].event_ << std::endl;
       }
       file << records[k].entry_ << std::endl;
       duplicate++;
     }
   }
   file.close();
   std::cout << "Total # of duplcate events " << duplicate << std::endl;
 }
 
 void findDuplicateEvent(std::string infile, std::string outfile, bool debug = false) {
   std::vector<recordEvent> records;
   readRecordEvents(infile, records, debug);
   sortEvent(records, debug);
   duplicateEvent(outfile, records, debug);
 }
 
 void combine(const std::string fname1,
              const std::string fname2,
              const std::string fname,
              const std::string outfile = "",
              int debug = 0) {
   ifstream infile1(fname1.c_str());
   ifstream infile2(fname2.c_str());
   if ((!infile1.is_open()) || (!infile2.is_open())) {
     std::cout << "Cannot open " << fname1 << " or " << fname2 << std::endl;
   } else {
     std::ofstream file;
     file.open(fname.c_str(), std::ofstream::out);
     TH1D *hist0 = new TH1D("W0", "Correction Factor (All)", 100, 0.0, 10.0);
     TH1D *hist1 = new TH1D("W1", "Correction Factor (Barrel)", 100, 0.0, 10.0);
     TH1D *hist2 = new TH1D("W2", "Correction Factor (Endcap)", 100, 0.0, 10.0);
     TProfile *prof = new TProfile("P", "Correction vs i#eta", 60, -30, 30, 0, 100, "");
     unsigned int kount(0), kout(0);
     double wmaxb(0), wmaxe(0);
     while (1) {
       Long64_t entry1, entry2;
       int ieta1, ieta2;
       double wt1, wt2;
       infile1 >> entry1 >> ieta1 >> wt1;
       infile2 >> entry2 >> ieta2 >> wt2;
       if ((!infile1.good()) || (!infile2.good()))
         break;
       ++kount;
       if (debug > 1) {
         std::cout << kount << " Enrty No. " << entry1 << ":" << entry2 << " eta " << ieta1 << ":" << ieta2 << " wt "
                   << wt1 << ":" << wt2 << std::endl;
       }
       if (entry1 == entry2) {
         int ieta = fabs(ieta1);
         double wt = (ieta >= 16) ? wt1 : wt2;
         file << std::setw(8) << entry1 << " " << std::setw(12) << std::setprecision(8) << wt << std::endl;
         hist0->Fill(wt);
         if (ieta >= 16) {
           hist2->Fill(wt);
           if (wt > wmaxe)
             wmaxe = wt;
         } else {
           hist1->Fill(wt);
           if (wt > wmaxb)
             wmaxb = wt;
         }
         prof->Fill(ieta1, wt);
         ++kout;
       } else if (debug > 0) {
         std::cout << kount << " Entry " << entry1 << ":" << entry2 << " eta " << ieta1 << ":" << ieta2 << " wt " << wt1
                   << ":" << wt2 << " mismatch" << std::endl;
       }
     }
     infile1.close();
     infile2.close();
     file.close();
     std::cout << "Writes " << kout << " entries to " << fname << " from " << kount << " events from " << fname1
               << " and " << fname2 << " maximum correction factor " << wmaxb << " (Barrel) " << wmaxe << " (Endcap)"
               << std::endl;
     if (outfile != "") {
       TFile *theFile = new TFile(outfile.c_str(), "RECREATE");
       theFile->cd();
       hist0->Write();
       hist1->Write();
       hist2->Write();
       prof->Write();
       theFile->Close();
     }
   }
 }
 
 void plotCombine(const char *infile, int flag = -1, bool drawStatBox = true, bool save = true) {
   int flag1 = (flag >= 0 ? (flag / 10) % 10 : 0);
   int flag2 = (flag >= 0 ? (flag % 10) : 0);
   std::string name[4] = {"W0", "W1", "W2", "P"};
   std::string xtitl[4] = {
       "Correction Factor (All)", "Correction Factor (Barrel)", "Correction Factor (Endcap)", "i#eta"};
   std::string ytitl[4] = {"Track", "Track", "Track", "Correction Factor"};
   char title[100];
   std::string mom[2] = {"all momentum", "p = 40:60 GeV"};
   std::string iso[2] = {"loose", "tight"};
   if (flag < 0) {
     sprintf(title, "All tracks");
   } else {
     sprintf(title, "Good tracks of %s with %s isolation", mom[flag1].c_str(), iso[flag2].c_str());
   }
 
   gStyle->SetCanvasBorderMode(0);
   gStyle->SetCanvasColor(kWhite);
   gStyle->SetPadColor(kWhite);
   gStyle->SetFillColor(kWhite);
   gStyle->SetOptTitle(0);
   gStyle->SetOptStat(111110);
   gStyle->SetOptFit(0);
   TFile *file = new TFile(infile);
   for (int k = 0; k < 4; ++k) {
     char nameh[40], namep[50];
     if (flag >= 0)
       sprintf(nameh, "%s%d%d", name[k].c_str(), flag1, flag2);
     else
       sprintf(nameh, "%s", name[k].c_str());
     sprintf(namep, "c_%s", nameh);
     TCanvas *pad(nullptr);
     if (k == 3) {
       TProfile *hist = (TProfile *)file->FindObjectAny(nameh);
       if (hist != nullptr) {
         pad = new TCanvas(namep, namep, 700, 500);
         pad->SetRightMargin(0.10);
         pad->SetTopMargin(0.10);
         hist->GetXaxis()->SetTitleSize(0.04);
         hist->GetXaxis()->SetTitle(xtitl[k].c_str());
         hist->GetYaxis()->SetTitle(ytitl[k].c_str());
         hist->GetYaxis()->SetLabelOffset(0.005);
         hist->GetYaxis()->SetTitleSize(0.04);
         hist->GetYaxis()->SetLabelSize(0.035);
         hist->GetYaxis()->SetTitleOffset(1.10);
         hist->SetMarkerStyle(20);
         hist->Draw();
         pad->Update();
         TPaveStats *st1 = (TPaveStats *)hist->GetListOfFunctions()->FindObject("stats");
         if (st1 != nullptr && drawStatBox) {
           st1->SetY1NDC(0.70);
           st1->SetY2NDC(0.90);
           st1->SetX1NDC(0.65);
           st1->SetX2NDC(0.90);
         }
       }
     } else {
       TH1D *hist = (TH1D *)file->FindObjectAny(nameh);
       if (hist != nullptr) {
         pad = new TCanvas(namep, namep, 700, 500);
         pad->SetRightMargin(0.10);
         pad->SetTopMargin(0.10);
         pad->SetLogy();
         hist->GetXaxis()->SetTitleSize(0.04);
         hist->GetXaxis()->SetTitle(xtitl[k].c_str());
         hist->GetYaxis()->SetTitle(ytitl[k].c_str());
         hist->GetYaxis()->SetLabelOffset(0.005);
         hist->GetYaxis()->SetTitleSize(0.04);
         hist->GetYaxis()->SetLabelSize(0.035);
         hist->GetYaxis()->SetTitleOffset(1.10);
         hist->SetMarkerStyle(20);
         hist->Draw();
         pad->Update();
         TPaveStats *st1 = (TPaveStats *)hist->GetListOfFunctions()->FindObject("stats");
         if (st1 != nullptr && drawStatBox) {
           st1->SetY1NDC(0.70);
           st1->SetY2NDC(0.90);
           st1->SetX1NDC(0.65);
           st1->SetX2NDC(0.90);
         }
       }
       TPaveText *txt0 = new TPaveText(0.10, 0.91, 0.90, 0.96, "blNDC");
       txt0->SetFillColor(0);
       txt0->AddText(title);
       txt0->Draw("same");
       pad->Update();
     }
     if (pad != nullptr) {
       pad->Modified();
       pad->Update();
       if (save) {
         sprintf(namep, "%s.pdf", pad->GetName());
         pad->Print(namep);
       }
     }
   }
 }
 
 class CalibPlotCombine {
 public:
   TChain *fChain;  //!pointer to the analyzed TTree or TChain
   Int_t fCurrent;  //!current Tree number in a TChain
 
   // Declaration of leaf types
   Int_t t_Run;
   Int_t t_Event;
   Int_t t_DataType;
   Int_t t_ieta;
   Int_t t_iphi;
   Double_t t_EventWeight;
   Int_t t_nVtx;
   Int_t t_nTrk;
   Int_t t_goodPV;
   Double_t t_l1pt;
   Double_t t_l1eta;
   Double_t t_l1phi;
   Double_t t_l3pt;
   Double_t t_l3eta;
   Double_t t_l3phi;
   Double_t t_p;
   Double_t t_pt;
   Double_t t_phi;
   Double_t t_mindR1;
   Double_t t_mindR2;
   Double_t t_eMipDR;
   Double_t t_eHcal;
   Double_t t_eHcal10;
   Double_t t_eHcal30;
   Double_t t_hmaxNearP;
   Double_t t_rhoh;
   Bool_t t_selectTk;
   Bool_t t_qltyFlag;
   Bool_t t_qltyMissFlag;
   Bool_t t_qltyPVFlag;
   Double_t t_gentrackP;
   std::vector<unsigned int> *t_DetIds;
   std::vector<double> *t_HitEnergies;
   std::vector<bool> *t_trgbits;
   std::vector<unsigned int> *t_DetIds1;
   std::vector<unsigned int> *t_DetIds3;
   std::vector<double> *t_HitEnergies1;
   std::vector<double> *t_HitEnergies3;
 
   // List of branches
   TBranch *b_t_Run;           //!
   TBranch *b_t_Event;         //!
   TBranch *b_t_DataType;      //!
   TBranch *b_t_ieta;          //!
   TBranch *b_t_iphi;          //!
   TBranch *b_t_EventWeight;   //!
   TBranch *b_t_nVtx;          //!
   TBranch *b_t_nTrk;          //!
   TBranch *b_t_goodPV;        //!
   TBranch *b_t_l1pt;          //!
   TBranch *b_t_l1eta;         //!
   TBranch *b_t_l1phi;         //!
   TBranch *b_t_l3pt;          //!
   TBranch *b_t_l3eta;         //!
   TBranch *b_t_l3phi;         //!
   TBranch *b_t_p;             //!
   TBranch *b_t_pt;            //!
   TBranch *b_t_phi;           //!
   TBranch *b_t_mindR1;        //!
   TBranch *b_t_mindR2;        //!
   TBranch *b_t_eMipDR;        //!
   TBranch *b_t_eHcal;         //!
   TBranch *b_t_eHcal10;       //!
   TBranch *b_t_eHcal30;       //!
   TBranch *b_t_hmaxNearP;     //!
   TBranch *b_t_rhoh;          //!
   TBranch *b_t_selectTk;      //!
   TBranch *b_t_qltyFlag;      //!
   TBranch *b_t_qltyMissFlag;  //!
   TBranch *b_t_qltyPVFlag;    //!
   TBranch *b_t_gentrackP;     //!
   TBranch *b_t_DetIds;        //!
   TBranch *b_t_HitEnergies;   //!
   TBranch *b_t_trgbits;       //!
   TBranch *b_t_DetIds1;       //!
   TBranch *b_t_DetIds3;       //!
   TBranch *b_t_HitEnergies1;  //!
   TBranch *b_t_HitEnergies3;  //!
 
   CalibPlotCombine(const char *fname,
                    const char *corrFileName,
                    const std::string dirname = "HcalIsoTrkAnalyzer",
                    int flag = 10);
   virtual ~CalibPlotCombine();
   virtual Int_t Cut(Long64_t entry);
   virtual Int_t GetEntry(Long64_t entry);
   virtual Long64_t LoadTree(Long64_t entry);
   virtual void Init(TChain *);
   virtual void Loop();
   virtual Bool_t Notify();
   virtual void Show(Long64_t entry = -1);
   bool goodTrack(double eHcal, double cut);
   void savePlot(const std::string &theName, bool append = false);
 
 private:
   CalibCorr *cFactor_;
   int flag_, ifDepth_;
   bool selectP_, tightSelect_;
   TH1D *hist0_, *hist1_, *hist2_;
   TProfile *prof_;
 };
 
 CalibPlotCombine::CalibPlotCombine(const char *fname, const char *corrFileName, const std::string dirnm, int flag)
     : cFactor_(nullptr), flag_(flag), ifDepth_(3) {
   selectP_ = (((flag_ / 10) % 10) > 0);
   tightSelect_ = ((flag_ % 10) > 0);
   flag_ = 0;
   if (selectP_)
     flag_ += 10;
   if (tightSelect_)
     ++flag_;
   std::cout << "Selection on momentum range: " << selectP_ << std::endl
             << "Tight isolation flag:        " << tightSelect_ << std::endl
             << "Flag:                        " << flag_ << std::endl;
   char treeName[400];
   sprintf(treeName, "%s/CalibTree", dirnm.c_str());
   TChain *chain = new TChain(treeName);
   std::cout << "Create a chain for " << treeName << " from " << fname << std::endl;
   if (!fillChain(chain, fname)) {
     std::cout << "*****No valid tree chain can be obtained*****" << std::endl;
   } else {
     std::cout << "Proceed with a tree chain with " << chain->GetEntries() << " entries" << std::endl;
     Init(chain);
   }
   cFactor_ = new CalibCorr(corrFileName, ifDepth_, false);
 }
 
 CalibPlotCombine::~CalibPlotCombine() {
   delete cFactor_;
   if (!fChain)
     return;
   delete fChain->GetCurrentFile();
 }
 
 Int_t CalibPlotCombine::GetEntry(Long64_t entry) {
   // Read contents of entry.
   if (!fChain)
     return 0;
   return fChain->GetEntry(entry);
 }
 
 Long64_t CalibPlotCombine::LoadTree(Long64_t entry) {
   // Set the environment to read one entry
   if (!fChain)
     return -5;
   Long64_t centry = fChain->LoadTree(entry);
   if (centry < 0)
     return centry;
   if (!fChain->InheritsFrom(TChain::Class()))
     return centry;
   TChain *chain = (TChain *)fChain;
   if (chain->GetTreeNumber() != fCurrent) {
     fCurrent = chain->GetTreeNumber();
     Notify();
   }
   return centry;
 }
 
 void CalibPlotCombine::Init(TChain *tree) {
   // The Init() function is called when the selector needs to initialize
   // a new tree or chain. Typically here the branch addresses and branch
   // pointers of the tree will be set.
   // It is normally not necessary to make changes to the generated
   // code, but the routine can be extended by the user if needed.
   // Init() will be called many times when running on PROOF
   // (once per file to be processed).
 
   // Set object pointer
   t_DetIds = 0;
   t_DetIds1 = 0;
   t_DetIds3 = 0;
   t_HitEnergies = 0;
   t_HitEnergies1 = 0;
   t_HitEnergies3 = 0;
   t_trgbits = 0;
   // Set branch addresses and branch pointers
   fChain = tree;
   fCurrent = -1;
   if (!tree)
     return;
   fChain->SetMakeClass(1);
 
   fChain->SetBranchAddress("t_Run", &t_Run, &b_t_Run);
   fChain->SetBranchAddress("t_Event", &t_Event, &b_t_Event);
   fChain->SetBranchAddress("t_DataType", &t_DataType, &b_t_DataType);
   fChain->SetBranchAddress("t_ieta", &t_ieta, &b_t_ieta);
   fChain->SetBranchAddress("t_iphi", &t_iphi, &b_t_iphi);
   fChain->SetBranchAddress("t_EventWeight", &t_EventWeight, &b_t_EventWeight);
   fChain->SetBranchAddress("t_nVtx", &t_nVtx, &b_t_nVtx);
   fChain->SetBranchAddress("t_nTrk", &t_nTrk, &b_t_nTrk);
   fChain->SetBranchAddress("t_goodPV", &t_goodPV, &b_t_goodPV);
   fChain->SetBranchAddress("t_l1pt", &t_l1pt, &b_t_l1pt);
   fChain->SetBranchAddress("t_l1eta", &t_l1eta, &b_t_l1eta);
   fChain->SetBranchAddress("t_l1phi", &t_l1phi, &b_t_l1phi);
   fChain->SetBranchAddress("t_l3pt", &t_l3pt, &b_t_l3pt);
   fChain->SetBranchAddress("t_l3eta", &t_l3eta, &b_t_l3eta);
   fChain->SetBranchAddress("t_l3phi", &t_l3phi, &b_t_l3phi);
   fChain->SetBranchAddress("t_p", &t_p, &b_t_p);
   fChain->SetBranchAddress("t_pt", &t_pt, &b_t_pt);
   fChain->SetBranchAddress("t_phi", &t_phi, &b_t_phi);
   fChain->SetBranchAddress("t_mindR1", &t_mindR1, &b_t_mindR1);
   fChain->SetBranchAddress("t_mindR2", &t_mindR2, &b_t_mindR2);
   fChain->SetBranchAddress("t_eMipDR", &t_eMipDR, &b_t_eMipDR);
   fChain->SetBranchAddress("t_eHcal", &t_eHcal, &b_t_eHcal);
   fChain->SetBranchAddress("t_eHcal10", &t_eHcal10, &b_t_eHcal10);
   fChain->SetBranchAddress("t_eHcal30", &t_eHcal30, &b_t_eHcal30);
   fChain->SetBranchAddress("t_hmaxNearP", &t_hmaxNearP, &b_t_hmaxNearP);
   fChain->SetBranchAddress("t_rhoh", &t_rhoh, &b_t_rhoh);
   fChain->SetBranchAddress("t_selectTk", &t_selectTk, &b_t_selectTk);
   fChain->SetBranchAddress("t_qltyFlag", &t_qltyFlag, &b_t_qltyFlag);
   fChain->SetBranchAddress("t_qltyMissFlag", &t_qltyMissFlag, &b_t_qltyMissFlag);
   fChain->SetBranchAddress("t_qltyPVFlag", &t_qltyPVFlag, &b_t_qltyPVFlag);
   fChain->SetBranchAddress("t_gentrackP", &t_gentrackP, &b_t_gentrackP);
   fChain->SetBranchAddress("t_DetIds", &t_DetIds, &b_t_DetIds);
   fChain->SetBranchAddress("t_HitEnergies", &t_HitEnergies, &b_t_HitEnergies);
   fChain->SetBranchAddress("t_trgbits", &t_trgbits, &b_t_trgbits);
   fChain->SetBranchAddress("t_DetIds1", &t_DetIds1, &b_t_DetIds1);
   fChain->SetBranchAddress("t_DetIds3", &t_DetIds3, &b_t_DetIds3);
   fChain->SetBranchAddress("t_HitEnergies1", &t_HitEnergies1, &b_t_HitEnergies1);
   fChain->SetBranchAddress("t_HitEnergies3", &t_HitEnergies3, &b_t_HitEnergies3);
   Notify();
 
   // Book the histograms
   char name[20], title[100];
   std::string mom[2] = {"all momentum", "p = 40:60 GeV"};
   std::string iso[2] = {"loose", "tight"};
   std::string rng[3] = {"All", "Barrel", "Endcap"};
   int flag1 = (flag_ / 10) % 10;
   int flag2 = (flag_ % 10);
   sprintf(name, "W0%d%d", flag1, flag2);
   sprintf(title,
           "Correction Factor (%s) for tracks with %s and %s isolation",
           rng[0].c_str(),
           mom[flag1].c_str(),
           iso[flag2].c_str());
   hist0_ = new TH1D(name, title, 100, 0.0, 10.0);
   sprintf(name, "W1%d%d", flag1, flag2);
   sprintf(title,
           "Correction Factor (%s) for tracks with %s and %s isolation",
           rng[1].c_str(),
           mom[flag1].c_str(),
           iso[flag2].c_str());
   hist1_ = new TH1D(name, title, 100, 0.0, 10.0);
   sprintf(name, "W2%d%d", flag1, flag2);
   sprintf(title,
           "Correction Factor (%s) for tracks with %s and %s isolation",
           rng[2].c_str(),
           mom[flag1].c_str(),
           iso[flag2].c_str());
   hist2_ = new TH1D(name, title, 100, 0.0, 10.0);
   sprintf(name, "P%d%d", flag1, flag2);
   sprintf(
       title, "Correction Factor vs i#eta for tracks with %s and %s isolation", mom[flag1].c_str(), iso[flag2].c_str());
   prof_ = new TProfile(name, title, 60, -30, 30, 0, 100, "");
 }
 
 Bool_t CalibPlotCombine::Notify() {
   // The Notify() function is called when a new file is opened. This
   // can be either for a new TTree in a TChain or when when a new TTree
   // is started when using PROOF. It is normally not necessary to make changes
   // to the generated code, but the routine can be extended by the
   // user if needed. The return value is currently not used.
 
   return kTRUE;
 }
 
 void CalibPlotCombine::Show(Long64_t entry) {
   // Print contents of entry.
   // If entry is not specified, print current entry
   if (!fChain)
     return;
   fChain->Show(entry);
 }
 
 Int_t CalibPlotCombine::Cut(Long64_t) {
   // This function may be called from Loop.
   // returns  1 if entry is accepted.
   // returns -1 otherwise.
   return 1;
 }
 
 void CalibPlotCombine::Loop() {
   //   In a ROOT session, you can do:
   //      Root > .L CalibPlotCombine.C
   //      Root > CalibPlotCombine t
   //      Root > t.GetEntry(12); // Fill t data members with entry number 12
   //      Root > t.Show();       // Show values of entry 12
   //      Root > t.Show(16);     // Read and show values of entry 16
   //      Root > t.Loop();       // Loop on all entries
   //
 
   //   This is the loop skeleton where:
   //      jentry is the global entry number in the chain
   //      ientry is the entry number in the current Tree
   //   Note that the argument to GetEntry must be:
   //      jentry for TChain::GetEntry
   //      ientry for TTree::GetEntry and TBranch::GetEntry
   //
   //       To read only selected branches, Insert statements like:
   // METHOD1:
   //    fChain->SetBranchStatus("*",0);  // disable all branches
   //    fChain->SetBranchStatus("branchname",1);  // activate branchname
   // METHOD2: replace line
   //    fChain->GetEntry(jentry);       //read all branches
   //by  b_branchname->GetEntry(ientry); //read only this branch
 
   if (fChain == 0)
     return;
   Long64_t nentries = fChain->GetEntriesFast();
   std::cout << "Total entries " << nentries << std::endl;
   Long64_t nbytes(0), nb(0);
   double wminb(99999999), wmaxb(0), wmine(99999999), wmaxe(0);
   for (Long64_t jentry = 0; jentry < nentries; jentry++) {
     Long64_t ientry = LoadTree(jentry);
     if (ientry < 0)
       break;
     nb = fChain->GetEntry(jentry);
     nbytes += nb;
     if (jentry % 1000000 == 0)
       std::cout << "Entry " << jentry << " Run " << t_Run << " Event " << t_Event << std::endl;
     double cut = (t_p > 20) ? (tightSelect_ ? 2.0 : 10.0) : 0.0;
     double eHcal(t_eHcal);
     if (goodTrack(eHcal, cut)) {
       if ((!selectP_) || ((t_p > 40.0) && (t_p < 60.0))) {
         int ieta = fabs(t_ieta);
         double wt = cFactor_->getTrueCorr(ientry);
         hist0_->Fill(wt);
         if (ieta >= 16) {
           hist2_->Fill(wt);
           wmaxe = std::max(wmaxe, wt);
           wmine = std::min(wmine, wt);
         } else {
           hist1_->Fill(wt);
           wmaxb = std::max(wmaxb, wt);
           wminb = std::min(wminb, wt);
         }
         prof_->Fill(t_ieta, wt);
       }
     }
   }
   std::cout << "Minimum and maximum correction factors " << wminb << ":" << wmaxb << " (Barrel) " << wmine << ":"
             << wmaxe << " (Endcap)" << std::endl;
 }
 
 bool CalibPlotCombine::goodTrack(double eHcal, double cut) {
   return ((t_qltyFlag) && t_selectTk && (t_hmaxNearP < cut) && (t_eMipDR < 1.0) && (eHcal > 0.001));
 }
 
 void CalibPlotCombine::savePlot(const std::string &theName, bool append) {
   TFile *theFile = (append ? (new TFile(theName.c_str(), "UPDATE")) : (new TFile(theName.c_str(), "RECREATE")));
   theFile->cd();
   TH1D *hist;
   hist = (TH1D *)(hist0_->Clone());
   hist->Write();
   hist = (TH1D *)(hist1_->Clone());
   hist->Write();
   hist = (TH1D *)(hist2_->Clone());
   hist->Write();
   TProfile *prof = (TProfile *)(prof_->Clone());
   prof->Write();
   std::cout << "All done" << std::endl;
   theFile->Close();
 }
 
 class CalibFitPU {
 private:
   TTree *fChain;   //!pointer to the analyzed TTree or TChain
   Int_t fCurrent;  //!current Tree number in a TChain
 
   // Fixed size dimensions of array or collections stored in the TTree if any.
 
   // Declaration of leaf types
   Int_t t_Event;
   Double_t t_p_PU;
   Double_t t_eHcal_PU;
   Double_t t_delta_PU;
   Double_t t_p_NoPU;
   Double_t t_eHcal_noPU;
   Double_t t_delta_NoPU;
   Int_t t_ieta;
 
   // List of branches
   TBranch *b_t_Event;
   TBranch *b_t_p_PU;
   TBranch *b_t_eHcal_PU;
   TBranch *b_t_delta_PU;
   TBranch *b_t_p_NoPU;
   TBranch *b_t_eHcal_noPU;
   TBranch *b_t_delta_NoPU;
   TBranch *b_t_ieta;
 
 public:
   CalibFitPU(const char *fname = "isotrackRelval.root");
   virtual ~CalibFitPU();
   virtual Int_t Cut(Long64_t entry);
   virtual Int_t GetEntry(Long64_t entry);
   virtual Long64_t LoadTree(Long64_t entry);
   virtual void Init(TTree *tree);
   virtual void Loop(bool extract_PU_parameters, std::string fileName, int dumpmax = 0);
   virtual Bool_t Notify();
   virtual void Show(Long64_t entry = -1);
 };
 
 CalibFitPU::CalibFitPU(const char *fname) : fChain(0) {
   // if parameter tree is not specified (or zero), connect the file
   // used to generate this class and read the Tree.
   TFile *f = new TFile(fname);
   TTree *tree = new TTree();
   f->GetObject("tree", tree);
   std::cout << "Find tree Tree in " << tree << " from " << fname << std::endl;
   Init(tree);
 }
 
 CalibFitPU::~CalibFitPU() {
   if (!fChain)
     return;
   delete fChain->GetCurrentFile();
 }
 
 Int_t CalibFitPU::GetEntry(Long64_t entry) {
   // Read contents of entry.
   if (!fChain)
     return 0;
   return fChain->GetEntry(entry);
 }
 
 Long64_t CalibFitPU::LoadTree(Long64_t entry) {
   // Set the environment to read one entry
   if (!fChain)
     return -5;
   Long64_t centry = fChain->LoadTree(entry);
   if (centry < 0)
     return centry;
   if (fChain->GetTreeNumber() != fCurrent) {
     fCurrent = fChain->GetTreeNumber();
     Notify();
   }
   return centry;
 }
 
 void CalibFitPU::Init(TTree *tree) {
   // The Init() function is called when the selector needs to initialize
   // a new tree or chain. Typically here the branch addresses and branch
   // pointers of the tree will be set.
   // It is normally not necessary to make changes to the generated
   // code, but the routine can be extended by the user if needed.
   // Init() will be called many times when running on PROOF
   // (once per file to be processed).
 
   // Set branch addresses and branch pointers
   if (!tree)
     return;
   fChain = tree;
   fCurrent = -1;
   fChain->SetMakeClass(1);
 
   fChain->SetBranchAddress("t_Event", &t_Event, &b_t_Event);
   fChain->SetBranchAddress("t_p_PU", &t_p_PU, &b_t_p_PU);
   fChain->SetBranchAddress("t_eHcal_PU", &t_eHcal_PU, &b_t_eHcal_PU);
   fChain->SetBranchAddress("t_delta_PU", &t_delta_PU, &b_t_delta_PU);
   fChain->SetBranchAddress("t_p_NoPU", &t_p_NoPU, &b_t_p_NoPU);
   fChain->SetBranchAddress("t_eHcal_noPU", &t_eHcal_noPU, &b_t_eHcal_noPU);
   fChain->SetBranchAddress("t_delta_NoPU", &t_delta_NoPU, &b_t_delta_NoPU);
   fChain->SetBranchAddress("t_ieta", &t_ieta, &b_t_ieta);
   Notify();
 }
 
 Bool_t CalibFitPU::Notify() {
   // The Notify() function is called when a new file is opened. This
   // can be either for a new TTree in a TChain or when when a new TTree
   // is started when using PROOF. It is normally not necessary to make changes
   // to the generated code, but the routine can be extended by the
   // user if needed. The return value is currently not used.
 
   return kTRUE;
 }
 
 void CalibFitPU::Show(Long64_t entry) {
   // Print contents of entry.
   // If entry is not specified, print current entry
   if (!fChain)
     return;
   fChain->Show(entry);
 }
 
 Int_t CalibFitPU::Cut(Long64_t) {
   // This function may be called from Loop.
   // returns  1 if entry is accepted.
   // returns -1 otherwise.
   return 1;
 }
 
 void CalibFitPU::Loop(bool extract_PU_parameters, std::string fileName, int dumpmax) {
   //   In a ROOT session, you can do:
   //      root> .L CalibFitPU.C
   //      root> CalibFitPU t
   //      root> t.GetEntry(12); // Fill t data members with entry number 12
   //      root> t.Show();       // Show values of entry 12
   //      root> t.Show(16);     // Read and show values of entry 16
   //      root> t.Loop();       // Loop on all entries
   //
 
   //     This is the loop skeleton where:
   //    jentry is the global entry number in the chain
   //    ientry is the entry number in the current Tree
   //  Note that the argument to GetEntry must be:
   //    jentry for TChain::GetEntry
   //    ientry for TTree::GetEntry and TBranch::GetEntry
   //
   //       To read only selected branches, Insert statements like:
   // METHOD1:
   //    fChain->SetBranchStatus("*",0);  // disable all branches
   //    fChain->SetBranchStatus("branchname",1);  // activate branchname
   // METHOD2: replace line
   //    fChain->GetEntry(jentry);       //read all branches
   //by  b_branchname->GetEntry(ientry); //read only this branch
   if (fChain == 0)
     return;
 
   Long64_t nentries = fChain->GetEntriesFast();
   Long64_t nbytes = 0, nb = 0;
 
   char filename[100];
 
   gStyle->SetCanvasBorderMode(0);
   gStyle->SetCanvasColor(kWhite);
   gStyle->SetPadColor(kWhite);
   gStyle->SetFillColor(kWhite);
 
   const int n = 7;
   int ieta_grid[n] = {7, 16, 25, 26, 27, 28, 29};
   double a00[n], a10[n], a20[n], a01[n], a11[n], a21[n], a02[n], a12[n], a22[n];
   const int nbin1 = 15;
   double bins1[nbin1 + 1] = {0.0, 0.1, 0.2, 0.3, 0.4, 0.6, 0.8, 1.0, 1.5, 2.0, 2.5, 3.0, 3.5, 4.0, 6.0, 9.0};
   const int nbin2 = 7;
   double bins2[nbin1 + 1] = {1.0, 1.5, 2.0, 2.5, 3.0, 3.5, 4.0, 5.0};
   int nbins[n] = {4, 5, 12, nbin2, nbin2, nbin2, nbin2};
   char name[20], title[100];
 
   std::vector<TH2D *> vec_h2;
   std::vector<TGraph *> vec_gr;
   std::vector<TProfile *> vec_hp;
 
   if (extract_PU_parameters) {
     for (int k = 0; k < n; k++) {
       sprintf(name, "h2_ieta%d", k);
       int ieta1 = (k == 0) ? 1 : ieta_grid[k - 1];
       sprintf(title, "PU Energy vs #Delta/p (i#eta = %d:%d)", ieta1, (ieta_grid[k] - 1));
       vec_h2.push_back(new TH2D(name, title, 100, 0, 10, 100, 0, 2));
       vec_gr.push_back(new TGraph());
       sprintf(name, "hp_ieta%d", k);
       if (k < 3)
         vec_hp.push_back(new TProfile(name, title, nbins[k], bins1));
       else
         vec_hp.push_back(new TProfile(name, title, nbins[k], bins2));
     }
 
     int points[7] = {0, 0, 0, 0, 0, 0, 0};
     //=======================================Starting of event Loop=======================================================
     std::cout << "Get " << nentries << " events from file\n";
 
     for (Long64_t jentry = 0; jentry < nentries; jentry++) {
       Long64_t ientry = LoadTree(jentry);
       if (ientry < 0)
         break;
       nb = fChain->GetEntry(jentry);
       nbytes += nb;
 
       double deltaOvP = t_delta_PU / t_p_PU;
       double diffEpuEnopuOvP = t_eHcal_noPU / t_eHcal_PU;
       if (jentry < dumpmax)
         std::cout << "Entry " << jentry << " ieta " << t_ieta << " p " << t_delta_PU << ":" << t_p_PU << ":" << deltaOvP
                   << " ehcal " << t_eHcal_noPU << ":" << t_eHcal_PU << ":" << diffEpuEnopuOvP << std::endl;
       for (int k = 0; k < n; k++) {
         if (std::abs(t_ieta) < ieta_grid[k]) {
           points[k]++;
           vec_h2[k]->Fill(deltaOvP, diffEpuEnopuOvP);
           vec_gr[k]->SetPoint(points[k], deltaOvP, diffEpuEnopuOvP);
           vec_hp[k]->Fill(deltaOvP, diffEpuEnopuOvP);
           break;
         }
       }
 
     }  //End of Event Loop to extract PU correction parameters
 
     for (int k = 0; k < n; k++)
       std::cout << "Bin " << k << " for 2D Hist " << vec_h2[k] << ":" << vec_h2[k]->GetEntries() << " Graph "
                 << vec_gr[k] << ":" << points[k] << " Profile " << vec_hp[k] << ":" << vec_hp[k]->GetEntries()
                 << std::endl;
 
     std::ofstream myfile0, myfile1, myfile2;
     sprintf(filename, "%s_par2d.txt", fileName.c_str());
     myfile0.open(filename);
     sprintf(filename, "%s_parProf.txt", fileName.c_str());
     myfile1.open(filename);
     sprintf(filename, "%s_parGraph.txt", fileName.c_str());
     myfile2.open(filename);
 
     char namepng[20];
     for (int k = 0; k < n; k++) {
       gStyle->SetOptStat(1100);
       gStyle->SetOptFit(1);
 
       TF1 *f1 = ((k < 2) ? (new TF1("f1", "[0]+[1]*x", 0, 5)) : (new TF1("f1", "[0]+[1]*x+[2]*x*x", 0, 5)));
       sprintf(name, "c_ieta%d2D", k);
       TCanvas *pad1 = new TCanvas(name, name, 500, 500);
       pad1->SetLeftMargin(0.10);
       pad1->SetRightMargin(0.10);
       pad1->SetTopMargin(0.10);
       vec_h2[k]->GetXaxis()->SetLabelSize(0.035);
       vec_h2[k]->GetYaxis()->SetLabelSize(0.035);
       vec_h2[k]->GetXaxis()->SetTitle("#Delta/p");
       vec_h2[k]->GetYaxis()->SetTitle("E_{NoPU} / E_{PU}");
       vec_h2[k]->Draw();
       vec_h2[k]->Fit(f1);
 
       a00[k] = f1->GetParameter(0);
       a10[k] = f1->GetParameter(1);
       a20[k] = (k < 2) ? 0 : f1->GetParameter(2);
       myfile0 << k << "\t" << a00[k] << "\t" << a10[k] << "\t" << a20[k] << "\n";
       pad1->Update();
       TPaveStats *st1 = (TPaveStats *)vec_h2[k]->GetListOfFunctions()->FindObject("stats");
       if (st1 != nullptr) {
         st1->SetY1NDC(0.70);
         st1->SetY2NDC(0.90);
         st1->SetX1NDC(0.65);
         st1->SetX2NDC(0.90);
       }
       pad1->Update();
       sprintf(namepng, "%s.png", pad1->GetName());
       pad1->Print(namepng);
 
       TF1 *f2 = ((k < 2) ? (new TF1("f2", "[0]+[1]*x", 0, 5)) : (new TF1("f2", "[0]+[1]*x+[2]*x*x", 0, 5)));
       sprintf(name, "c_ieta%dPr", k);
       TCanvas *pad2 = new TCanvas(name, name, 500, 500);
       pad2->SetLeftMargin(0.10);
       pad2->SetRightMargin(0.10);
       pad2->SetTopMargin(0.10);
       vec_hp[k]->GetXaxis()->SetLabelSize(0.035);
       vec_hp[k]->GetYaxis()->SetLabelSize(0.035);
       vec_hp[k]->GetXaxis()->SetTitle("#Delta/p");
       vec_hp[k]->GetYaxis()->SetTitle("E_{NoPU} / E_{PU}");
       vec_hp[k]->Draw();
       vec_hp[k]->Fit(f2);
 
       a01[k] = f2->GetParameter(0);
       a11[k] = f2->GetParameter(1);
       a21[k] = (k < 2) ? 0 : f2->GetParameter(2);
       myfile1 << k << "\t" << a01[k] << "\t" << a11[k] << "\t" << a21[k] << "\n";
       pad2->Update();
       TPaveStats *st2 = (TPaveStats *)vec_hp[k]->GetListOfFunctions()->FindObject("stats");
       if (st2 != nullptr) {
         st2->SetY1NDC(0.70);
         st2->SetY2NDC(0.90);
         st2->SetX1NDC(0.65);
         st2->SetX2NDC(0.90);
       }
       pad2->Update();
       sprintf(namepng, "%s.png", pad2->GetName());
       pad2->Print(namepng);
 
       TF1 *f3 = ((k < 2) ? (new TF1("f3", "[0]+[1]*x", 0, 5)) : (new TF1("f3", "[0]+[1]*x+[2]*x*x", 0, 5)));
       sprintf(name, "c_ieta%dGr", k);
       TCanvas *pad3 = new TCanvas(name, name, 500, 500);
       pad3->SetLeftMargin(0.10);
       pad3->SetRightMargin(0.10);
       pad3->SetTopMargin(0.10);
       gStyle->SetOptFit(1111);
       vec_gr[k]->GetXaxis()->SetLabelSize(0.035);
       vec_gr[k]->GetYaxis()->SetLabelSize(0.035);
       vec_gr[k]->GetXaxis()->SetTitle("#Delta/p");
       vec_gr[k]->GetYaxis()->SetTitle("E_{PU} - E_{NoPU}/p");
       vec_gr[k]->Fit(f3, "R");
       vec_gr[k]->Draw("Ap");
       f3->Draw("same");
 
       a02[k] = f3->GetParameter(0);
       a12[k] = f3->GetParameter(1);
       a22[k] = (k < 2) ? 0 : f3->GetParameter(2);
       myfile2 << k << "\t" << a02[k] << "\t" << a12[k] << "\t" << a22[k] << "\n";
       pad3->Update();
       TPaveStats *st3 = (TPaveStats *)vec_gr[k]->GetListOfFunctions()->FindObject("stats");
       if (st3 != nullptr) {
         st3->SetY1NDC(0.70);
         st3->SetY2NDC(0.90);
         st3->SetX1NDC(0.65);
         st3->SetX2NDC(0.90);
       }
       pad3->Update();
       pad3->Modified();
       sprintf(namepng, "%s.png", pad3->GetName());
       pad3->Print(namepng);
     }
   } else {
     std::string line;
     double number;
     sprintf(filename, "%s_par2d.txt", fileName.c_str());
     std::ifstream myfile0(filename);
     if (myfile0.is_open()) {
       int iii = 0;
       while (getline(myfile0, line)) {
         std::istringstream iss2(line);
         int ii = 0;
         while (iss2 >> number) {
           if (ii == 0)
             a00[iii] = number;
           else if (ii == 1)
             a10[iii] = number;
           else if (ii == 2)
             a20[iii] = number;
           ++ii;
         }
         ++iii;
       }
     }
     sprintf(filename, "%s_parProf.txt", fileName.c_str());
     std::ifstream myfile1(filename);
     if (myfile1.is_open()) {
       int iii = 0;
       while (getline(myfile1, line)) {
         std::istringstream iss2(line);
         int ii = 0;
         while (iss2 >> number) {
           if (ii == 0)
             a01[iii] = number;
           else if (ii == 1)
             a11[iii] = number;
           else if (ii == 2)
             a21[iii] = number;
           ++ii;
         }
         ++iii;
       }
     }
     sprintf(filename, "%s_parGraph.txt", fileName.c_str());
     std::ifstream myfile2(filename);
     if (myfile2.is_open()) {
       int iii = 0;
       while (getline(myfile2, line)) {
         std::istringstream iss2(line);
         int ii = 0;
         while (iss2 >> number) {
           if (ii == 0)
             a02[iii] = number;
           else if (ii == 1)
             a12[iii] = number;
           else if (ii == 2)
             a22[iii] = number;
           ++ii;
         }
         ++iii;
       }
     }
   }
 
   std::cout << "\nParameter Values:\n";
   for (int i = 0; i < n; i++) {
     std::cout << "[" << i << "] (" << a00[i] << ", " << a10[i] << ", " << a20[i] << ")  (" << a01[i] << ", " << a11[i]
               << ", " << a21[i] << ")  (" << a02[i] << ", " << a12[i] << ", " << a22[i] << ")\n";
   }
   std::cout << "\n\n";
   std::vector<TH1F *> vec_EovP_UnCorr_PU, vec_EovP_UnCorr_NoPU;
   std::vector<TH1F *> vec_EovP_Corr0_PU, vec_EovP_Corr0_NoPU;
   std::vector<TH1F *> vec_EovP_Corr1_PU, vec_EovP_Corr1_NoPU;
   std::vector<TH1F *> vec_EovP_Corr2_PU, vec_EovP_Corr2_NoPU;
   TH1F *h_current;
 
   for (int k = 0; k < (2 * 28 + 1); k++) {
     if (k != 28) {
       sprintf(name, "EovP_ieta%dUnPU", k - 28);
       sprintf(title, "E/p (Uncorrected PU) for i#eta = %d", k - 28);
       h_current = new TH1F(name, title, 100, 0, 5);
       h_current->GetXaxis()->SetTitle(title);
       h_current->GetYaxis()->SetTitle("Tracks");
       vec_EovP_UnCorr_PU.push_back(h_current);
       sprintf(name, "EovP_ieta%dUnNoPU", k - 28);
       sprintf(title, "E/p (Uncorrected No PU) for i#eta = %d", k - 28);
       h_current = new TH1F(name, title, 100, 0, 5);
       h_current->GetXaxis()->SetTitle(title);
       h_current->GetYaxis()->SetTitle("Tracks");
       vec_EovP_UnCorr_NoPU.push_back(h_current);
       sprintf(name, "EovP_ieta%dCor0NoPU", k - 28);
       sprintf(title, "E/p (Corrected using 2D No PU) for i#eta = %d", k - 28);
       h_current = new TH1F(name, title, 100, 0, 5);
       h_current->GetXaxis()->SetTitle(title);
       h_current->GetYaxis()->SetTitle("Tracks");
       vec_EovP_Corr0_NoPU.push_back(h_current);
       sprintf(name, "EovP_ieta%dCor0PU", k - 28);
       sprintf(title, "E/p (Corrected using 2D PU) for i#eta = %d", k - 28);
       h_current = new TH1F(name, title, 100, 0, 5);
       h_current->GetXaxis()->SetTitle(title);
       h_current->GetYaxis()->SetTitle("Tracks");
       vec_EovP_Corr0_PU.push_back(h_current);
       sprintf(name, "EovP_ieta%dCor1NoPU", k - 28);
       sprintf(title, "E/p (Corrected using profile No PU) for i#eta = %d", k - 28);
       h_current = new TH1F(name, title, 100, 0, 5);
       h_current->GetXaxis()->SetTitle(title);
       h_current->GetYaxis()->SetTitle("Tracks");
       vec_EovP_Corr1_NoPU.push_back(h_current);
       sprintf(name, "EovP_ieta%dCor1PU", k - 28);
       sprintf(title, "E/p (Corrected using profile PU) for i#eta = %d", k - 28);
       h_current = new TH1F(name, title, 100, 0, 5);
       h_current->GetXaxis()->SetTitle(title);
       h_current->GetYaxis()->SetTitle("Tracks");
       vec_EovP_Corr1_PU.push_back(h_current);
       sprintf(name, "EovP_ieta%dCor2NoPU", k - 28);
       sprintf(title, "E/p (Corrected using graph No PU) for i#eta = %d", k - 28);
       h_current = new TH1F(name, title, 100, 0, 5);
       h_current->GetXaxis()->SetTitle(title);
       h_current->GetYaxis()->SetTitle("Tracks");
       vec_EovP_Corr2_NoPU.push_back(h_current);
       sprintf(name, "EovP_ieta%dCor2PU", k - 28);
       sprintf(title, "E/p (Corrected using graph PU) for i#eta = %d", k - 28);
       h_current = new TH1F(name, title, 100, 0, 5);
       h_current->GetXaxis()->SetTitle(title);
       h_current->GetYaxis()->SetTitle("Tracks");
       vec_EovP_Corr2_PU.push_back(h_current);
     }
   }
   std::cout << "Book " << (8 * vec_EovP_UnCorr_PU.size()) << " histograms\n";
 
   //==============================================================================================================================================
 
   nbytes = nb = 0;
   std::cout << nentries << " entries in the root file" << std::endl;
   for (Long64_t jentry = 0; jentry < nentries; jentry++) {
     Long64_t ientry = LoadTree(jentry);
     if (ientry < 0)
       break;
     nb = fChain->GetEntry(jentry);
     nbytes += nb;
 
     int i1 = n;
     for (int k = 0; k < n; k++) {
       if (std::abs(t_ieta) < ieta_grid[k]) {
         i1 = k;
         break;
       }
     }
     if ((t_ieta == 0) || (i1 >= n))
       continue;
     int i2 = (t_ieta < 0) ? (t_ieta + 28) : (t_ieta + 27);
 
     double EpuOvP = t_eHcal_PU / t_p_PU;
     double EnopuOvP = t_eHcal_noPU / t_p_PU;
     double deltaOvP = t_delta_PU / t_p_PU;
     double deltaNopuOvP = t_delta_NoPU / t_p_PU;
 
     vec_EovP_UnCorr_PU[i2]->Fill(EpuOvP);
     vec_EovP_UnCorr_NoPU[i2]->Fill(EnopuOvP);
 
     double c0p =
         (((i1 < 3) || (deltaOvP > 1.0)) ? (a00[i1] + a10[i1] * deltaOvP + a20[i1] * deltaOvP * deltaOvP) : 1.0);
     double c1p =
         (((i1 < 3) || (deltaOvP > 1.0)) ? (a01[i1] + a11[i1] * deltaOvP + a21[i1] * deltaOvP * deltaOvP) : 1.0);
     double c2p =
         (((i1 < 3) || (deltaOvP > 1.0)) ? (a02[i1] + a12[i1] * deltaOvP + a22[i1] * deltaOvP * deltaOvP) : 1.0);
     double c0np =
         (((i1 < 3) || (deltaNopuOvP > 1.0)) ? (a00[i1] + a10[i1] * deltaNopuOvP + a12[i1] * deltaNopuOvP * deltaNopuOvP)
                                             : 1.0);
     double c1np =
         (((i1 < 3) || (deltaNopuOvP > 1.0)) ? (a01[i1] + a11[i1] * deltaNopuOvP + a21[i1] * deltaNopuOvP * deltaNopuOvP)
                                             : 1.0);
     double c2np =
         (((i1 < 3) || (deltaNopuOvP > 1.0)) ? (a02[i1] + a12[i1] * deltaNopuOvP + a22[i1] * deltaNopuOvP * deltaNopuOvP)
                                             : 1.0);
 
     vec_EovP_Corr0_PU[i2]->Fill(EpuOvP * c0p);
     vec_EovP_Corr0_NoPU[i2]->Fill(EnopuOvP * c0np);
     vec_EovP_Corr1_PU[i2]->Fill(EpuOvP * c1p);
     vec_EovP_Corr1_NoPU[i2]->Fill(EnopuOvP * c1np);
     vec_EovP_Corr2_PU[i2]->Fill(EpuOvP * c2p);
     vec_EovP_Corr2_NoPU[i2]->Fill(EnopuOvP * c2np);
   }
 
   sprintf(filename, "%s.root", fileName.c_str());
   TFile *f1 = new TFile(filename, "RECREATE");
   f1->cd();
   for (unsigned int k = 0; k < vec_EovP_UnCorr_PU.size(); k++) {
     vec_EovP_UnCorr_PU[k]->Write();
     vec_EovP_UnCorr_NoPU[k]->Write();
     vec_EovP_Corr0_PU[k]->Write();
     vec_EovP_Corr0_NoPU[k]->Write();
     vec_EovP_Corr1_PU[k]->Write();
     vec_EovP_Corr1_NoPU[k]->Write();
     vec_EovP_Corr2_PU[k]->Write();
     vec_EovP_Corr2_NoPU[k]->Write();
   }
   for (unsigned int k = 0; k < vec_hp.size(); ++k) {
     vec_h2[k]->Write();
     vec_hp[k]->Write();
     vec_gr[k]->Write();
   }
 }
 
 class CalibMerge {
 public:
   struct isotk {
     isotk(int pv = 0, double rho = 0, double pp = 0, double eH = 0, double eH10 = 0, double eH30 = 0, double del = 0)
         : goodPV(pv), rhoh(rho), p(pp), eHcal(eH), eHcal10(eH10), eHcal30(eH30), delta(del) {}
 
     int goodPV;
     double rhoh, p, eHcal, eHcal10, eHcal30, delta;
   };
 
   CalibMerge();
   ~CalibMerge();
   Int_t Cut(Long64_t entry);
   Int_t GetEntry(Long64_t entry);
   Long64_t LoadTree(Long64_t entry);
   Bool_t Notify();
   void Show(Long64_t entry = -1);
   void LoopNoPU(const char *fnameNoPU, std::string dirnm = "HcalIsoTrkAnalyzer");
   void LoopPU(const char *fnamePU, const char *fnameOut, std::string dirnm = "HcalIsoTrkAnalyzer");
   bool Init(const char *fname, const std::string &dirnm);
   void bookTree(const char *fname);
   void close();
 
 private:
   TChain *fChain;  //!pointer to the analyzed TTree or TChain
   Int_t fCurrent;  //!current Tree number in a TChain
 
   std::map<std::pair<int, int>, std::vector<isotk> > isotks_;
 
   // Declaration of leaf types
   Int_t t_Run;
   Int_t t_Event;
   Int_t t_DataType;
   Int_t t_ieta;
   Int_t t_iphi;
   Double_t t_EventWeight;
   Int_t t_nVtx;
   Int_t t_nTrk;
   Int_t t_goodPV;
   Double_t t_l1pt;
   Double_t t_l1eta;
   Double_t t_l1phi;
   Double_t t_l3pt;
   Double_t t_l3eta;
   Double_t t_l3phi;
   Double_t t_p;
   Double_t t_pt;
   Double_t t_phi;
   Double_t t_mindR1;
   Double_t t_mindR2;
   Double_t t_eMipDR;
   Double_t t_eHcal;
   Double_t t_eHcal10;
   Double_t t_eHcal30;
   Double_t t_hmaxNearP;
   Double_t t_rhoh;
   Bool_t t_selectTk;
   Bool_t t_qltyFlag;
   Bool_t t_qltyMissFlag;
   Bool_t t_qltyPVFlag;
   Double_t t_gentrackP;
   std::vector<unsigned int> *t_DetIds;
   std::vector<double> *t_HitEnergies;
   std::vector<bool> *t_trgbits;
   std::vector<unsigned int> *t_DetIds1;
   std::vector<unsigned int> *t_DetIds3;
   std::vector<double> *t_HitEnergies1;
   std::vector<double> *t_HitEnergies3;
 
   // List of branches
   TBranch *b_t_Run;           //!
   TBranch *b_t_Event;         //!
   TBranch *b_t_DataType;      //!
   TBranch *b_t_ieta;          //!
   TBranch *b_t_iphi;          //!
   TBranch *b_t_EventWeight;   //!
   TBranch *b_t_nVtx;          //!
   TBranch *b_t_nTrk;          //!
   TBranch *b_t_goodPV;        //!
   TBranch *b_t_l1pt;          //!
   TBranch *b_t_l1eta;         //!
   TBranch *b_t_l1phi;         //!
   TBranch *b_t_l3pt;          //!
   TBranch *b_t_l3eta;         //!
   TBranch *b_t_l3phi;         //!
   TBranch *b_t_p;             //!
   TBranch *b_t_pt;            //!
   TBranch *b_t_phi;           //!
   TBranch *b_t_mindR1;        //!
   TBranch *b_t_mindR2;        //!
   TBranch *b_t_eMipDR;        //!
   TBranch *b_t_eHcal;         //!
   TBranch *b_t_eHcal10;       //!
   TBranch *b_t_eHcal30;       //!
   TBranch *b_t_hmaxNearP;     //!
   TBranch *b_t_rhoh;          //!
   TBranch *b_t_selectTk;      //!
   TBranch *b_t_qltyFlag;      //!
   TBranch *b_t_qltyMissFlag;  //!
   TBranch *b_t_qltyPVFlag;    //!
   TBranch *b_t_gentrackP;     //!
   TBranch *b_t_DetIds;        //!
   TBranch *b_t_HitEnergies;   //!
   TBranch *b_t_trgbits;       //!
   TBranch *b_t_DetIds1;       //!
   TBranch *b_t_DetIds3;       //!
   TBranch *b_t_HitEnergies1;  //!
   TBranch *b_t_HitEnergies3;  //!
 
   TFile *outputFile_;
   TTree *outtree_;
   Int_t event_;
   Int_t ieta_;
   Int_t nvtx_;
   Double_t rhoh_;
   Double_t p_NoPU_;
   Double_t p_PU_;
   Double_t eHcal_NoPU_;
   Double_t eHcal_PU_;
   Double_t eHcal10_NoPU_;
   Double_t eHcal10_PU_;
   Double_t eHcal30_NoPU_;
   Double_t eHcal30_PU_;
   Double_t delta_NoPU_;
   Double_t delta_PU_;
 };
 
 CalibMerge::CalibMerge() : outputFile_(nullptr), outtree_(nullptr) {}
 
 CalibMerge::~CalibMerge() { close(); }
 
 Int_t CalibMerge::GetEntry(Long64_t entry) {
   // Read contents of entry.
   if (!fChain)
     return 0;
   return fChain->GetEntry(entry);
 }
 
 Long64_t CalibMerge::LoadTree(Long64_t entry) {
   // Set the environment to read one entry
   if (!fChain)
     return -5;
   Long64_t centry = fChain->LoadTree(entry);
   if (centry < 0)
     return centry;
   if (fChain->GetTreeNumber() != fCurrent) {
     fCurrent = fChain->GetTreeNumber();
     Notify();
   }
   return centry;
 }
 
 Bool_t CalibMerge::Notify() {
   // The Notify() function is called when a new file is opened. This
   // can be either for a new TTree in a TChain or when when a new TTree
   // is started when using PROOF. It is normally not necessary to make changes
   // to the generated code, but the routine can be extended by the
   // user if needed. The return value is currently not used.
 
   return kTRUE;
 }
 
 void CalibMerge::Show(Long64_t entry) {
   // Print contents of entry.
   // If entry is not specified, print current entry
   if (!fChain)
     return;
   fChain->Show(entry);
 }
 
 Int_t CalibMerge::Cut(Long64_t) {
   // This function may be called from Loop.
   // returns  1 if entry is accepted.
   // returns -1 otherwise.
   return 1;
 }
 
 void CalibMerge::LoopNoPU(const char *fname, std::string dirnm) {
   bool ok = Init(fname, dirnm);
   std::cout << "Opens no PU file " << fname << " with flag " << ok << std::endl;
   isotks_.clear();
   if (ok) {
     Long64_t nentries = fChain->GetEntriesFast();
     Long64_t nbytes = 0, nb = 0;
     for (Long64_t jentry = 0; jentry < nentries; jentry++) {
       Long64_t ientry = LoadTree(jentry);
       if (ientry < 0)
         break;
       nb = fChain->GetEntry(jentry);
       nbytes += nb;
       std::pair<int, int> key(t_Event, t_ieta);
       isotk tk(t_goodPV, t_rhoh, t_p, t_eHcal, t_eHcal10, t_eHcal30, (t_eHcal30 - t_eHcal10));
       std::map<std::pair<int, int>, std::vector<isotk> >::iterator itr = isotks_.find(key);
       if (itr == isotks_.end()) {
         std::vector<isotk> v;
         v.push_back(tk);
         isotks_[key] = v;
       } else {
         (itr->second).push_back(tk);
       }
     }
     std::cout << "Finds " << isotks_.size() << " tracks from " << nentries << " entries with " << nbytes << " bytes"
               << std::endl;
   }
 }
 
 void CalibMerge::LoopPU(const char *fname, const char *fout, std::string dirnm) {
   bool ok = Init(fname, dirnm);
   std::cout << "Opens PU file " << fname << " with flag " << ok << std::endl;
   if (ok && (isotks_.size() > 0)) {
     bookTree(fout);
     Long64_t nentries = fChain->GetEntriesFast();
     Long64_t nbytes(0), nb(0), merge(0);
     for (Long64_t jentry = 0; jentry < nentries; jentry++) {
       Long64_t ientry = LoadTree(jentry);
       if (ientry < 0)
         break;
       nb = fChain->GetEntry(jentry);
       nbytes += nb;
       std::pair<int, int> key(t_Event, t_ieta);
       std::map<std::pair<int, int>, std::vector<isotk> >::iterator itr = isotks_.find(key);
       if (itr != isotks_.end()) {
         for (unsigned int k = 0; (itr->second).size(); ++k) {
           if (std::abs(t_p - (itr->second)[k].p) < 0.01) {
             event_ = (itr->first).first;
             ieta_ = (itr->first).second;
             nvtx_ = (itr->second)[k].goodPV;
             rhoh_ = (itr->second)[k].rhoh;
             p_NoPU_ = (itr->second)[k].p;
             p_PU_ = t_p;
             eHcal_NoPU_ = (itr->second)[k].eHcal;
             eHcal_PU_ = t_eHcal;
             eHcal10_NoPU_ = (itr->second)[k].eHcal10;
             eHcal10_PU_ = t_eHcal10;
             eHcal30_NoPU_ = (itr->second)[k].eHcal30;
             eHcal30_PU_ = t_eHcal30;
             delta_NoPU_ = (itr->second)[k].delta;
             delta_PU_ = (t_eHcal30 - t_eHcal10);
             outtree_->Fill();
             ++merge;
             break;
           }
         }
       }
     }
     std::cout << "Use " << isotks_.size() << ":" << nentries << " from noPU|PU files to produce " << merge
               << " merged tracks";
   }
 }
 
 bool CalibMerge::Init(const char *fname, const std::string &dirnm) {
   char treeName[400];
   sprintf(treeName, "%s/CalibTree", dirnm.c_str());
   TChain *fChain = new TChain(treeName);
   if (!fillChain(fChain, fname)) {
     std::cout << "Creation of the chain for " << treeName << " from " << fname << " failed " << std::endl;
     return false;
   } else {
     std::cout << "Proceed with a tree chain with " << fChain->GetEntries() << " entries" << std::endl;
     fCurrent = -1;
     fChain->SetMakeClass(1);
     // Set object pointer
     t_DetIds = 0;
     t_DetIds1 = 0;
     t_DetIds3 = 0;
     t_HitEnergies = 0;
     t_HitEnergies1 = 0;
     t_HitEnergies3 = 0;
     t_trgbits = 0;
     fChain->SetBranchAddress("t_Run", &t_Run, &b_t_Run);
     fChain->SetBranchAddress("t_Event", &t_Event, &b_t_Event);
     fChain->SetBranchAddress("t_DataType", &t_DataType, &b_t_DataType);
     fChain->SetBranchAddress("t_ieta", &t_ieta, &b_t_ieta);
     fChain->SetBranchAddress("t_iphi", &t_iphi, &b_t_iphi);
     fChain->SetBranchAddress("t_EventWeight", &t_EventWeight, &b_t_EventWeight);
     fChain->SetBranchAddress("t_nVtx", &t_nVtx, &b_t_nVtx);
     fChain->SetBranchAddress("t_nTrk", &t_nTrk, &b_t_nTrk);
     fChain->SetBranchAddress("t_goodPV", &t_goodPV, &b_t_goodPV);
     fChain->SetBranchAddress("t_l1pt", &t_l1pt, &b_t_l1pt);
     fChain->SetBranchAddress("t_l1eta", &t_l1eta, &b_t_l1eta);
     fChain->SetBranchAddress("t_l1phi", &t_l1phi, &b_t_l1phi);
     fChain->SetBranchAddress("t_l3pt", &t_l3pt, &b_t_l3pt);
     fChain->SetBranchAddress("t_l3eta", &t_l3eta, &b_t_l3eta);
     fChain->SetBranchAddress("t_l3phi", &t_l3phi, &b_t_l3phi);
     fChain->SetBranchAddress("t_p", &t_p, &b_t_p);
     fChain->SetBranchAddress("t_pt", &t_pt, &b_t_pt);
     fChain->SetBranchAddress("t_phi", &t_phi, &b_t_phi);
     fChain->SetBranchAddress("t_mindR1", &t_mindR1, &b_t_mindR1);
     fChain->SetBranchAddress("t_mindR2", &t_mindR2, &b_t_mindR2);
     fChain->SetBranchAddress("t_eMipDR", &t_eMipDR, &b_t_eMipDR);
     fChain->SetBranchAddress("t_eHcal", &t_eHcal, &b_t_eHcal);
     fChain->SetBranchAddress("t_eHcal10", &t_eHcal10, &b_t_eHcal10);
     fChain->SetBranchAddress("t_eHcal30", &t_eHcal30, &b_t_eHcal30);
     fChain->SetBranchAddress("t_hmaxNearP", &t_hmaxNearP, &b_t_hmaxNearP);
     fChain->SetBranchAddress("t_rhoh", &t_rhoh, &b_t_rhoh);
     fChain->SetBranchAddress("t_selectTk", &t_selectTk, &b_t_selectTk);
     fChain->SetBranchAddress("t_qltyFlag", &t_qltyFlag, &b_t_qltyFlag);
     fChain->SetBranchAddress("t_qltyMissFlag", &t_qltyMissFlag, &b_t_qltyMissFlag);
     fChain->SetBranchAddress("t_qltyPVFlag", &t_qltyPVFlag, &b_t_qltyPVFlag);
     fChain->SetBranchAddress("t_gentrackP", &t_gentrackP, &b_t_gentrackP);
     fChain->SetBranchAddress("t_DetIds", &t_DetIds, &b_t_DetIds);
     fChain->SetBranchAddress("t_HitEnergies", &t_HitEnergies, &b_t_HitEnergies);
     fChain->SetBranchAddress("t_trgbits", &t_trgbits, &b_t_trgbits);
     fChain->SetBranchAddress("t_DetIds1", &t_DetIds1, &b_t_DetIds1);
     fChain->SetBranchAddress("t_DetIds3", &t_DetIds3, &b_t_DetIds3);
     fChain->SetBranchAddress("t_HitEnergies1", &t_HitEnergies1, &b_t_HitEnergies1);
     fChain->SetBranchAddress("t_HitEnergies3", &t_HitEnergies3, &b_t_HitEnergies3);
     Notify();
     return true;
   }
 }
 
 void CalibMerge::bookTree(const char *fname) {
   std::cout << "BookTree in " << fname << std::endl;
   outputFile_ = TFile::Open(fname, "RECREATE");
   outputFile_->cd();
   outtree_ = new TTree("Tree", "Tree");
   outtree_->Branch("t_Event", &event_);
   outtree_->Branch("t_ieta", &ieta_);
   outtree_->Branch("t_nvtx", &nvtx_);
   outtree_->Branch("t_rhoh", &rhoh_);
   outtree_->Branch("t_p_noPU", &p_NoPU_);
   outtree_->Branch("t_p_PU", &p_PU_);
   outtree_->Branch("t_eHcal_noPU", &eHcal_NoPU_);
   outtree_->Branch("t_eHcal_PU", &eHcal_PU_);
   outtree_->Branch("t_eHcal10_noPU", &eHcal10_NoPU_);
   outtree_->Branch("t_eHcal10_PU", &eHcal10_PU_);
   outtree_->Branch("t_eHcal30_noPU", &eHcal30_NoPU_);
   outtree_->Branch("t_eHcal30_PU", &eHcal30_PU_);
   outtree_->Branch("t_delta_noPU", &delta_NoPU_);
   outtree_->Branch("t_delta_PU", &delta_PU_);
 }
 
 void CalibMerge::close() {
   if (outputFile_ != nullptr) {
     outputFile_->cd();
     std::cout << "file yet to be Written" << std::endl;
     outtree_->Write();
     std::cout << "file Written" << std::endl;
     outputFile_->Close();
   }
   outputFile_ = nullptr;
   std::cout << "now doing return" << std::endl;
 }
 
 void combineML(const char *inputFileList, const char *outfile) {
   std::map<int, std::string> files;
   std::ifstream infile(inputFileList);
   if (!infile.is_open()) {
     std::cout << "** ERROR: Can't open '" << inputFileList << "' for input" << std::endl;
   } else {
     while (1) {
       int depth;
       std::string fname;
       infile >> depth >> fname;
       if (!infile.good())
         break;
       files[depth] = fname;
     }
     infile.close();
   }
   std::cout << "Gets a list of " << files.size() << " file names from " << inputFileList << std::endl;
   if (files.size() > 0) {
     std::map<int, std::vector<listML> > mlList;
     for (std::map<int, std::string>::const_iterator itr = files.begin(); itr != files.end(); ++itr) {
       int depth = itr->first;
       std::string fname = itr->second;
       std::ifstream fInput(fname.c_str());
       if (!fInput.good()) {
         std::cout << "Cannot open file " << fname << std::endl;
       } else {
         char buffer[1024];
         unsigned int all(0), good1(0), good2(0);
         while (fInput.getline(buffer, 1024)) {
           ++all;
           if (buffer[0] == '#')
             continue;  //ignore comment
           std::vector<std::string> items = splitString(std::string(buffer));
           if (items.size() != 4) {
             std::cout << "Ignore  line: " << buffer << std::endl;
           } else {
             ++good1;
             int depth0 = std::atoi(items[1].c_str());
             if (depth0 == depth) {
               ++good2;
               int ieta = std::atoi(items[0].c_str());
               double ml = std::atoi(items[2].c_str());
               double dml = std::atoi(items[3].c_str());
               listML l0(depth, ml, dml);
               if (mlList.find(ieta) == mlList.end()) {
                 std::vector<listML> l0v;
                 mlList[ieta] = l0v;
               }
               (mlList[ieta]).push_back(l0);
             }
           }
         }
         fInput.close();
         std::cout << "Reads total of " << all << " and " << good1 << ":" << good2 << " good records for depth " << depth
                   << std::endl;
       }
     }
     if (mlList.size() > 0) {
       std::ofstream fout(outfile);
       for (std::map<int, std::vector<listML> >::const_iterator itr = mlList.begin(); itr != mlList.end(); ++itr) {
         int ieta = itr->first;
         std::vector<listML> l0v = itr->second;
         double den(0), dden(0);
         for (unsigned int k = 0; k < l0v.size(); ++k) {
           if (l0v[k].depth_ == 2) {
             den = l0v[k].ml_;
             dden = l0v[k].dml_;
           }
         }
         if (den > 0) {
           fout << std::setw(4) << ieta << "   " << l0v.size();
           for (unsigned int k = 0; k < l0v.size(); ++k) {
             double ml = den / l0v[k].ml_;
             double dml = l0v[k].dml_ * den / (l0v[k].ml_ * l0v[k].ml_);
             fout << "  " << l0v[k].depth_ << "  " << std::setw(6) << ml << "  " << std::setw(6) << dml;
           }
           fout << std::endl;
         }
       }
       fout.close();
     }
   }
 }
 
 void calCorrCombine(
     const char *inFileCorr, const char *inFileDepth, const char *outFileCorr, int truncateFlag, int etaMax) {
   const int neta = 58;
   int ietas[neta] = {1,   2,   3,   4,   5,   6,   7,   8,   9,   10,  11,  12,  13,  14,  15,  16,  17,  18, 19,  20,
                      21,  22,  23,  24,  25,  26,  27,  28,  29,  -1,  -2,  -3,  -4,  -5,  -6,  -7,  -8,  -9, -10, -11,
                      -12, -13, -14, -15, -16, -17, -18, -19, -20, -21, -22, -23, -24, -25, -26, -27, -28, -29};
   int depthMin[neta] = {1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
                         1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1};
   int depthMax[neta] = {4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 5, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 3,
                         4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 5, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 3};
 
   // Read the correction factors
   std::map<unsigned int, std::pair<double, double> > cfactors;
   if (std::string(inFileCorr) != "") {
     std::ifstream fInput(inFileCorr);
     if (!fInput.good()) {
       std::cout << "Cannot open file " << inFileCorr << std::endl;
     } else {
       char buffer[1024];
       unsigned int all(0), good(0);
       while (fInput.getline(buffer, 1024)) {
         ++all;
         if (buffer[0] == '#')
           continue;  //ignore comment
         std::vector<std::string> items = splitString(std::string(buffer));
         if (items.size() != 5) {
           std::cout << "Ignore  line: " << buffer << std::endl;
         } else {
           ++good;
           std::istringstream converter(items[0].c_str());
           unsigned int det;
           converter >> std::hex >> det;
           double corrf = std::atof(items[3].c_str());
           double dcorr = std::atof(items[4].c_str());
           cfactors[det] = std::pair<double, double>(corrf, dcorr);
         }
       }
       fInput.close();
       std::cout << "Reads total of " << all << " and " << good << " good records" << std::endl;
     }
   }
 
   // Read in the depth dependent correction factors
   std::map<int, std::vector<double> > weights;
   if (std::string(inFileDepth) != "") {
     std::ifstream infile(inFileDepth);
     if (!infile.is_open()) {
       std::cout << "Cannot open duplicate file " << inFileDepth << std::endl;
     } else {
       unsigned int all(0), good(0);
       char buffer[1024];
       while (infile.getline(buffer, 1024)) {
         ++all;
         std::string bufferString(buffer);
         if (bufferString.substr(0, 1) == "#") {
           continue;  //ignore other comments
         } else {
           std::vector<std::string> items = splitString(bufferString);
           if (items.size() < 3) {
             std::cout << "Ignore  line: " << buffer << " Size " << items.size() << std::endl;
           } else {
             ++good;
             int ieta = std::atoi(items[0].c_str());
             std::vector<double> weight;
             for (unsigned int k = 1; k < items.size(); ++k) {
               double corrf = std::atof(items[k].c_str());
               weight.push_back(corrf);
             }
             weights[ieta] = weight;
           }
         }
       }
       infile.close();
       std::cout << "Reads total of " << all << " and " << good << " good records of depth dependent factors from "
                 << inFileDepth << std::endl;
     }
   }
 
   // Now combine the two information
   std::map<unsigned int, std::pair<double, double> > cfacFinal;
   std::ofstream outfile(outFileCorr);
   outfile << "#" << std::setprecision(4) << std::setw(10) << "detId" << std::setw(10) << "ieta" << std::setw(10)
           << "depth" << std::setw(15) << "corrFactor" << std::endl;
   for (int k = 0; k < neta; ++k) {
     int ieta = ietas[k];
     for (int depth = depthMin[k]; depth <= depthMax[k]; ++depth) {
       int subdet = ifHB(ieta, depth) ? 1 : 2;
       int d = truncateDepth(ieta, depth, truncateFlag);
       unsigned int key = repackId(subdet, ieta, 0, d);
       double c1(1), dc1(0), c2(1);
       if (cfactors.find(key) != cfactors.end()) {
         c1 = cfactors[key].first;
         dc1 = cfactors[key].second;
       }
       if (weights.find(ieta) != weights.end()) {
         if (static_cast<unsigned int>(depth) <= weights[ieta].size())
           c2 = (weights[ieta])[depth - 1];
       }
       double cf = c1 * c2;
       double dcf = dc1 * c2;
       if (std::abs(ieta) > etaMax) {
         int ieta0 = (ieta > 0) ? etaMax : -etaMax;
         key = repackId(subdet, ieta0, 0, depth);
         if (cfacFinal.find(key) != cfacFinal.end()) {
           cf = cfacFinal[key].first;
           dcf = cfacFinal[key].second;
         }
       }
       key = repackId(subdet, ieta, 0, depth);
       cfacFinal[key] = std::pair<double, double>(cf, dcf);
       if (std::abs(ieta) <= etaMax)
         outfile << std::setw(10) << std::hex << key << std::setw(10) << std::dec << ieta << std::setw(10) << depth
                 << std::setw(10) << cf << " " << std::setw(10) << dcf << std::endl;
     }
   }
   outfile.close();
 }