TrigL2MuonSA::ClusterRoadDefiner Class Reference

#include <ClusterRoadDefiner.h>

Inheritance diagram for TrigL2MuonSA::ClusterRoadDefiner:

Collaboration diagram for TrigL2MuonSA::ClusterRoadDefiner:

Public Member Functions
	ClusterRoadDefiner (const std::string &type, const std::string &name, const IInterface *parent)
virtual StatusCode	initialize () override
StatusCode	defineRoad (const EventContext &ctx, const xAOD::MuonRoI *p_roi, std::vector< TrigL2MuonSA::MuonRoad > &clusterRoad, TrigL2MuonSA::RpcLayerClusters &rpcLayerClusters, const ToolHandle< ClusterPatFinder > *clusterPatFinder, std::vector< TrigL2MuonSA::RpcFitResult > &clusterFitResults, double roiEtaMinLow, double roiEtaMaxLow, double roiEtaMinHigh, double roiEtaMaxHigh) const
void	setRoadWidthForFailure (double rWidth_RPC_Failed)
void	setRpcGeometry (bool use_rpc)
ServiceHandle< StoreGateSvc > &	evtStore ()
	The standard StoreGateSvc (event store) Returns (kind of) a pointer to the StoreGateSvc.
const ServiceHandle< StoreGateSvc > &	detStore () const
	The standard StoreGateSvc/DetectorStore Returns (kind of) a pointer to the StoreGateSvc.
virtual StatusCode	sysInitialize () override
	Perform system initialization for an algorithm.
virtual StatusCode	sysStart () override
	Handle START transition.
virtual std::vector< Gaudi::DataHandle * >	inputHandles () const override
	Return this algorithm's input handles.
virtual std::vector< Gaudi::DataHandle * >	outputHandles () const override
	Return this algorithm's output handles.
Gaudi::Details::PropertyBase &	declareProperty (Gaudi::Property< T, V, H > &t)
void	updateVHKA (Gaudi::Details::PropertyBase &)
MsgStream &	msg () const
bool	msgLvl (const MSG::Level lvl) const

Protected Member Functions
void	renounceArray (SG::VarHandleKeyArray &handlesArray)
	remove all handles from I/O resolution
std::enable_if_t< std::is_void_v< std::result_of_t< decltype(&T::renounce)(T)> > &&!std::is_base_of_v< SG::VarHandleKeyArray, T > &&std::is_base_of_v< Gaudi::DataHandle, T >, void >	renounce (T &h)
void	extraDeps_update_handler (Gaudi::Details::PropertyBase &ExtraDeps)
	Add StoreName to extra input/output deps as needed.

Private Types
typedef ServiceHandle< StoreGateSvc >	StoreGateSvc_t

Private Member Functions
Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
	specialization for handling Gaudi::Property<SG::VarHandleKey>

Private Attributes
double	m_rWidth_RPC_Failed {0}
bool	m_use_rpc {true}
ToolHandle< IRegSelTool >	m_regionSelector {this, "RegionSelectionTool", "RegSelTool/RegSelTool_MDT", "MDT Region Selector Tool"}
ServiceHandle< Muon::IMuonIdHelperSvc >	m_idHelperSvc {this, "MuonIdHelperSvc", "Muon::MuonIdHleperSvc/MuonIdHelperSvc"}
StoreGateSvc_t	m_evtStore
	Pointer to StoreGate (event store by default)
StoreGateSvc_t	m_detStore
	Pointer to StoreGate (detector store by default)
std::vector< SG::VarHandleKeyArray * >	m_vhka
bool	m_varHandleArraysDeclared

Detailed Description

Definition at line 33 of file ClusterRoadDefiner.h.

Member Typedef Documentation

StoreGateSvc_t

typedef ServiceHandle<StoreGateSvc> AthCommonDataStore< AthCommonMsg< AlgTool > >::StoreGateSvc_t

