SectorMapComparer Class Reference

A root tool that compares two Sectormaps (local root files) and produces some statistics output. More...

#include <SectorMapComparer.h>

Inheritance diagram for SectorMapComparer:

Public Member Functions
	SectorMapComparer ()=delete
	dont use this constructor
	SectorMapComparer (const std::string &SMFileFirst, const std::string &SMFileSecond)
	constructor
	~SectorMapComparer ()=default
	default destructor
void	plot (bool logScale=true, TString pdfFileName="", bool drawLegend=true)
	will create lots of Canvases!!!
void	plotSectorStats (bool logScale=true, TString pdfFileName="", bool drawLegend=true)
	Will create canvases showing statistics.
void	compareMaps (TString setup, bool unmatchedEntries=false)
	runs the comparison for all filters (and only the filters) in the sectormap files
void	showSetups ()
	lists all setups of sectormaps included in the two files
void	showSetups (TString sectorMapFileName)
	lists all sector map setups in the specified file
void	showFiles ()
	lists the names of the files which are used

Private Member Functions
uint	countConnections (const std::unordered_map< uint, uint > &map, int layer=-1, int ladder=-1, int sensor=-1, int sector=-1)
	counts all connections for given layer, ladder, sensor, sector.
std::string	getHash (long l1, long l2, long l3)
	I was too lacy to implement a proper hash function, so I convert the three numbers into a string and use the string as hash for the map.
void	findTrees (TDirectory *aDir, std::vector< std::string > &listOfTrees)
	helper function that returns a list of names for all trees contained in the TDirectory including sub-directories
void	setLeafAddresses (TTree *t, std::unordered_map< std::string, double > &filterVals, std::unordered_map< std::string, uint > &SecIDVals)
	automatically sets the TLeaf addresses for a tree.
void	fillSectorToTreeIndexMap (TTree *tree, std::unordered_map< std::string, long > &map)
	fills a map that maps sector combinations in the tree to string which is a hash combining the three (two) sector ids
void	compareTrees (TTree *t_first, TTree *t_second, bool unmatchedEntries=false)
	makes the comparison of two trees, and fills histograms and certain maps
void	clearMaps ()
	helper that clears all the maps used

Private Attributes
std::unordered_map< std::string, TH1F >	m_histo_map_first
	histograms for the first sector map
std::unordered_map< std::string, TH1F >	m_histo_map_second
	histograms for the second sector map
std::unordered_map< std::string, TH1F >	m_histo_map_diff
	histograms that store differences between the two sector maps
std::unordered_map< std::string, TH1F >	m_histo_map_range_first
	histograms that store the range of that filter (max - min)
std::unordered_map< std::string, TH1F >	m_histo_map_range_second
	histograms that store the range of that filter (max - min)
std::unordered_map< uint, uint >	m_map_N2HitCombs
	count the number of 2Hit connections for each sector,
std::unordered_map< uint, uint >	m_map_N2HitCombs_matched
	count the number of 2Hit connections for each sector, only if sector combination was "matched" (Note: meaning of "matched" depends on the setting)
std::unordered_map< uint, uint >	m_map_N3HitCombs
	count the number of 3Hit connections for each sector, can be used to do some statistics
std::unordered_map< uint, uint >	m_map_N3HitCombs_matched
	count the number of 3Hit connections for each sector, only if sector combination was "matched" (Note: meaning of "matched" depends on the setting)
std::string	m_SMFileName_first
	name of the file containing the first sectormap
std::string	m_SMFileName_second
	name of the file containing the second sectormap
std::string	m_setupsTreeName = "Setups"
	name of the tree all the setups are stored
std::string	m_setupsBranchName = "name"
	name of the branch in the setups tree that holds the names of the setups
bool	m_isCompared = false
	remember if CompareMaps already has been run, to give warnings if functions are called that need CompareMaps to have run

Detailed Description

A root tool that compares two Sectormaps (local root files) and produces some statistics output.

