TrigFTF_GNN_Geometry Class Reference

#include <GNN_Geometry.h>

Collaboration diagram for TrigFTF_GNN_Geometry:

Public Member Functions
	TrigFTF_GNN_Geometry (const std::vector< TrigInDetSiLayer > &, const std::unique_ptr< GNN_FasTrackConnector > &)
	~TrigFTF_GNN_Geometry ()
const TrigFTF_GNN_Layer *	getTrigFTF_GNN_LayerByKey (unsigned int) const
const TrigFTF_GNN_Layer *	getTrigFTF_GNN_LayerByIndex (int) const
unsigned int	getTrigFTF_GNN_LayerKeyByIndex (int idx) const
int	num_bins () const
unsigned int	num_layers () const
const std::vector< std::pair< int, std::vector< int > > > &	bin_groups () const

Protected Member Functions
const TrigFTF_GNN_Layer *	addNewLayer (const TrigInDetSiLayer &, int)

Protected Attributes
float	m_etaBinWidth
std::map< unsigned int, TrigFTF_GNN_Layer * >	m_layMap
std::vector< TrigFTF_GNN_Layer * >	m_layArray
std::vector< unsigned int >	m_layerKeys
int	m_nEtaBins
std::vector< std::pair< int, std::vector< int > > >	m_binGroups

Detailed Description

Definition at line 48 of file GNN_Geometry.h.

Constructor & Destructor Documentation

TrigFTF_GNN_Geometry()

TrigFTF_GNN_Geometry::TrigFTF_GNN_Geometry	(	const std::vector< TrigInDetSiLayer > &	layers,
		const std::unique_ptr< GNN_FasTrackConnector > &	conn )

