SubGraphID Class Reference

stores the ID of a subgraph, which is basically a chain of FullSecID coded as unsigned ints. More...

#include <SubGraphID.h>

Public Member Functions
bool	operator== (const SubGraphID &b) const
	overloaded '=='-operator
bool	operator< (const SubGraphID &b) const
	overloaded '<'-operator for sorting algorithms
	SubGraphID (const std::vector< unsigned > &idChain)
	constructor, mandatory iDChain musst at least contain one iD.
unsigned	size () const
	returns chainLength of this id.
std::vector< unsigned >::const_iterator	begin () const
	returns first entry of IDchain.
std::vector< unsigned >::const_iterator	end () const
	returns last entry of IDchain.
bool	checkSharesTrunk (const SubGraphID &b) const
	if both graphs have got the same IDs except the last one, they share a trunk.
std::string	print () const
	returns string of entries.
unsigned	isElementOf (const SubGraphID &b) const
	checks if given sectorPack ( >= 1 sector) is part of this, ignores subLayerID.
unsigned	isElementOf (const std::vector< unsigned > &b) const
	checks if given sectorPack ( >= 1 sector) is part of this, ignores subLayerID.
bool	hasElement (unsigned b) const
	checks if given raw secID is part of this, ignores subLayerID.
bool	areTheSameSectors (const SubGraphID &b) const
	checks if sectors are identical (while ignoring the subLayerID)
std::vector< unsigned >	hasSharedLayer () const
	returns raw IDs of entries being outer friend of sectors on same layer.
bool	updateID (unsigned newID)
	if newID is element of this (ignoring subLayerID), oldID will be replaced by newID. returns true, if an ID was replaced.
std::vector< FullSecID >	getFullSecIDs () const
	returns SecIDs coded as FullSecIDs:

Protected Member Functions
bool	areTheSameSector (unsigned a, unsigned b) const
	checks if two given ids are the same sector (while ignoring the sublayerID).

Protected Attributes
std::vector< unsigned >	m_idChain
	ids of this SubGraphID.

Detailed Description

stores the ID of a subgraph, which is basically a chain of FullSecID coded as unsigned ints.

Definition at line 24 of file SubGraphID.h.

Constructor & Destructor Documentation

SubGraphID()

SubGraphID ( const std::vector< unsigned > &  idChain )

inlineexplicit

constructor, mandatory iDChain musst at least contain one iD.

Sectors should be sorted from outer to inner sectors, please take care of that yourself since this is not checked internally.

Definition at line 68 of file SubGraphID.h.

                                                            : m_idChain(idChain)
    {
      if (m_idChain.empty()) { B2FATAL("SubGraphID-Constructor, given idChain is empty - illegal usage!"); }
    }

Member Function Documentation

areTheSameSector()

bool areTheSameSector ( unsigned  a, unsigned  b  ) const

inlineprotected

checks if two given ids are the same sector (while ignoring the sublayerID).

Definition at line 30 of file SubGraphID.h.

    {
      FullSecID idA(a);
      FullSecID idB(b);
      return idA.getVxdID() == idB.getVxdID() and idA.getSecID() == idB.getSecID();
    }

areTheSameSectors()

bool areTheSameSectors ( const SubGraphID &  b ) const

inline

checks if sectors are identical (while ignoring the subLayerID)

Definition at line 142 of file SubGraphID.h.

    {
      if (size() != b.size()) return false;
      for (unsigned i = 0; i < size(); i++) {
        if (areTheSameSector(m_idChain[i], b.m_idChain[i]) == false) return false;
      }
      return true;
    }

begin()

std::vector< unsigned >::const_iterator begin ( ) const

inline

returns first entry of IDchain.

Definition at line 79 of file SubGraphID.h.

{ return m_idChain.begin(); }

checkSharesTrunk()

bool checkSharesTrunk ( const SubGraphID &  b ) const

inline

if both graphs have got the same IDs except the last one, they share a trunk.

Definition at line 87 of file SubGraphID.h.

    {
      unsigned chainsize = m_idChain.size();
      if (b.size() != chainsize) { return false; }
 
      for (unsigned i = 0; i < chainsize - 1; i++) {
        if (b.m_idChain[i] != m_idChain[i]) { return false; }
      }
 
      return true;
    }

end()

std::vector< unsigned >::const_iterator end ( ) const

inline

returns last entry of IDchain.

Definition at line 83 of file SubGraphID.h.

{ return m_idChain.end(); }

getFullSecIDs()

std::vector< FullSecID > getFullSecIDs ( ) const

inline

returns SecIDs coded as FullSecIDs:

Definition at line 185 of file SubGraphID.h.

    {
      std::vector<FullSecID> ids;
 
      for (auto& id : m_idChain) {
        ids.push_back(FullSecID(id));
      }
      return ids;
    }

