This class factors out code common between LArEM_ID and LArEM_SuperCell_ID. More...

#include <LArEM_Base_ID.h>

Inheritance diagram for LArEM_Base_ID:

Collaboration diagram for LArEM_Base_ID:

Classes
class	HashCalc
	small class holding the starting hash value, the min eta and the number of phi bins of each region More...

Public Types
typedef Identifier::size_type	size_type

typedef std::vector< Identifier >::const_iterator	id_iterator
	Type for iterators over identifiers. More...

typedef boost::iterator_range< id_iterator >	id_range
	Type for range over identifiers. More...

enum	{ NOT_VALID =999999 }

enum	HelperType { HelperType::Unimplemented = -1, HelperType::Silicon = 0, HelperType::Pixel, HelperType::PLR, HelperType::SCT, HelperType::TRT, HelperType::LArEM, HelperType::LArFCal, HelperType::LArFCalSuperCell, HelperType::LArHEC, HelperType::LArHEC_SuperCell, HelperType::LARMiniFCal, HelperType::Tile, HelperType::TileSuperCell, HelperType::LArOnline, HelperType::LArOnlineSuperCell, HelperType::LArElectrode, HelperType::LArHVLine, HelperType::TileHardware, HelperType::TileTestbeam, HelperType::CaloCell, HelperType::CaloSuperCell, HelperType::CaloDM, HelperType::CaloLvl1, HelperType::GTower, HelperType::JTower, HelperType::Muon, HelperType::LUCID, HelperType::LUCID_Hardware, HelperType::Zdc, HelperType::ZdcHardware, HelperType::TT }
	enum class for eventual final derived types of this class More...

Public Member Functions
	LArEM_Base_ID (const std::string &name, const std::string &group, bool supercell)
	Constructor. More...

	~LArEM_Base_ID ()

Identifier	region_id (const ExpandedIdentifier &exp_id) const
	Build a cell identifier from an expanded identifier. More...

Identifier	channel_id (const ExpandedIdentifier &exp_id) const
	Build a cell identifier from an expanded identifier. More...

Identifier	region_id (int barrel_ec, int sampling, int region) const
	build a region identifier More...

Identifier	region_id (int barrel_ec, int sampling, int region, bool checks) const

Identifier	channel_id (int barrel_ec, int sampling, int region, int eta, int phi) const
	build a cell identifier More...

Identifier	channel_id (int barrel_ec, int sampling, int region, int eta, int phi, bool checks) const

Identifier	region_id (const Identifier channelId) const
	allows to know in which region is a channel/cell – valid for both kinds of channels More...