privateinherited

Definition at line 388 of file AthCommonDataStore.h.

Constructor & Destructor Documentation

ClusterRoadDefiner()

TrigL2MuonSA::ClusterRoadDefiner::ClusterRoadDefiner	(	const std::string &	type,
		const std::string &	name,
		const IInterface *	parent )

Definition at line 13 of file ClusterRoadDefiner.cxx.

                                                                               :
  AthAlgTool(type, name, parent)
{
}

Member Function Documentation

declareGaudiProperty()

Gaudi::Details::PropertyBase & AthCommonDataStore< AthCommonMsg< AlgTool > >::declareGaudiProperty ( Gaudi::Property< T, V, H > & hndl, const SG::VarHandleKeyType &  )

inlineprivateinherited

specialization for handling Gaudi::Property<SG::VarHandleKey>

Definition at line 156 of file AthCommonDataStore.h.

  {
    return *AthCommonDataStore<PBASE>::declareProperty(hndl.name(),
                                                       hndl.value(), 
                                                       hndl.documentation());
 
  }

declareProperty()

Gaudi::Details::PropertyBase & AthCommonDataStore< AthCommonMsg< AlgTool > >::declareProperty ( Gaudi::Property< T, V, H > & t )

inlineinherited

Definition at line 145 of file AthCommonDataStore.h.

                                                                     {
    typedef typename SG::HandleClassifier<T>::type htype;
    return AthCommonDataStore<PBASE>::declareGaudiProperty(t, htype());
  }

defineRoad()

StatusCode TrigL2MuonSA::ClusterRoadDefiner::defineRoad	(	const EventContext &	ctx,
		const xAOD::MuonRoI *	p_roi,
		std::vector< TrigL2MuonSA::MuonRoad > &	clusterRoad,
		TrigL2MuonSA::RpcLayerClusters &	rpcLayerClusters,
		const ToolHandle< ClusterPatFinder > *	clusterPatFinder,
		std::vector< TrigL2MuonSA::RpcFitResult > &	clusterFitResults,
		double	roiEtaMinLow,
		double	roiEtaMaxLow,
		double	roiEtaMinHigh,
		double	roiEtaMaxHigh ) const

Definition at line 35 of file ClusterRoadDefiner.cxx.