Yes we old people do use root. So get over it and open a root session to create an Object to let its magic unfold. This tool assumes that both sectormaps use the same setup (i.e. number of sectors on sensor, and filter configuration). It still may work with slightly different filters as long as the naming did not change. But if the number of sectors on sensor is different the matching of sectors will not work and the results may become misleading!

The output will be several plots comparing the filter cuts (min, max) for each of the contained filters. In addition a simple counting of sector connections is provided.

Per default only sector combinations which are matched between both sectormaps are drawn. If the option unmatchedEntries==true is set when calling CompareMaps only the sector combinations which are not matched from the first sector map are plotted.

Definition at line 38 of file SectorMapComparer.h.

Constructor & Destructor Documentation

SectorMapComparer()

SectorMapComparer	(	const std::string &	SMFileFirst,
		const std::string &	SMFileSecond
	)

constructor

Parameters

SMFileFirst	root file name the first sector map is contained in
SMFileSecond	root file name the second sector map is contained in

Definition at line 31 of file SectorMapComparer.cc.

                                                                    : m_SMFileName_first(SMFileFirst),
  m_SMFileName_second(SMFileSecond)
{
  Belle2::LogSystem::Instance().getLogConfig()->setLogLevel(LogConfig::c_Info);
};

Member Function Documentation

clearMaps()

void clearMaps ( )

inlineprivate

helper that clears all the maps used

Definition at line 140 of file SectorMapComparer.h.

    {
      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();
    }

compareMaps()

void compareMaps	(	TString	setup,
		bool	unmatchedEntries = false
	)

runs the comparison for all filters (and only the filters) in the sectormap files

Definition at line 337 of file SectorMapComparer.cc.

{
  B2INFO("comparing SectorMaps in the following files");
  B2INFO("first:  " << m_SMFileName_first);
  B2INFO("second: " << m_SMFileName_second);
 
  TFile* f_first = TFile::Open(m_SMFileName_first.c_str());
  TFile* f_second = TFile::Open(m_SMFileName_second.c_str());
 
  if (!f_first->IsOpen() || !f_first->IsOpen()) {
    B2ERROR("ERROR: one of the files not open");
 
    if (f_first) f_first->Close();
    if (f_second) f_second->Close();
    return;
  }
 
  // get the list of trees from the first file (for second file assume same trees)
  std::vector<std::string> listOfTrees;
  findTrees(f_first, listOfTrees);
 
  // clear the maps, else old results will be mixed with this run
  clearMaps();
 
  for (const std::string& tname_first : listOfTrees) {
 
    // only look at the trees for the specified Setup
    if (!TString(tname_first).Contains(setupName)) continue;
 
 
    // assume second file has
    std::string tname_second = tname_first;
    tname_second.replace(0, m_SMFileName_first.length(), m_SMFileName_second);
 
 
 
    TTree* t_first = (TTree*)f_first->Get(tname_first.c_str());
    TTree* t_second = (TTree*)f_second->Get(tname_second.c_str());
 
    // filter out the sector id and test for consistency
    if (TString(tname_first).Contains("CompactSecIDs")) {
      if (t_first->GetEntries() != t_second->GetEntries())
        B2FATAL("The number of entries in CompactSecIDs should be identical! This indicates that two sectormaps with"
                " different sectors on sensors are compared which will lead to wrong results! " << std::endl <<
                "# CompactSecIDs SM1: " << t_first->GetEntries() << std::endl <<
                "# CompactSecIDs SM2: " << t_second->GetEntries() << std::endl
               );
      // we dont compare those
      continue;
    }
 
    B2INFO("Comparing tree: " << tname_first << " with tree: " << tname_second <<  std::endl);
 
    if (!t_first || !t_second) {
      B2ERROR("One of the trees not found!");
      continue;
    }
 
    compareTrees(t_first, t_second, unmatchedEntries);
  }
 
  f_first->Close();
  f_second->Close();
 
  m_isCompared = true;
}

compareTrees()

void compareTrees ( TTree *  t_first, TTree *  t_second, bool  unmatchedEntries = false  )

private

makes the comparison of two trees, and fills histograms and certain maps

Parameters

t_first	first tree
t_second	secdon tree
unmatchedEntries	if true only the unmatched entries will be filled (only for the first tree)

