SectorMapComparer.h

/**************************************************************************
 * basf2 (Belle II Analysis Software Framework)                           *
 * Author: The Belle II Collaboration                                     *
 *                                                                        *
 * See git log for contributors and copyright holders.                    *
 * This file is licensed under LGPL-3.0, see LICENSE.md.                  *
 **************************************************************************/
 
 
#pragma once
 
#include <framework/logging/Logger.h>
 
#include <TTree.h>
#include <TH1F.h>
 
#include <unordered_map>
#include <iostream>
 
namespace Belle2 {
  class SectorMapComparer : public TObject {
  public:
    SectorMapComparer() = delete;
    SectorMapComparer(const std::string& SMFileFirst, const std::string& SMFileSecond);
 
    ~SectorMapComparer() = default;
 
 
    void plot(bool logScale = true, TString pdfFileName = "", bool drawLegend = true);
 
    void plotSectorStats(bool logScale = true, TString pdfFileName = "", bool drawLegend = true);
 
    void compareMaps(TString setup, bool unmatchedEntries = false);
 
    void showSetups()
    {
      std::cout << std::endl;
      showSetups(m_SMFileName_first);
      std::cout << std::endl;
      showSetups(m_SMFileName_second);
    }
 
    void showSetups(TString sectorMapFileName);
 
    void showFiles()
    {
      B2INFO("Following files will be compared:");
      B2INFO("=================================");
      B2INFO("First : " << m_SMFileName_first);
      B2INFO("Second: " << m_SMFileName_second);
    }
 
 
  private:
 
 
    uint countConnections(const std::unordered_map<uint, uint>& map,  int layer = -1, int ladder = -1, int sensor = -1,
                          int sector = -1);
 
    std::string getHash(long l1, long l2, long l3);
 
    void findTrees(TDirectory* aDir, std::vector<std::string>&  listOfTrees);
 
    void setLeafAddresses(TTree* t, std::unordered_map<std::string, double>& filterVals,
                          std::unordered_map<std::string, uint>& SecIDVals);
 
    void fillSectorToTreeIndexMap(TTree* tree, std::unordered_map<std::string, long>& map);
 
    void compareTrees(TTree* t_first, TTree* t_second, bool unmatchedEntries = false);
 
    void clearMaps()
    {
      m_histo_map_first.clear();
      m_histo_map_second.clear();
      m_histo_map_diff.clear();
      m_histo_map_range_first.clear();
      m_histo_map_range_second.clear();
      m_map_N2HitCombs.clear();
      m_map_N2HitCombs_matched.clear();
      m_map_N3HitCombs.clear();
      m_map_N3HitCombs_matched.clear();
    }
 
    // stores the histograms
    // WARNING: these will be reused!
    std::unordered_map<std::string, TH1F> m_histo_map_first; 
    std::unordered_map<std::string, TH1F> m_histo_map_second; 
    std::unordered_map<std::string, TH1F> m_histo_map_diff; 
    std::unordered_map<std::string, TH1F> m_histo_map_range_first; 
    std::unordered_map<std::string, TH1F> m_histo_map_range_second; 
 
    std::unordered_map<uint, uint> m_map_N2HitCombs;
    std::unordered_map<uint, uint> m_map_N2HitCombs_matched;
 
    std::unordered_map<uint, uint> m_map_N3HitCombs;
    std::unordered_map<uint, uint> m_map_N3HitCombs_matched;
 
 
 
    std::string m_SMFileName_first; 
    std::string m_SMFileName_second; 
 
    std::string m_setupsTreeName = "Setups"; 
    std::string m_setupsBranchName = "name"; 
 
    bool m_isCompared = false;
 
    // we dont want to write out this class, so version number should stay 0
    ClassDef(SectorMapComparer, 0)
  };
}// end namespace