Definition at line 300 of file GNN_Geometry.cxx.

                                                                                                                                      : m_nEtaBins(0) {
 
  const float min_z0 = -168.0;
  const float max_z0 =  168.0;
  
  m_etaBinWidth = conn->m_etaBin;
 
  for(const auto& layer : layers) {
    const TrigFTF_GNN_Layer* pL = addNewLayer(layer, m_nEtaBins);
    m_nEtaBins += pL->num_bins();
  }
 
  //calculating bin tables in the connector...
  //calculate bin pairs for graph edge building
 
  int lastBin1 = -1;
  
  for(std::map<int, std::vector<GNN_FASTRACK_CONNECTION*> >::const_iterator it = conn->m_connMap.begin();it!=conn->m_connMap.end();++it) {
 
    const std::vector<GNN_FASTRACK_CONNECTION*>& vConn = (*it).second;
 
    for(std::vector<GNN_FASTRACK_CONNECTION*>::const_iterator cIt=vConn.begin();cIt!=vConn.end();++cIt) {
      
      unsigned int src = (*cIt)->m_src;//n2 : the new connectors
      unsigned int dst = (*cIt)->m_dst;//n1
      
      const TrigFTF_GNN_Layer* pL1 = getTrigFTF_GNN_LayerByKey(dst);
      const TrigFTF_GNN_Layer* pL2 = getTrigFTF_GNN_LayerByKey(src);
      
      if (pL1==nullptr) {
    std::cout << " skipping invalid dst layer " << dst << std::endl; 
      continue; 
      }
      if (pL2==nullptr) {
    std::cout << " skipping invalid src layer " << src << std::endl; 
      continue; 
      }
      int nSrcBins = pL2->m_bins.size();
      int nDstBins = pL1->m_bins.size();
      
      (*cIt)->m_binTable.resize(nSrcBins*nDstBins, 0);
 
      for(int b1=0;b1<nDstBins;b1++) {//loop over bins in Layer 1
    for(int b2=0;b2<nSrcBins;b2++) {//loop over bins in Layer 2
      if(!pL1->verifyBin(pL2, b1, b2, min_z0, max_z0)) continue;
      int address = b1 + b2*nDstBins;
      (*cIt)->m_binTable.at(address) = 1;
 
       int bin1_idx = pL1->m_bins.at(b1);
       int bin2_idx = pL2->m_bins.at(b2);
       
       if(bin1_idx != lastBin1) {//adding a new group
 
         std::vector<int> v2(1, bin2_idx);
         m_binGroups.push_back(std::make_pair(bin1_idx, v2));
         lastBin1 = bin1_idx;
 
       }
       else {//extend the last group
         (*m_binGroups.rbegin()).second.push_back(bin2_idx);
       }
    }
      }
    }
  }
 
  // find stages of eta-bin pairs using the graph ablation algorithm
 
  std::map<int, std::pair<std::list<int>, std::list<int> > > bin_map;
 
  // 1. create a map of bin-to-bin connections
 
  //initialize with empty links
  
  for (const auto& bg : m_binGroups) {
 
    int bin1 = bg.first;
 
    if (bin_map.find(bin1) == bin_map.end()) {//add to the map
      std::pair<std::list<int>, std::list<int> > empty_links;
      bin_map.insert(std::make_pair(bin1, empty_links));
    }
 
    std::pair<std::list<int>, std::list<int> >& bin1_links = (*bin_map.find(bin1)).second;
 
    for (auto bin2 : bg.second) {
 
      if (bin_map.find(bin2) == bin_map.end()) {//add to the map
        std::pair<std::list<int>, std::list<int> > empty_links;
        bin_map.insert(std::make_pair(bin2, empty_links));
      }
 
      std::pair<std::list<int>, std::list<int> >& bin2_links = (*bin_map.find(bin2)).second;
 
      bin1_links.second.push_back(bin2);//incoming link bin1 <- bin2
      bin2_links.first.push_back(bin1); //outgoing link bin2 -> bin1
 
    } 
  }
  
  std::map<int, std::pair<std::list<int>, std::list<int> > > current_map(bin_map);//copy bin map as the original will be modified
 
  // 2. find stages starting from the last one (i.e. bin1 with no outgoing connections)
 
  std::vector<std::vector<int> > stages;
 
  stages.reserve(50);
 
  while (!current_map.empty()) {
 
    // 2a. find all bins with zero outgoing links
 
    std::vector<int> exit_bins;
 
    for(const auto& bl : current_map) {
 
      if(!bl.second.first.empty()) continue;
 
      exit_bins.push_back(bl.first);
      
    }
 
    //2b. add a new stage: vector of bin1
 
    stages.emplace_back(exit_bins);
 
    //2c. remove links : graph ablation
 
    for (auto bin1_key : exit_bins) {
      auto p1 = current_map.find(bin1_key);
      if (p1 == current_map.end()) continue;
      auto& bin1_links = (*p1).second;
 
      for(auto bin2_key : bin1_links.second) {
        auto p2 = current_map.find(bin2_key);
        if (p2 == current_map.end()) continue;
        std::list<int>& links = (*p2).second.first;
        links.remove(bin1_key);
      }
    }
 
    //2d. finally, remove all exit bin1s from the map
 
    for (auto bin1_key : exit_bins) {
      current_map.erase(bin1_key);
    }
 
  }
 
  //3. Refill binGroups with staged bin pair collections.
 
  m_binGroups.clear();
  
  for (auto iter = stages.rbegin(); iter != stages.rend(); ++iter) {//refill order is reverse to creation
 
    for (auto bin1_idx : (*iter)) {
      const auto p = bin_map.find(bin1_idx);
      if (p == bin_map.end()) continue;
      const std::list<int>& bin2_list = (*p).second.second;//bins which are incoming to bin1
 
      std::vector<int> v2(bin2_list.begin(), bin2_list.end());
      
      m_binGroups.push_back(std::make_pair(bin1_idx, v2));//store the group
 
    }
  }  
}

~TrigFTF_GNN_Geometry()

TrigFTF_GNN_Geometry::~TrigFTF_GNN_Geometry

(

)