Definition at line 111 of file SectorMapComparer.cc.

{
 
  // index the second tree
  std::unordered_map<std::string, long> indexmap_t_second;
  // WARNING: this messes with leaf addresses of the sector ids
  fillSectorToTreeIndexMap(t_second, indexmap_t_second);
 
 
  std::unordered_map<std::string, double> vals_t_first;
  std::unordered_map<std::string, uint> ids_t_first;
  setLeafAddresses(t_first, vals_t_first, ids_t_first);
 
  std::unordered_map<std::string, double> vals_t_second;
  std::unordered_map<std::string, uint> ids_t_second;
  setLeafAddresses(t_second, vals_t_second, ids_t_second);
 
 
  // identify Three hit combinations by existens of the branch centerID
  bool isTriplet =  t_first->GetBranch("centerFullSecID") != nullptr;
 
  // some cross checks
  if (vals_t_second.size() != vals_t_first.size()) {
    B2WARNING("Number of filters stored in the two SectorMaps seem to differ! This is per se not dangerous, but some cuts may be compared to zero.");
  }
 
  // Creating histograms, using the list of leaves  for indexing the histograms
  TObjArray* leafList = t_first->GetListOfLeaves();
  for (TObject* o : *leafList) {
    TLeaf* l_first = (TLeaf*)o;
    // no histograms for the sector ids
    TString leafName = l_first->GetName();
    if (leafName.Contains("FullSecID")) continue;
 
    double min = std::min(t_first->GetMinimum(leafName), t_second->GetMinimum(leafName));
    double max = std::max(t_first->GetMaximum(leafName), t_second->GetMaximum(leafName));
    double range = std::fabs(min - max);
    // TODO: make this configurable
    int Nbins = 100;
 
    // As in the current version the maps are used for several trees, cross check that histograms are not overwritten
    if (m_histo_map_first.find(leafName.Data()) != m_histo_map_first.end() ||
        m_histo_map_second.find(leafName.Data()) != m_histo_map_second.end() ||
        m_histo_map_diff.find(leafName.Data()) != m_histo_map_diff.end()) {
 
      B2ERROR("ERROR: Histogram for key " << leafName.Data() << " already exists");
    }
 
 
    m_histo_map_first[ leafName.Data() ] = TH1F(leafName + "_first", leafName, Nbins, min, max);
    m_histo_map_first[ leafName.Data() ].SetDirectory(nullptr);
    m_histo_map_second[ leafName.Data() ] = TH1F(leafName + "_second", leafName, Nbins, min, max);
    m_histo_map_second[ leafName.Data() ].SetDirectory(nullptr);
    m_histo_map_diff[ leafName.Data() ] = TH1F(leafName + "_diff", "difference " + leafName + " (SM1 - SM2)", Nbins, -0.2 * range,
                                               0.2 * range);
    m_histo_map_diff[ leafName.Data() ].SetDirectory(nullptr);
 
    // histograms containing the max minus the min
    TString niceName = leafName;
    niceName.ReplaceAll("_min", "");
    niceName.ReplaceAll("_max", "");
    m_histo_map_range_first[ leafName.Data() ] = TH1F(leafName + "_range_first", niceName + " range (max - min)", Nbins, 0, range);
    m_histo_map_range_first[ leafName.Data() ].SetDirectory(nullptr);
    m_histo_map_range_second[ leafName.Data() ] = TH1F(leafName + "_range_second", niceName + " range (max - min)", Nbins, 0, range);
    m_histo_map_range_second[ leafName.Data() ].SetDirectory(nullptr);
  }
 
 
 
  // loop over t1, and get corresponding value for t2
  for (long i = 0; i < t_first->GetEntries(); i++) {
    t_first->GetEntry(i);
 
    std::string hash = getHash(ids_t_first["innerFullSecID"], ids_t_first["centerFullSecID"], ids_t_first["outerFullSecID"]);
 
 
    // count all connections
    if (isTriplet) m_map_N3HitCombs[ ids_t_first["outerFullSecID"] ]++;
    else  m_map_N2HitCombs[ ids_t_first["outerFullSecID"] ]++;
 
 
    // filter connections inside both sector maps, if unmatchedEntries is true only the unmatched entries will be selected
    if (indexmap_t_second.find(hash) == indexmap_t_second.end()) {
      // case this sector combination not matched, can be thrown away if  unmatchedEntries is set false
      if (!unmatchedEntries) continue;
    } else {
      // sector combination is matched, read second tree and skip if unmatchedEntries is set
      t_second->GetEntry(indexmap_t_second[hash]);
      if (unmatchedEntries) continue;
    }
 
    // only count the matched ones
    if (isTriplet) m_map_N3HitCombs_matched[ ids_t_first["outerFullSecID"] ]++;
    else  m_map_N2HitCombs_matched[ ids_t_first["outerFullSecID"] ]++;
 
    // now fill the histograms
    // NOTE: in case unmatchedEntries==true the values in the the second tree do not make any sense, so not fill any histograms with them
    for (TObject* o : *leafList) {
      TString leafName = o->GetName();
      // TODO: find a better way to destinguish the secid leaves from the others
      if (leafName.Contains("FullSecID")) continue;
      m_histo_map_first[ leafName.Data() ].Fill(vals_t_first[leafName.Data()]);
      if (!unmatchedEntries) {
        m_histo_map_second[ leafName.Data() ].Fill(vals_t_second[leafName.Data()]);
        m_histo_map_diff[ leafName.Data() ].Fill(vals_t_first[leafName.Data()] - vals_t_second[leafName.Data()]);
      }
      // calculate the range only for the max
      if (leafName.Contains("_max")) {
        TString minLeafName = leafName;
        minLeafName.ReplaceAll("_max", "_min");
        m_histo_map_range_first[ leafName.Data() ].Fill(vals_t_first[leafName.Data()] - vals_t_first[minLeafName.Data()]);
        if (!unmatchedEntries) m_histo_map_range_second[ leafName.Data() ].Fill(vals_t_second[leafName.Data()] -
              vals_t_second[minLeafName.Data()]);
      }
    }
 
  }
 
}