{
  const double ZERO_LIMIT = 1e-5;
  const int N_STATION = 3; //0:inner, 1:middle, 2:outer
 
  const int N_LAYER = 5; // 0: inner, 1: middle, 2: outer 4: BME 5: BMG
  const int N_SECTOR = 2; // 0: normal, 1:overlap
 
  if (m_use_rpc) {
    std::vector< std::vector< double > > aw, bw;
    std::vector< double > clearRoad;
    clearRoad.clear();
    aw.assign(N_STATION, clearRoad);
    bw.assign(N_STATION, clearRoad);
    ATH_MSG_DEBUG("start searching eta pattern");
    if ( (*clusterPatFinder)->findPatternEta(aw, bw, rpcLayerClusters) ) {
      for(unsigned int iClus = 0; iClus < aw[1].size(); iClus++){
        TrigL2MuonSA::RpcFitResult clusFitResult;
        clusFitResult.Clear();
        clusFitResult.isSuccess = true;
        clusFitResult.offset_inner = (bw[0]).at(iClus);
        clusFitResult.offset_middle = (bw[1]).at(iClus);
        clusFitResult.offset_outer = (bw[2]).at(iClus);
        clusFitResult.slope_inner = 1.0/(aw[0]).at(iClus);
        clusFitResult.slope_middle = 1.0/(aw[1]).at(iClus);
        clusFitResult.slope_outer = 1.0/(aw[2]).at(iClus);
        ATH_MSG_DEBUG("==========================================================");
        ATH_MSG_DEBUG("inner clusterRoad slope/offset = " << clusFitResult.slope_inner << "/" << clusFitResult.offset_inner);
        ATH_MSG_DEBUG("middle clusterRoad slope/offset = " << clusFitResult.slope_middle << "/" << clusFitResult.offset_middle);
        ATH_MSG_DEBUG("outer clusterRoad slope/offset = " << clusFitResult.slope_outer << "/" << clusFitResult.offset_outer);
        for(int i=0;i<N_STATION;i++){
          if(std::abs(1.0/aw[i].at(iClus)) <= ZERO_LIMIT) clusFitResult.isSuccess = false;
        }
        clusterFitResults.push_back(clusFitResult);
      }
      ATH_MSG_DEBUG("==========================================================");
    } else {
      TrigL2MuonSA::RpcFitResult clusFitResult;
      clusFitResult.Clear();
      clusFitResult.isSuccess = false;
      clusterFitResults.push_back(clusFitResult);
    }
 
    ATH_MSG_DEBUG("start searching phi pattern");
    std::vector<double> phi_middle, phi_outer;
    phi_middle.clear(); phi_outer.clear();
    if ( (*clusterPatFinder)->findPatternPhi(phi_middle, phi_outer, rpcLayerClusters) ){
      double phi_middle_tot = 0;
      double phi_outer_tot = 0;
      size_t npatternPhi = phi_middle.size();
      if(npatternPhi > 0){
        for(double& phi : phi_middle){
          phi_middle_tot = phi_middle_tot + phi;
        }
        for(double& phi : phi_outer){
          phi_outer_tot = phi_outer_tot + phi;
        }
        double phi_middle_center = phi_middle_tot/npatternPhi;
        double phi_outer_center = phi_outer_tot/npatternPhi;
        ATH_MSG_DEBUG("center of phi middle/outer = " << phi_middle_center << "/" << phi_outer_center);
        for(unsigned int iClus_fit = 0; iClus_fit < clusterFitResults.size(); iClus_fit++){
          clusterFitResults.at(iClus_fit).phi = phi_middle_center;
          clusterFitResults.at(iClus_fit).phi_middle = phi_middle_center;
          clusterFitResults.at(iClus_fit).phi_outer = phi_outer_center;
        }
      } else {
        for(unsigned int iClus_fit = 0; iClus_fit < clusterFitResults.size(); iClus_fit++){
          clusterFitResults.at(iClus_fit).phi = p_roi->phi();
          clusterFitResults.at(iClus_fit).phi_middle = p_roi->phi();
          clusterFitResults.at(iClus_fit).phi_outer = p_roi->phi();
        }
      }
    } else {
      for(unsigned int iClus_fit = 0; iClus_fit < clusterFitResults.size(); iClus_fit++){
        clusterFitResults.at(iClus_fit).phi = p_roi->phi();
      }
    }
  }
  if(clusterFitResults.empty()){
    TrigL2MuonSA::RpcFitResult clusFitResult;
    clusFitResult.Clear();
    clusFitResult.isSuccess = false;
    clusFitResult.phi = p_roi->phi();
    clusterFitResults.push_back(clusFitResult);
  }
 
  ATH_MSG_DEBUG("stored cluster eta/phi pattern to clusterRoad");
  for(unsigned int iClus_fit = 0; iClus_fit < clusterFitResults.size(); iClus_fit++){
    TrigL2MuonSA::MuonRoad muonRoad;
    muonRoad.Clear();
    // RPC data is not available -> use RoI
 
    muonRoad.isEndcap   = false;
    muonRoad.phiMiddle  = clusterFitResults.at(iClus_fit).phi;
    muonRoad.phiRoI     = p_roi->phi();
    muonRoad.side       = (p_roi->phi()<0.)? 0 : 1;
    muonRoad.LargeSmall = ((p_roi->getSectorID() + 1)/2 )%2;
 
    int PhysicsSector = ((p_roi->getSectorID() + 1)/4 )%8 + 1;
 
    int special = 0;
    if (muonRoad.LargeSmall == 0 && (PhysicsSector == 6 || PhysicsSector == 8 ))
      special = 1;
    else if (muonRoad.LargeSmall == 1 && (PhysicsSector == 6 || PhysicsSector == 7 ))
      special = 1;
    muonRoad.Special = special;
 
    for (int i_station=0; i_station<6; i_station++) {
      for (int i_layer=0; i_layer<8; i_layer++) {
        if(!clusterFitResults.at(iClus_fit).isSuccess) {
          if (i_station==0)      muonRoad.rWidth[i_station][i_layer] = 500;//for inner
          else if (i_station==1) muonRoad.rWidth[i_station][i_layer] = 650;//for middle
          else if (i_station==2) muonRoad.rWidth[i_station][i_layer] = 800;//for outer
          else if (i_station==3) muonRoad.rWidth[i_station][i_layer] = 500;//EndcapInner
          else if (i_station==4) muonRoad.rWidth[9][i_layer] = 650;//BME
          else if (i_station==5) muonRoad.rWidth[10][i_layer] = 650;//BMG
          else muonRoad.rWidth[i_station][i_layer] = m_rWidth_RPC_Failed;
        }
        else {
          if (i_station==0)      muonRoad.rWidth[i_station][i_layer] = 400;//for inner
          else if (i_station==1) muonRoad.rWidth[i_station][i_layer] = 200;//for middle
          else if (i_station==2) muonRoad.rWidth[i_station][i_layer] = 400;//for outer
          else if (i_station==3) muonRoad.rWidth[i_station][i_layer] = 400;//EndcapInner
          else if (i_station==4) muonRoad.rWidth[9][i_layer] = m_rWidth_RPC_Failed;//BME
          else if (i_station==5) muonRoad.rWidth[10][i_layer] = m_rWidth_RPC_Failed;//BMG
          else muonRoad.rWidth[i_station][i_layer] = m_rWidth_RPC_Failed;
        }
      }
    }
    int sector_trigger = 99;
    int sector_overlap = 99;
    std::vector<Identifier> stationList;
    std::vector<IdentifierHash> mdtHashList;
 
    // get sector_trigger and sector_overlap by using the region selector
    IdContext context = m_idHelperSvc->mdtIdHelper().module_context();
 
    double etaMin =  p_roi->eta()-.02;
    double etaMax =  p_roi->eta()+.02;
    double phiMin = muonRoad.phiMiddle-.01;
    double phiMax = muonRoad.phiMiddle+.01;
    if(phiMax > M_PI) phiMax -= M_PI*2.;
    if(phiMin < M_PI*-1) phiMin += M_PI*2.;
 
    TrigRoiDescriptor* roi = new TrigRoiDescriptor( p_roi->eta(), etaMin, etaMax, p_roi->phi(), phiMin, phiMax );
 
    const IRoiDescriptor* iroi = static_cast<IRoiDescriptor*> (roi);
 
    if (iroi) m_regionSelector->lookup(ctx)->HashIDList(*iroi, mdtHashList);
    else {
      TrigRoiDescriptor fullscan_roi( true );
      m_regionSelector->lookup(ctx)->HashIDList(fullscan_roi, mdtHashList);
    }
 
    if(roi) delete roi;
 
    for( const IdentifierHash& hash : mdtHashList){
 
      Identifier id;
      const int convert = m_idHelperSvc->mdtIdHelper().get_id(hash, id, &context);
 
      if(convert!=0) ATH_MSG_ERROR("problem converting hash list to id");
 
      muonRoad.stationList.push_back(id);
      const int stationPhi = m_idHelperSvc->mdtIdHelper().stationPhi(id);
      std::string name = m_idHelperSvc->mdtIdHelper().stationNameString(m_idHelperSvc->mdtIdHelper().stationName(id));
 
      if ( name[1]=='M' && name[2]=='E' ) continue;//exclude BME
      else if ( name[1]=='M' && name[2]=='G' ) continue;//exclude BMG
 
      int LargeSmall = 0;
      if(name[2]=='S' || name[2]=='F' || name[2]=='G' ) LargeSmall = 1;
      int sector = (stationPhi-1)*2 + LargeSmall;
      if(sector_trigger == 99)
        sector_trigger = sector;
      else if(sector_trigger != sector)
        sector_overlap = sector;
    }
 
    int MDT_tr = (PhysicsSector - 1)*2 + muonRoad.LargeSmall;
    if (MDT_tr == sector_overlap) {
      sector_overlap = sector_trigger;
      sector_trigger = MDT_tr;
    }
 
    muonRoad.MDT_sector_trigger = sector_trigger;
    muonRoad.MDT_sector_overlap = sector_overlap;
 
    if (clusterFitResults.at(iClus_fit).isSuccess) {
      for (int i_sector=0; i_sector<N_SECTOR; i_sector++) {
        muonRoad.aw[0][i_sector] = clusterFitResults.at(iClus_fit).slope_inner;
        muonRoad.bw[0][i_sector] = clusterFitResults.at(iClus_fit).offset_inner;
        muonRoad.aw[1][i_sector] =  clusterFitResults.at(iClus_fit).slope_middle;
        muonRoad.bw[1][i_sector] = clusterFitResults.at(iClus_fit).offset_middle;
        muonRoad.aw[2][i_sector] =  clusterFitResults.at(iClus_fit).slope_outer;
        muonRoad.bw[2][i_sector] = clusterFitResults.at(iClus_fit).offset_outer;
        muonRoad.aw[3][i_sector] = clusterFitResults.at(iClus_fit).slope_inner; // Endcap Inner
        muonRoad.bw[3][i_sector] = clusterFitResults.at(iClus_fit).offset_inner;
        muonRoad.aw[9][i_sector] = clusterFitResults.at(iClus_fit).slope_middle;//BME
        muonRoad.bw[9][i_sector] = clusterFitResults.at(iClus_fit).offset_middle;
        muonRoad.aw[10][i_sector] = clusterFitResults.at(iClus_fit).slope_middle;//BMG
        muonRoad.bw[10][i_sector] = clusterFitResults.at(iClus_fit).offset_middle;
      }
    } else {
      double roiEtaLow = (roiEtaMinLow + roiEtaMaxLow) * 0.5;
      double roiEtaHigh = (roiEtaMinHigh + roiEtaMaxHigh) * 0.5;
      double thetaLow  = std::atan(std::exp(-std::abs(roiEtaLow)))*2.;
      double thetaHigh  = std::atan(std::exp(-std::abs(roiEtaHigh)))*2.;
      double awLow     = (std::abs(roiEtaLow) > ZERO_LIMIT)? std::tan(thetaLow)*(std::abs(roiEtaLow)/roiEtaLow): 0.;
      double awHigh     = (std::abs(roiEtaHigh) > ZERO_LIMIT)? std::tan(thetaHigh)*(std::abs(roiEtaHigh)/roiEtaHigh): 0.;
 
      for (int i_station=0; i_station<N_LAYER; i_station++) {
        for (int i_sector=0; i_sector<N_SECTOR; i_sector++) {
          muonRoad.aw[i_station][i_sector] = awLow;
          muonRoad.bw[i_station][i_sector] = 0;
          if (i_station==2) muonRoad.aw[i_station][i_sector] = awHigh;
          else if (i_station==3) muonRoad.aw[i_station][i_sector] = awLow; //EI
          else if (i_station==4) muonRoad.aw[9][i_sector] = awLow; //BME
          else if (i_station==5) muonRoad.aw[10][i_sector] = awLow; //BMG
        }
      }
    }
    clusterRoad.push_back(muonRoad);
  }
  ATH_MSG_DEBUG("finished ClusterRoadDefiner algorithm... leave");
  return StatusCode::SUCCESS;
}