hasElement()

bool hasElement ( unsigned  b ) const

inline

checks if given raw secID is part of this, ignores subLayerID.

returns number of identical sectors

Definition at line 132 of file SubGraphID.h.

    {
      for (unsigned idA : m_idChain) {
        if (areTheSameSector(idA, b)) return true;
      }
      return false;
    }

hasSharedLayer()

std::vector< unsigned > hasSharedLayer ( ) const

inline

returns raw IDs of entries being outer friend of sectors on same layer.

This function assumes that the ids are sorted from outermost (= first) to innermost (= last) iD.

Definition at line 153 of file SubGraphID.h.

    {
      B2DEBUG(20, "hasSharedLayer-start with iD " << print() << ":");
      std::vector<unsigned> outerOnes;
      for (unsigned i = 0; i < size() - 1; i++) { // i: outer iD i+1: inner iD
        B2DEBUG(20, "found layerIDs for outer/inner: " << FullSecID(m_idChain[i]).getLayerID() << "/" << FullSecID(
                  m_idChain[i + 1]).getLayerID());
        if (FullSecID(m_idChain[i]).getLayerID() == FullSecID(m_idChain[i + 1]).getLayerID()) {
          outerOnes.push_back(m_idChain[i]);
          B2DEBUG(20, "hasSharedLayer good combi found with inner: " << FullSecID(m_idChain[i + 1]).getFullSecString() << ", storing outer: "
                  << FullSecID(m_idChain[i]).getFullSecString());
        }
      }
      return outerOnes;
    }

isElementOf() [1/2]

unsigned isElementOf ( const std::vector< unsigned > &  b ) const

inline

checks if given sectorPack ( >= 1 sector) is part of this, ignores subLayerID.

returns number of identical sectors

Definition at line 117 of file SubGraphID.h.

    {
      if (size() < b.size()) return 0;
 
      unsigned nIdentical = 0;
      for (unsigned idA : m_idChain) {
        for (unsigned idB : b) {
          if (areTheSameSector(idA, idB)) nIdentical++;
        }
      }
      return nIdentical;
    }

isElementOf() [2/2]

unsigned isElementOf ( const SubGraphID &  b ) const

inline

checks if given sectorPack ( >= 1 sector) is part of this, ignores subLayerID.

returns number of identical sectors

Definition at line 112 of file SubGraphID.h.

    { return isElementOf(b.m_idChain); }

operator<()

bool operator< ( const SubGraphID &  b ) const

inline

overloaded '<'-operator for sorting algorithms

Definition at line 54 of file SubGraphID.h.

    {
      // sorting: if outermost (== first) sector > of b.outermost this > b. If outermost == b.outermost, step is repeated until end of chain length is reached. last straw: longer chain is bigger.
      unsigned chainsize = m_idChain.size() < b.size() ? m_idChain.size() : b.size();
      for (unsigned i = 0 ; i < chainsize; i++) {
        if (m_idChain[i] < b.m_idChain[i]) return true;
        if (m_idChain[i] == b.m_idChain[i]) continue;
        return false;
      }
      return m_idChain.size() < b.size();
    }

operator==()

bool operator== ( const SubGraphID &  b ) const

inline

overloaded '=='-operator

Definition at line 40 of file SubGraphID.h.

    {
      unsigned chainsize = m_idChain.size();
      if (b.size() != chainsize) { return false; }
 
      for (unsigned i = 0; i < chainsize; i++) {
        if (b.m_idChain[i] != m_idChain[i]) { return false; }
      }
 
      return true;
    }

print()

std::string print ( ) const

inline

returns string of entries.

Definition at line 101 of file SubGraphID.h.

    {
      std::string out;
      for (unsigned iD : m_idChain) {
        out += FullSecID(iD).getFullSecString() + " ";
      }
      return out;
    }

size()

unsigned size ( ) const

inline

returns chainLength of this id.

Definition at line 75 of file SubGraphID.h.

{ return m_idChain.size(); }

updateID()

bool updateID ( unsigned  newID )

inline

if newID is element of this (ignoring subLayerID), oldID will be replaced by newID. returns true, if an ID was replaced.

Definition at line 171 of file SubGraphID.h.

    {
      for (unsigned& secID : m_idChain) {
        if (areTheSameSector(newID, secID) == false) continue;
        FullSecID tempID(secID);
        secID = FullSecID(tempID.getVxdID(), true, tempID.getSecID()).getFullSecID();
        return true;
      }
 
      return false;
    }

Member Data Documentation

m_idChain

std::vector<unsigned> m_idChain

protected

ids of this SubGraphID.

Definition at line 26 of file SubGraphID.h.

---

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

• tracking/trackFindingVXD/sectorMapTools/include/SubGraphID.h