countConnections()

uint countConnections ( const std::unordered_map< uint, uint > &  map, int  layer = -1, int  ladder = -1, int  sensor = -1, int  sector = -1  )

private

counts all connections for given layer, ladder, sensor, sector.

If -1 is given for any of those it is summed over the corresponding entries This has to be called after the CompareMaps function, else the result will be zero

Parameters

map	reference to map mapping from fullsecid to number of times
layer,ladder,sensor,sector	layer, ladder, sensor, sector number, if -1 it will be summed over

Definition at line 406 of file SectorMapComparer.cc.

{
  uint result = 0;
  for (const auto& entry : map) {
    // convert to FullSecID
    FullSecID fullSID(entry.first);
    if (layer >= 0 && fullSID.getLayerNumber() != layer) continue;
    if (ladder >= 0 && fullSID.getLadderNumber() != ladder) continue;
    if (sensor >= 0 && fullSID.getVxdID().getSensorNumber() != sensor) continue;
    if (sector >= 0 && fullSID.getSecID() != sector) continue;
 
    result += entry.second;
  }
  return result;
}

fillSectorToTreeIndexMap()

void fillSectorToTreeIndexMap ( TTree *  tree, std::unordered_map< std::string, long > &  map  )

private

fills a map that maps sector combinations in the tree to string which is a hash combining the three (two) sector ids

Parameters

tree	the tree to be mapped
map	the map which will be filled in the function

Definition at line 81 of file SectorMapComparer.cc.

{
  // the branchnames which store the sectorIDs
  std::vector<std::string> bNames = {"innerFullSecID", "centerFullSecID", "outerFullSecID"};
  std::vector<uint> bVals = {0, 0, 0}; // lets hope there is no inner sector id 0! But need to be 0 here as later no check for existance in the map for segments, so default value is used.
 
  for (uint i = 0; i < bNames.size(); i++) {
    TLeaf* l = tree->GetLeaf(bNames[i].c_str());
    if (l) {
      l->SetAddress(&(bVals[i]));
    }
  }
 
  // now loop to create the map
  for (long i = 0; i < tree->GetEntries(); i++) {
    tree->GetEntry(i);
    std::string hash = getHash(bVals[0], bVals[1], bVals[2]);
    //std::cout << hash << " " << i << std::endl;
    map[hash] = i;
  }
 
}