detStore()

const ServiceHandle< StoreGateSvc > & AthCommonDataStore< AthCommonMsg< AlgTool > >::detStore ( ) const

inlineinherited

The standard StoreGateSvc/DetectorStore Returns (kind of) a pointer to the StoreGateSvc.

Definition at line 95 of file AthCommonDataStore.h.

{ return m_detStore; }

evtStore()

ServiceHandle< StoreGateSvc > & AthCommonDataStore< AthCommonMsg< AlgTool > >::evtStore ( )

inlineinherited

The standard StoreGateSvc (event store) Returns (kind of) a pointer to the StoreGateSvc.

Definition at line 85 of file AthCommonDataStore.h.

{ return m_evtStore; }

extraDeps_update_handler()

void AthCommonDataStore< AthCommonMsg< AlgTool > >::extraDeps_update_handler ( Gaudi::Details::PropertyBase & ExtraDeps )

protectedinherited

Add StoreName to extra input/output deps as needed.

use the logic of the VarHandleKey to parse the DataObjID keys supplied via the ExtraInputs and ExtraOuputs Properties to add the StoreName if it's not explicitly given

initialize()

StatusCode TrigL2MuonSA::ClusterRoadDefiner::initialize ( )

overridevirtual

Definition at line 23 of file ClusterRoadDefiner.cxx.