Identifier	channel_id (const Identifier regionId, int eta, int phi) const
	allows to build a cell id starting from a region id (e.g. More...

Identifier	channel_id (const Identifier regionId, int eta, int phi, bool checks) const

IdentifierHash	channel_hash (Identifier channelId) const
	create hash id from channel id More...

IdentifierHash	channel_hash_binary_search (Identifier channelId) const
	create hash id from channel id – method NOT optimised, please use channel_hash() above More...

id_iterator	reg_begin () const
	begin iterator over set of Region Identifiers More...

id_iterator	reg_end () const
	end iterator over set of Region Identifiers More...

id_range	reg_range () const
	Range over set of Region Identifiers. More...

id_iterator	em_begin () const
	begin iterator over full set of EM Identifiers More...

id_iterator	em_end () const
	end iterator over full set of EM Identifiers More...

id_range	em_range () const
	Range over full set of EM Identifiers. More...

const std::vector< Identifier > &	channel_ids () const
	provide access to channel id vector, accessed via hash More...

bool	is_em_barrel (const Identifier id) const
	test if the id belongs to the EM barrel More...

bool	is_em_endcap (const Identifier id) const
	test if the id belongs to the EM Endcap More...

bool	is_em_endcap_inner (const Identifier id) const
	test if the id belongs to the EM Endcap inner wheel More...

bool	is_em_endcap_outer (const Identifier id) const
	test if the id belongs to the EM Endcap outer wheel More...

int	barrel_ec (const Identifier id) const
	return barrel_ec according to : More...

int	sampling (const Identifier id) const
	return sampling according to : More...

int	region (const Identifier id) const
	return region according to : More...

int	eta (const Identifier id) const
	return eta according to : More...

int	phi (const Identifier id) const
	return phi according to : More...

bool	is_supercell (const Identifier id) const
	Test if the identifier represents a supercell. More...

int	eta_min (const Identifier regId) const
	min value of eta index (-999 == failure) More...

int	eta_max (const Identifier regId) const
	max value of eta index (-999 == failure) More...

int	phi_min (const Identifier regId) const
	min value of phi index (-999 == failure) More...

int	phi_max (const Identifier regId) const
	max value of phi index (-999 == failure) More...

int	initialize_base_from_dictionary (const IdDictMgr &dict_mgr, const std::string &group_name)
	initialization from the identifier dictionary More...

bool	twoSymSides () const
	True if the + and - sides of the calorimeter are identical (true layout). More...

int	get_neighbours (const IdentifierHash id, const LArNeighbours::neighbourOption &option, std::vector< IdentifierHash > &neighbourList) const
	access to hashes for neighbours return == 0 for neighbours found option = prevInPhi, nextInPhi, prevInEta, nextInEta, faces2D, corners2D, all2D, prevInSamp, nextInSamp, upAndDown, prevSubDet, nextSubDet, all3D More...

Identifier	region_id (IdentifierHash hashId) const
	Return the region Identifier for a given hash code (no checking). More...

IdentifierHash	region_hash (Identifier regionId) const
	Convert a connected region Identifier to a hash code. More...

Identifier	channel_id (IdentifierHash hashId) const
	Return the channel (cell) Identifier for a given hash code (no checking). More...

const HashGroup &	channels () const
	Return the `HashGroup` for channels (cells). More...

const HashGroup &	regions () const
	Return the `HashGroup` for regions. More...

Identifier	channel_id (IdentifierHash hashId) const
	Return the channel (cell) Identifier for a given hash code (no checking). More...

Identifier	region_id (IdentifierHash hashId) const
	Return the region Identifier for a given hash code (no checking). More...

IdentifierHash	region_hash (Identifier regionId) const
	Convert a connected region Identifier to a hash code. More...

virtual int	get_id (const IdentifierHash &hash_id, Identifier &id, const IdContext *context=0) const
	Convert a hash code to an Identifier for either channels or regions, depending on the context. More...

virtual int	get_hash (const Identifier &id, IdentifierHash &hash_id, const IdContext *context=0) const
	Convert an Identifier to a hash code for either channels or regions, depending on the context. More...

size_type	channel_hash_max () const
	One more than the largest channel (cell) hash code. More...

size_type	region_hash_max () const
	One more than the largest region hash code. More...

IdContext	channel_context () const
	Return the context for channels (cells). More...

IdContext	region_context () const
	Return the context for regions. More...

const std::vector< const IdDictRegion * > &	dictRegions () const
	Return the vector of `IdDictRegion`, accessed via region hash. More...

float	etaGranularity (const IdentifierHash regHash) const
	Return the eta granularity of a region, or `NOT_VALID`. More...

float	phiGranularity (const IdentifierHash regHash) const
	Return the phi granularity of a region, or `NOT_VALID`. More...

float	eta0 (const IdentifierHash regHash) const
	Return the minimum eta of region, or `NOT_VALID`. More...

float	phi0 (const IdentifierHash regHash) const
	Return the minimum phi of region, or `NOT_VALID`. More...

const std::string &	name () const
	Return the name for this helper. More...

IMessageSvc *	msgSvc ()
	Return the message service for this helper (may be null). More...

bool	msgLvl (const MSG::Level lvl) const
	Test the output level. More...

MsgStream &	msg () const
	The standard message stream. More...

MsgStream &	msg (const MSG::Level lvl) const
	The standard message stream. More...

void	setLevel (MSG::Level lvl)
	Change the current logging level. More...

Protected Member Functions
HashGroup &	channels ()
	Return the `HashGroup` for channels (cells). non-const. More...

HashGroup &	regions ()
	Return the `HashGroup` for regions. non-const. More...

const IdDictDictionary *	dict () const
	Return the dictionary for this subdetector. More...

int	fill_vec_of_dict_regions (const std::string &group_name="")
	Initialize the list of detector regions. More...

Private Types
enum	{ NOT_VALID_HASH = 256000 }

Private Member Functions
void	region_id_checks (int barrel_ec, int sampling, int region) const

void	channel_id_checks (int barrel_ec, int sampling, int region, int eta, int phi) const

void	channel_id_checks (const Identifier regionId, int eta, int phi) const

virtual int	get_expanded_id (const Identifier &id, ExpandedIdentifier &exp_id, const IdContext *context) const
	create expanded Identifier from Identifier (return == 0 for OK) More...

int	phi_min_init (const Identifier regId) const

int	initLevelsFromDict (const std::string &group_name)

int	init_hashes ()

int	get_prevInEta (const LArEM_region emRegion, const unsigned int &index, const short int &nPhi, const float &gPhi, const unsigned int &minHash, int &neighbourIndex, IdentifierHash neighbList, unsigned int &nBiggerCell) const

int	get_nextInEta (const LArEM_region emRegion, const unsigned int &index, const short int &nPhi, const float &gPhi, const unsigned int &maxHash, int &neighbourIndex, IdentifierHash neighbList, unsigned int &nBiggerCell) const

int	get_prevInSamp (const LArEM_region emRegion, const unsigned int &index, const short int &nPhi, const unsigned int &minHash, const double &gEta, const float &gPhi, const double &absEta, int &neighbourIndex, IdentifierHash neighbList) const

int	get_nextInSamp (const LArEM_region emRegion, const unsigned int &index, const short int &nPhi, const unsigned int &minHash, const double &gEta, const float &gPhi, const double &absEta, int &neighbourIndex, IdentifierHash neighbList) const

int	get_prevInSubdet (const LArEM_region emRegion, const unsigned int &index, const short int &nPhi, const unsigned int &minHash, const double &gEta, const float &gPhi, const double &absEta, int &neighbourIndex, IdentifierHash neighbList) const

int	get_nextInSubdet (const LArEM_region emRegion, const unsigned int &index, const short int &nPhi, const unsigned int &minHash, const double &gEta, const float &gPhi, const double &absEta, int &neighbourIndex, IdentifierHash neighbList) const

int	init_neighbors ()

	LArEM_Base_ID (const LArEM_Base_ID &)

LArEM_Base_ID &	operator= (const LArEM_Base_ID &)

void	initMessaging () const
	Initialize our message level and MessageSvc. More...

Static Private Member Functions
static int	get_prevInPhi (const LArEM_region emRegion, const unsigned int &index, const short int &nPhi, const unsigned int &minHash, int &neighbourIndex, IdentifierHash neighbList)

static int	get_nextInPhi (const LArEM_region emRegion, const unsigned int &index, const short int &nPhi, const unsigned int &minHash, int &neighbourIndex, IdentifierHash neighbList)

Private Attributes
unsigned	m_slar {0}

bool	m_two_sym_sides {true}

MultiRange	m_full_region_range

MultiRange	m_full_em_range

size_type	m_em_region_index {0}

size_type	m_LAR_INDEX {999}

size_type	m_EM_INDEX {999}

size_type	m_BEC_INDEX {999}

size_type	m_SAMPLING_INDEX {999}

size_type	m_REGION_INDEX {999}

size_type	m_ETA_INDEX {999}

size_type	m_PHI_INDEX {999}

size_type	m_SLAR_INDEX {999}

IdDictFieldImplementation	m_lar_impl

IdDictFieldImplementation	m_em_impl

IdDictFieldImplementation	m_bec_impl

IdDictFieldImplementation	m_sampling_impl

IdDictFieldImplementation	m_region_impl

IdDictFieldImplementation	m_eta_impl

IdDictFieldImplementation	m_phi_impl

IdDictFieldImplementation	m_slar_impl

std::vector< int >	m_vecOfPhiMin

std::vector< HashCalc >	m_hash_calcs

IdDictFieldImplementation	m_bec_reg_impl

std::vector< LArEM_region * >	m_vecOfRegions

std::vector< unsigned >	m_cells

std::string	m_name
	Name of this helper. More...

HashGroup	m_channels
	Group of channel (cell) Identifiers. More...

HashGroup	m_regions
	Group of region Identifiers. More...

const IdDictDictionary *	m_dict
	The dictionary for this helper. More...

std::vector< const IdDictRegion * >	m_vecOfDictRegions
	List of `IdDictRegion` objects. More...

std::string	m_nm
	Message source name. More...

boost::thread_specific_ptr< MsgStream >	m_msg_tls
	MsgStream instance (a std::cout like with print-out levels) More...

std::atomic< IMessageSvc * >	m_imsg { nullptr }
	MessageSvc pointer. More...

std::atomic< MSG::Level >	m_lvl { MSG::NIL }
	Current logging level. More...

std::atomic_flag m_initialized	ATLAS_THREAD_SAFE = ATOMIC_FLAG_INIT
	Messaging initialized (initMessaging) More...

Initialization and version name
virtual int	initialize_from_dictionary (const IdDictMgr &dict_mgr) override
	Initialization from the identifier dictionary. More...

virtual std::string	dictionaryVersion (void) const override

setting pointer to the MessageService
enum	ID { ATLAS_ID = static_cast<Identifier::value_type>(0), MAX_BIT = Identifier::MAX_BIT, PIXEL_MASK = static_cast<Identifier::value_type>(0xFF), ALL_BITS = Identifier::ALL_BITS }

std::string	m_dict_version

bool	m_is_initialized_from_dict {}

size_type	m_DET_INDEX {999}

size_type	m_SUBDET_INDEX {999}

size_type	m_MUON_SUBDET_INDEX {999}

int	m_INDET_ID {2}

int	m_LAR_ID {4}

int	m_TILE_ID {5}

int	m_MUON_ID {7}

int	m_CALO_ID {10}

int	m_PIXEL_ID {1}

int	m_SCT_ID {2}

int	m_TRT_ID {3}

int	m_HGTD_ID {4}

int	m_LUMI_ID {3}

int	m_LUMI_PLR_ID {1}

int	m_LAR_EM_ID {1}

int	m_LAR_HEC_ID {2}

int	m_LAR_FCAL_ID {3}

int	m_LAR_FCAL_MODULE_INDEX {999}

int	m_MDT_ID {0}

int	m_CSC_ID {1}

int	m_RPC_ID {2}

int	m_TGC_ID {3}

int	m_STGC_ID {4}

int	m_MM_ID {5}

int	m_FWD_ID {13}

int	m_ALFA_ID {1}

int	m_BCM_ID {3}

int	m_LUCID_ID {5}

int	m_ZDC_ID {7}

bool	m_isHighLuminosityLHC {}

Range::field	m_lvl1_field

Range::field	m_lvl1_onl_field

Range::field	m_lar_dm_field

Range::field	m_tile_dm_field

IdDictDictionary *	m_atlas_dict {}

IdDictDictionary *	m_indet_dict {}

IdDictDictionary *	m_lar_dict {}

IdDictDictionary *	m_tile_dict {}

IdDictDictionary *	m_muon_dict {}

IdDictDictionary *	m_calo_dict {}

IdDictDictionary *	m_fwd_dict {}

AtlasDetectorIDHelper *	m_helper {}

IdDictFieldImplementation	m_det_impl

IdDictFieldImplementation	m_indet_part_impl

IdDictFieldImplementation	m_calo_side_impl

IdDictFieldImplementation	m_lar_part_impl

IdDictFieldImplementation	m_lar_fcal_module_impl

IdDictFieldImplementation	m_muon_station_name_impl

IdDictFieldImplementation	m_muon_mdt_impl

IdDictFieldImplementation	m_muon_rpc_impl

IdDictFieldImplementation	m_fwd_part_impl

std::vector< unsigned int >	m_muon_tech_bits

virtual void	setMessageSvc (IMessageSvc *msgSvc) override

void	set_quiet (bool quiet)
	Set flag for suppressing informational output. More...

virtual void	setDictVersion (const IdDictMgr &dict_mgr, const std::string &name) override

std::string	to_range (const ExpandedIdentifier &id) const

std::string	fix_barrel_ec (const std::string &barrel_ec) const

ExpandedIdentifier	indet_exp (void) const
	Detector systems: More...

ExpandedIdentifier	lar_exp (void) const

ExpandedIdentifier	tile_exp (void) const

ExpandedIdentifier	muon_exp (void) const

ExpandedIdentifier	calo_exp (void) const

ExpandedIdentifier	fwd_exp (void) const

ExpandedIdentifier	pixel_exp (void) const
	Inner Detector: More...

ExpandedIdentifier	sct_exp (void) const

ExpandedIdentifier	trt_exp (void) const

ExpandedIdentifier	hgtd_exp (void) const

ExpandedIdentifier	lumi_exp (void) const

ExpandedIdentifier	lar_em_exp (void) const
	LAr. More...

ExpandedIdentifier	lar_hec_exp (void) const

ExpandedIdentifier	lar_fcal_exp (void) const

ExpandedIdentifier	alfa_exp (void) const
	Forward. More...

ExpandedIdentifier	bcm_exp (void) const

ExpandedIdentifier	lucid_exp (void) const

ExpandedIdentifier	zdc_exp (void) const

int	indet_field_value () const
	Provide efficient access to individual field values, for subclass idhelpers. More...

int	lar_field_value () const

int	tile_field_value () const

int	muon_field_value () const

int	calo_field_value () const

int	pixel_field_value () const

int	sct_field_value () const

int	trt_field_value () const

int	hgtd_field_value () const

int	lumi_field_value () const

int	plr_field_value () const

int	lar_em_field_value () const

int	lar_hec_field_value () const

int	lar_fcal_field_value () const

int	mdt_field_value () const

int	csc_field_value () const

int	rpc_field_value () const

int	tgc_field_value () const

int	stgc_field_value () const

int	mm_field_value () const

int	forward_field_value () const

int	alfa_field_value () const

int	bcm_field_value () const

int	lucid_field_value () const

int	zdc_field_value () const

int	register_dict_tag (const IdDictMgr &dict_mgr, const std::string &dict_name)
	Register the file and tag names for a particular IdDict dictionary. More...

bool	reinitialize (const IdDictMgr &dict_mgr)
	Test whether an idhelper should be reinitialized based on the change of tags. More...

std::string	m_group
	Group name. More...

bool	m_do_checks {}
	Flag for subclasses to know whether or not to perform checks. More...

bool	m_do_neighbours {true}
	Flag for subclasses to know whether or not to perform neighbour initialization. More...

IMessageSvc *	m_msgSvc {}
	pointer to the message service More...

bool	m_quiet {}
	If true, suppress DEBUG/INFO messages. More...

std::vector< std::string >	m_dict_names
	List of dictionary names used by this helper. More...

std::vector< std::string >	m_file_names
	List of dictionary file names used by this helper. More...

std::vector< std::string >	m_dict_tags
	List of dictionary versions used by this helper. More...

Detailed Description

This class factors out code common between LArEM_ID and LArEM_SuperCell_ID.

Definition at line 35 of file LArEM_Base_ID.h.

Member Typedef Documentation

◆ id_iterator

typedef std::vector<Identifier>::const_iterator LArEM_Base_ID::id_iterator

Type for iterators over identifiers.

Definition at line 80 of file LArEM_Base_ID.h.

◆ id_range

typedef boost::iterator_range<id_iterator> LArEM_Base_ID::id_range

Type for range over identifiers.

Definition at line 82 of file LArEM_Base_ID.h.

◆ size_type

typedef Identifier::size_type LArEM_Base_ID::size_type

Definition at line 38 of file LArEM_Base_ID.h.

Member Enumeration Documentation

◆ anonymous enum

anonymous enum

private

Enumerator
NOT_VALID_HASH

Definition at line 350 of file LArEM_Base_ID.h.

350 {NOT_VALID_HASH = 256000};

◆ anonymous enum

anonymous enum

inherited

Enumerator
NOT_VALID

Definition at line 36 of file CaloIDHelper.h.

36 { NOT_VALID=999999 };

◆ HelperType

enum AtlasDetectorID::HelperType

stronginherited

enum class for eventual final derived types of this class

Enumerator
Unimplemented
Silicon
Pixel
PLR
SCT
TRT
LArEM
LArFCal
LArFCalSuperCell
LArHEC
LArHEC_SuperCell
LARMiniFCal
Tile
TileSuperCell
LArOnline
LArOnlineSuperCell
LArElectrode
LArHVLine
TileHardware
TileTestbeam
CaloCell
CaloSuperCell
CaloDM
CaloLvl1
GTower
JTower
Muon
LUCID
LUCID_Hardware
Zdc
ZdcHardware
TT

Definition at line 55 of file AtlasDetectorID.h.

                          {
       Unimplemented = -1,
       Silicon = 0,
       Pixel, PLR, SCT, TRT, 
       //inherits from CaloIDHelper
       LArEM, LArFCal, LArFCalSuperCell,
       LArHEC, LArHEC_SuperCell, LARMiniFCal, 
       Tile, TileSuperCell,
       //
       //inherit from LArOnlineId
       LArOnline, LArOnlineSuperCell,
       //
       LArElectrode, LArHVLine,
       TileHardware, TileTestbeam, 
       CaloCell, CaloSuperCell,
       CaloDM, CaloLvl1,
       //inherit from JGTowerBase
       GTower, JTower,
       //
       Muon,
       LUCID, LUCID_Hardware, 
       Zdc,ZdcHardware,
       TT
     };

◆ ID

enum AtlasDetectorID::ID

privateinherited

Enumerator
ATLAS_ID
MAX_BIT
PIXEL_MASK
ALL_BITS

Definition at line 389 of file AtlasDetectorID.h.

                      { ATLAS_ID     = static_cast<Identifier::value_type>(0),
                MAX_BIT      = Identifier::MAX_BIT,
                // mask to distinguish a pixel id from lvl1 id (bit 1 set)
                PIXEL_MASK   = static_cast<Identifier::value_type>(0xFF),
                ALL_BITS     = Identifier::ALL_BITS };

Constructor & Destructor Documentation

◆ LArEM_Base_ID() [1/2]

LArEM_Base_ID::LArEM_Base_ID	(	const std::string &	name,
		const std::string &	group,
		bool	supercell
	)

Constructor.

If SUPERCELL is true, this helper is for supercells.

Definition at line 26 of file LArEM_Base_ID.cxx.

   : CaloIDHelper (name, group),
     m_slar (supercell ? 1 : 0)
 {
 }

◆ ~LArEM_Base_ID()

LArEM_Base_ID::~LArEM_Base_ID ( )

Definition at line 35 of file LArEM_Base_ID.cxx.

 {
   std::vector<LArEM_region*>::iterator first = m_vecOfRegions.begin();
   std::vector<LArEM_region*>::iterator last  = m_vecOfRegions.end();
   for (; first != last; ++first) delete (*first);
 }

◆ LArEM_Base_ID() [2/2]

LArEM_Base_ID::LArEM_Base_ID ( const LArEM_Base_ID & )

private

Member Function Documentation

◆ alfa_exp()

ExpandedIdentifier AtlasDetectorID::alfa_exp ( void ) const

inlineprotectedinherited

Forward.

Definition at line 578 of file AtlasDetectorID.h.

 {
     ExpandedIdentifier result(fwd_exp());
     return (result << m_ALFA_ID);
 }

◆ alfa_field_value()

int AtlasDetectorID::alfa_field_value ( ) const

inlineprotectedinherited

Definition at line 668 of file AtlasDetectorID.h.

668 {return (m_ALFA_ID);}

◆ barrel_ec()

int LArEM_Base_ID::barrel_ec ( const Identifier id ) const

return barrel_ec according to :

element           range              meaning
-------           -----              -------

barrel_ec        +/-1             positive/negative barrel - A/C side or P/M half barrel
"                +/-2             positive/negative endcap outer wheel - A/C side 
"                +/-3             positive/negative endcap inner wheel - A/C side

◆ bcm_exp()

ExpandedIdentifier AtlasDetectorID::bcm_exp ( void ) const

inlineprotectedinherited

Definition at line 585 of file AtlasDetectorID.h.

 {
     ExpandedIdentifier result(fwd_exp());
     return (result << m_BCM_ID);
 }

◆ bcm_field_value()

int AtlasDetectorID::bcm_field_value ( ) const

inlineprotectedinherited

Definition at line 670 of file AtlasDetectorID.h.

670 {return (m_BCM_ID);}

◆ calo()

Identifier AtlasDetectorID::calo ( void ) const

inherited

Definition at line 83 of file AtlasDetectorID.cxx.

                                        {
     Identifier result{0};
     // Pack field
     m_det_impl.pack(calo_field_value(), result);
     return result;
 }

◆ calo_exp()

ExpandedIdentifier AtlasDetectorID::calo_exp ( void ) const

inlineprotectedinherited

Definition at line 508 of file AtlasDetectorID.h.

 {
     ExpandedIdentifier result;
     return (result << m_CALO_ID);
 }

◆ calo_field_value()

int AtlasDetectorID::calo_field_value ( ) const

inlineprotectedinherited

Definition at line 618 of file AtlasDetectorID.h.

618 {return (m_CALO_ID);}

◆ channel_context()

IdContext CaloIDHelper::channel_context ( ) const

inherited

Return the context for channels (cells).

◆ channel_hash()

IdentifierHash LArEM_Base_ID::channel_hash ( Identifier channelId ) const

create hash id from channel id

◆ channel_hash_binary_search()

IdentifierHash LArEM_Base_ID::channel_hash_binary_search ( Identifier channelId ) const

create hash id from channel id – method NOT optimised, please use channel_hash() above

◆ channel_hash_max()

size_type CaloIDHelper::channel_hash_max ( ) const

inherited

One more than the largest channel (cell) hash code.

◆ channel_id() [1/7]

Identifier LArEM_Base_ID::channel_id ( const ExpandedIdentifier & exp_id ) const

Build a cell identifier from an expanded identifier.

◆ channel_id() [2/7]

Identifier LArEM_Base_ID::channel_id	(	const Identifier	regionId,
		int	eta,
		int	phi
	)		const

allows to build a cell id starting from a region id (e.g.

from descriptors) – valid for both kinds of channels

◆ channel_id() [3/7]

Identifier LArEM_Base_ID::channel_id	(	const Identifier	regionId,
		int	eta,
		int	phi,
		bool	checks
	)		const

◆ channel_id() [4/7]

Identifier CaloIDHelper::channel_id ( IdentifierHash hashId ) const

inherited

Return the channel (cell) Identifier for a given hash code (no checking).

◆ channel_id() [5/7]

Identifier CaloIDHelper::channel_id

Return the channel (cell) Identifier for a given hash code (no checking).

◆ channel_id() [6/7]

Identifier LArEM_Base_ID::channel_id	(	int	barrel_ec,
		int	sampling,
		int	region,
		int	eta,
		int	phi
	)		const

build a cell identifier

◆ channel_id() [7/7]

Identifier LArEM_Base_ID::channel_id	(	int	barrel_ec,
		int	sampling,
		int	region,
		int	eta,
		int	phi,
		bool	checks
	)		const

◆ channel_id_checks() [1/2]

void LArEM_Base_ID::channel_id_checks	(	const Identifier	regionId,
		int	eta,
		int	phi
	)		const

private

Definition at line 174 of file LArEM_Base_ID.cxx.

 {
   // Check that id is within allowed range
  
   // Fill expanded id
     ExpandedIdentifier expId; 
  
     IdContext context = region_context();
     if (get_expanded_id(regionId, expId, &context)) {
     std::string errorMessage = "LArEM_Base_ID::channel_id_checks(regId) result is not OK: ID = "
         + show_to_string(regionId) ;
     throw LArID_Exception(errorMessage , 6);
     }
  
     expId << eta << phi << m_slar;
  
     if (!m_full_em_range.match(expId)) { 
     std::string errorMessage = "LArEM_Base_ID::channel_id_checks(regId) result is not OK: ID, range = "
         + std::string(expId) + " , " + (std::string)m_full_em_range;
     throw LArID_Exception(errorMessage , 6);
     }
 }

◆ channel_id_checks() [2/2]

void LArEM_Base_ID::channel_id_checks	(	int	barrel_ec,
		int	sampling,
		int	region,
		int	eta,
		int	phi
	)		const

private

Definition at line 158 of file LArEM_Base_ID.cxx.

 {  
     // Check that id is within allowed range
  
     // Fill expanded id
     ExpandedIdentifier expId(lar_em_exp());
     expId << barrel_ec << sampling << region << eta << phi << m_slar ;
  
     if (!m_full_em_range.match(expId)) { 
     std::string errorMessage = "LArEM_Base_ID::channel_id_checks() result is not OK: ID, range = "
         + std::string(expId) + " , " + (std::string)m_full_em_range;
     throw LArID_Exception(errorMessage , 6);
     }
 }

◆ channel_ids()

const std::vector<Identifier>& LArEM_Base_ID::channel_ids ( ) const

provide access to channel id vector, accessed via hash

◆ channels() [1/2]

HashGroup& CaloIDHelper::channels ( )

protectedinherited

Return the HashGroup for channels (cells). non-const.

◆ channels() [2/2]

const HashGroup& CaloIDHelper::channels ( ) const

inherited

Return the HashGroup for channels (cells).

◆ csc()

Identifier AtlasDetectorID::csc ( void ) const

inherited

Definition at line 40 of file AtlasDetectorID.cxx.

                                       {
     return Identifier{};
 }

◆ csc_field_value()

int AtlasDetectorID::csc_field_value ( ) const

inlineprotectedinherited

Definition at line 651 of file AtlasDetectorID.h.

651 {return (m_CSC_ID);}

◆ detsystem_context()

IdContext AtlasDetectorID::detsystem_context ( void ) const

inherited

IdContext (indicates id length) for detector systems.

Definition at line 178 of file AtlasDetectorID.cxx.

                                                    {
     ExpandedIdentifier id{};
     return IdContext{id, 0, m_DET_INDEX};
 }

◆ dict()

const IdDictDictionary* CaloIDHelper::dict ( ) const

protectedinherited

Return the dictionary for this subdetector.

◆ dict_names()

const std::vector< std::string > & AtlasDetectorID::dict_names ( void ) const

inherited

Dictionary names.

Definition at line 467 of file AtlasDetectorID.cxx.

                                                                {
     return m_dict_names;
 }

◆ dict_tags()

const std::vector< std::string > & AtlasDetectorID::dict_tags ( void ) const

inherited

Version tags for subdet dictionaries.

Definition at line 473 of file AtlasDetectorID.cxx.

                                                               {
     return m_dict_tags;
 }

◆ dictionaryVersion()

std::string AtlasDetectorID::dictionaryVersion ( void ) const

overridevirtualinherited

Implements IdHelper.

Definition at line 281 of file AtlasDetectorID.cxx.

                                                    {
     return m_dict_version;
 }

◆ dictRegions()

const std::vector<const IdDictRegion*>& CaloIDHelper::dictRegions ( ) const

inherited

Return the vector of IdDictRegion, accessed via region hash.

◆ do_checks()

bool AtlasDetectorID::do_checks ( void ) const

overridevirtualinherited

Checks are performed by default in debug compilation and NOT in optimized compilation.

One can switch or query this mode for any idHelper with the following methods:

Implements IdHelper.

Definition at line 476 of file AtlasDetectorID.cxx.

                                       {
     return m_do_checks;
 }

◆ do_neighbours()

bool AtlasDetectorID::do_neighbours ( void ) const

overridevirtualinherited

Neighbour initialization is performed by default One can switch or query this mode for any idHelper with the following method:

Implements IdHelper.

Definition at line 483 of file AtlasDetectorID.cxx.

                                           {
     return m_do_neighbours;
 }

◆ em_begin()

id_iterator LArEM_Base_ID::em_begin ( ) const

begin iterator over full set of EM Identifiers

◆ em_end()

id_iterator LArEM_Base_ID::em_end ( ) const

end iterator over full set of EM Identifiers

◆ em_range()

id_range LArEM_Base_ID::em_range ( ) const

Range over full set of EM Identifiers.

◆ eta()

int LArEM_Base_ID::eta ( const Identifier id ) const

return eta according to :

Cells:
element           range              meaning

eta for barrel   [0,60]         presampler - 0< eta <1.52 - deta is approximately equal to 0.025
"                [0,447]        sampling 1 region 0  0   < eta < 1.4   - deta = 0.025/8 
"                [0,2]          sampling 1 region 1  1.4 < eta < 1.475 - deta = 0.025
"                [0,55]         sampling 2 region 0  0   < eta < 1.4   - deta = 0.025 
"                0              sampling 2 region 1  1.4 < eta < 1.475 - deta = 0.075
"                [0,26]         sampling 3 region 0  0   < eta < 1.35  - deta = 0.050 
"

eta for endcap   [0,11]      presampler  sampling 0 region 0  1.5   < eta < 1.8   - deta = 0.025
"                0           outer wheel sampling 1 region 0  1.375 < eta < 1.425 - deta = 0.05  



"                [0,2]       outer wheel sampling 1 region 1  1.425 < eta < 1.5   - deta = 0.025
"                [0,95]      outer wheel sampling 1 region 2  1.5   < eta < 1.8   - deta = 0.025/8
"                [0,47]      outer wheel sampling 1 region 3  1.8   < eta < 2.0   - deta = 0.025/6
"                [0,63]      outer wheel sampling 1 region 4  2.0   < eta < 2.4   - deta = 0.025/4 
"                [0,3]       outer wheel sampling 1 region 5  2.4   < eta < 2.5   - deta = 0.025
"                [0,6]       inner wheel sampling 1 region 0  2.5   < eta < 3.2   - deta = 0.1
"                0           outer wheel sampling 2 region 0  1.375 < eta < 1.425 - deta = 0.05
"                [0,42]      outer wheel sampling 2 region 1  1.425 < eta < 2.5   - deta = 0.025
"                [0,6]       inner wheel sampling 2 region 0  2.5   < eta < 3.2   - deta = 0.1
"                [0,19]      outer wheel sampling 3 region 0  1.5   < eta < 2.5   - deta = 0.05

Supercells:
element           range              meaning

eta for barrel   [0,15]         presampler - 0< eta <1.52 - deta is approximately equal to 0.1
"                [0,55]         sampling 1 region 0  0   < eta < 1.4   - deta = 0.025
"                [0,2]          sampling 1 region 1  1.4 < eta < 1.475 - deta = 0.025
"                [0,55]         sampling 2 region 0  0   < eta < 1.4   - deta = 0.025 
"                0              sampling 2 region 1  1.4 < eta < 1.475 - deta = 0.075
"                [0,13]         sampling 3 region 0  0   < eta < 1.35  - deta = 0.1
"

eta for endcap   [0,2]       presampler  sampling 0 region 0  1.5   < eta < 1.8   - deta = 0.1
"                0           outer wheel sampling 1 region 0  1.375 < eta < 1.425 - deta = 0.125
"                [0,11]      outer wheel sampling 1 region 2  1.5   < eta < 1.8   - deta = 0.025
"                [0,7]       outer wheel sampling 1 region 3  1.8   < eta < 2.0   - deta = 0.033
"                [0,15]      outer wheel sampling 1 region 4  2.0   < eta < 2.4   - deta = 0.025
"                0           outer wheel sampling 1 region 5  2.4   < eta < 2.5   - deta = 0.1
"                [0,2]       inner wheel sampling 1 region 0  2.5   < eta < 3.1   - deta = 0.2
"                0           inner wheel sampling 1 region 1  3.1   < eta < 3.2   - deta = 0.1
"                0           outer wheel sampling 2 region 0  1.375 < eta < 1.425 - deta = 0.05
"                [0,42]      outer wheel sampling 2 region 1  1.425 < eta < 2.5   - deta = 0.025
"                [0,2]       inner wheel sampling 2 region 0  2.5   < eta < 3.1   - deta = 0.2
"                0           inner wheel sampling 2 region 0  3.1   < eta < 3.2   - deta = 0.1
"                [0,9]       outer wheel sampling 3 region 0  1.5   < eta < 2.5   - deta = 0.1

◆ eta0()

float CaloIDHelper::eta0 ( const IdentifierHash regHash ) const

inherited

Return the minimum eta of region, or NOT_VALID.

Parameters

regHash REGION hash code.

Definition at line 209 of file CaloIDHelper.cxx.

 {
   if (regHash >= m_vecOfDictRegions.size()) return NOT_VALID;
   return (m_vecOfDictRegions[regHash]->eta0());
 }

◆ eta_max()

int LArEM_Base_ID::eta_max ( const Identifier regId ) const

max value of eta index (-999 == failure)

Warning: input = REGION ID !!

Definition at line 74 of file LArEM_Base_ID.cxx.

 {
   ExpandedIdentifier expId;
   IdContext context = region_context();
   if(!get_expanded_id(regId, expId, &context)) {
     int result = -999;
     for (unsigned int i = 0; i < m_full_em_range.size(); ++i) {
       const Range& range = m_full_em_range[i];
       if (range.match(expId)) {
     const Range::field& eta_field = range[m_ETA_INDEX];
     if (not eta_field.empty()) {
       int etamax = eta_field.get_maximum();
       if (result < etamax) result = etamax;
     }
       }
     }
     return (result);
   }
   return (-999);  // default
 }

◆ eta_min()

int LArEM_Base_ID::eta_min ( const Identifier regId ) const

min value of eta index (-999 == failure)

Warning: input = REGION ID !!

Definition at line 48 of file LArEM_Base_ID.cxx.

 {
   ExpandedIdentifier expId;
   IdContext context = region_context();
   if(!get_expanded_id(regId, expId, &context)) {
     int result = -999;
     for (unsigned int i = 0; i < m_full_em_range.size(); ++i) {
       const Range& range = m_full_em_range[i];
       if (range.match(expId)) {
     const Range::field& eta_field = range[m_ETA_INDEX];
     if (not eta_field.empty()) {
       int etamin = eta_field.get_minimum();
       if (-999 == result) {
         result = etamin;
       }
       else {
         if (etamin < result) result = etamin;
       }
     }
       }
     }
     return (result);
   }
   return (-999);
 }

◆ etaGranularity()

float CaloIDHelper::etaGranularity ( const IdentifierHash regHash ) const

inherited

Return the eta granularity of a region, or NOT_VALID.

Parameters

regHash REGION hash code.

Definition at line 187 of file CaloIDHelper.cxx.

 {
   if (regHash >= m_vecOfDictRegions.size()) return NOT_VALID;
   return m_vecOfDictRegions[regHash]->deta();
 }

◆ file_names()

const std::vector< std::string > & AtlasDetectorID::file_names ( void ) const

inherited

File names for subdet dictionaries.

Definition at line 470 of file AtlasDetectorID.cxx.

                                                               {
     return m_file_names;
 }

◆ fill_vec_of_dict_regions()

int CaloIDHelper::fill_vec_of_dict_regions ( const std::string & group_name = "" )

protectedinherited

Initialize the list of detector regions.

init_regions should have been called first.

Parameters

group_name The group for this helper.

Returns: 0 on success; non-zero on failure.

Definition at line 261 of file CaloIDHelper.cxx.

 {
   m_vecOfDictRegions.clear();
   m_vecOfDictRegions.reserve (regions().hash_max());
   IdContext region_cntxt = region_context();
   ExpandedIdentifier expRegId;
   for (Identifier id : regions().range()) {
     if(!get_expanded_id(id, expRegId, &region_cntxt)) {
       m_vecOfDictRegions.push_back (m_dict->find_region(expRegId,group_name));
     }
   }
   // cppcheck-suppress assertWithSideEffect
   assert (m_vecOfDictRegions.size() == regions().hash_max());
   return 0;
 }

◆ fix_barrel_ec()

std::string AtlasDetectorID::fix_barrel_ec ( const std::string & barrel_ec ) const

protectedinherited

◆ forward_field_value()

int AtlasDetectorID::forward_field_value ( ) const

inlineprotectedinherited

Definition at line 666 of file AtlasDetectorID.h.

666 {return (m_FWD_ID);}

◆ fwd_exp()

ExpandedIdentifier AtlasDetectorID::fwd_exp ( void ) const

inlineprotectedinherited

Definition at line 515 of file AtlasDetectorID.h.

 {
     ExpandedIdentifier result;
     return (result << m_FWD_ID);
 }

◆ get_expanded_id()

int LArEM_Base_ID::get_expanded_id	(	const Identifier &	id,
		ExpandedIdentifier &	exp_id,
		const IdContext *	context
	)		const

privatevirtual

create expanded Identifier from Identifier (return == 0 for OK)

Implements CaloIDHelper.

Definition at line 201 of file LArEM_Base_ID.cxx.

 {
     // We assume that the context is >= region
     exp_id.clear();
     exp_id << lar_field_value()
            << lar_em_field_value()
        << barrel_ec(id)
        << sampling(id)
        << region(id);
     if(context && context->end_index() >= m_ETA_INDEX) {
     exp_id << eta(id);
     if(context->end_index() >= m_PHI_INDEX) {
         exp_id << phi(id);
             if ( context->end_index() >= m_SLAR_INDEX) {
               exp_id << (unsigned)is_supercell(id);
             }
     }
     }
     return (0);
 }

◆ get_hash()

int CaloIDHelper::get_hash	(	const Identifier &	id,
		IdentifierHash &	hash_id,
		const IdContext *	context = `0`
	)		const

virtualinherited

Convert an Identifier to a hash code for either channels or regions, depending on the context.

Uses binary search. Some of the subdetector-specific helpers define faster versions of channel_hash and region_hash (that, however, do less checking).

Parameters

	id	The identifier to convert.
[out]	hash_id	The resulting hash code. Will be invalid if there was an error.
	context	The context in which to do the conversion (specifies whether we want channels or regions).

Returns: 0 for success, non-zero for failure (unrecognized context or Identifier.

Reimplemented from AtlasDetectorID.

Reimplemented in Tile_Base_ID.

Definition at line 163 of file CaloIDHelper.cxx.

 {
   hash_id = IdentifierHash();
  
   size_t begin = (context) ? context->begin_index(): 0;
   size_t end   = (context) ? context->end_index()  : 0; 
  
   if (0 == begin) { 
     const HashGroup* hg = nullptr;
     if (m_channels.end_index() == end) hg = &m_channels;
     else if (m_regions.end_index() == end) hg = &m_regions;
  
     if (hg)
       return hg->get_hash (id, hash_id);
   }
  
   return 1;
 }

◆ get_id()

int CaloIDHelper::get_id	(	const IdentifierHash &	hash_id,
		Identifier &	id,
		const IdContext *	context = `0`
	)		const

virtualinherited

Convert a hash code to an Identifier for either channels or regions, depending on the context.

If you know the context at compile-time, channel_id and region_id will be faster (but they don't do range checking).

Parameters

	hash_id	The hash code to convert.
[out]	id	The resulting Identifier. Will be invalid if there was an error.
	context	The context in which to do the conversion (specifies whether we want channels or regions).

Returns: 0 for success, non-zero for failure (unrecognized context, or hash code out of range).

Reimplemented from AtlasDetectorID.

Reimplemented in Tile_Base_ID.

Definition at line 121 of file CaloIDHelper.cxx.

 {
   int result = 1;
   id.clear();
  
   size_t begin = (context) ? context->begin_index(): 0;
   size_t end   = (context) ? context->end_index()  : 0; 
  
   if (0 == begin) { 
     const HashGroup* hg = nullptr;
     if (m_channels.end_index() == end) hg = &m_channels;
     else if (m_regions.end_index() == end) hg = &m_regions;
  
     if (hg) {
       if (hash_id < hg->hash_max()) {
     id = hg->id (hash_id);
     result = 0;
       }
     }
   }
  
   return(result);
 }

◆ get_neighbours()

int LArEM_Base_ID::get_neighbours	(	const IdentifierHash	id,
		const LArNeighbours::neighbourOption &	option,
		std::vector< IdentifierHash > &	neighbourList
	)		const

access to hashes for neighbours return == 0 for neighbours found
option = prevInPhi, nextInPhi, prevInEta, nextInEta, faces2D, corners2D, all2D, prevInSamp, nextInSamp, upAndDown, prevSubDet, nextSubDet, all3D

in 'nextInEta', 'nextInSamp', 'nextSubDet', next means 'away from the centre of Atlas'
in 'prevInEta', 'prevInSamp', 'prevSubDet', prev means 'towards the centre of Atlas'
faces2D means prevInPhi + nextInPhi + prevInEta + nextInEta
corners2D means corners in the same sampling, not only touching cells but all corner cells forming a square (in case of change in eta granularity )
all2D means faces2D + corners2D
upAndDown means prevInSamp + nextInSamp
prevSubDet and nextSubDet mean across barrel/EC boundary
all3D means all2D + upAndDown + prevSubDet + nextSubDet

Definition at line 692 of file LArEM_Base_ID.cxx.

 {
   int result = 1; 
  
   neighbourList.clear();
   
   if(!m_do_neighbours) {
     if(m_msgSvc) {
       MsgStream log(m_msgSvc, "LArEM_Base_ID" );
       log << MSG::WARNING << "neighbours not initialized !!! returning empty list" << endmsg;
     }
     else {
       std::cout << " WARNING: neighbours not initialized !!! returning empty list " << std::endl;
     }
     return result;
   }
  
   if(id >= channel_hash_max()) {
     if(m_msgSvc) {
       MsgStream log(m_msgSvc, "LArEM_Base_ID" );
       log << MSG::WARNING << "neighbours requested for non-existing channel -- id/max " << id << "/"
           << channel_hash_max() << endmsg;
     }
     else {
       std::cout << " neighbours requested for non-existing channel -- id/max " << id << "/"
                 << channel_hash_max() << std::endl;
     }
     return result;
   }
  
   const short int maxNeighb=22;
   IdentifierHash neighbList[maxNeighb];
   int neighbourIndex = 0;
  
   // cell index
   unsigned int index=id;
  
   //
   // .... find in which region is the cell   
   //
   auto itr = std::upper_bound(m_cells.begin(), m_cells.end(), index);
   unsigned short int regionN = (itr - m_cells.begin()) - 1;
   assert (regionN < m_vecOfRegions.size());
   // get pointer to this region
   LArEM_region* emRegion = m_vecOfRegions[regionN];
   // retrieve characteristic numbers for this region
   short int nPhi = emRegion->phiN();
   float gPhi = emRegion->phiGranularity();
   unsigned int minHash = emRegion->hashMin();
   unsigned int maxHash = emRegion->hashMax();
  
   bool corners2DOnly  = ( (option & LArNeighbours::all2D) 
               == LArNeighbours::corners2D );
   //
   // .... previous neighbour in phi
   //
   IdentifierHash prevNeighbInPhi=NOT_VALID_HASH;
   if( (option & LArNeighbours::prevInPhi) 
       || corners2DOnly ){
     if(!get_prevInPhi(emRegion, index, nPhi, minHash, neighbourIndex, neighbList)){
       // always 1 and only 1 neighbour in phi in ATLAS, but 0 or 1 neighbour in phi in TB
       prevNeighbInPhi=neighbList[neighbourIndex-1];
       if( corners2DOnly ){
     neighbourIndex--;
       }
     }
   }
  
   //
   // ....next neighbour in phi
   //
   IdentifierHash nextNeighbInPhi=NOT_VALID_HASH;
   if( (option & LArNeighbours::nextInPhi)
       ||  corners2DOnly ){
     if(!get_nextInPhi(emRegion, index, nPhi, minHash, neighbourIndex, neighbList)){
       // always 1 and only 1 neighbour in phi in ATLAS, but 0 or 1 neighbour in phi in TB
       nextNeighbInPhi=neighbList[neighbourIndex-1];
       if( corners2DOnly ){
     neighbourIndex--;
       }
     }
   }
  
   //
   // ....previous neighbours in eta
   //
   unsigned int nPrevBiggerCell=NOT_VALID_HASH;
   if( (option & LArNeighbours::prevInEta) ){
     get_prevInEta(emRegion, index, nPhi, gPhi, minHash, neighbourIndex, neighbList, nPrevBiggerCell);
   }
  
   //
   // ....next neighbours in eta
   //
   unsigned int nNextBiggerCell=NOT_VALID_HASH;
   if( (option & LArNeighbours::nextInEta) ){
     get_nextInEta(emRegion, index, nPhi, gPhi, maxHash, neighbourIndex, neighbList, nNextBiggerCell);
   }
  
   //
   // ....corners in the same sampling
   //
   if( (option & LArNeighbours::corners2D) ){
     if(prevNeighbInPhi != NOT_VALID_HASH){
       unsigned int index1=prevNeighbInPhi;
       int oldNeighbourIndex = neighbourIndex;
       // allow only 1 corner cell in order to avoid the problem of 
       // non-mutual neighbourness
       // since the cells come ordered in phi it should be the last cell for
       // prevNeighbInPhi as starting points
       get_prevInEta(emRegion, index1, nPhi, gPhi, minHash, neighbourIndex, neighbList, nPrevBiggerCell);
       if ( neighbourIndex > oldNeighbourIndex+1 ) {
     neighbList[oldNeighbourIndex] = neighbList[neighbourIndex-1];
     neighbourIndex = oldNeighbourIndex+1;
       }
       oldNeighbourIndex = neighbourIndex;
       get_nextInEta(emRegion, index1, nPhi, gPhi, maxHash, neighbourIndex, neighbList, nNextBiggerCell);
       if ( neighbourIndex > oldNeighbourIndex+1 ) {
     neighbList[oldNeighbourIndex] = neighbList[neighbourIndex-1];
     neighbourIndex = oldNeighbourIndex+1;
       }
     }
  
     if(nextNeighbInPhi != NOT_VALID_HASH){
       unsigned int index2=nextNeighbInPhi;
       int oldNeighbourIndex = neighbourIndex;
       // allow only 1 corner cell in order to avoid the problem of 
       // non-mutual neighbourness
       // since the cells come ordered in phi it should be the 1st cell for
       // nextNeighbInPhi 
       get_prevInEta(emRegion, index2, nPhi, gPhi, minHash, neighbourIndex, neighbList, nPrevBiggerCell);
       if ( neighbourIndex > oldNeighbourIndex+1 ) {
     neighbourIndex = oldNeighbourIndex+1;
       }
       oldNeighbourIndex = neighbourIndex;
       get_nextInEta(emRegion, index2, nPhi, gPhi, maxHash, neighbourIndex, neighbList, nNextBiggerCell);
       if ( neighbourIndex > oldNeighbourIndex+1 ) {
     neighbourIndex = oldNeighbourIndex+1;
       }
     }
   }
  
   //
   // .... neighbours in sampling (common code)
   // EM caracteristics = granularity changes in both eta and phi + partial overlap of samplings
   //
   if( (option & LArNeighbours::upAndDown) ) {
     // granularity of the initial region
     double gEta = (double)(emRegion->etaGranularity());
     // initial eta
     int nEta =  int( (index-minHash) / nPhi);
     double absEta = (double)(emRegion->etaMin()) + (double)(nEta * gEta);
  
     // previous neighbours in sampling
     if( (option & LArNeighbours::prevInSamp) ){
       get_prevInSamp(emRegion, index, nPhi, minHash, gEta, gPhi, absEta, neighbourIndex, neighbList);
     }
  
     // next neighbours in sampling
     if( (option & LArNeighbours::nextInSamp) ){
       get_nextInSamp(emRegion, index, nPhi, minHash, gEta, gPhi, absEta, neighbourIndex, neighbList);
     }
   }
  
   //
   // .... neighbours across subdet
   //
   if( (option & (LArNeighbours::prevSubDet | LArNeighbours::nextSubDet)) ){
     // granularity of the initial region
     double gEta = (double)(emRegion->etaGranularity());
     // initial eta
     int nEta =  int( (index-minHash) / nPhi);
     double absEta = (double)(emRegion->etaMin()) + (double)(nEta * gEta);
  
     // prev neighbours in subdet
     if( (option & LArNeighbours::prevSubDet) ){ 
       get_prevInSubdet(emRegion, index, nPhi, minHash, gEta, gPhi, absEta, neighbourIndex, neighbList);
     }
     // next neighbours in subdet
     if( (option & LArNeighbours::nextSubDet) ){
       get_nextInSubdet(emRegion, index, nPhi, minHash, gEta, gPhi, absEta, neighbourIndex, neighbList);
     }
   }
  
  
   neighbourList.resize(neighbourIndex);
   if (neighbourIndex > 0) {
     if (neighbourIndex <= maxNeighb) {
       std::copy (&neighbList[0], &neighbList[neighbourIndex],  neighbourList.begin());
       result = 0 ;
     } else {
       if(m_msgSvc) {
         MsgStream log(m_msgSvc, "LArEM_Base_ID" );
     log << MSG::WARNING << " more than 22 neighbours for this cell, NONE will be retained" << endmsg;
       }
       else {
     std::cout << "WARNING: more than 22 neighbours for this cell, NONE will be retained " << neighbourIndex << std::endl;
       }
     } 
   }
  
   return result;
 }

◆ get_nextInEta()

int LArEM_Base_ID::get_nextInEta	(	const LArEM_region *	emRegion,
		const unsigned int &	index,
		const short int &	nPhi,
		const float &	gPhi,
		const unsigned int &	maxHash,
		int &	neighbourIndex,
		IdentifierHash *	neighbList,
		unsigned int &	nBiggerCell
	)		const

private

Definition at line 995 of file LArEM_Base_ID.cxx.

 {
   int result = 1; 
  
   unsigned int nIndex = 0;
   IdentifierHash nHash = 0;
  
   if( emRegion->isEtaMax(index)){
     // eta == etaMax -> go to next region in eta
     short int nNextEtaRegion = emRegion->nextEtaRegion();
     // no neighbour if no next region in eta
     if( nNextEtaRegion != NOT_VALID_REGION ) {
       // Tell clang to optimize assuming that FP exceptions can trap.
       // Otherwise, it can vectorize the division, which can lead to
       // spurious division-by-zero traps from unused vector lanes.
       CXXUTILS_TRAPPING_FP;
       LArEM_region* nextEmRegion = m_vecOfRegions[nNextEtaRegion];
       float gPhiPlus= nextEmRegion->phiGranularity();
       unsigned int minHashPlus = nextEmRegion->hashMin();
       float phiMargin = 0.25*std::min(gPhi,gPhiPlus);
       float rPhi = (index+nPhi-maxHash)*gPhi+emRegion->phiMin();
       int nPhiPlusFirst = int(std::floor((rPhi     -nextEmRegion->phiMin())
                     /gPhiPlus+phiMargin))+minHashPlus;
       int nPhiPlusNext  = int(std::floor((rPhi+gPhi-nextEmRegion->phiMin())
                     /gPhiPlus+phiMargin))+minHashPlus;
       if ( nPhiPlusNext == nPhiPlusFirst ) nPhiPlusNext++;
  
       for(int i=nPhiPlusFirst; i<nPhiPlusNext; i++){
     nIndex = i ;
     if(nIndex != nBiggerCell) {
       nHash = nIndex;
       neighbList[neighbourIndex] = nHash;
       neighbourIndex++;
       result = 0;
     }
     // to avoid duplicated cells in corners
     if(gPhi < gPhiPlus && nBiggerCell == NOT_VALID_HASH) nBiggerCell=nIndex;
       }
     }
   }
   else {
     // stay in same region (1 neighbour)
     nIndex = index + nPhi;
     nHash = nIndex;
     neighbList[neighbourIndex] = nHash;
     neighbourIndex++;
     result = 0;
   }
   return result;
 }

◆ get_nextInPhi()

int LArEM_Base_ID::get_nextInPhi	(	const LArEM_region *	emRegion,
		const unsigned int &	index,
		const short int &	nPhi,
		const unsigned int &	minHash,
		int &	neighbourIndex,
		IdentifierHash *	neighbList
	)

staticprivate

Definition at line 913 of file LArEM_Base_ID.cxx.

 {
   int result = 1; 
   if(!emRegion->isPhiMax(index)) {
     unsigned int nIndex = index+1;
     if( ((index-minHash+1)%(nPhi)) == 0 ) nIndex=index-nPhi+1;
     IdentifierHash nHash = nIndex;
     neighbList[neighbourIndex] = nHash;
     neighbourIndex++;
     result = 0;
   }
   return result;
 }

◆ get_nextInSamp()

int LArEM_Base_ID::get_nextInSamp	(	const LArEM_region *	emRegion,
		const unsigned int &	index,
		const short int &	nPhi,
		const unsigned int &	minHash,
		const double &	gEta,
		const float &	gPhi,
		const double &	absEta,
		int &	neighbourIndex,
		IdentifierHash *	neighbList
	)		const

private

Definition at line 1116 of file LArEM_Base_ID.cxx.

 {
   int result = 1; 
  
   // neighbours' indices
   unsigned int nIndex=0;
   // neighbours' hash
   IdentifierHash nHash=0;
  
   const std::vector<short int>& nextSampRegion= emRegion->nextSamplingRegion();
   int nNextSampReg = nextSampRegion.size();
   if(nNextSampReg > 0) {
     for(int ireg=0; ireg<nNextSampReg; ireg++) {
       LArEM_region* nextEmRegion = m_vecOfRegions[nextSampRegion[ireg]];
       double gEtaPlus = (double)(nextEmRegion->etaGranularity());
       float gPhiPlus= nextEmRegion->phiGranularity();
       double minEtaPlus = (double)(nextEmRegion->etaMin());
       double maxEtaPlus = (double)(nextEmRegion->etaMax());
       double margin = 0.25*std::min(gEta,gEtaPlus);
       if((minEtaPlus < absEta+gEta-margin) && (absEta+margin < maxEtaPlus)) {
         // Tell clang to optimize assuming that FP exceptions can trap.
         // Otherwise, it can vectorize the division, which can lead to
         // spurious division-by-zero traps from unused vector lanes.
         CXXUTILS_TRAPPING_FP;
  
     short int nPhiPlus = nextEmRegion->phiN();
     unsigned int minHashPlus = nextEmRegion->hashMin(); 
     float phiMargin = 0.25*std::min(gPhi,gPhiPlus);
     // phi 'coordinate' in initial region
     float rPhi = ((index-minHash)%nPhi)*gPhi+emRegion->phiMin();
     int nPhiPlusFirst = int(std::floor((rPhi     -nextEmRegion->phiMin())
                       /gPhiPlus+phiMargin));
     int nPhiPlusNext  = int(std::floor((rPhi+gPhi-nextEmRegion->phiMin())
                       /gPhiPlus+phiMargin));
     if ( nPhiPlusNext == nPhiPlusFirst ) nPhiPlusNext++;
  
     double fEtaPlus = (absEta-minEtaPlus) / gEtaPlus + margin ;
     // eta 'coordinate' in initial region + 1
     double fEtaMaxPlus = (absEta+gEta-minEtaPlus) / gEtaPlus + margin ;
     int nEtaPlus = int(fEtaPlus) ;
     int nEtaMaxPlus = int(fEtaMaxPlus) ;
     if (nEtaMaxPlus == nEtaPlus) nEtaMaxPlus++;
  
     for(int i=nEtaPlus; i<nEtaMaxPlus; i++){
       for(int j=nPhiPlusFirst; j<nPhiPlusNext; j++){
         nIndex = minHashPlus + i * nPhiPlus + j;
         if( (nIndex >= nextEmRegion->hashMin()) && (nIndex < nextEmRegion->hashMax()) ) {
           nHash = nIndex;
           neighbList[neighbourIndex] = nHash;
           neighbourIndex++;
           result = 0;
         }
       }
     }
       } // end eta condition
     } // end loop on regions
   }
   return result;
 }

◆ get_nextInSubdet()

int LArEM_Base_ID::get_nextInSubdet	(	const LArEM_region *	emRegion,
		const unsigned int &	index,
		const short int &	nPhi,
		const unsigned int &	minHash,
		const double &	gEta,
		const float &	gPhi,
		const double &	absEta,
		int &	neighbourIndex,
		IdentifierHash *	neighbList
	)		const

private

Definition at line 1247 of file LArEM_Base_ID.cxx.

 {
   int result = 1; 
  
   // neighbours' indices
   unsigned int nIndex=0;
   // neighbours' hash
   IdentifierHash nHash=0;
  
   const std::vector<short int>& nextSubdetRegion= emRegion->nextSubdetRegion();
   int nNextSubdetReg = nextSubdetRegion.size();
   if(nNextSubdetReg > 0) {
     for(int ireg=0; ireg<nNextSubdetReg; ireg++) {
       LArEM_region* nextEmRegion = m_vecOfRegions[nextSubdetRegion[ireg]];
       double gEtaPlus = (double)(nextEmRegion->etaGranularity());
       float gPhiPlus= nextEmRegion->phiGranularity();
       double minEtaPlus = (double)(nextEmRegion->etaMin());
       double maxEtaPlus = (double)(nextEmRegion->etaMax());
       double margin = 0.25*std::min(gEta,gEtaPlus);
       if((minEtaPlus < absEta+gEta-margin) && (absEta+margin < maxEtaPlus)) {
         // Tell clang to optimize assuming that FP exceptions can trap.
         // Otherwise, it can vectorize the division, which can lead to
         // spurious division-by-zero traps from unused vector lanes.
         CXXUTILS_TRAPPING_FP;
     
     short int nPhiPlus = nextEmRegion->phiN();
     unsigned int minHashPlus = nextEmRegion->hashMin(); 
     float phiMargin = 0.25*std::min(gPhi,gPhiPlus);
     // phi 'coordinate' in initial region
     float rPhi = ((index-minHash)%nPhi)*gPhi+emRegion->phiMin();
     int nPhiPlusFirst = int(std::floor((rPhi     -nextEmRegion->phiMin())
                       /gPhiPlus+phiMargin));
     int nPhiPlusNext  = int(std::floor((rPhi+gPhi-nextEmRegion->phiMin())
                       /gPhiPlus+phiMargin));
     if ( nPhiPlusNext == nPhiPlusFirst ) nPhiPlusNext++;
  
     double fEtaPlus = (absEta-minEtaPlus) / gEtaPlus + margin ;
     // eta 'coordinate' in initial region + 1
     double fEtaMaxPlus = (absEta+gEta-minEtaPlus) / gEtaPlus + margin ;
     int nEtaPlus = int(fEtaPlus) ;
     int nEtaMaxPlus = int(fEtaMaxPlus) ;
     if (nEtaMaxPlus == nEtaPlus) nEtaMaxPlus++;
  
     for(int i=nEtaPlus; i<nEtaMaxPlus; i++) {
       for(int j=nPhiPlusFirst; j<nPhiPlusNext; j++) {
         nIndex = minHashPlus + i * nPhiPlus + j;
         if( (nIndex >= nextEmRegion->hashMin()) && (nIndex < nextEmRegion->hashMax()) ) {
           nHash = nIndex;
           neighbList[neighbourIndex] = nHash;
           neighbourIndex++;
           result = 0;
         }
       }
     }
       } // end eta condition
     } // end loop on regions
   }
   return result;
 }

◆ get_prevInEta()

int LArEM_Base_ID::get_prevInEta	(	const LArEM_region *	emRegion,
		const unsigned int &	index,
		const short int &	nPhi,
		const float &	gPhi,
		const unsigned int &	minHash,
		int &	neighbourIndex,
		IdentifierHash *	neighbList,
		unsigned int &	nBiggerCell
	)		const

private

Definition at line 928 of file LArEM_Base_ID.cxx.

 {
   int result = 1; 
  
   unsigned int nIndex = 0;
   IdentifierHash nHash = 0;
  
   if( emRegion->isEtaMin(index)){
     // eta == etaMin -> go to previous region in eta
     short int nPrevEtaRegion = emRegion->prevEtaRegion();
     // no neighbour if no previous region in eta
     if( nPrevEtaRegion != NOT_VALID_REGION ) {
       LArEM_region* prevEmRegion = m_vecOfRegions[nPrevEtaRegion];
       if(emRegion->isFirstBarrelRegion()) {
     // special case: barrel middle
     unsigned int minHashMinus = prevEmRegion->hashMin();
     nIndex = minHashMinus + index-minHash ;
     nHash = nIndex;
     neighbList[neighbourIndex] = nHash;
     neighbourIndex++;
     result = 0;
       }
       else {
         // Tell clang to optimize assuming that FP exceptions can trap.
         // Otherwise, it can vectorize the division, which can lead to
         // spurious division-by-zero traps from unused vector lanes.
         CXXUTILS_TRAPPING_FP;
     short int nPhiMinus = prevEmRegion->phiN();
     float gPhiMinus= prevEmRegion->phiGranularity();
     unsigned int maxHashMinus = prevEmRegion->hashMax();
     float phiMargin = 0.25*std::min(gPhi,gPhiMinus);
     float rPhi = (index-minHash)*gPhi+emRegion->phiMin();
     int nPhiMinusFirst = int(std::floor((rPhi     -prevEmRegion->phiMin())
                        /gPhiMinus+phiMargin))
       +maxHashMinus-nPhiMinus;
     int nPhiMinusNext  = int(std::floor((rPhi+gPhi-prevEmRegion->phiMin())
                        /gPhiMinus+phiMargin))
       +maxHashMinus-nPhiMinus;
     if ( nPhiMinusNext == nPhiMinusFirst ) nPhiMinusNext++;
         
     for(int i=nPhiMinusFirst; i<nPhiMinusNext; i++){
       nIndex = i ;
       if(nIndex != nBiggerCell) {
         nHash = nIndex;
         neighbList[neighbourIndex] = nHash;
         neighbourIndex++;
         result = 0;
       }
       // to avoid duplicated cells in corners
       if(gPhi < gPhiMinus && nBiggerCell == NOT_VALID_HASH) nBiggerCell=nIndex;
     }
       }
     }
   }
   else {
     // stay in same region (1 neighbour)
     nIndex = index - nPhi;
     nHash = nIndex;
     neighbList[neighbourIndex] = nHash;
     neighbourIndex++;
     result = 0;
   }
   return result;
 }

◆ get_prevInPhi()

int LArEM_Base_ID::get_prevInPhi	(	const LArEM_region *	emRegion,
		const unsigned int &	index,
		const short int &	nPhi,
		const unsigned int &	minHash,
		int &	neighbourIndex,
		IdentifierHash *	neighbList
	)

staticprivate

Definition at line 898 of file LArEM_Base_ID.cxx.

 {
   int result = 1; 
   unsigned int nIndex = index-1;
   if(!emRegion->isPhiMin(index)) {
     if( ((index-minHash)%(nPhi)) == 0 ) nIndex=index+nPhi-1;
     IdentifierHash nHash = nIndex;
     neighbList[neighbourIndex] = nHash;
     neighbourIndex++;
     result = 0;
   }
   return result;
 }

◆ get_prevInSamp()

int LArEM_Base_ID::get_prevInSamp	(	const LArEM_region *	emRegion,
		const unsigned int &	index,
		const short int &	nPhi,
		const unsigned int &	minHash,
		const double &	gEta,
		const float &	gPhi,
		const double &	absEta,
		int &	neighbourIndex,
		IdentifierHash *	neighbList
	)		const

private

Definition at line 1048 of file LArEM_Base_ID.cxx.

 {
   int result = 1; 
  
   // neighbours' indices
   unsigned int nIndex=0;
   // neighbours' hash
   IdentifierHash nHash=0;
  
   // previous region in sampling
   const std::vector<short int>& prevSampRegion= emRegion->prevSamplingRegion();
   int nPrevSampReg = prevSampRegion.size();
   if(nPrevSampReg > 0) {
     for(int ireg=0; ireg<nPrevSampReg; ireg++) {
       LArEM_region* prevEmRegion = m_vecOfRegions[prevSampRegion[ireg]];
       // eta granularity of previous region in sampling
       double gEtaMinus= (double)(prevEmRegion->etaGranularity());
       // starting eta of prev region
       double minEtaMinus =  (double)(prevEmRegion->etaMin());
       double maxEtaMinus =  (double)(prevEmRegion->etaMax());
       double margin = 0.25*std::min(gEta,gEtaMinus);
       if((minEtaMinus < absEta+gEta-margin) && (absEta+margin < maxEtaMinus)) {
         // Tell clang to optimize assuming that FP exceptions can trap.
         // Otherwise, it can vectorize the division, which can lead to
         // spurious division-by-zero traps from unused vector lanes.
         CXXUTILS_TRAPPING_FP;
     
     // phi granularity of previous region in sampling
     float gPhiMinus= prevEmRegion->phiGranularity();
     // max phi of previous region in sampling
     short int nPhiMinus = prevEmRegion->phiN();
     // first hash of previous region in sampling
     unsigned int minHashMinus = prevEmRegion->hashMin(); 
     float phiMargin = 0.25*std::min(gPhi,gPhiMinus);
     // phi 'coordinate' in initial region
     float rPhi = ((index-minHash)%nPhi)*gPhi+emRegion->phiMin();
     int nPhiMinusFirst = int(std::floor((rPhi     -prevEmRegion->phiMin())
                        /gPhiMinus+phiMargin));
     int nPhiMinusNext  = int(std::floor((rPhi+gPhi-prevEmRegion->phiMin())
                        /gPhiMinus+phiMargin));
     if ( nPhiMinusNext == nPhiMinusFirst ) nPhiMinusNext++;
         
     // eta 'coordinate' in initial region
     double fEtaMinus = (absEta-minEtaMinus) / gEtaMinus + margin ;
     // eta 'coordinate' in initial region + 1
     double fEtaMaxMinus = (absEta+gEta-minEtaMinus) / gEtaMinus + margin ;
     int nEtaMinus = int(fEtaMinus);
     int nEtaMaxMinus = int(fEtaMaxMinus);
     if ( nEtaMaxMinus == nEtaMinus ) nEtaMaxMinus++;
     for(int i=nEtaMinus; i<nEtaMaxMinus; i++) {
       for (int j=nPhiMinusFirst; j<nPhiMinusNext;j++) {
         nIndex = minHashMinus + i * nPhiMinus + j;
         if( (nIndex >= prevEmRegion->hashMin()) && (nIndex < prevEmRegion->hashMax()) ) {
           nHash = nIndex;
           neighbList[neighbourIndex] = nHash;
           neighbourIndex++;
           result = 0;
         }
       }
     } 
       } // end eta condition
     } // loop on ireg
   }
   return result;
 }

◆ get_prevInSubdet()

int LArEM_Base_ID::get_prevInSubdet	(	const LArEM_region *	emRegion,
		const unsigned int &	index,
		const short int &	nPhi,
		const unsigned int &	minHash,
		const double &	gEta,
		const float &	gPhi,
		const double &	absEta,
		int &	neighbourIndex,
		IdentifierHash *	neighbList
	)		const

private

Definition at line 1179 of file LArEM_Base_ID.cxx.

 {
   int result = 1; 
  
   // neighbours' indices
   unsigned int nIndex=0;
   // neighbours' hash
   IdentifierHash nHash=0;
  
   // previous region in sampling
   const std::vector<short int>& prevSubdetRegion= emRegion->prevSubdetRegion();
   int nPrevSubdetReg = prevSubdetRegion.size();
   if(nPrevSubdetReg > 0) {
     for(int ireg=0; ireg<nPrevSubdetReg; ireg++) {
       LArEM_region* prevEmRegion = m_vecOfRegions[prevSubdetRegion[ireg]];
       // eta granularity of previous region in sampling
       double gEtaMinus= (double)(prevEmRegion->etaGranularity());
       // starting eta of prev region
       double minEtaMinus =  (double)(prevEmRegion->etaMin());
       double maxEtaMinus =  (double)(prevEmRegion->etaMax());
       double margin = 0.25*std::min(gEta,gEtaMinus);
       if((minEtaMinus < absEta+gEta-margin) && (absEta+margin < maxEtaMinus)) {
         // Tell clang to optimize assuming that FP exceptions can trap.
         // Otherwise, it can vectorize the division, which can lead to
         // spurious division-by-zero traps from unused vector lanes.
         CXXUTILS_TRAPPING_FP;
     
     // phi granularity of previous region in sampling
     float gPhiMinus= prevEmRegion->phiGranularity();
     // max phi of previous region in sampling
     short int nPhiMinus = prevEmRegion->phiN();
     // first hash of previous region in sampling
     unsigned int minHashMinus = prevEmRegion->hashMin(); 
     float phiMargin = 0.25*std::min(gPhi,gPhiMinus);
     // phi 'coordinate' in initial region
     float rPhi = ((index-minHash)%nPhi)*gPhi+emRegion->phiMin();
     int nPhiMinusFirst = int(std::floor((rPhi     -prevEmRegion->phiMin())
                        /gPhiMinus+phiMargin));
     int nPhiMinusNext  = int(std::floor((rPhi+gPhi-prevEmRegion->phiMin())
                        /gPhiMinus+phiMargin));
     if ( nPhiMinusNext == nPhiMinusFirst ) nPhiMinusNext++;
     // eta 'coordinate' in initial region
     double fEtaMinus = (absEta-minEtaMinus) / gEtaMinus + margin ;
     // eta 'coordinate' in initial region + 1
     double fEtaMaxMinus = (absEta+gEta-minEtaMinus) / gEtaMinus + margin ;
     int nEtaMinus = int(fEtaMinus);
     int nEtaMaxMinus = int(fEtaMaxMinus);
     if ( nEtaMaxMinus == nEtaMinus ) nEtaMaxMinus++;
  
     for(int i=nEtaMinus; i<nEtaMaxMinus; i++) {
       for (int j=nPhiMinusFirst; j<nPhiMinusNext;j++) {
         nIndex = minHashMinus + i * nPhiMinus + j;
         if( (nIndex >= prevEmRegion->hashMin()) && (nIndex < prevEmRegion->hashMax()) ) {
           nHash = nIndex;
           neighbList[neighbourIndex] = nHash;
           neighbourIndex++;
           result = 0;
         }
       }
     } 
       } // end eta condition
     } // loop on ireg
   }
   return result;
 }

◆ group()

const std::string & AtlasDetectorID::group ( ) const

inherited

Group name for this helper.

Definition at line 32 of file AtlasDetectorID.cxx.

 {
   return m_group;
 }

◆ helper()

virtual HelperType AtlasDetectorID::helper ( ) const

inlinevirtualinherited

Type of helper, defaulted to 'Unimplemented'.

Reimplemented in SCT_ID, PLR_ID, and PixelID.

Definition at line 90 of file AtlasDetectorID.h.

                                       {
       return HelperType::Unimplemented;
     }

◆ hgtd()

Identifier AtlasDetectorID::hgtd ( void ) const

inherited

Definition at line 114 of file AtlasDetectorID.cxx.

                                        {
     Identifier result{0};
     // Pack field
     m_det_impl.pack(indet_field_value(), result);
     m_indet_part_impl.pack(m_HGTD_ID, result);
     return result;
 }

◆ hgtd_exp()

ExpandedIdentifier AtlasDetectorID::hgtd_exp ( void ) const

inlineprotectedinherited

Definition at line 543 of file AtlasDetectorID.h.

 {
     ExpandedIdentifier result(indet_exp());
     return (result << m_HGTD_ID);
 }

◆ hgtd_field_value()

int AtlasDetectorID::hgtd_field_value ( ) const

inlineprotectedinherited

Definition at line 630 of file AtlasDetectorID.h.

630 {return (m_HGTD_ID);}

◆ indet()

Identifier AtlasDetectorID::indet ( void ) const

inherited

Detector systems:

Definition at line 55 of file AtlasDetectorID.cxx.

                                         {
     Identifier result{0};
     // Pack field
     m_det_impl.pack(indet_field_value(), result);
     return result;
 }

◆ indet_exp()

ExpandedIdentifier AtlasDetectorID::indet_exp ( void ) const

inlineprotectedinherited

Detector systems:

Definition at line 480 of file AtlasDetectorID.h.

 {
     ExpandedIdentifier result;
     return (result << m_INDET_ID);
 }

◆ indet_field_value()

int AtlasDetectorID::indet_field_value ( ) const

inlineprotectedinherited

Provide efficient access to individual field values, for subclass idhelpers.

Definition at line 606 of file AtlasDetectorID.h.

606 {return (m_INDET_ID);}

◆ init_hashes()

int LArEM_Base_ID::init_hashes ( )

private

Definition at line 428 of file LArEM_Base_ID.cxx.

 {
   if (channels().init (*this, "channels",
                        m_full_em_range, &LArEM_Base_ID::channel_id,
                        m_SLAR_INDEX))
     return 1;
   if (regions().init (*this, "regions",
                       m_full_region_range, &LArEM_Base_ID::region_id,
                       m_REGION_INDEX))
     return 1;
  
   return (0);
 }

◆ init_neighbors()

int LArEM_Base_ID::init_neighbors ( )

private

Definition at line 1310 of file LArEM_Base_ID.cxx.

 {
   MsgStream log(m_msgSvc, "LArEM_Base_ID" );
   if(m_msgSvc) {
     log << MSG::DEBUG << "init_neighbors" << endmsg;
   }
   else {
     std::cout << " LArEM_Base_ID::init_neighbors " << std::endl;
   }
  
   const std::vector<const IdDictRegion*>& vecOfDictRegions = dictRegions();
  
   //
   // ..... loop on regions -> store vector of LArEM_region*
   //
   m_vecOfRegions.resize(region_hash_max());
   short int reg=0;
   std::vector<Identifier>::const_iterator debut=reg_begin() ;
   std::vector<Identifier>::const_iterator fin  =reg_end() ;
   for (; debut != fin; ++debut) {
       const Identifier& regId = (*debut);
  
       bool phiWrapAround = (dictionaryVersion() == "fullAtlas" );
       bool isBarrelMiddle = false;
  
       //
       // ..... translate regId to chanId and get hash
       //
  
       Identifier id ;
       unsigned int index0 = NOT_VALID_HASH;
       int etaMin = eta_min(regId);
       int phiMin = phi_min(regId);
       if(etaMin >= 0 && phiMin >= 0) {
     try{
       id = channel_id (regId, eta_min(regId), phi_min(regId) );  
     }
     catch(LArID_Exception & except){
       if(m_msgSvc) {
         log << MSG::ERROR << " LArId exception " 
         << (std::string)except
         << endmsg;
       }
       else {
         std::cout 
           <<  " LArId exception " 
           << (std::string)except
           << std::endl;
       }
     }
     IdentifierHash hashId = channel_hash (id) ;
     index0=hashId;
       }
       else {
     if(m_msgSvc) {
       log << MSG::WARNING << " could not find non negative etaMin and phiMin for region " 
           << show_to_string(regId)
           << endmsg;
     }
     else {
       std::cout << "WARNING !! could not find non negative etaMin and phiMin for region " 
             << show_to_string(regId)
             << std::endl;
     }
     index0 = 0;
       }
  
       short int deltaEta = eta_max(regId) - eta_min(regId) + 1 ;
       short int nPhi = phi_max(regId) - phi_min(regId) + 1 ;
       // starting eta 
       float eta0 = this->eta0(reg);
       // eta granularity
       float deta = etaGranularity(reg);
       // starting phi 
       float phi0 = this->phi0(reg);
       // phi granularity
       float dphi =  phiGranularity(reg);
  
       // full range of regions
       unsigned int ireg0=0;
       unsigned int ireg1=region_hash_max();
       //  if 2 symetric sides, in which side is the current reg.
       if(twoSymSides()) {
     if(reg < (short int)region_hash_max()/2) {
       ireg0=0;
       ireg1=region_hash_max()/2;
     } else {
       ireg0=region_hash_max()/2;
       ireg1=region_hash_max();
     }
       }
  
       //
       // .... compute prev/next regions in eta 
       //
       short int regForPrevEta=NOT_VALID_REGION;
       const IdDictRegion* prevEtaDicReg =  vecOfDictRegions[reg]->prev_abs_eta();
       short int regForNextEta=NOT_VALID_REGION;
       const IdDictRegion* nextEtaDicReg =  vecOfDictRegions[reg]->next_abs_eta();
       for(unsigned int ireg=ireg0;ireg<ireg1;ireg++){
     if(vecOfDictRegions[ireg] == prevEtaDicReg) regForPrevEta = ireg;
     if(vecOfDictRegions[ireg] == nextEtaDicReg) regForNextEta = ireg;
       }
       // .... special case of barrel middle
       if(twoSymSides()) {
     if(eta0 < 0.1 ) {
       isBarrelMiddle = true;
       if(barrel_ec(regId) < 0) {
         regForPrevEta = reg+6;
       } else {
         regForPrevEta = reg-6;
       }
     }
       }
  
       //
       // .... compute prev/next regions in sampling  
       //
       std::vector<short int> regForPrevSamp;
       for (const IdDictRegion* dictreg : vecOfDictRegions[reg]->prev_samp()) {
     for(unsigned int ireg=ireg0;ireg<ireg1;ireg++){
       if(vecOfDictRegions[ireg] == dictreg) regForPrevSamp.push_back(ireg);
     }
       }
  
       std::vector<short int> regForNextSamp;
       for (const IdDictRegion* dictreg : vecOfDictRegions[reg]->next_samp()) {
     for(unsigned int ireg=ireg0;ireg<ireg1;ireg++){
       if(vecOfDictRegions[ireg] == dictreg) regForNextSamp.push_back(ireg);
     }
       }
  
       //
       // .... compute prev/next regions in subdet  
       //
       std::vector<short int> regForPrevSubdet;
       for (const IdDictRegion* dictreg : vecOfDictRegions[reg]->prev_subdet()) {
     for(unsigned int ireg=ireg0;ireg<ireg1;ireg++){
       if(vecOfDictRegions[ireg] == dictreg) regForPrevSubdet.push_back(ireg);
     }
       }
  
       std::vector<short int> regForNextSubdet;
       for (const IdDictRegion* dictreg : vecOfDictRegions[reg]->next_subdet()) {
     for(unsigned int ireg=ireg0;ireg<ireg1;ireg++){
       if(vecOfDictRegions[ireg] == dictreg) regForNextSubdet.push_back(ireg);
     }
       }
  
       //
       // ....now ready to build region object
       //
  
       LArEM_region * emRegion = new LArEM_region(index0,deltaEta,nPhi,eta0,deta,phi0,dphi,phiWrapAround,isBarrelMiddle,
                          regForPrevEta,regForNextEta,
                          regForPrevSamp,regForNextSamp, 
                          regForPrevSubdet,regForNextSubdet);
       // save in a vector for further use in get_neighbours method
       // optimized nov 2005
       //      m_vecOfRegions.push_back(emRegion);
       m_vecOfRegions[reg]=emRegion;
       reg++;
   } // end of loop on regions
  
   //
   // ..... loop on channels 
   //
       // optimized nov 2005
   m_cells.reserve(64);
   unsigned int i=0;
   reg=0;
   Identifier lastRegId;
   for (Identifier chanId : em_range()) {
       const Identifier& regId = region_id(chanId);
       if(regId != lastRegId) {
     m_cells.push_back(i);
     reg++;
       }
       ++i;
  
       if(m_do_checks) {
     // for cross check only
     IdentifierHash hashReg = region_hash (regId) ;
     if ((short int)hashReg != reg) {
       if(m_msgSvc) {
         log << MSG::ERROR << " init_neighbors: problem reg, hashReg = " << reg << " " << hashReg 
         << endmsg;
       }
       else {
         std::cout << " init_neighbors: problem reg, hashReg = " << reg << " " << hashReg 
               << std::endl;
       }
     }
       }
  
       lastRegId=regId;
   }
  
   return (0);
 }

◆ initialize_base_from_dictionary()

int LArEM_Base_ID::initialize_base_from_dictionary	(	const IdDictMgr &	dict_mgr,
		const std::string &	group_name
	)

initialization from the identifier dictionary

Definition at line 444 of file LArEM_Base_ID.cxx.

 {
   MsgStream log(m_msgSvc, "LArEM_Base_ID" );
  
   log << MSG::DEBUG << "initialize_base_from_dictionary" << endmsg;
  
   // Check whether this helper should be reinitialized
   if (!reinitialize(dict_mgr)) {
     log << MSG::DEBUG << "Request to reinitialize not satisfied - tags have not changed" << endmsg;
     return (0);
   }
   else {
     if(m_msgSvc)log << MSG::DEBUG << "(Re)initialize" << endmsg;
   }
  
   // init base object
   if(CaloIDHelper::initialize_base_from_dictionary(dict_mgr,
                                                    "LArCalorimeter"))
     return (1);
  
   // initialize dictionary version
   AtlasDetectorID::setDictVersion(dict_mgr, "LArCalorimeter");
  
   // Initialize the field indices
   if (initLevelsFromDict(group_name)) return (1);
  
   // Find value for the field LAr Calorimeter   
     const IdDictDictionary* atlasDict = dict_mgr.find_dictionary ("ATLAS"); 
     int larField   = -1;
     if (atlasDict->get_label_value("subdet", "LArCalorimeter", larField)) {
       if(m_msgSvc) {
     log << MSG::ERROR << "Could not get value for label 'LArCalorimeter' of field 'subdet' in dictionary " 
         << atlasDict->name()
         << endmsg;
       }
       else {
         std::cout << "Could not get value for label 'LArCalorimeter' of field 'subdet' in dictionary " 
                   << atlasDict->name()
                   << std::endl;
       }
       return (1);
     }
  
   // Find value for the field LArEM 
     int larEmField   = -1;
     if (dict()->get_label_value("part", "LArEM", larEmField)) {
       if(m_msgSvc) {
     log << MSG::ERROR << "Could not get value for label 'LArEM' of field 'part' in dictionary " 
         << dict()->name()
         << endmsg;
       }
       else {
         std::cout << "Could not get value for label 'LArEM' of field 'part' in dictionary " 
                   << dict()->name()
                   << std::endl;
       }
       return (1);
     }
  
     // Set up id for region and range prefix
     ExpandedIdentifier reg_id;
     reg_id.add(larField);
     reg_id.add(larEmField);
     Range prefix;   
  
     m_full_em_range = dict()->build_multirange(reg_id, group_name, prefix);
     m_full_region_range = dict()->build_multirange(reg_id, group_name, prefix, "region");  
  
     if (!m_quiet) {
       if(m_msgSvc) {
         log << MSG::DEBUG << " initialize_from_dict : " 
             << endmsg;
         log << MSG::DEBUG << " region range -> "  << (std::string)m_full_region_range
             << endmsg;
         log << MSG::DEBUG << " channel range -> "  << (std::string)m_full_em_range
             << endmsg;
       }
       else {
         std::cout << " LArEM_Base_ID::initialize_from_dict : " 
                   << std::endl;
         std::cout << " region range -> "  << (std::string)m_full_region_range
                   << std::endl;
         std::cout << " channel range -> "  << (std::string)m_full_em_range
                   << std::endl;
       }
     }
    
     // initialize m_two_sym_sides
     m_two_sym_sides = ( dictionaryVersion() == "fullAtlas" );
  
  
     // Setup the hash tables
     if(init_hashes()) return (1);
  
     // initialize dictionary regions
     if (fill_vec_of_dict_regions (group_name)) return 1;
  
     m_vecOfPhiMin.resize(regions().hash_max());
     for (unsigned int i = 0; i < regions().hash_max(); ++i) {
       Identifier regId = region_id(i); 
       m_vecOfPhiMin[i] = phi_min_init(regId);
     }
  
  
     // Setup for hash calculation
  
     // We use the structure of the region definitions in the
     // dictionary to optimize. Specifically, each dict region
     // corresponds to two regions of uniform eta/phi granularity (+/-
     // in barrel/endcap). The lookup table only needs to contain the
     // hash offset for each region and the number of phi cells.
  
     // The implementation requires:
  
     //   1) a lookup table for each region containing hash offset and
     //      nphi
     //   2) a decoder to access the "index" corresponding to the
     //      bec/samp/reg fields. These fields use 8 bits, so the
     //      vector has a length of 256 for only 36 regions.
  
  
     // Create decoder for fields bec to region
     IdDictFieldImplementation::size_type bits = 
     m_bec_impl.bits() +
     m_sampling_impl.bits() +
     m_region_impl.bits();
     IdDictFieldImplementation::size_type bits_offset = m_bec_impl.bits_offset();
     m_bec_reg_impl.set_bits(bits, bits_offset);
  
     //    std::cout << "bec_reg "  << m_bec_reg_impl.decode_index()  << " " 
     //      << (std::string)m_bec_reg_impl.ored_field()  << " " 
     //      << std::hex << m_bec_reg_impl.mask() << " " 
     //      << m_bec_reg_impl.zeroing_mask() << " " 
     //      << std::dec << m_bec_reg_impl.shift()
     //      << " " << m_bec_reg_impl.bits() << " " <<m_bec_reg_impl.bits_offset()
     //      << std::endl;
  
  
     // Set up vector as lookup table for hash calculation. 
     m_hash_calcs.resize(256);
     for (unsigned int i = 0; i < m_full_em_range.size(); ++i) {
     const Range* range = &m_full_em_range[i];
     ExpandedIdentifier exp_id = range->minimum (); 
     HashCalc hc;
  
     Identifier min = channel_id (exp_id[m_BEC_INDEX],
                      exp_id[m_SAMPLING_INDEX], 
                      exp_id[m_REGION_INDEX],
                      exp_id[m_ETA_INDEX],
                      exp_id[m_PHI_INDEX]);
     IdentifierHash min_neg = channel_hash_binary_search(min);
     hc.m_hash    = min_neg;
     Identifier minReg = region_id(min) ;
     hc.m_etamin  = eta_min(minReg);
     hc.m_phimin  = phi_min(minReg);
     hc.m_nphi    = (*range)[m_PHI_INDEX].get_indices();
     m_hash_calcs[m_bec_reg_impl.unpack(min)] = hc;
  
     // Flip sign for bec if 2 symmetric sides (ATLAS case, not TB)
     if(m_two_sym_sides) {
       Identifier min1 = channel_id (-exp_id[m_BEC_INDEX],
                     exp_id[m_SAMPLING_INDEX], 
                     exp_id[m_REGION_INDEX],
                     exp_id[m_ETA_INDEX],
                     exp_id[m_PHI_INDEX]);
       IdentifierHash min_pos = channel_hash_binary_search(min1);
       hc.m_hash  = min_pos;
       m_hash_calcs[m_bec_reg_impl.unpack(min1)] = hc;
     }
  
  
     if (m_bec_reg_impl.unpack(min) > 255) {
       if(m_msgSvc) {
         log << MSG::WARNING << "min > 255 " 
         << i << " "
         << show_to_string(min) << " " 
         << m_bec_reg_impl.unpack(min) << " " 
         << endmsg;
       }
       else {
         std::cout << "min > 255 " 
               << i << " "
               << show_to_string(min) << " " 
               << m_bec_reg_impl.unpack(min) << " " 
               << std::endl;
       }
     }
     }
     
 //   Some detailed printout
 //      ExpandedIdentifier exp_id = range->maximum (); 
 //  Identifier max = channel_id (exp_id[m_BEC_INDEX],
 //                       exp_id[m_SAMPLING_INDEX], 
 //                       exp_id[m_REGION_INDEX],
 //                       exp_id[m_ETA_INDEX],
 //                       exp_id[m_PHI_INDEX]);
 //      Identifier max0 = channel_id (-exp_id[m_BEC_INDEX],
 //                        exp_id[m_SAMPLING_INDEX], 
 //                        exp_id[m_REGION_INDEX],
 //                        exp_id[m_ETA_INDEX],
 //                        exp_id[m_PHI_INDEX]);
 //      std::cout << "channel ranges, id, hash " 
 //            << i << " "
 //            << show_to_string(min) << " " 
 //            << show_to_string(max0) << " " 
 //            << show_to_string(min1) << " " 
 //            << show_to_string(max) << " " 
 //            << channel_hash_binary_search(min)  << " " 
 //            << channel_hash_binary_search(min1)  << " " 
 //            << min_pos  << " " 
 //            << range->cardinality() << " " 
 //            << std::endl;
 //      }
  
     // Check hash calculation
     for (unsigned int i = 0; i < channels().hash_max(); ++i) {
       Identifier id = channel_id(i);
       if (channel_hash(id) != i) {
     if(m_msgSvc) {
       log << MSG::ERROR << "channel ranges, id, hash " 
           << show_to_string(id) << " " 
           << channel_hash(id) << " " 
           << i
           << endmsg;
     }
     else {
       std::cout << " *****  Error ";
       std::cout << "channel ranges, id, hash " 
             << show_to_string(id) << " " 
             << channel_hash(id) << " " 
             << i
             << std::endl;
     }
       }
     }
     
     // Setup hash tables for finding neighbors (at the end of initialisation, 
     // to benefit from optimization
     if(m_do_neighbours) {
       if(init_neighbors()) return (1);     
     }
  
     return 0;
 }

◆ initialize_from_dictionary()

int AtlasDetectorID::initialize_from_dictionary ( const IdDictMgr & dict_mgr )

overridevirtualinherited

Initialization from the identifier dictionary.

Implements IdHelper.

Reimplemented in SCT_ID, TRT_ID, SiliconID, LArOnline_SuperCellID, PixelID, MuonIdHelper, MdtIdHelper, CaloCell_Base_ID, sTgcIdHelper, CscIdHelper, MmIdHelper, TgcIdHelper, RpcIdHelper, PLR_ID, LArOnlineID_Base, CaloDM_ID, TileHWID, TileTBID, HGTD_ID, LArMiniFCAL_ID, CaloLVL1_ID, LArElectrodeID, LArEM_SuperCell_ID, LArEM_ID, TTOnlineID, ZdcID, LArHEC_ID, LArHVLineID, TileID, Tile_SuperCell_ID, LArHEC_SuperCell_ID, LArFCAL_ID, CaloCell_ID, LArFCAL_SuperCell_ID, GTower_ID, JTower_ID, and LArOnlineID.

Definition at line 255 of file AtlasDetectorID.cxx.

                                                                          {
  
     // Register version of ATLAS dictionary
     if (register_dict_tag(dict_mgr, "ATLAS")){
         ATH_MSG_ERROR(__func__<<":"<<__LINE__<<" - Failed to register dict tag");
         return 1;
     }
     // Initialize helper, needed for init of AtlasDetectorID
     if (!m_helper) {
         m_helper = std::make_unique<AtlasDetectorIDHelper>().release();
     }
  
     if (m_helper->initialize_from_dictionary(dict_mgr)){
         ATH_MSG_ERROR(__func__<<":"<<__LINE__<<" - Initialization from dictionary failed.");
         return 1;
     }
     // Initialize level indices and id values from dicts
     if (initLevelsFromDict(dict_mgr)) {
         ATH_MSG_ERROR(__func__<<":"<<__LINE__<<" - Level initialization from dictionary failed.");
         return 1;
     }
     m_is_initialized_from_dict = true;
     ATH_MSG_DEBUG("initialize_from_dictionary - OK");
     return 0;
 }

◆ initLevelsFromDict()

int LArEM_Base_ID::initLevelsFromDict ( const std::string & group_name )

private

Definition at line 222 of file LArEM_Base_ID.cxx.

 {
   MsgStream log(m_msgSvc, "LArEM_Base_ID" );
   if(!dict()) {
     if(m_msgSvc) {
       log << MSG::ERROR << "initLevelsFromDict - dictionary NOT initialized "
       << endmsg;
     }
     else {
       std::cout << "LArEM_Base_ID::initLevelsFromDict - dictionary NOT initialized "
         << std::endl ;
     }
     return (1);
   }
  
   // Find out which identifier field corresponds to each level.
  
   m_LAR_INDEX        = 999 ;
   m_EM_INDEX         = 999 ;
   m_BEC_INDEX        = 999 ;
   m_SAMPLING_INDEX   = 999 ;
   m_REGION_INDEX     = 999 ;
   m_ETA_INDEX        = 999 ;
   m_PHI_INDEX        = 999 ;
   m_SLAR_INDEX       = 999 ;
  
   // Find a EM region
   IdDictField* field = dict()->find_field("subdet") ;
   if (field) {
     m_LAR_INDEX = field->index();
   }
   else {
     if(m_msgSvc) {
       log << MSG::ERROR << "initLevelsFromDict - unable to find 'subdet' field "
       << endmsg;
     }
     else {
       std::cout << "LArEM_Base_ID::initLevelsFromDict - unable to find 'subdet' field "
         << std::endl ;
     }
     return (1);
   }
  
   field = dict()->find_field("part") ;
   if (field) {
     m_EM_INDEX = field->index();
   }
   else {
     if(m_msgSvc) {
       log << MSG::ERROR << "initLevelsFromDict - unable to find 'part' field "
       << endmsg;
     }
     else {
       std::cout << "LArEM_Base_ID::initLevelsFromDict - unable to find 'part' field "
         << std::endl ;
     }
     return (1);
   }
  
   field = dict()->find_field("barrel-endcap") ;
   if (field) {
     m_BEC_INDEX = field->index();
   }
   else {
     if(m_msgSvc) {
       log << MSG::ERROR << "initLevelsFromDict - unable to find 'barrel-endcap' field "
       << endmsg;
     }
     else {
       std::cout << "LArEM_Base_ID::initLevelsFromDict - unable to find 'barrel-endcap' field "
         << std::endl ;
     }
     return (1);
   }
  
   field = dict()->find_field("sampling") ;
   if (field) {
     m_SAMPLING_INDEX = field->index();
   }
   else {
     if(m_msgSvc) {
       log << MSG::ERROR << "initLevelsFromDict - unable to find 'sampling' field "
       << endmsg;
     }
     else {
       std::cout << "LArEM_Base_ID::initLevelsFromDict - unable to find 'sampling' field "
         << std::endl ;
     }
     return (1);
   }
  
   field = dict()->find_field("region") ;
   if (field) {
     m_REGION_INDEX = field->index();
   }
   else {
     if(m_msgSvc) {
       log << MSG::ERROR << "initLevelsFromDict - unable to find 'region' field "
       << endmsg;
     }
     else {
       std::cout << "LArEM_Base_ID::initLevelsFromDict - unable to find 'region' field "
         << std::endl ;
     }
     return (1);
   }
  
   field = dict()->find_field("eta") ;
   if (field) {
     m_ETA_INDEX = field->index();
   }
   else {
     if(m_msgSvc) {
       log << MSG::ERROR << "initLevelsFromDict - unable to find 'eta' field "
       << endmsg;
     }
     else {
       std::cout << "LArEM_Base_ID::initLevelsFromDict - unable to find 'eta' field "
         << std::endl ;
     }
     return (1);
   }
  
   field = dict()->find_field("phi") ;
   if (field) {
     m_PHI_INDEX = field->index();
   }
   else {
     if(m_msgSvc) {
       log << MSG::ERROR << "initLevelsFromDict - unable to find 'phi' field "
       << endmsg;
     }
     else {
       std::cout << "LArEM_Base_ID::initLevelsFromDict - unable to find 'phi' field "
         << std::endl ;
     }
     return (1);
   }
  
   field = dict()->find_field("is-slar") ;
   if (field) {
     m_SLAR_INDEX = field->index();
   }
   else {
     if(m_msgSvc) {
       log << MSG::ERROR << "initLevelsFromDict - unable to find 'is-slar' field "
           << endmsg;
     }
     else {
       std::cout << "LArEM_Base_ID::initLevelsFromDict - unable to find 'is-slar' field "
                 << std::endl ;
     }
     return (1);
   }
  
   // Set the field implementations
  
   IdDictGroup* group = dict()->find_group(group_name);
   if ( !group ){
     log << MSG::ERROR << "initLevelsFromDict - cannot find " << group_name 
         << " group' field " << endmsg;
   }
   else {
     m_em_region_index = group->regions()[0]->index();
   }
   const IdDictRegion& region = dict()->region(m_em_region_index);
  
   m_lar_impl      = region.implementation(m_LAR_INDEX);
   m_em_impl       = region.implementation(m_EM_INDEX);
   m_bec_impl      = region.implementation(m_BEC_INDEX);
   m_sampling_impl = region.implementation(m_SAMPLING_INDEX);
   m_region_impl   = region.implementation(m_REGION_INDEX);
   m_eta_impl      = region.implementation(m_ETA_INDEX);
   m_phi_impl      = region.implementation(m_PHI_INDEX);
   m_slar_impl     = region.implementation(m_SLAR_INDEX);
  
   if (!m_quiet) {
     if(m_msgSvc) {
       log << MSG::DEBUG << "decode index and bit fields for each level: " << endmsg;
       log << MSG::DEBUG << "lar  "  << m_lar_impl.show_to_string() << endmsg;
       log << MSG::DEBUG << "em   "   << m_em_impl.show_to_string() << endmsg;
       log << MSG::DEBUG << "bec  "  << m_bec_impl.show_to_string() << endmsg;
       log << MSG::DEBUG << "samp " << m_sampling_impl.show_to_string() << endmsg;
       log << MSG::DEBUG << "reg  "  << m_region_impl.show_to_string() << endmsg;
       log << MSG::DEBUG << "eta  "  << m_eta_impl.show_to_string() << endmsg;
       log << MSG::DEBUG << "phi  "  << m_phi_impl.show_to_string() << endmsg;
       log << MSG::DEBUG << "is-slar  "  << m_slar_impl.show_to_string() << endmsg;
     }
     else {
       std::cout << "decode index and bit fields for each level: " << std::endl;
       std::cout << "lar  "  << m_lar_impl.show_to_string() << std::endl;
       std::cout << "em   "   << m_em_impl.show_to_string() << std::endl;
       std::cout << "bec  "  << m_bec_impl.show_to_string() << std::endl;
       std::cout << "samp " << m_sampling_impl.show_to_string() << std::endl;
       std::cout << "reg  "  << m_region_impl.show_to_string() << std::endl;
       std::cout << "eta  "  << m_eta_impl.show_to_string() << std::endl;
       std::cout << "phi  "  << m_phi_impl.show_to_string() << std::endl;
       std::cout << "is-slar  "  << m_slar_impl.show_to_string() << std::endl;
     }
   }
   
  
   return(0) ;
 }

◆ initMessaging()

void AthMessaging::initMessaging ( ) const

privateinherited

Initialize our message level and MessageSvc.

This method should only be called once.

Definition at line 39 of file AthMessaging.cxx.

 {
   m_imsg = Athena::getMessageSvc();
   m_lvl = m_imsg ?
     static_cast<MSG::Level>( m_imsg.load()->outputLevel(m_nm) ) :
     MSG::INFO;
 }

◆ is_alfa()

bool AtlasDetectorID::is_alfa ( Identifier id ) const

inlineinherited

Definition at line 936 of file AtlasDetectorID.h.

 {
     bool result = false;
     if(is_forward(id)) {
         result = (abs(m_lar_part_impl.unpack(id)) == m_ALFA_ID);
     }
     return result;
 }

◆ is_bcm()

bool AtlasDetectorID::is_bcm ( Identifier id ) const

inlineinherited

Definition at line 946 of file AtlasDetectorID.h.

 {
     bool result = false;
     if(is_forward(id)) {
         result = (abs(m_lar_part_impl.unpack(id)) == m_BCM_ID);
     }
     return result;
 }

◆ is_calo() [1/2]

bool AtlasDetectorID::is_calo ( const ExpandedIdentifier & id ) const

inherited

Definition at line 296 of file AtlasDetectorID.cxx.

                                                                 {
     return id.fields() > 0 && id[0] == m_CALO_ID;
 }

◆ is_calo() [2/2]

bool AtlasDetectorID::is_calo ( Identifier id ) const

inlineinherited

Definition at line 702 of file AtlasDetectorID.h.

 {
     return (m_det_impl.unpack(id) == m_CALO_ID);
 }

◆ is_csc() [1/2]

bool AtlasDetectorID::is_csc ( const ExpandedIdentifier & id ) const

inherited

Definition at line 338 of file AtlasDetectorID.cxx.

                                                                {
     return id.fields() > 4 && id[0] == m_MUON_ID && id[4] == m_CSC_ID;
 }

◆ is_csc() [2/2]

bool AtlasDetectorID::is_csc ( Identifier id ) const

inlineinherited

Definition at line 886 of file AtlasDetectorID.h.

 {
     bool result = false;
     if (!is_muon(id)) return false;
     unsigned int stationNameIndex = m_muon_station_name_impl.unpack(id);
     unsigned int techBit = m_muon_tech_bits[stationNameIndex];
     result = (is_muon(id) && (techBit == AtlasDetDescr::fAtlasCSC));
     return result;
 }

◆ is_em_barrel()

bool LArEM_Base_ID::is_em_barrel ( const Identifier id ) const

test if the id belongs to the EM barrel

◆ is_em_endcap()

bool LArEM_Base_ID::is_em_endcap ( const Identifier id ) const

test if the id belongs to the EM Endcap

◆ is_em_endcap_inner()

bool LArEM_Base_ID::is_em_endcap_inner ( const Identifier id ) const

test if the id belongs to the EM Endcap inner wheel

◆ is_em_endcap_outer()

bool LArEM_Base_ID::is_em_endcap_outer ( const Identifier id ) const

test if the id belongs to the EM Endcap outer wheel

◆ is_forward()

bool AtlasDetectorID::is_forward ( Identifier id ) const

inlineinherited

Definition at line 930 of file AtlasDetectorID.h.

 {
     return (m_det_impl.unpack(id) == m_FWD_ID);
 }

◆ is_hgtd() [1/2]

bool AtlasDetectorID::is_hgtd ( const ExpandedIdentifier & id ) const

inherited

Definition at line 309 of file AtlasDetectorID.cxx.

                                                                 {
     return is_indet(id) && id.fields() > 1 && id[1] == m_HGTD_ID;
 }

◆ is_hgtd() [2/2]

bool AtlasDetectorID::is_hgtd ( Identifier id ) const

inlineinherited

Definition at line 789 of file AtlasDetectorID.h.

 {
     bool result = false;
     // Must check is_pixel to allow for special bits
     // (don't need this check for 64-bit identifier, but leave it in for now)
     if(is_indet(id) && !is_pixel(id)) {
         result = (m_indet_part_impl.unpack(id) == m_HGTD_ID);
     }
     return result;
 }

◆ is_indet() [1/2]

bool AtlasDetectorID::is_indet ( const ExpandedIdentifier & id ) const

inherited

Definition at line 284 of file AtlasDetectorID.cxx.

                                                                 {
     return  id.fields() > 0 && id[0] == m_INDET_ID;
 }

◆ is_indet() [2/2]

bool AtlasDetectorID::is_indet ( Identifier id ) const

inlineinherited

Definition at line 678 of file AtlasDetectorID.h.

 {
     return (m_det_impl.unpack(id) == m_INDET_ID);
 }

◆ is_lar() [1/2]

bool AtlasDetectorID::is_lar ( const ExpandedIdentifier & id ) const

inherited

Definition at line 287 of file AtlasDetectorID.cxx.

                                                                {
     return id.fields() > 0 && id[0] == m_LAR_ID;
 }

◆ is_lar() [2/2]

bool AtlasDetectorID::is_lar ( Identifier id ) const

inlineinherited

Definition at line 684 of file AtlasDetectorID.h.

 {
     return (m_det_impl.unpack(id) == m_LAR_ID);
 }

◆ is_lar_dm()

bool AtlasDetectorID::is_lar_dm ( Identifier id ) const

inlineinherited

LAr/Tile dead material:

Definition at line 731 of file AtlasDetectorID.h.

 {
     bool result = false;
     if (is_calo(id)) {
         int temp = m_calo_side_impl.unpack(id);
         result = (m_lar_dm_field.match(temp));
     }
     return result;
 }

◆ is_lar_em() [1/2]

bool AtlasDetectorID::is_lar_em ( const ExpandedIdentifier & id ) const

inherited

Definition at line 319 of file AtlasDetectorID.cxx.

                                                                   {
     return is_lar(id) && id.fields() > 1 && std::abs(id[1]) == m_LAR_EM_ID;
 }

◆ is_lar_em() [2/2]

bool AtlasDetectorID::is_lar_em ( Identifier id ) const

inlineinherited

Definition at line 813 of file AtlasDetectorID.h.

 {
     bool result = false;
     if(is_lar(id)) {
         result = (abs(m_lar_part_impl.unpack(id)) == m_LAR_EM_ID);
     }
     return result;
 }

◆ is_lar_fcal() [1/2]

bool AtlasDetectorID::is_lar_fcal ( const ExpandedIdentifier & id ) const

inherited

Definition at line 326 of file AtlasDetectorID.cxx.

                                                                     {
     return is_lar(id) && id.fields() > 1 && std::abs(id[1]) == m_LAR_FCAL_ID;
 }

◆ is_lar_fcal() [2/2]

bool AtlasDetectorID::is_lar_fcal ( Identifier id ) const

inlineinherited

Definition at line 834 of file AtlasDetectorID.h.

 {
     bool result = false;
     if(is_lar(id)) {
         result = (abs(m_lar_part_impl.unpack(id)) == m_LAR_FCAL_ID);
     }
     return result;
 }

◆ is_lar_hec() [1/2]

bool AtlasDetectorID::is_lar_hec ( const ExpandedIdentifier & id ) const

inherited

Definition at line 322 of file AtlasDetectorID.cxx.

                                                                    {
     return is_lar(id) && id.fields() > 1 && std::abs(id[1]) == m_LAR_HEC_ID;
 }

◆ is_lar_hec() [2/2]

bool AtlasDetectorID::is_lar_hec ( Identifier id ) const

inlineinherited

Definition at line 824 of file AtlasDetectorID.h.

 {
     bool result = false;
     if(is_lar(id)) {
         result = (abs(m_lar_part_impl.unpack(id)) == m_LAR_HEC_ID);
     }
     return result;
 }

◆ is_lar_minifcal() [1/2]

bool AtlasDetectorID::is_lar_minifcal ( const ExpandedIdentifier & id ) const

inherited

Definition at line 330 of file AtlasDetectorID.cxx.

                                                                         {
     return is_lar_fcal(id) && id.fields() > 3 &&std::abs(id[3]) == 0;
 }

◆ is_lar_minifcal() [2/2]

bool AtlasDetectorID::is_lar_minifcal ( Identifier id ) const

inlineinherited

Definition at line 844 of file AtlasDetectorID.h.

 {
     bool result = false;
     if(is_lar_fcal(id)) {
         result = (m_lar_fcal_module_impl.unpack(id) == 0);
     }
     return result;
 }

◆ is_lucid()

bool AtlasDetectorID::is_lucid ( Identifier id ) const

inlineinherited

Definition at line 956 of file AtlasDetectorID.h.

 {
     bool result = false;
     if(is_forward(id)) {
         result = (abs(m_lar_part_impl.unpack(id)) == m_LUCID_ID);
     }
     return result;
 }

◆ is_lumi() [1/2]

bool AtlasDetectorID::is_lumi ( const ExpandedIdentifier & id ) const

inherited

Definition at line 312 of file AtlasDetectorID.cxx.

                                                                 {
     return is_indet(id) && id.fields() > 1 && id[1] == m_LUMI_ID;
 }

◆ is_lumi() [2/2]

bool AtlasDetectorID::is_lumi ( Identifier id ) const

inlineinherited

Definition at line 801 of file AtlasDetectorID.h.

 {
     bool result = false;
     // Must check is_pixel to allow for special bits
     // (don't need this check for 64-bit identifier, but leave it in for now)
     if(is_indet(id) && !is_pixel(id)) {
         result = (m_indet_part_impl.unpack(id) == m_LUMI_ID);
     }
     return result;
 }

◆ is_lvl1_online()

bool AtlasDetectorID::is_lvl1_online ( Identifier id ) const

inlineinherited

Definition at line 719 of file AtlasDetectorID.h.

 {
     bool result = false;
     if (is_calo(id)) {
         int temp = m_calo_side_impl.unpack(id);
         result = (m_lvl1_onl_field.match(temp));
     }
     return result;
 }

◆ is_lvl1_trig_towers()

bool AtlasDetectorID::is_lvl1_trig_towers ( Identifier id ) const

inlineinherited

Definition at line 708 of file AtlasDetectorID.h.

 {
     bool result = false;
     if (is_calo(id)) {
         int temp = m_calo_side_impl.unpack(id);
         result = (m_lvl1_field.match(temp));
     }
     return result;
 }

◆ is_mdt() [1/2]

bool AtlasDetectorID::is_mdt ( const ExpandedIdentifier & id ) const

inherited

Definition at line 334 of file AtlasDetectorID.cxx.

                                                               {
     return id.fields() > 4 && id[0] == m_MUON_ID && id[4] == m_MDT_ID;
 }

◆ is_mdt() [2/2]

bool AtlasDetectorID::is_mdt ( Identifier id ) const

inlineinherited

Definition at line 854 of file AtlasDetectorID.h.

 {
     bool result = false;
     if (!is_muon(id)) return false;
     unsigned int stationNameIndex = m_muon_station_name_impl.unpack(id);
     unsigned int techBit = m_muon_tech_bits[stationNameIndex];
     // MDT and RPC can only be destinguished by the additional bit in the ID
     // since the station names are ambiguous
     if (is_muon(id) && ((techBit == AtlasDetDescr::fAtlasMDT)
                         || (techBit == AtlasDetDescr::fAtlasRPC))) {
       result = (m_muon_mdt_impl.unpack(id) == m_MDT_ID);
     }
     return result;
 }

◆ is_mm() [1/2]

bool AtlasDetectorID::is_mm ( const ExpandedIdentifier & id ) const

inherited

Definition at line 354 of file AtlasDetectorID.cxx.

                                                               {
     return id.fields() > 4 && id[0] == m_MUON_ID && id[4] == m_MM_ID;
 }

◆ is_mm() [2/2]

bool AtlasDetectorID::is_mm ( Identifier id ) const

inlineinherited

Definition at line 908 of file AtlasDetectorID.h.

 {
     bool result = false;
     if (!is_muon(id)) return false;
     unsigned int stationNameIndex = m_muon_station_name_impl.unpack(id);
     unsigned int techBit = m_muon_tech_bits[stationNameIndex];
     result = (is_muon(id) && (techBit == AtlasDetDescr::fAtlasMM));
     return result;
 }

◆ is_muon() [1/2]

bool AtlasDetectorID::is_muon ( const ExpandedIdentifier & id ) const

inherited

Definition at line 293 of file AtlasDetectorID.cxx.

                                                                 {
     return id.fields() > 0 && id[0] == m_MUON_ID;
 }

◆ is_muon() [2/2]

bool AtlasDetectorID::is_muon ( Identifier id ) const

inlineinherited

Definition at line 696 of file AtlasDetectorID.h.

 {
     return (m_det_impl.unpack(id) == m_MUON_ID);
 }

◆ is_pixel() [1/2]

bool AtlasDetectorID::is_pixel ( const ExpandedIdentifier & id ) const

inherited

Definition at line 299 of file AtlasDetectorID.cxx.

                                                                  {
     return is_indet(id) && id.fields() > 1 && id[1] == m_PIXEL_ID;
 }

◆ is_pixel() [2/2]

bool AtlasDetectorID::is_pixel ( Identifier id ) const

inlineinherited

Definition at line 755 of file AtlasDetectorID.h.

 {
     bool result = false;
     if(is_indet(id)) {
         result = (m_indet_part_impl.unpack(id) == m_PIXEL_ID);
     }
     return result;
 }

◆ is_plr() [1/2]

bool AtlasDetectorID::is_plr ( const ExpandedIdentifier & id ) const

inherited

Definition at line 315 of file AtlasDetectorID.cxx.

                                                                {
     return is_lumi(id) && id.fields() > 2 && id[2] == m_LUMI_PLR_ID;
 }

◆ is_plr() [2/2]

bool AtlasDetectorID::is_plr ( Identifier id ) const

inherited

◆ is_rpc() [1/2]

bool AtlasDetectorID::is_rpc ( const ExpandedIdentifier & id ) const

inherited

Definition at line 342 of file AtlasDetectorID.cxx.

                                                                {
     return id.fields() > 4 && id[0] == m_MUON_ID && id[4] == m_RPC_ID;
 }

◆ is_rpc() [2/2]

bool AtlasDetectorID::is_rpc ( Identifier id ) const

inlineinherited

Definition at line 870 of file AtlasDetectorID.h.

 {
     bool result = false;
     if (!is_muon(id)) return false;
     unsigned int stationNameIndex = m_muon_station_name_impl.unpack(id);
     unsigned int techBit = m_muon_tech_bits[stationNameIndex];
     // MDT and RPC can only be destinguished by the additional bit in the ID
     // since the station names are ambiguous
     if (is_muon(id) && ((techBit == AtlasDetDescr::fAtlasMDT)
                         || (techBit == AtlasDetDescr::fAtlasRPC))) {
       result = (m_muon_rpc_impl.unpack(id) == m_RPC_ID);
     }
     return result;
 }

◆ is_sct() [1/2]

bool AtlasDetectorID::is_sct ( const ExpandedIdentifier & id ) const

inherited

Definition at line 303 of file AtlasDetectorID.cxx.

                                                                {
     return is_indet(id) && id.fields() > 1 && id[1] == m_SCT_ID;
 }

◆ is_sct() [2/2]

bool AtlasDetectorID::is_sct ( Identifier id ) const

inlineinherited

Definition at line 765 of file AtlasDetectorID.h.

 {
     bool result = false;
     // Must check is_pixel to allow for special bits
     // (don't need this check for 64-bit identifier, but leave it in for now)
     if(is_indet(id) && !is_pixel(id)) {
     result = (m_indet_part_impl.unpack(id) == m_SCT_ID);
     }
     return result;
 }

◆ is_stgc() [1/2]

bool AtlasDetectorID::is_stgc ( const ExpandedIdentifier & id ) const

inherited

Definition at line 350 of file AtlasDetectorID.cxx.

                                                                 {
     return id.fields() > 4 && id[0] == m_MUON_ID && id[4] == m_STGC_ID;
 }

◆ is_stgc() [2/2]

bool AtlasDetectorID::is_stgc ( Identifier id ) const

inlineinherited

Definition at line 919 of file AtlasDetectorID.h.

 {
     bool result = false;
     if (!is_muon(id)) return false;
     unsigned int stationNameIndex = m_muon_station_name_impl.unpack(id);
     unsigned int techBit = m_muon_tech_bits[stationNameIndex];
     result = (is_muon(id) && (techBit == AtlasDetDescr::fAtlasSTGC));
     return result;
 }

◆ is_supercell()

bool LArEM_Base_ID::is_supercell ( const Identifier id ) const

Test if the identifier represents a supercell.

Definition at line 42 of file LArEM_Base_ID.cxx.

 {
   return(m_slar_impl.unpack(id)) != 0;
 }

◆ is_tgc() [1/2]

bool AtlasDetectorID::is_tgc ( const ExpandedIdentifier & id ) const

inherited

Definition at line 346 of file AtlasDetectorID.cxx.

                                                                {
     return id.fields() > 4 && id[0] == m_MUON_ID && id[4] == m_TGC_ID;
 }

◆ is_tgc() [2/2]

bool AtlasDetectorID::is_tgc ( Identifier id ) const

inlineinherited

Definition at line 897 of file AtlasDetectorID.h.

 {
     bool result = false;
     if (!is_muon(id)) return false;
     unsigned int stationNameIndex = m_muon_station_name_impl.unpack(id);
     unsigned int techBit = m_muon_tech_bits[stationNameIndex];
     result = (is_muon(id) && (techBit == AtlasDetDescr::fAtlasTGC));
     return result;
 }

◆ is_tile() [1/2]

bool AtlasDetectorID::is_tile ( const ExpandedIdentifier & id ) const

inherited

Definition at line 290 of file AtlasDetectorID.cxx.

                                                                 {
     return id.fields() > 0 && id[0] == m_TILE_ID;
 }

◆ is_tile() [2/2]

bool AtlasDetectorID::is_tile ( Identifier id ) const

inlineinherited

Definition at line 690 of file AtlasDetectorID.h.

 {
     return (m_det_impl.unpack(id) == m_TILE_ID);
 }

◆ is_tile_dm()

bool AtlasDetectorID::is_tile_dm ( Identifier id ) const

inlineinherited

Definition at line 743 of file AtlasDetectorID.h.

 {
     bool result = false;
     if (is_calo(id)) {
         int temp = m_calo_side_impl.unpack(id);
         result = (m_tile_dm_field.match(temp));
     }
     return result;
 }

◆ is_trt() [1/2]

bool AtlasDetectorID::is_trt ( const ExpandedIdentifier & id ) const

inherited

Definition at line 306 of file AtlasDetectorID.cxx.

                                                                {
     return is_indet(id) && id.fields() > 1;
 }

◆ is_trt() [2/2]

bool AtlasDetectorID::is_trt ( Identifier id ) const

inlineinherited

Definition at line 777 of file AtlasDetectorID.h.

 {
     bool result = false;
     // Must check is_pixel to allow for special bits
     // (don't need this check for 64-bit identifier, but leave it in for now)
     if(is_indet(id) && !is_pixel(id)) {
         result = (m_indet_part_impl.unpack(id) == m_TRT_ID);
     }
     return result;
 }

◆ is_zdc()

bool AtlasDetectorID::is_zdc ( Identifier id ) const

inlineinherited

Definition at line 966 of file AtlasDetectorID.h.

 {
     bool result = false;
     if(is_forward(id)) {
         result = (abs(m_lar_part_impl.unpack(id)) == m_ZDC_ID);
     }
     return result;
 }

◆ lar()

Identifier AtlasDetectorID::lar ( void ) const

inherited

Definition at line 62 of file AtlasDetectorID.cxx.

                                       {
     Identifier result{0};
     // Pack field
     m_det_impl.pack(lar_field_value(), result);
     return result;
 }

◆ lar_dm()

Identifier AtlasDetectorID::lar_dm ( void ) const

inherited

Definition at line 146 of file AtlasDetectorID.cxx.

                                          {
     Identifier result{0};
     // Pack field
     m_det_impl.pack(calo_field_value(), result);
     m_calo_side_impl.pack(-4, result);
     return result;
 }

◆ lar_em()

Identifier AtlasDetectorID::lar_em ( void ) const

inherited

Definition at line 130 of file AtlasDetectorID.cxx.

                                          { 
     Identifier result{0};
     // Pack field
     m_det_impl.pack(lar_field_value(), result);
     m_lar_part_impl.pack(m_LAR_EM_ID, result);
     return result;
 }

◆ lar_em_exp()

ExpandedIdentifier AtlasDetectorID::lar_em_exp ( void ) const

inlineprotectedinherited

LAr.

Definition at line 557 of file AtlasDetectorID.h.

 {
     ExpandedIdentifier result(lar_exp());
     return (result << m_LAR_EM_ID);
 }

◆ lar_em_field_value()

int AtlasDetectorID::lar_em_field_value ( ) const

inlineprotectedinherited

Definition at line 639 of file AtlasDetectorID.h.

639 {return (m_LAR_EM_ID);}

◆ lar_exp()

ExpandedIdentifier AtlasDetectorID::lar_exp ( void ) const

inlineprotectedinherited

Definition at line 487 of file AtlasDetectorID.h.

 {
     ExpandedIdentifier result;
     return (result << m_LAR_ID);
 }

◆ lar_fcal()

Identifier AtlasDetectorID::lar_fcal ( void ) const

inherited

Definition at line 170 of file AtlasDetectorID.cxx.

                                            {
     Identifier result{0};
     // Pack field
     m_det_impl.pack(lar_field_value(), result);
     m_lar_part_impl.pack(m_LAR_FCAL_ID, result);
     return result;
 }

◆ lar_fcal_exp()

ExpandedIdentifier AtlasDetectorID::lar_fcal_exp ( void ) const

inlineprotectedinherited

Definition at line 571 of file AtlasDetectorID.h.

 {
     ExpandedIdentifier result(lar_exp());
     return (result << m_LAR_FCAL_ID);
 }

◆ lar_fcal_field_value()

int AtlasDetectorID::lar_fcal_field_value ( ) const

inlineprotectedinherited

Definition at line 645 of file AtlasDetectorID.h.

645 {return (m_LAR_FCAL_ID);}

◆ lar_field_value()

int AtlasDetectorID::lar_field_value ( ) const

inlineprotectedinherited

Definition at line 609 of file AtlasDetectorID.h.

609 {return (m_LAR_ID);}

◆ lar_hec()

Identifier AtlasDetectorID::lar_hec ( void ) const

inherited

Definition at line 162 of file AtlasDetectorID.cxx.

                                           {
     Identifier result{0};
     // Pack field
     m_det_impl.pack(lar_field_value(), result);
     m_lar_part_impl.pack(m_LAR_HEC_ID, result);
     return result;
 }

◆ lar_hec_exp()

ExpandedIdentifier AtlasDetectorID::lar_hec_exp ( void ) const

inlineprotectedinherited

Definition at line 564 of file AtlasDetectorID.h.

 {
     ExpandedIdentifier result(lar_exp());
     return (result << m_LAR_HEC_ID);
 }

◆ lar_hec_field_value()

int AtlasDetectorID::lar_hec_field_value ( ) const

inlineprotectedinherited

Definition at line 642 of file AtlasDetectorID.h.

642 {return (m_LAR_HEC_ID);}

◆ lar_lvl1()

Identifier AtlasDetectorID::lar_lvl1 ( void ) const

inherited

Definition at line 138 of file AtlasDetectorID.cxx.

                                            {
     Identifier result{0};
     // Pack field
     m_det_impl.pack(calo_field_value(), result);
     m_calo_side_impl.pack(-1, result);
     return result;
 }

◆ lucid_exp()

ExpandedIdentifier AtlasDetectorID::lucid_exp ( void ) const

inlineprotectedinherited

Definition at line 592 of file AtlasDetectorID.h.

 {
     ExpandedIdentifier result(fwd_exp());
     return (result << m_LUCID_ID);
 }

◆ lucid_field_value()

int AtlasDetectorID::lucid_field_value ( ) const

inlineprotectedinherited

Definition at line 672 of file AtlasDetectorID.h.

672 {return (m_LUCID_ID);}

◆ lumi()

Identifier AtlasDetectorID::lumi ( void ) const

inherited

Definition at line 122 of file AtlasDetectorID.cxx.

                                        {
     Identifier result{0};
     // Pack field
     m_det_impl.pack(indet_field_value(), result);
     m_indet_part_impl.pack(m_LUMI_ID, result);
     return result;
 }

◆ lumi_exp()

ExpandedIdentifier AtlasDetectorID::lumi_exp ( void ) const

inlineprotectedinherited

Definition at line 550 of file AtlasDetectorID.h.

 {
     ExpandedIdentifier result(indet_exp());
     return (result << m_LUMI_ID);
 }

◆ lumi_field_value()

int AtlasDetectorID::lumi_field_value ( ) const

inlineprotectedinherited

Definition at line 633 of file AtlasDetectorID.h.

633 {return (m_LUMI_ID);}

◆ mdt()

Identifier AtlasDetectorID::mdt ( void ) const

inherited

Definition at line 37 of file AtlasDetectorID.cxx.

                                       {
     return Identifier{};
 }

◆ mdt_field_value()

int AtlasDetectorID::mdt_field_value ( ) const

inlineprotectedinherited

Definition at line 648 of file AtlasDetectorID.h.

648 {return (m_MDT_ID);}

◆ mm()

Identifier AtlasDetectorID::mm ( void ) const

inherited

Definition at line 52 of file AtlasDetectorID.cxx.

                                      {
     return Identifier{};
 }

◆ mm_field_value()

int AtlasDetectorID::mm_field_value ( ) const

inlineprotectedinherited

Definition at line 663 of file AtlasDetectorID.h.

663 {return (m_MM_ID);}

◆ msg() [1/2]

MsgStream & AthMessaging::msg ( ) const

inlineinherited

The standard message stream.

Returns a reference to the default message stream May not be invoked before sysInitialize() has been invoked.

Definition at line 164 of file AthMessaging.h.

 {
   MsgStream* ms = m_msg_tls.get();
   if (!ms) {
     if (!m_initialized.test_and_set()) initMessaging();
     ms = new MsgStream(m_imsg,m_nm);
     m_msg_tls.reset( ms );
   }
  
   ms->setLevel (m_lvl);
   return *ms;
 }

◆ msg() [2/2]

MsgStream & AthMessaging::msg ( const MSG::Level lvl ) const

inlineinherited

The standard message stream.

Returns a reference to the default message stream May not be invoked before sysInitialize() has been invoked.

Definition at line 179 of file AthMessaging.h.

180 { return msg() << lvl; }

◆ msgLvl()

bool AthMessaging::msgLvl ( const MSG::Level lvl ) const

inlineinherited

Test the output level.

Parameters

lvl	The message level to test against

Returns: boolean Indicating if messages at given level will be printed

Return values

true	Messages at level "lvl" will be printed

Definition at line 151 of file AthMessaging.h.

 {
   if (!m_initialized.test_and_set()) initMessaging();
   if (m_lvl <= lvl) {
     msg() << lvl;
     return true;
   } else {
     return false;
   }
 }

◆ msgSvc()

IMessageSvc* CaloIDHelper::msgSvc ( )

inherited

Return the message service for this helper (may be null).

◆ muon()

Identifier AtlasDetectorID::muon ( void ) const

inherited

Definition at line 76 of file AtlasDetectorID.cxx.

                                        {
     Identifier result{0};
     // Pack field
     m_det_impl.pack(muon_field_value(), result);
     return result;
 }

◆ muon_exp()

ExpandedIdentifier AtlasDetectorID::muon_exp ( void ) const

inlineprotectedinherited

Definition at line 501 of file AtlasDetectorID.h.

 {
     ExpandedIdentifier result;
     return (result << m_MUON_ID);
 }

◆ muon_field_value()

int AtlasDetectorID::muon_field_value ( ) const

inlineprotectedinherited

Definition at line 615 of file AtlasDetectorID.h.

615 {return (m_MUON_ID);}

◆ name()

const std::string& CaloIDHelper::name ( ) const

inherited

Return the name for this helper.

◆ operator=()

LArEM_Base_ID& LArEM_Base_ID::operator= ( const LArEM_Base_ID & )

private

◆ phi()

int LArEM_Base_ID::phi ( const Identifier id ) const

return phi according to :

element           range              meaning
-------           -----              -------

Cells:
phi for barrel   [0,63]         barrel presampler   - dphi = 0.1
"                [0,63]         sampling 1 region 0 - dphi = 0.1
"                [0,255]        sampling 1 region 1 - dphi = 0.025
"                [0,255]        sampling 2 region 0 - dphi = 0.025
"                [0,255]        sampling 2 region 1 - dphi = 0.025
"                [0,255]        sampling 3 region 1 - dphi = 0.025

phi for endcap   [0,63]      presampler  sampling 0 region 0       - dphi = 0.1
"                [0,63]      outer wheel sampling 1 regions [0,5]  - dphi = 0.1 
"                [0,63]      inner wheel sampling 1 regions 0      - dphi = 0.1 
"                [0,255]     outer wheel sampling 2 regions [0,1]  - dphi = 0.025
"                [0,63]      inner wheel sampling 2 region 0       - dphi = 0.1
"                [0,255]     outer wheel sampling 3 region 0       - dphi = 0.025

Supercells:
phi for barrel   [0,63]         barrel presampler   - dphi = 0.1
"                [0,63]         sampling 1 region 0 - dphi = 0.1
"                [0,63]         sampling 1 region 1 - dphi = 0.1
"                [0,63]         sampling 2 region 0 - dphi = 0.1
"                [0,63]         sampling 2 region 1 - dphi = 0.1
"                [0,63]         sampling 3 region 1 - dphi = 0.1

phi for endcap   [0,63]      presampler  sampling 0 region 0       - dphi = 0.1
"                [0,63]      outer wheel sampling 1 regions [0,5]  - dphi = 0.1 
"                [0,31]      inner wheel sampling 1 regions 0      - dphi = 0.2
"                [0,63]      outer wheel sampling 2 regions [0,1]  - dphi = 0.1
"                [0,31]      inner wheel sampling 2 region 0       - dphi = 0.2
"                [0,63]      outer wheel sampling 3 region 0       - dphi = 0.1

◆ phi0()

float CaloIDHelper::phi0 ( const IdentifierHash regHash ) const

inherited

Return the minimum phi of region, or NOT_VALID.

Parameters

regHash REGION hash code.

Definition at line 220 of file CaloIDHelper.cxx.

 {
   if (regHash >= m_vecOfDictRegions.size()) return NOT_VALID;
   return (m_vecOfDictRegions[regHash]->phi0());
 }

◆ phi_max()

int LArEM_Base_ID::phi_max ( const Identifier regId ) const

max value of phi index (-999 == failure)

Warning: input = REGION ID !!

Definition at line 121 of file LArEM_Base_ID.cxx.

 {
   ExpandedIdentifier expId;
   IdContext context = region_context();
   if(!get_expanded_id(regId, expId, &context)) {
     int result = -999;
     for (unsigned int i = 0; i < m_full_em_range.size(); ++i) {
       const Range& range = m_full_em_range[i];
       if (range.match(expId)) {
     const Range::field& phi_field = range[m_PHI_INDEX];
     if (not phi_field.empty()) {
       int phimax = phi_field.get_maximum();
       if (result < phimax) result = phimax;
     }
       }
     }
     return (result);
   }
   return (-999);  // default
 }

◆ phi_min()

int LArEM_Base_ID::phi_min ( const Identifier regId ) const

min value of phi index (-999 == failure)

Warning: input = REGION ID !!

◆ phi_min_init()

int LArEM_Base_ID::phi_min_init ( const Identifier regId ) const

private

Definition at line 95 of file LArEM_Base_ID.cxx.

 {
   ExpandedIdentifier expId;
   IdContext region_cntxt = region_context();
   if(!get_expanded_id(regId, expId, &region_cntxt)) {
     int result = -999;
     for (unsigned int i = 0; i < m_full_em_range.size(); ++i) {
       const Range& range = m_full_em_range[i];
       if (range.match(expId)) {
     const Range::field& phi_field = range[m_PHI_INDEX];
     if (not phi_field.empty()) {
       int phimin = phi_field.get_minimum();
       if (-999 == result) {
         result = phimin;
       }
       else {
         if (phimin < result) result = phimin;
       }
     }
       }
     }
     return (result);
   }
   return (-999);  // default
 }

◆ phiGranularity()

float CaloIDHelper::phiGranularity ( const IdentifierHash regHash ) const

inherited

Return the phi granularity of a region, or NOT_VALID.

Parameters

regHash REGION hash code.

Definition at line 198 of file CaloIDHelper.cxx.

 {
   if (regHash >= m_vecOfDictRegions.size()) return NOT_VALID;
   return  2. * M_PI / m_vecOfDictRegions[regHash]->dphi();
 }

◆ pixel()

Identifier AtlasDetectorID::pixel ( void ) const

inherited

Definition at line 90 of file AtlasDetectorID.cxx.

                                         {
     Identifier result{0};
     // Pack field
     m_det_impl.pack(indet_field_value(), result);
     m_indet_part_impl.pack(m_PIXEL_ID, result);
     return result;
 }

◆ pixel_exp()

ExpandedIdentifier AtlasDetectorID::pixel_exp ( void ) const

inlineprotectedinherited

Inner Detector:

Definition at line 522 of file AtlasDetectorID.h.

 {
     ExpandedIdentifier result(indet_exp());
     return (result << m_PIXEL_ID);
 }

◆ pixel_field_value()

int AtlasDetectorID::pixel_field_value ( ) const

inlineprotectedinherited

Definition at line 621 of file AtlasDetectorID.h.

621 {return (m_PIXEL_ID);}

◆ plr_field_value()

int AtlasDetectorID::plr_field_value ( ) const

inlineprotectedinherited

Definition at line 636 of file AtlasDetectorID.h.

636 {return (m_LUMI_PLR_ID);}

◆ print()

void AtlasDetectorID::print	(	Identifier	id,
		const IdContext *	context = `0`
	)		const

inherited

Expanded print out of any identifier.

Definition at line 423 of file AtlasDetectorID.cxx.

                                                                          {
     ATH_MSG_INFO(print_to_string(id, context));
 }

◆ print_to_string()

std::string AtlasDetectorID::print_to_string	(	Identifier	id,
		const IdContext *	context = `0`
	)		const

inherited

or provide the printout in string form

Definition at line 427 of file AtlasDetectorID.cxx.

                                                                              {
     // Print out for any Atlas identifier
     std::string result;
     if (m_is_initialized_from_dict) {
  
         // Do a generic printout of identifier from dictionary
         unsigned int max_index = (context) ? context->end_index() : 999;
  
         // Find the dictionary to use:
         IdDictDictionary *dict{nullptr};
         ExpandedIdentifier expId;
         ExpandedIdentifier prefix; // default is null prefix
         Identifier compact = id;
  
         if (is_indet(id)) {
             dict = m_indet_dict;
         } else if (is_lar(id)) {
             dict = m_lar_dict;
         } else if (is_tile(id)) {
             dict = m_tile_dict;
         } else if (is_muon(id)) {
             dict = m_muon_dict;
         } else if (is_lvl1_trig_towers(id) ||  is_lvl1_online(id) ||
                    is_lar_dm(id) || is_tile_dm(id)) {
             dict = m_calo_dict;
         } else if (is_forward(id)) {
             dict = m_fwd_dict;
         }
  
         if (!dict) {
             ATH_MSG_WARNING(__func__<<":"<<__LINE__<<" No dictionary could be associated to "<<id);
             return result;
         }
         if (dict->unpack(m_group, compact, prefix, max_index," ", result)) {
             return result;
         }
     }
     return result;
 }

◆ reg_begin()

id_iterator LArEM_Base_ID::reg_begin ( ) const

begin iterator over set of Region Identifiers

◆ reg_end()

id_iterator LArEM_Base_ID::reg_end ( ) const

end iterator over set of Region Identifiers

◆ reg_range()

id_range LArEM_Base_ID::reg_range ( ) const

Range over set of Region Identifiers.

◆ region()

int LArEM_Base_ID::region ( const Identifier id ) const

return region according to :

element           range              meaning

region           0               both presamplers
"                [0,1]           barrel sampling 1 and 2 
"                0               barrel sampling 3
"
"                [0,5]           endcap outer wheel sampling 1 (cells)
"                0,[2,5]         endcap outer wheel sampling 1 (supercells)
"                0               endcap inner wheel sampling 1 (cells)
"                [0,1]           endcap inner wheel sampling 1 (supercells)
"                [0,1]           endcap outer wheel sampling 2
"                0               endcap inner wheel sampling 2 (cells)
"                [0,1]           endcap inner wheel sampling 2 (supercells)
"                0               endcap outer wheel sampling 3

◆ region_context()

IdContext CaloIDHelper::region_context ( ) const

inherited

Return the context for regions.

◆ region_hash() [1/2]

IdentifierHash CaloIDHelper::region_hash ( Identifier regionId ) const

inherited

Convert a connected region Identifier to a hash code.

Some subdetector helpers may override this with a faster version.

◆ region_hash() [2/2]

IdentifierHash CaloIDHelper::region_hash

Convert a connected region Identifier to a hash code.

Some subdetector helpers may override this with a faster version.

◆ region_hash_max()

size_type CaloIDHelper::region_hash_max ( ) const

inherited

One more than the largest region hash code.

◆ region_id() [1/6]

Identifier LArEM_Base_ID::region_id ( const ExpandedIdentifier & exp_id ) const

Build a cell identifier from an expanded identifier.

◆ region_id() [2/6]

Identifier LArEM_Base_ID::region_id ( const Identifier channelId ) const

allows to know in which region is a channel/cell – valid for both kinds of channels

◆ region_id() [3/6]

Identifier CaloIDHelper::region_id ( IdentifierHash hashId ) const

inherited

Return the region Identifier for a given hash code (no checking).

◆ region_id() [4/6]

Identifier CaloIDHelper::region_id

Return the region Identifier for a given hash code (no checking).

◆ region_id() [5/6]

Identifier LArEM_Base_ID::region_id	(	int	barrel_ec,
		int	sampling,
		int	region
	)		const

build a region identifier

◆ region_id() [6/6]

Identifier LArEM_Base_ID::region_id	(	int	barrel_ec,
		int	sampling,
		int	region,
		bool	checks
	)		const

◆ region_id_checks()

void LArEM_Base_ID::region_id_checks	(	int	barrel_ec,
		int	sampling,
		int	region
	)		const

private

Definition at line 142 of file LArEM_Base_ID.cxx.

 {
   // Check that id is within allowed range
  
   // Fill expanded id
   ExpandedIdentifier expId(lar_em_exp());
   expId << barrel_ec << sampling << region ;
  
   if (!m_full_region_range.match(expId)) { 
     std::string errorMessage = "LArEM_Base_ID::region_id_checks() result is not OK: ID, range = "
       + std::string(expId) + " , " + (std::string)m_full_region_range;
     throw LArID_Exception(errorMessage , 5);
   }
 }

◆ regions() [1/2]

HashGroup& CaloIDHelper::regions ( )

protectedinherited

Return the HashGroup for regions. non-const.

◆ regions() [2/2]

const HashGroup& CaloIDHelper::regions ( ) const

inherited

Return the HashGroup for regions.

◆ register_dict_tag()

int AtlasDetectorID::register_dict_tag	(	const IdDictMgr &	dict_mgr,
		const std::string &	dict_name
	)

protectedinherited

Register the file and tag names for a particular IdDict dictionary.

Definition at line 201 of file AtlasDetectorID.cxx.

                                                                    {
     // Register version of dictionary dict_name
  
     // Access dictionary by name
     IdDictDictionary *dict = dict_mgr.find_dictionary(dict_name);
     if (!dict) {
         ATH_MSG_ERROR(__func__<<":"<<__LINE__<<" No dictionary found");
         return 1;
  
     }
     // Add in dict name, file name and version
     m_dict_names.push_back(dict_name);
     m_file_names.push_back(dict->file_name());
     m_dict_tags.push_back(dict->dict_tag());
     return 0;
 }

◆ reinitialize()

bool AtlasDetectorID::reinitialize ( const IdDictMgr & dict_mgr )

protectedinherited

Test whether an idhelper should be reinitialized based on the change of tags.

Definition at line 221 of file AtlasDetectorID.cxx.

                                                             {
     // If no tag has been registered, then reinitialize
     if (m_dict_tags.size() == 0){
         return true;
     }
     // If no dict names have been registered, then reinitialize
     if (m_dict_names.size() == 0){
         return true;
     }
     // Loop over dict names and check version tags
     if (m_dict_names.size() != m_dict_tags.size()) {
         ATH_MSG_ERROR("reinitialize: dict names and tags vectors not the same length ");
         ATH_MSG_ERROR("names: " << m_dict_names.size() << " tags: " << m_dict_tags.size());
     }
     for (unsigned int i = 0; i < m_dict_names.size(); ++i) {
         // Access dictionary by name
         IdDictDictionary *dict = dict_mgr.find_dictionary(m_dict_names[i]);
         if (!dict) {
             ATH_MSG_ERROR("reinitialize: could not find dict -  " << m_dict_names[i]);
             return false;
         }
         if (m_dict_tags[i] != dict->dict_tag()) {
             // Remove all memory of versions
             m_dict_names.clear();
             m_dict_tags.clear();
             m_file_names.clear();
             return true;
         }
     }
  
     // Tags match - don't reinitialize
     return false;
 }

◆ rpc()

Identifier AtlasDetectorID::rpc ( void ) const

inherited

Definition at line 43 of file AtlasDetectorID.cxx.

                                       {
     return Identifier{};
 }

◆ rpc_field_value()

int AtlasDetectorID::rpc_field_value ( ) const

inlineprotectedinherited

Definition at line 654 of file AtlasDetectorID.h.

654 {return (m_RPC_ID);}

◆ sampling()

int LArEM_Base_ID::sampling ( const Identifier id ) const

return sampling according to :

element range meaning

sampling 0 both presamplers " [1,3] barrel and endcap outer wheel " [1,2] endcap inner wheel

◆ sct()

Identifier AtlasDetectorID::sct ( void ) const

inherited

Definition at line 98 of file AtlasDetectorID.cxx.

                                       {
     Identifier result{0};
     // Pack field
     m_det_impl.pack(indet_field_value(), result);
     m_indet_part_impl.pack(m_SCT_ID, result);
     return result;
 }

◆ sct_exp()

ExpandedIdentifier AtlasDetectorID::sct_exp ( void ) const

inlineprotectedinherited

Definition at line 529 of file AtlasDetectorID.h.

 {
     ExpandedIdentifier result(indet_exp());
     return (result << m_SCT_ID);
 }

◆ sct_field_value()

int AtlasDetectorID::sct_field_value ( ) const

inlineprotectedinherited

Definition at line 624 of file AtlasDetectorID.h.

624 {return (m_SCT_ID);}

◆ set_do_checks()

void AtlasDetectorID::set_do_checks ( bool do_checks )

overridevirtualinherited

Implements IdHelper.

Definition at line 479 of file AtlasDetectorID.cxx.

                                                   {
     m_do_checks = do_checks;
 }

◆ set_do_neighbours()

void AtlasDetectorID::set_do_neighbours ( bool do_neighbours )

overridevirtualinherited

Implements IdHelper.

Definition at line 487 of file AtlasDetectorID.cxx.

                                                           {
     m_do_neighbours = do_neighbours;
 }

◆ set_quiet()

void AtlasDetectorID::set_quiet ( bool quiet )

inherited

Set flag for suppressing informational output.

Definition at line 495 of file AtlasDetectorID.cxx.

                                           {
     m_quiet = quiet;
 }

◆ setDictVersion()

void AtlasDetectorID::setDictVersion	(	const IdDictMgr &	dict_mgr,
		const std::string &	name
	)

overrideprotectedvirtualinherited

Implements IdHelper.

Definition at line 499 of file AtlasDetectorID.cxx.

                                                                                      {
     const IdDictDictionary *dict = dict_mgr.find_dictionary(name);
     m_dict_version = dict->version();
 }

◆ setLevel()

void AthMessaging::setLevel ( MSG::Level lvl )

inherited

Change the current logging level.

Use this rather than msg().setLevel() for proper operation with MT.

Definition at line 28 of file AthMessaging.cxx.

 {
   m_lvl = lvl;
 }

◆ setMessageSvc()

void AtlasDetectorID::setMessageSvc ( IMessageSvc * msgSvc )

overridevirtualinherited

Implements IdHelper.

Definition at line 491 of file AtlasDetectorID.cxx.

                                                        {
     m_msgSvc = msgSvc;
 }

◆ show()

void AtlasDetectorID::show	(	Identifier	id,
		const IdContext *	context = `0`,
		char	sep = `'.'`
	)		const

inherited

Short print out of any identifier (optionally provide separation character - default is '.

'):

Definition at line 359 of file AtlasDetectorID.cxx.

                                                                                         {
     ATH_MSG_INFO(show_to_string(id, context, sep));
 }

◆ show_to_string()

std::string AtlasDetectorID::show_to_string	(	Identifier	id,
		const IdContext *	context = `0`,
		char	sep = `'.'`
	)		const

inherited

or provide the printout in string form

Definition at line 365 of file AtlasDetectorID.cxx.

                                                                                              {
     // Do a generic printout of identifier
  
     std::string result("Unable to decode id");
     unsigned int max_index = (context) ? context->end_index() : 999;
  
     if (!id.is_valid()) {
       return "[INVALID]";
     }
  
     if (!m_is_initialized_from_dict)
         return result;
  
     // Find the dictionary to use:
     IdDictDictionary *dict{nullptr};
     ExpandedIdentifier expId{};
     ExpandedIdentifier prefix{}; // default is null prefix
     Identifier compact = id;
  
     if (is_indet(id)) {
         dict = m_indet_dict;
     } else if (is_lar(id)) {
         dict = m_lar_dict;
     } else if (is_tile(id)) {
         dict = m_tile_dict;
     } else if (is_muon(id)) {
         dict = m_muon_dict;
     } else if (is_lvl1_trig_towers(id) || is_lvl1_online(id) ||
                is_lar_dm(id) || is_tile_dm(id)) {
         dict = m_calo_dict;
     } else if (is_forward(id)) {
         dict = m_fwd_dict;
     }
  
     if (!dict) {
         ATH_MSG_WARNING(__func__<<" No detector type associated to id "<<id);
         return result;
     }
     if (dict->unpack(m_group, compact, prefix, max_index, expId)) {
         return result;
     }
  
     bool first = true;
     result = "";
     if ('.' == sep)
         result = "[";
     for (unsigned int i = 0; i < expId.fields(); ++i) {
         if (first)
             first = false;
         else
             result += sep;
         result += std::format("{}", expId[i]);
     }
     if ('.' == sep)
         result += "]";
     return result;
 }

◆ stgc()

Identifier AtlasDetectorID::stgc ( void ) const

inherited

Definition at line 49 of file AtlasDetectorID.cxx.

                                        {
     return Identifier{};
 }

◆ stgc_field_value()

int AtlasDetectorID::stgc_field_value ( ) const

inlineprotectedinherited

Definition at line 660 of file AtlasDetectorID.h.

660 {return (m_STGC_ID);}

◆ subdet_context()

IdContext AtlasDetectorID::subdet_context ( void ) const

inherited

IdContext (indicates id length) for sub-detector.

Definition at line 184 of file AtlasDetectorID.cxx.

                                                 {
     ExpandedIdentifier id{};
     return IdContext{id, 0, m_SUBDET_INDEX};
 }

◆ tgc()

Identifier AtlasDetectorID::tgc ( void ) const

inherited

Definition at line 46 of file AtlasDetectorID.cxx.

                                       {
     return Identifier{};
 }

◆ tgc_field_value()

int AtlasDetectorID::tgc_field_value ( ) const

inlineprotectedinherited

Definition at line 657 of file AtlasDetectorID.h.

657 {return (m_TGC_ID);}

◆ tile()

Identifier AtlasDetectorID::tile ( void ) const

inherited

Definition at line 69 of file AtlasDetectorID.cxx.

                                        {
     Identifier result{0};
     // Pack field
     m_det_impl.pack(tile_field_value(), result);
     return result;
 }

◆ tile_dm()

Identifier AtlasDetectorID::tile_dm ( void ) const

inherited

Definition at line 154 of file AtlasDetectorID.cxx.

                                           {
     Identifier result{0};
     // Pack field
     m_det_impl.pack(calo_field_value(), result);
     m_calo_side_impl.pack(-5, result);
     return result;
 }

◆ tile_exp()

ExpandedIdentifier AtlasDetectorID::tile_exp ( void ) const

inlineprotectedinherited

Definition at line 494 of file AtlasDetectorID.h.

 {
     ExpandedIdentifier result;
     return (result << m_TILE_ID);
 }

◆ tile_field_value()

int AtlasDetectorID::tile_field_value ( ) const

inlineprotectedinherited

Definition at line 612 of file AtlasDetectorID.h.

612 {return (m_TILE_ID);}

◆ to_range()

std::string AtlasDetectorID::to_range ( const ExpandedIdentifier & id ) const

protectedinherited

Definition at line 504 of file AtlasDetectorID.cxx.

                                                                       {
  
     // Build a string from the contents of an identifier
     int fields = id.fields();
     std::string result("");
     for (int i = 0; i < fields; ++i) {
         if (i > 0) {
             result += '/'; // add '/' only if NOT last one
         }
         result += std::format("{}", id[i]);
     }
     return result;
 }

◆ trt()

Identifier AtlasDetectorID::trt ( void ) const

inherited

Definition at line 106 of file AtlasDetectorID.cxx.

                                       {
     Identifier result{0};
     // Pack field
     m_det_impl.pack(indet_field_value(), result);
     m_indet_part_impl.pack(m_TRT_ID, result);
     return result;
 }

◆ trt_exp()

ExpandedIdentifier AtlasDetectorID::trt_exp ( void ) const

inlineprotectedinherited

Definition at line 536 of file AtlasDetectorID.h.

 {
     ExpandedIdentifier result(indet_exp());
     return (result << m_TRT_ID);
 }

◆ trt_field_value()

int AtlasDetectorID::trt_field_value ( ) const

inlineprotectedinherited

Definition at line 627 of file AtlasDetectorID.h.

627 {return (m_TRT_ID);}

◆ twoSymSides()

bool LArEM_Base_ID::twoSymSides ( ) const

True if the + and - sides of the calorimeter are identical (true layout).

False if they are mirror reflections (used in early MC).

◆ zdc_exp()

ExpandedIdentifier AtlasDetectorID::zdc_exp ( void ) const

inlineprotectedinherited

Definition at line 599 of file AtlasDetectorID.h.

 {
     ExpandedIdentifier result(fwd_exp());
     return (result << m_ZDC_ID);
 }

◆ zdc_field_value()

int AtlasDetectorID::zdc_field_value ( ) const

inlineprotectedinherited

Definition at line 674 of file AtlasDetectorID.h.

674 {return (m_ZDC_ID);}

Member Data Documentation

◆ ATLAS_THREAD_SAFE

std::atomic_flag m_initialized AthMessaging::ATLAS_THREAD_SAFE = ATOMIC_FLAG_INIT

◆ m_CSC_ID

int AtlasDetectorID::m_CSC_ID {1}

privateinherited

Definition at line 419 of file AtlasDetectorID.h.

◆ m_det_impl

IdDictFieldImplementation AtlasDetectorID::m_det_impl

privateinherited

Definition at line 444 of file AtlasDetectorID.h.

◆ m_DET_INDEX

size_type AtlasDetectorID::m_DET_INDEX {999}

privateinherited

Definition at line 400 of file AtlasDetectorID.h.

std::vector<std::string> AtlasDetectorID::m_file_names

std::string AtlasDetectorID::m_group

protectedinherited

Group name.

Definition at line 359 of file AtlasDetectorID.h.

◆ m_hash_calcs

std::vector<HashCalc> LArEM_Base_ID::m_hash_calcs

private

Definition at line 448 of file LArEM_Base_ID.h.

◆ m_helper

AtlasDetectorIDHelper* AtlasDetectorID::m_helper {}

privateinherited

Definition at line 443 of file AtlasDetectorID.h.

◆ m_HGTD_ID

int AtlasDetectorID::m_HGTD_ID {4}

privateinherited

Definition at line 411 of file AtlasDetectorID.h.

◆ m_imsg

std::atomic<IMessageSvc*> AthMessaging::m_imsg { nullptr }

std::atomic<MSG::Level> AthMessaging::m_lvl { MSG::NIL }

◆ m_msgSvc

IMessageSvc* AtlasDetectorID::m_msgSvc {}

IdDictFieldImplementation LArEM_Base_ID::m_phi_impl

private

Definition at line 424 of file LArEM_Base_ID.h.

◆ m_PHI_INDEX

size_type LArEM_Base_ID::m_PHI_INDEX {999}

private

Definition at line 415 of file LArEM_Base_ID.h.

◆ m_PIXEL_ID

int AtlasDetectorID::m_PIXEL_ID {1}

privateinherited

Definition at line 408 of file AtlasDetectorID.h.

◆ m_quiet

bool AtlasDetectorID::m_quiet {}

protectedinherited

If true, suppress DEBUG/INFO messages.

Definition at line 372 of file AtlasDetectorID.h.

◆ m_region_impl

IdDictFieldImplementation LArEM_Base_ID::m_region_impl

private

Definition at line 422 of file LArEM_Base_ID.h.

◆ m_REGION_INDEX

size_type LArEM_Base_ID::m_REGION_INDEX {999}

private

Definition at line 413 of file LArEM_Base_ID.h.

◆ m_regions

◆ m_two_sym_sides

bool LArEM_Base_ID::m_two_sym_sides {true}

private

Definition at line 403 of file LArEM_Base_ID.h.

◆ m_vecOfDictRegions

std::vector<const IdDictRegion*> CaloIDHelper::m_vecOfDictRegions

privateinherited

List of IdDictRegion objects.

Definition at line 342 of file CaloIDHelper.h.

◆ m_vecOfPhiMin

std::vector<int> LArEM_Base_ID::m_vecOfPhiMin

private

Definition at line 428 of file LArEM_Base_ID.h.

◆ m_vecOfRegions

std::vector<LArEM_region*> LArEM_Base_ID::m_vecOfRegions

private

Definition at line 452 of file LArEM_Base_ID.h.

◆ m_ZDC_ID

int AtlasDetectorID::m_ZDC_ID {7}

privateinherited

Definition at line 428 of file AtlasDetectorID.h.

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

Classes

Public Types

Public Member Functions

Protected Member Functions

Private Types

Private Member Functions

Static Private Member Functions

Private Attributes

Initialization and version name

setting pointer to the MessageService

Detailed Description

Member Typedef Documentation

◆ id_iterator

◆ id_range

◆ size_type

Member Enumeration Documentation

◆ anonymous enum

◆ anonymous enum

◆ HelperType

◆ ID

Constructor & Destructor Documentation

◆ LArEM_Base_ID() [1/2]

◆ ~LArEM_Base_ID()

◆ LArEM_Base_ID() [2/2]

Member Function Documentation

◆ alfa_exp()

◆ alfa_field_value()

◆ barrel_ec()

◆ bcm_exp()

◆ bcm_field_value()

◆ calo()

◆ calo_exp()

◆ calo_field_value()

◆ channel_context()

◆ channel_hash()

◆ channel_hash_binary_search()

◆ channel_hash_max()

◆ channel_id() [1/7]

◆ channel_id() [2/7]

◆ channel_id() [3/7]

◆ channel_id() [4/7]

◆ channel_id() [5/7]

◆ channel_id() [6/7]

◆ channel_id() [7/7]

◆ channel_id_checks() [1/2]

◆ channel_id_checks() [2/2]

◆ channel_ids()

◆ channels() [1/2]

◆ channels() [2/2]

◆ csc()

◆ csc_field_value()

◆ detsystem_context()

◆ dict()

◆ dict_names()

◆ dict_tags()

◆ dictionaryVersion()

◆ dictRegions()

◆ do_checks()

◆ do_neighbours()

◆ em_begin()

◆ em_end()

◆ em_range()

◆ eta()

◆ eta0()

◆ eta_max()

◆ eta_min()

◆ etaGranularity()

◆ file_names()

◆ fill_vec_of_dict_regions()

◆ fix_barrel_ec()

◆ forward_field_value()

◆ fwd_exp()

◆ get_expanded_id()

◆ get_hash()

◆ get_id()

◆ get_neighbours()

◆ get_nextInEta()

◆ get_nextInPhi()

◆ get_nextInSamp()

◆ get_nextInSubdet()