findTrees()

void findTrees ( TDirectory *  aDir, std::vector< std::string > &  listOfTrees  )

private

helper function that returns a list of names for all trees contained in the TDirectory including sub-directories

Parameters

aDir	a root directory pointer (e.g. TFile *)
listOfTrees	this vector will be filled with the names of the tree (NOTE: the name contains the full path (including file name))

Definition at line 266 of file SectorMapComparer.cc.

{
  TList* keys = aDir->GetListOfKeys();
  for (TObject* akey : *keys) {
 
    // there should be no check needed as each key should be attached to an object
    TObject* o = aDir->Get(akey->GetName());
 
 
    if (o->InheritsFrom(TDirectory::Class())) findTrees((TDirectory*)o, listOfTrees);
    if (o->InheritsFrom(TTree::Class())) {
      listOfTrees.emplace_back(std::string(aDir->GetPath()) + std::string("/") + std::string(o->GetName()));
    }
  }
 
}

getHash()

std::string getHash ( long  l1, long  l2, long  l3  )

private

I was too lacy to implement a proper hash function, so I convert the three numbers into a string and use the string as hash for the map.

Parameters

l1,l2,l3

just three numbers of type long

Returns

: a string which combines the three numbers which can be used as hash as the hash function for std::string already exists

Definition at line 40 of file SectorMapComparer.cc.

{
  std::string str = std::to_string(l1) + "-" + std::to_string(l2) + "-" + std::to_string(l3);
  return str;
}

plot()

void plot	(	bool	logScale = true,
		TString	pdfFileName = "",
		bool	drawLegend = true
	)

will create lots of Canvases!!!

Parameters

logScale	if true the y-axis will be log scale
pdfFileName	name of the output file, has to be a file format which is supported by TCanvas::SaveAs (e.g. .pdf) if empty "" no output file will be created
drawLegend	if true a legend is drawn, may hide interisting parts so one can deactivate it

Definition at line 285 of file SectorMapComparer.cc.

{
 
  if (!m_isCompared) {
    B2WARNING("You need to run SectorMapComparer::CompareMaps before this function!");
    return;
  }
 
  int n = m_histo_map_first.size();
  int counter = 1;
  for (const auto& hist : m_histo_map_first) {
    std::string aName = hist.first;
    TCanvas* can = new TCanvas((aName + "_can").c_str(), aName.c_str());
    can->Divide(1, 3);
 
    can->cd(1)->SetLogy((int)logScale);
    // TODO: pretty sure this is a memory leak, but right now I do not care
    // draw legend only for first
    TLegend* l = new TLegend(0.15, 0.7, 0.3, 0.9);
    TH1* hbuff = m_histo_map_first[ aName ].DrawCopy();
    l->AddEntry(hbuff, "first SectorMap", "lpf");
    m_histo_map_second[ aName ].SetLineColor(kRed);
    hbuff = m_histo_map_second[ aName ].DrawCopy("same");
    l->AddEntry(hbuff, "second SectorMap", "lpf");
    if (drawLegend) l->Draw();
 
    can->cd(2)->SetLogy((int)logScale);;
    m_histo_map_diff[ aName ].DrawCopy();
 
    if (TString(aName).Contains("_max")) {
      can->cd(3)->SetLogy((int)logScale);
      m_histo_map_range_first[ aName ].DrawCopy();
      m_histo_map_range_second[ aName ].SetLineColor(kRed);
      m_histo_map_range_second[ aName ].DrawCopy("same");
    }
 
    // if file name is specified plot directly to pdf file
    if (pdfFileName != "") {
      if (n == 1) can->SaveAs(pdfFileName);
      else {
        if (counter == 1) can->SaveAs(pdfFileName + "(");
        else if (counter == n) can->SaveAs(pdfFileName + ")");
        else can->SaveAs(pdfFileName);
      }
    }
    counter++;
  }
 
}