{
  ATH_CHECK(m_idHelperSvc.retrieve());
  ATH_CHECK(m_regionSelector.retrieve());
  ATH_MSG_DEBUG("Retrieved the RegionSelector tool ");
 
  return StatusCode::SUCCESS;
}

inputHandles()

virtual std::vector< Gaudi::DataHandle * > AthCommonDataStore< AthCommonMsg< AlgTool > >::inputHandles ( ) const

overridevirtualinherited

Return this algorithm's input handles.

We override this to include handle instances from key arrays if they have not yet been declared. See comments on updateVHKA.

msg()

MsgStream & AthCommonMsg< AlgTool >::msg ( ) const

inlineinherited

Definition at line 24 of file AthCommonMsg.h.

                                {
    return this->msgStream();
  }

msgLvl()

bool AthCommonMsg< AlgTool >::msgLvl ( const MSG::Level lvl ) const

inlineinherited

Definition at line 30 of file AthCommonMsg.h.

                                               {
    return this->msgLevel(lvl);
  }

outputHandles()

virtual std::vector< Gaudi::DataHandle * > AthCommonDataStore< AthCommonMsg< AlgTool > >::outputHandles ( ) const

overridevirtualinherited

Return this algorithm's output handles.

We override this to include handle instances from key arrays if they have not yet been declared. See comments on updateVHKA.