Definition at line 469 of file GNN_Geometry.cxx.

                                            {
  for(std::vector<TrigFTF_GNN_Layer*>::iterator it =  m_layArray.begin();it!=m_layArray.end();++it) {
    delete (*it);
  }
  m_layMap.clear();m_layArray.clear();
}

Member Function Documentation

addNewLayer()

const TrigFTF_GNN_Layer * TrigFTF_GNN_Geometry::addNewLayer ( const TrigInDetSiLayer & l, int bin0 )

protected

Definition at line 490 of file GNN_Geometry.cxx.

                                                                                              {
 
  unsigned int layerKey = l.m_subdet;
 
  float ew = m_etaBinWidth;
  
  TrigFTF_GNN_Layer* pHL = new TrigFTF_GNN_Layer(l, ew, bin0);
  
  m_layMap.insert(std::pair<unsigned int, TrigFTF_GNN_Layer*>(layerKey, pHL));
  m_layArray.push_back(pHL);
  m_layerKeys.push_back(layerKey);
  return pHL;
}

bin_groups()

const std::vector< std::pair< int, std::vector< int > > > & TrigFTF_GNN_Geometry::bin_groups ( ) const

inline

Definition at line 60 of file GNN_Geometry.h.

{return m_binGroups;}

getTrigFTF_GNN_LayerByIndex()

const TrigFTF_GNN_Layer * TrigFTF_GNN_Geometry::getTrigFTF_GNN_LayerByIndex

(

int

idx

)

const

Definition at line 484 of file GNN_Geometry.cxx.

                                                                                        {
  return m_layArray.at(idx);
}

getTrigFTF_GNN_LayerByKey()

const TrigFTF_GNN_Layer * TrigFTF_GNN_Geometry::getTrigFTF_GNN_LayerByKey

(

unsigned int

key

)

const

Definition at line 476 of file GNN_Geometry.cxx.

                                                                                               {
  std::map<unsigned int, TrigFTF_GNN_Layer*>::const_iterator it = m_layMap.find(key);
  if(it == m_layMap.end()) {
    return nullptr;
  }
  return (*it).second;
}

getTrigFTF_GNN_LayerKeyByIndex()

unsigned int TrigFTF_GNN_Geometry::getTrigFTF_GNN_LayerKeyByIndex ( int idx ) const

inline

Definition at line 55 of file GNN_Geometry.h.

                                                                    {
    return m_layerKeys[idx];
  }

num_bins()

int TrigFTF_GNN_Geometry::num_bins ( ) const

inline

Definition at line 58 of file GNN_Geometry.h.

{return m_nEtaBins;}

num_layers()

unsigned int TrigFTF_GNN_Geometry::num_layers ( ) const

inline

Definition at line 59 of file GNN_Geometry.h.

{return m_layArray.size();}

Member Data Documentation

m_binGroups

std::vector<std::pair<int, std::vector<int> > > TrigFTF_GNN_Geometry::m_binGroups

protected

Definition at line 73 of file GNN_Geometry.h.

m_etaBinWidth

float TrigFTF_GNN_Geometry::m_etaBinWidth

protected

Definition at line 66 of file GNN_Geometry.h.

m_layArray

std::vector<TrigFTF_GNN_Layer*> TrigFTF_GNN_Geometry::m_layArray

protected

Definition at line 69 of file GNN_Geometry.h.

m_layerKeys

std::vector<unsigned int> TrigFTF_GNN_Geometry::m_layerKeys

protected

Definition at line 70 of file GNN_Geometry.h.

m_layMap

std::map<unsigned int, TrigFTF_GNN_Layer*> TrigFTF_GNN_Geometry::m_layMap

protected

Definition at line 68 of file GNN_Geometry.h.

m_nEtaBins

int TrigFTF_GNN_Geometry::m_nEtaBins

protected

Definition at line 71 of file GNN_Geometry.h.

---

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

• GNN_Geometry.h
• GNN_Geometry.cxx