plotSectorStats()

void plotSectorStats	(	bool	logScale = true,
		TString	pdfFileName = "",
		bool	drawLegend = true
	)

Will create canvases showing statistics.

Parameters

logScale	if true the y-axis will be log scale
pdfFileName	name of the output file, has to a file format which is supported by TCanvas::SaveAs (e.g. .pdf) if empty "" no output file will be created
drawLegend	if true a legend is drawn, may hide interisting parts so one can deactivate it

Definition at line 424 of file SectorMapComparer.cc.

{
  if (!m_isCompared) {
    B2WARNING("You need to run SectorMapComparer::CompareMaps before this function!");
    return;
  }
 
  TH1F h_2hits("h_2hits", "number of two hit connections starting at ith layer; layer; number connections", 7, -0.5, 6.5);
  // stats box does not give any useful information, so deactivate it
  h_2hits.SetStats(false);
  // make some copies
  TH1F h_2hits_matched(h_2hits);
  h_2hits_matched.SetName("h2hits_matched");
  h_2hits_matched.SetLineColor(kRed);
  // make copies for the three hit connections
  TH1F h_3hits(h_2hits);
  h_3hits.SetName("h_3hits");
  h_3hits.SetTitle("number of three hit connections starting at ith layer; layer; number connections");
  TH1F h_3hits_matched(h_3hits);
  h_3hits_matched.SetName("h_3hits_matched");
  h_3hits_matched.SetLineColor(kRed);
 
  for (int ilayer = 1; ilayer < 7; ilayer++) {
 
    // the bin is the same for all
    int bin = h_2hits.FindBin(ilayer);
    h_2hits.SetBinContent(bin, countConnections(m_map_N2HitCombs, ilayer, -1, -1, -1));
    h_2hits_matched.SetBinContent(bin, countConnections(m_map_N2HitCombs_matched, ilayer, -1, -1, -1));
    h_3hits.SetBinContent(bin, countConnections(m_map_N3HitCombs, ilayer, -1, -1, -1));
    h_3hits_matched.SetBinContent(bin, countConnections(m_map_N3HitCombs_matched, ilayer, -1, -1, -1));
  }
 
  TCanvas* can = new TCanvas("secStats", "secStats");
  can->Divide(1, 2);
  can->cd(1)->SetLogy((int)logScale);
  // TODO: potential memory leak, but I dont care
  TLegend* l = new TLegend(0.15, 0.7, 0.3, 0.9);
 
  TH1* hbuff = h_2hits.DrawCopy();
  l->AddEntry(hbuff, "all from first map", "lpf");
  hbuff = h_2hits_matched.DrawCopy("same");
  l->AddEntry(hbuff, "only matched ", "lpf");
  if (drawLegend) l->Draw();
 
  can->cd(2)->SetLogy((int)logScale);
  h_3hits.DrawCopy();
  h_3hits_matched.DrawCopy("same");
 
 
 
  // a stupid way of counting the number of sensors contained without having to invoke the geometry
  std::vector< std::unordered_map<std::string, int> > sensorsInLayer2Hits(6);
  for (const auto& entry : m_map_N2HitCombs) {
    VxdID id = FullSecID(entry.first).getVxdID();
    sensorsInLayer2Hits[id.getLayerNumber() - 1][(std::string)id ] = 1;
  }
  std::vector< std::unordered_map<std::string, int> > sensorsInLayer3Hits(6);
  for (const auto& entry : m_map_N3HitCombs) {
    VxdID id = FullSecID(entry.first).getVxdID();
    sensorsInLayer3Hits[id.getLayerNumber() - 1][(std::string)id] = 1;
  }
  // Reusing old histograms!
  for (int i = 1; i <= 6; i++) {
    // assumes binning is still the same for all hists!
    int bin = 0;
    bin = h_3hits.FindBin(i);
 
    int nSensors2Hits = sensorsInLayer2Hits[i - 1].size();
    int nSensors3Hits = sensorsInLayer3Hits[i - 1].size();
 
    if (nSensors2Hits > 0) {
      h_2hits.SetBinContent(bin, h_2hits.GetBinContent(bin) / nSensors2Hits);
      h_2hits_matched.SetBinContent(bin, h_2hits_matched.GetBinContent(bin) / nSensors2Hits);
    } else {
      B2WARNING("No sensors found in layer " << i);
    }
 
    if (nSensors3Hits > 0) {
      h_3hits.SetBinContent(bin, h_3hits.GetBinContent(bin) / nSensors3Hits);
      h_3hits_matched.SetBinContent(bin, h_3hits_matched.GetBinContent(bin) / nSensors3Hits);
    } else {
      B2WARNING("No sensors found in layer " << i);
    }
  }
 
  TCanvas* can2 = new TCanvas("ConPerSensor", "Connections per sensor");
  can2->Divide(1, 2);
  can2->cd(1)->SetLogy((int)logScale);
  // TODO: potential memory leak, but I dont care
  TLegend* l2 = new TLegend(0.15, 0.7, 0.3, 0.9);
 
  h_2hits.SetTitle("average number of 2Hit combinations per sensor starting at ith layer; layer; avg. connections/sensor");
  hbuff = h_2hits.DrawCopy();
  l2->AddEntry(hbuff, "all from first map", "lpf");
  hbuff = h_2hits_matched.DrawCopy("same");
  l2->AddEntry(hbuff, "only matched ", "lpf");
  if (drawLegend) l2->Draw();
 
  can2->cd(2)->SetLogy((int)logScale);
  h_3hits.SetTitle("average number of 3Hit combinations per sensor starting at ith layer; layer; avg. connections/sensor");
  h_3hits.DrawCopy();
  h_3hits_matched.DrawCopy("same");
 
 
 
  if (pdfFileName != "") {
    can->SaveAs(pdfFileName + "(");
    can2->SaveAs(pdfFileName + ")");
  }
 
}