renounce()

std::enable_if_t< std::is_void_v< std::result_of_t< decltype(&T::renounce)(T)> > &&!std::is_base_of_v< SG::VarHandleKeyArray, T > &&std::is_base_of_v< Gaudi::DataHandle, T >, void > AthCommonDataStore< AthCommonMsg< AlgTool > >::renounce ( T & h )

inlineprotectedinherited

Definition at line 380 of file AthCommonDataStore.h.

  {
    h.renounce();
    PBASE::renounce (h);
  }

renounceArray()

void AthCommonDataStore< AthCommonMsg< AlgTool > >::renounceArray ( SG::VarHandleKeyArray & handlesArray )

inlineprotectedinherited

remove all handles from I/O resolution

Definition at line 364 of file AthCommonDataStore.h.

                                                          {
    handlesArray.renounce();
  }

setRoadWidthForFailure()

void TrigL2MuonSA::ClusterRoadDefiner::setRoadWidthForFailure ( double rWidth_RPC_Failed )

inline

Definition at line 53 of file ClusterRoadDefiner.h.

{ m_rWidth_RPC_Failed = rWidth_RPC_Failed; };

setRpcGeometry()

void TrigL2MuonSA::ClusterRoadDefiner::setRpcGeometry ( bool use_rpc )

inline

Definition at line 54 of file ClusterRoadDefiner.h.

{ m_use_rpc = use_rpc; };

sysInitialize()

virtual StatusCode AthCommonDataStore< AthCommonMsg< AlgTool > >::sysInitialize ( )

overridevirtualinherited

Perform system initialization for an algorithm.

We override this to declare all the elements of handle key arrays at the end of initialization. See comments on updateVHKA.

Reimplemented in asg::AsgMetadataTool, AthCheckedComponent< AthAlgTool >, AthCheckedComponent<::AthAlgTool >, and DerivationFramework::CfAthAlgTool.

sysStart()

virtual StatusCode AthCommonDataStore< AthCommonMsg< AlgTool > >::sysStart ( )

overridevirtualinherited

Handle START transition.

We override this in order to make sure that conditions handle keys can cache a pointer to the conditions container.

updateVHKA()

void AthCommonDataStore< AthCommonMsg< AlgTool > >::updateVHKA ( Gaudi::Details::PropertyBase & )

inlineinherited

Definition at line 308 of file AthCommonDataStore.h.

                                               {
    // debug() << "updateVHKA for property " << p.name() << " " << p.toString() 
    //         << "  size: " << m_vhka.size() << endmsg;
    for (auto &a : m_vhka) {
      std::vector<SG::VarHandleKey*> keys = a->keys();
      for (auto k : keys) {
        k->setOwner(this);
      }
    }
  }

Member Data Documentation

m_detStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< AlgTool > >::m_detStore

privateinherited

Pointer to StoreGate (detector store by default)

Definition at line 393 of file AthCommonDataStore.h.

m_evtStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< AlgTool > >::m_evtStore

privateinherited

Pointer to StoreGate (event store by default)

Definition at line 390 of file AthCommonDataStore.h.

m_idHelperSvc

ServiceHandle<Muon::IMuonIdHelperSvc> TrigL2MuonSA::ClusterRoadDefiner::m_idHelperSvc {this, "MuonIdHelperSvc", "Muon::MuonIdHleperSvc/MuonIdHelperSvc"}

private

Definition at line 61 of file ClusterRoadDefiner.h.

{this, "MuonIdHelperSvc", "Muon::MuonIdHleperSvc/MuonIdHelperSvc"};

m_regionSelector

ToolHandle<IRegSelTool> TrigL2MuonSA::ClusterRoadDefiner::m_regionSelector {this, "RegionSelectionTool", "RegSelTool/RegSelTool_MDT", "MDT Region Selector Tool"}

private

Definition at line 60 of file ClusterRoadDefiner.h.

{this, "RegionSelectionTool", "RegSelTool/RegSelTool_MDT", "MDT Region Selector Tool"};

m_rWidth_RPC_Failed

double TrigL2MuonSA::ClusterRoadDefiner::m_rWidth_RPC_Failed {0}

private

Definition at line 57 of file ClusterRoadDefiner.h.

{0};

m_use_rpc

bool TrigL2MuonSA::ClusterRoadDefiner::m_use_rpc {true}

private

Definition at line 58 of file ClusterRoadDefiner.h.

{true};

m_varHandleArraysDeclared

bool AthCommonDataStore< AthCommonMsg< AlgTool > >::m_varHandleArraysDeclared

privateinherited

Definition at line 399 of file AthCommonDataStore.h.

m_vhka

std::vector<SG::VarHandleKeyArray*> AthCommonDataStore< AthCommonMsg< AlgTool > >::m_vhka

privateinherited

Definition at line 398 of file AthCommonDataStore.h.

---

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

• ClusterRoadDefiner.h
• ClusterRoadDefiner.cxx