setLeafAddresses()

void setLeafAddresses ( TTree *  t, std::unordered_map< std::string, double > &  filterVals, std::unordered_map< std::string, uint > &  SecIDVals  )

private

automatically sets the TLeaf addresses for a tree.

Currently only TLeafI and TLeafD are supported

Parameters

t	the tree for setting the addresses
filterVals	the targets for the TLeafD addresses, will be filled in the function
SecIDVals	the targets for the TLeafI addresses, will be filled in the function

Definition at line 51 of file SectorMapComparer.cc.

{
  TObjArray* leafList = t->GetListOfLeaves();
  for (TObject* o : *leafList) {
    TLeaf* l = (TLeaf*)o;
    std::string name = l->GetName();
    // cannot use TClass pointer here as it is TLeaf and not TLeafD or TLeafI, ClassName is virtual (gives the name of the derived)
    TString classname = l->ClassName();
 
    // filter leafs of type TLeafI (sector IDs) from the
    if (classname.EqualTo("TLeafI")) {
      SecIDVals[name] = 0;
      l->SetAddress(&(SecIDVals[name]));
    } else if (classname.EqualTo("TLeafD")) {
      filterVals[name] = 0.0;
      l->SetAddress(&(filterVals[name]));
    } else {
      B2WARNING("Unsupported TLeaf type: " << l->ClassName() << ". Will skip this TLeaf.");
    }
 
  }
}

showFiles()

void showFiles ( )

inline

lists the names of the files which are used

Definition at line 85 of file SectorMapComparer.h.

    {
      B2INFO("Following files will be compared:");
      B2INFO("=================================");
      B2INFO("First : " << m_SMFileName_first);
      B2INFO("Second: " << m_SMFileName_second);
    }

showSetups() [1/2]

void showSetups ( )

inline

lists all setups of sectormaps included in the two files

Definition at line 73 of file SectorMapComparer.h.

    {
      std::cout << std::endl;
      showSetups(m_SMFileName_first);
      std::cout << std::endl;
      showSetups(m_SMFileName_second);
    }

showSetups() [2/2]

void showSetups

(

TString

sectorMapFileName

)

lists all sector map setups in the specified file

Definition at line 232 of file SectorMapComparer.cc.

{
  TFile* f = TFile::Open(secmapFileName);
  if (!f->IsOpen()) {
    B2WARNING("File not opened: " << secmapFileName);
    return;
  }
 
  TTree* t = (TTree*)f->Get(m_setupsTreeName.c_str());
  if (t == nullptr) {
    B2WARNING("tree not found! tree name: " << m_setupsTreeName);
    return;
  }
 
  TString* setupKeyName = nullptr;
  t->SetBranchAddress(m_setupsBranchName.c_str(), & setupKeyName);
  if (setupKeyName == nullptr) {
    B2WARNING("setupKeyName not found");
    return;
  } else {
    std::cout << "Following setups found for file: " << secmapFileName << std::endl;
    std::cout << "================================ " << std::endl;
    for (long i = 0; i < t->GetEntries(); ++i) {
      t->GetEntry(i);
      std::cout << (*setupKeyName) << std::endl;
    }
 
    delete setupKeyName;
  }
}

Member Data Documentation

m_histo_map_diff

std::unordered_map<std::string, TH1F> m_histo_map_diff

private

histograms that store differences between the two sector maps

Definition at line 157 of file SectorMapComparer.h.

m_histo_map_first

std::unordered_map<std::string, TH1F> m_histo_map_first

private

histograms for the first sector map

Definition at line 155 of file SectorMapComparer.h.

m_histo_map_range_first

std::unordered_map<std::string, TH1F> m_histo_map_range_first

private

histograms that store the range of that filter (max - min)

Definition at line 158 of file SectorMapComparer.h.

m_histo_map_range_second

std::unordered_map<std::string, TH1F> m_histo_map_range_second

private

histograms that store the range of that filter (max - min)

Definition at line 159 of file SectorMapComparer.h.

m_histo_map_second

std::unordered_map<std::string, TH1F> m_histo_map_second

private

histograms for the second sector map

Definition at line 156 of file SectorMapComparer.h.

m_isCompared

bool m_isCompared = false

private

remember if CompareMaps already has been run, to give warnings if functions are called that need CompareMaps to have run

Definition at line 180 of file SectorMapComparer.h.

m_map_N2HitCombs

std::unordered_map<uint, uint> m_map_N2HitCombs

private

count the number of 2Hit connections for each sector,

Definition at line 162 of file SectorMapComparer.h.

m_map_N2HitCombs_matched

std::unordered_map<uint, uint> m_map_N2HitCombs_matched

private

count the number of 2Hit connections for each sector, only if sector combination was "matched" (Note: meaning of "matched" depends on the setting)

Definition at line 164 of file SectorMapComparer.h.

m_map_N3HitCombs

std::unordered_map<uint, uint> m_map_N3HitCombs

private

count the number of 3Hit connections for each sector, can be used to do some statistics

Definition at line 167 of file SectorMapComparer.h.

m_map_N3HitCombs_matched

std::unordered_map<uint, uint> m_map_N3HitCombs_matched

private

count the number of 3Hit connections for each sector, only if sector combination was "matched" (Note: meaning of "matched" depends on the setting)

Definition at line 169 of file SectorMapComparer.h.

m_setupsBranchName

std::string m_setupsBranchName = "name"

private

name of the branch in the setups tree that holds the names of the setups

Definition at line 177 of file SectorMapComparer.h.

m_setupsTreeName

std::string m_setupsTreeName = "Setups"

private

name of the tree all the setups are stored

Definition at line 176 of file SectorMapComparer.h.

m_SMFileName_first

std::string m_SMFileName_first

private

name of the file containing the first sectormap

Definition at line 173 of file SectorMapComparer.h.

m_SMFileName_second

std::string m_SMFileName_second

private

name of the file containing the second sectormap

Definition at line 174 of file SectorMapComparer.h.

---

The documentation for this class was generated from the following files:

• tracking/trackFindingVXD/sectorMapTools/include/SectorMapComparer.h
• tracking/trackFindingVXD/sectorMapTools/src/SectorMapComparer.cc