ATLAS Offline Software
Loading...
Searching...
No Matches
LArEM_ID Class Reference

Helper class for LArEM offline identifiers. More...

#include <LArEM_ID.h>

Inheritance diagram for LArEM_ID:
Collaboration diagram for LArEM_ID:

Public Types

using size_type = Identifier::size_type
using id_iterator = std::vector<Identifier>::const_iterator
 Type for iterators over identifiers.
using id_range = std::ranges::subrange<id_iterator>
 Type for range over identifiers.
enum  { NOT_VALID =999999 }
enum class  HelperType {
  Unimplemented = -1 , Silicon = 0 , 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
}
 enum class for eventual final derived types of this class More...

Public Member Functions

 LArEM_ID ()
virtual ~LArEM_ID ()
virtual int initialize_from_dictionary (const IdDictMgr &dict_mgr)
 initialization from the identifier dictionary
Identifier region_id (const ExpandedIdentifier &exp_id) const
 Build a cell identifier from an expanded identifier.
Identifier region_id (int barrel_ec, int sampling, int region) const
 build a region identifier
Identifier region_id (int barrel_ec, int sampling, int region, 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
Identifier region_id (IdentifierHash hashId) const
 Return the region Identifier for a given hash code (no checking).
Identifier channel_id (const ExpandedIdentifier &exp_id) const
 Build a cell identifier from an expanded identifier.
Identifier channel_id (int barrel_ec, int sampling, int region, int eta, int phi) const
 build a cell identifier
Identifier channel_id (int barrel_ec, int sampling, int region, int eta, int phi, bool checks) const
Identifier channel_id (const Identifier regionId, int eta, int phi) const
 allows to build a cell id starting from a region id (e.g.
Identifier channel_id (const Identifier regionId, int eta, int phi, bool checks) const
Identifier channel_id (IdentifierHash hashId) const
 Return the channel (cell) Identifier for a given hash code (no checking).
IdentifierHash channel_hash (Identifier channelId) const
 create hash id from channel id
IdentifierHash channel_hash_binary_search (Identifier channelId) const
 create hash id from channel id – method NOT optimised, please use channel_hash() above
id_iterator reg_begin () const
 begin iterator over set of Region Identifiers
id_iterator reg_end () const
 end iterator over set of Region Identifiers
id_range reg_range () const
 Range over set of Region Identifiers.
id_iterator em_begin () const
 begin iterator over full set of EM Identifiers
id_iterator em_end () const
 end iterator over full set of EM Identifiers
id_range em_range () const
 Range over full set of EM Identifiers.
const std::vector< Identifier > & channel_ids () const
 provide access to channel id vector, accessed via hash
bool is_em_barrel (const Identifier id) const
 test if the id belongs to the EM barrel
bool is_em_endcap (const Identifier id) const
 test if the id belongs to the EM Endcap
bool is_em_endcap_inner (const Identifier id) const
 test if the id belongs to the EM Endcap inner wheel
bool is_em_endcap_outer (const Identifier id) const
 test if the id belongs to the EM Endcap outer wheel
int barrel_ec (const Identifier id) const
 return barrel_ec according to :

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

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

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

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

bool is_supercell (const Identifier id) const
 Test if the identifier represents a supercell.
int eta_min (const Identifier regId) const
 min value of eta index (-999 == failure)
int eta_max (const Identifier regId) const
 max value of eta index (-999 == failure)
int phi_min (const Identifier regId) const
 min value of phi index (-999 == failure)
int phi_max (const Identifier regId) const
 max value of phi index (-999 == failure)
int initialize_base_from_dictionary (const IdDictMgr &dict_mgr, const std::string &group_name)
 initialization from the identifier dictionary
bool twoSymSides () const
 True if the + and - sides of the calorimeter are identical (true layout).
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

IdentifierHash region_hash (Identifier regionId) const
 Convert a connected region Identifier to a hash code.
const HashGroupchannels () const
 Return the HashGroup for channels (cells).
const HashGroupregions () const
 Return the HashGroup for regions.
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.
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.
size_type channel_hash_max () const
 One more than the largest channel (cell) hash code.
size_type region_hash_max () const
 One more than the largest region hash code.
IdContext channel_context () const
 Return the context for channels (cells).
IdContext region_context () const
 Return the context for regions.
const std::vector< const IdDictRegion * > & dictRegions () const
 Return the vector of IdDictRegion, accessed via region hash.
float etaGranularity (const IdentifierHash regHash) const
 Return the eta granularity of a region, or NOT_VALID.
float phiGranularity (const IdentifierHash regHash) const
 Return the phi granularity of a region, or NOT_VALID.
float eta0 (const IdentifierHash regHash) const
 Return the minimum eta of region, or NOT_VALID.
float phi0 (const IdentifierHash regHash) const
 Return the minimum phi of region, or NOT_VALID.
const std::string & name () const
 Return the name for this helper.
bool msgLvl (const MSG::Level lvl) const
 Test the output level.
MsgStream & msg () const
 The standard message stream.
MsgStream & msg (const MSG::Level lvl) const
 The standard message stream.
void setLevel (MSG::Level lvl)
 Change the current logging level.
strutors
virtual HelperType helper () const
 Type of helper, defaulted to 'Unimplemented'.
const std::string & group () const
 Group name for this helper.
Detector system ids
Identifier indet (void) const
 Detector systems:
Identifier lar (void) const
Identifier tile (void) const
Identifier muon (void) const
Identifier calo (void) const
Inner Detector subsystem ids
Identifier pixel (void) const
Identifier sct (void) const
Identifier trt (void) const
Identifier hgtd (void) const
Identifier lumi (void) const
LAr subsystem ids
Identifier lar_em (void) const
Identifier lar_hec (void) const
Identifier lar_fcal (void) const
Muon subsystem ids
Identifier mdt (void) const
Identifier csc (void) const
Identifier rpc (void) const
Identifier tgc (void) const
Identifier stgc (void) const
Identifier mm (void) const
level 1 and dead material ids
Identifier lar_lvl1 (void) const
Identifier lar_dm (void) const
Identifier tile_dm (void) const
Contexts to provide id length - e.g. for use in generic decoding
IdContext detsystem_context (void) const
 IdContext (indicates id length) for detector systems.
IdContext subdet_context (void) const
 IdContext (indicates id length) for sub-detector.
Initialization and version name
virtual std::string dictionaryVersion (void) const override
Generic printing of identifiers
void show (Identifier id, const IdContext *context=0, char sep='.') const
 Short print out of any identifier (optionally provide separation character - default is '.
std::string show_to_string (Identifier id, const IdContext *context=0, char sep='.') const
 or provide the printout in string form
void print (Identifier id, const IdContext *context=0) const
 Expanded print out of any identifier.
std::string print_to_string (Identifier id, const IdContext *context=0) const
 or provide the printout in string form
Test of an Identifier to see if it belongs to a particular detector (sub)system:
bool is_indet (Identifier id) const
bool is_lar (Identifier id) const
bool is_tile (Identifier id) const
bool is_muon (Identifier id) const
bool is_calo (Identifier id) const
bool is_lvl1_trig_towers (Identifier id) const
bool is_lvl1_online (Identifier id) const
bool is_pixel (Identifier id) const
bool is_sct (Identifier id) const
bool is_trt (Identifier id) const
bool is_hgtd (Identifier id) const
bool is_lumi (Identifier id) const
bool is_plr (Identifier id) const
bool is_lar_em (Identifier id) const
bool is_lar_hec (Identifier id) const
bool is_lar_fcal (Identifier id) const
bool is_lar_minifcal (Identifier id) const
bool is_lar_dm (Identifier id) const
 LAr/Tile dead material:
bool is_tile_dm (Identifier id) const
bool is_mdt (Identifier id) const
bool is_csc (Identifier id) const
bool is_tgc (Identifier id) const
bool is_rpc (Identifier id) const
bool is_stgc (Identifier id) const
bool is_mm (Identifier id) const
bool is_forward (Identifier id) const
bool is_alfa (Identifier id) const
bool is_bcm (Identifier id) const
bool is_lucid (Identifier id) const
bool is_zdc (Identifier id) const
Test of an Identifier to see if it belongs to a particular detector (sub)system (using expanded ids):
bool is_indet (const ExpandedIdentifier &id) const
bool is_lar (const ExpandedIdentifier &id) const
bool is_tile (const ExpandedIdentifier &id) const
bool is_muon (const ExpandedIdentifier &id) const
bool is_calo (const ExpandedIdentifier &id) const
bool is_pixel (const ExpandedIdentifier &id) const
bool is_sct (const ExpandedIdentifier &id) const
bool is_trt (const ExpandedIdentifier &id) const
bool is_hgtd (const ExpandedIdentifier &id) const
bool is_lumi (const ExpandedIdentifier &id) const
bool is_plr (const ExpandedIdentifier &id) const
bool is_lar_em (const ExpandedIdentifier &id) const
bool is_lar_hec (const ExpandedIdentifier &id) const
bool is_lar_fcal (const ExpandedIdentifier &id) const
bool is_lar_minifcal (const ExpandedIdentifier &id) const
bool is_mdt (const ExpandedIdentifier &id) const
bool is_csc (const ExpandedIdentifier &id) const
bool is_tgc (const ExpandedIdentifier &id) const
bool is_rpc (const ExpandedIdentifier &id) const
bool is_stgc (const ExpandedIdentifier &id) const
bool is_mm (const ExpandedIdentifier &id) const
Dictionary versioning: provide access to dictionary names and versions. Note that a helper may correspond to one or more id dictionary
const std::vector< std::string > & dict_names (void) const
 Dictionary names.
const std::vector< std::string > & file_names (void) const
 File names for subdet dictionaries.
const std::vector< std::string > & dict_tags (void) const
 Version tags for subdet dictionaries.
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:
virtual bool do_checks (void) const override
 Checks are performed by default in debug compilation and NOT in optimized compilation.
virtual void set_do_checks (bool do_checks) override

Protected Member Functions

HashGroupchannels ()
 Return the HashGroup for channels (cells). non-const.
HashGroupregions ()
 Return the HashGroup for regions. non-const.
const IdDictDictionarydict () const
 Return the dictionary for this subdetector.
int fill_vec_of_dict_regions (const std::string &group_name="")
 Initialize the list of detector regions.

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)
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 ()
void initMessaging () const
 Initialize our message level and MessageSvc.

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< HashCalcm_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.
HashGroup m_channels
 Group of channel (cell) Identifiers.
HashGroup m_regions
 Group of region Identifiers.
const IdDictDictionarym_dict
 The dictionary for this helper.
std::vector< const IdDictRegion * > m_vecOfDictRegions
 List of IdDictRegion objects.
std::string m_nm
 Message source name.
boost::thread_specific_ptr< MsgStream > m_msg_tls
 MsgStream instance (a std::cout like with print-out levels)
std::atomic< IMessageSvc * > m_imsg { nullptr }
 MessageSvc pointer.
std::atomic< MSG::Level > m_lvl { MSG::NIL }
 Current logging level.
std::atomic_flag m_initialized ATLAS_THREAD_SAFE = ATOMIC_FLAG_INIT
 Messaging initialized (initMessaging)

neighbours are initialized by default. One can switch or query this mode with the following methods:

virtual bool do_neighbours (void) const override
 Neighbour initialization is performed by default One can switch or query this mode for any idHelper with the following method:
virtual void set_do_neighbours (bool do_neighbours) override
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
const IdDictDictionarym_atlas_dict {}
const IdDictDictionarym_indet_dict {}
const IdDictDictionarym_lar_dict {}
const IdDictDictionarym_tile_dict {}
const IdDictDictionarym_muon_dict {}
const IdDictDictionarym_calo_dict {}
const IdDictDictionarym_fwd_dict {}
AtlasDetectorIDHelperm_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 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:
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:
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.
ExpandedIdentifier lar_hec_exp (void) const
ExpandedIdentifier lar_fcal_exp (void) const
ExpandedIdentifier alfa_exp (void) const
 Forward.
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.
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.
bool reinitialize (const IdDictMgr &dict_mgr)
 Test whether an idhelper should be reinitialized based on the change of tags.
std::string m_group
 Group name.
bool m_do_checks {}
 Flag for subclasses to know whether or not to perform checks.
bool m_do_neighbours {true}
 Flag for subclasses to know whether or not to perform neighbour initialization.
std::vector< std::string > m_dict_names
 List of dictionary names used by this helper.
std::vector< std::string > m_file_names
 List of dictionary file names used by this helper.
std::vector< std::string > m_dict_tags
 List of dictionary versions used by this helper.

Detailed Description

Helper class for LArEM offline identifiers.

This class provides an interface to decode and generate offline identifiers for the LAr EM detector subsystem.

Definition and range of values for the elements of the identifier are:

Connected channels :

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
sampling         0                both presamplers
"                [1,3]            barrel and endcap outer wheel 
"                [1,2]            endcap inner wheel
region           0                both presamplers
"                [0,1]            barrel sampling 1 and 2 
"                0                barrel sampling 3
"
"                [0,5]            endcap outer wheel sampling 1
"                0                endcap inner wheel sampling 1
"                [0,1]            endcap outer wheel sampling 2
"                0                endcap inner wheel sampling 2
"                0                endcap outer wheel sampling 3
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 
"
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 0 - dphi = 0.025

number of cells in barrel :
presampler :  7808
sampling 1 : 58752
sampling 2 : 29184
sampling 3 : 13824
total      :109568

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
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 region  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
number of cells in endcap :
presampler  :  1536
Outer wheel:
sampling 1  : 27648
sampling 2  : 22528
sampling 3  : 10240
total       : 60416
Inner wheel:
sampling 1  :   896
sampling 2  :   896
total       :  1792
Grand Total : 63744
 
Author
started by RD Schaffer
maintained by Fabienne Ledroit

Definition at line 110 of file LArEM_ID.h.

Member Typedef Documentation

◆ id_iterator

Type for iterators over identifiers.

Definition at line 80 of file LArEM_Base_ID.h.

◆ id_range

using LArEM_Base_ID::id_range = std::ranges::subrange<id_iterator>
inherited

Type for range over identifiers.

Definition at line 82 of file LArEM_Base_ID.h.

◆ size_type

using LArEM_ID::size_type = Identifier::size_type

Definition at line 114 of file LArEM_ID.h.

Member Enumeration Documentation

◆ anonymous enum

anonymous enum
inherited
Enumerator
NOT_VALID 

Definition at line 36 of file CaloIDHelper.h.

36{ NOT_VALID=999999 };

◆ anonymous enum

anonymous enum
privateinherited
Enumerator
NOT_VALID_HASH 

Definition at line 350 of file LArEM_Base_ID.h.

350{NOT_VALID_HASH = 256000};

◆ HelperType

enum class 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.

55 {
56 Unimplemented = -1,
57 Silicon = 0,
58 Pixel, PLR, SCT, TRT,
59 //inherits from CaloIDHelper
60 LArEM, LArFCal, LArFCalSuperCell,
61 LArHEC, LArHEC_SuperCell, LARMiniFCal,
62 Tile, TileSuperCell,
63 //
64 //inherit from LArOnlineId
65 LArOnline, LArOnlineSuperCell,
66 //
67 LArElectrode, LArHVLine,
68 TileHardware, TileTestbeam,
69 CaloCell, CaloSuperCell,
70 CaloDM, CaloLvl1,
71 //inherit from JGTowerBase
72 GTower, JTower,
73 //
74 Muon,
75 LUCID, LUCID_Hardware,
76 Zdc,ZdcHardware,
77 TT
78 };
@ TRT
Definition RegSelEnums.h:26
@ SCT
Definition RegSelEnums.h:25
@ Pixel
Definition DetType.h:13
constexpr std::initializer_list< int > Tile
Definition HIEventDefs.h:70
Muon_v1 Muon
Reference the current persistent version:

◆ ID

enum AtlasDetectorID::ID
privateinherited
Enumerator
ATLAS_ID 
MAX_BIT 
PIXEL_MASK 
ALL_BITS 

Definition at line 373 of file AtlasDetectorID.h.

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

Constructor & Destructor Documentation

◆ LArEM_ID()

LArEM_ID::LArEM_ID ( )

Definition at line 16 of file LArEM_ID.cxx.

16 :
17 LArEM_Base_ID("LArEM_ID", "lar_em", 0)
18{
19}
LArEM_Base_ID(const std::string &name, const std::string &group, bool supercell)
Constructor.

◆ ~LArEM_ID()

LArEM_ID::~LArEM_ID ( )
virtualdefault

Member Function Documentation

◆ alfa_exp()

ExpandedIdentifier AtlasDetectorID::alfa_exp ( void ) const
protectedinherited

Forward.

Definition at line 1140 of file AtlasDetectorID.cxx.

1141{
1142 ExpandedIdentifier result(fwd_exp());
1143 return (result << m_ALFA_ID);
1144}
ExpandedIdentifier fwd_exp(void) const

◆ alfa_field_value()

int AtlasDetectorID::alfa_field_value ( ) const
inlineprotectedinherited

Definition at line 526 of file AtlasDetectorID.h.

526{return (m_ALFA_ID);}

◆ barrel_ec()

int LArEM_Base_ID::barrel_ec ( const Identifier id) const
inherited

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
protectedinherited

Definition at line 1147 of file AtlasDetectorID.cxx.

1148{
1149 ExpandedIdentifier result(fwd_exp());
1150 return (result << m_BCM_ID);
1151}

◆ bcm_field_value()

int AtlasDetectorID::bcm_field_value ( ) const
inlineprotectedinherited

Definition at line 528 of file AtlasDetectorID.h.

528{return (m_BCM_ID);}

◆ calo()

Identifier AtlasDetectorID::calo ( void ) const
inherited

Definition at line 85 of file AtlasDetectorID.cxx.

85 {
86 Identifier result{0};
87 // Pack field
88 m_det_impl.pack(calo_field_value(), result);
89 return result;
90}
IdDictFieldImplementation m_det_impl
int calo_field_value() const

◆ calo_exp()

ExpandedIdentifier AtlasDetectorID::calo_exp ( void ) const
protectedinherited

Definition at line 1070 of file AtlasDetectorID.cxx.

1071{
1072 ExpandedIdentifier result;
1073 return (result << m_CALO_ID);
1074}

◆ calo_field_value()

int AtlasDetectorID::calo_field_value ( ) const
inlineprotectedinherited

Definition at line 476 of file AtlasDetectorID.h.

476{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
inherited

create hash id from channel id

◆ channel_hash_binary_search()

IdentifierHash LArEM_Base_ID::channel_hash_binary_search ( Identifier channelId) const
inherited

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/6]

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

Build a cell identifier from an expanded identifier.

◆ channel_id() [2/6]

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

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

from descriptors) – valid for both kinds of channels

◆ channel_id() [3/6]

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

◆ channel_id() [4/6]

Identifier CaloIDHelper::channel_id ( IdentifierHash hashId) const
inherited

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

◆ channel_id() [5/6]

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

build a cell identifier

◆ channel_id() [6/6]

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

◆ channel_id_checks() [1/2]

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

Definition at line 174 of file LArEM_Base_ID.cxx.

176{
177 // Check that id is within allowed range
178
179 // Fill expanded id
180 ExpandedIdentifier expId;
181
182 IdContext context = region_context();
183 if (get_expanded_id(regionId, expId, &context)) {
184 std::string errorMessage = "LArEM_Base_ID::channel_id_checks(regId) result is not OK: ID = "
185 + show_to_string(regionId) ;
186 throw LArID_Exception(errorMessage , 6);
187 }
188
189 expId << eta << phi << m_slar;
190
191 if (!m_full_em_range.match(expId)) {
192 std::string errorMessage = "LArEM_Base_ID::channel_id_checks(regId) result is not OK: ID, range = "
193 + std::string(expId) + " , " + (std::string)m_full_em_range;
194 throw LArID_Exception(errorMessage , 6);
195 }
196}
std::string show_to_string(Identifier id, const IdContext *context=0, char sep='.') const
or provide the printout in string form
IdContext region_context() const
Return the context for regions.
int eta(const Identifier id) const
return eta according to :
int phi(const Identifier id) const
return phi according to :
virtual int get_expanded_id(const Identifier &id, ExpandedIdentifier &exp_id, const IdContext *context) const
create expanded Identifier from Identifier (return == 0 for OK)
MultiRange m_full_em_range

◆ channel_id_checks() [2/2]

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

Definition at line 158 of file LArEM_Base_ID.cxx.

160{
161 // Check that id is within allowed range
162
163 // Fill expanded id
164 ExpandedIdentifier expId(lar_em_exp());
165 expId << barrel_ec << sampling << region << eta << phi << m_slar ;
166
167 if (!m_full_em_range.match(expId)) {
168 std::string errorMessage = "LArEM_Base_ID::channel_id_checks() result is not OK: ID, range = "
169 + std::string(expId) + " , " + (std::string)m_full_em_range;
170 throw LArID_Exception(errorMessage , 6);
171 }
172}
ExpandedIdentifier lar_em_exp(void) const
LAr.
int region(const Identifier id) const
return region according to :
int barrel_ec(const Identifier id) const
return barrel_ec according to :
int sampling(const Identifier id) const
return sampling according to :

◆ channel_ids()

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

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 42 of file AtlasDetectorID.cxx.

42 {
43 return Identifier{};
44}

◆ csc_field_value()

int AtlasDetectorID::csc_field_value ( ) const
inlineprotectedinherited

Definition at line 509 of file AtlasDetectorID.h.

509{return (m_CSC_ID);}

◆ detsystem_context()

IdContext AtlasDetectorID::detsystem_context ( void ) const
inherited

IdContext (indicates id length) for detector systems.

Definition at line 180 of file AtlasDetectorID.cxx.

180 {
181 ExpandedIdentifier id{};
182 return IdContext{id, 0, m_DET_INDEX};
183}

◆ 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 469 of file AtlasDetectorID.cxx.

469 {
470 return m_dict_names;
471}
std::vector< std::string > m_dict_names
List of dictionary names used by this helper.

◆ dict_tags()

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

Version tags for subdet dictionaries.

Definition at line 475 of file AtlasDetectorID.cxx.

475 {
476 return m_dict_tags;
477}
std::vector< std::string > m_dict_tags
List of dictionary versions used by this helper.

◆ dictionaryVersion()

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

Implements IdHelper.

Definition at line 283 of file AtlasDetectorID.cxx.

283 {
284 return m_dict_version;
285}
std::string 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 478 of file AtlasDetectorID.cxx.

478 {
479 return m_do_checks;
480}
bool m_do_checks
Flag for subclasses to know whether or not to perform 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 485 of file AtlasDetectorID.cxx.

485 {
486 return m_do_neighbours;
487}
bool m_do_neighbours
Flag for subclasses to know whether or not to perform neighbour initialization.

◆ em_begin()

id_iterator LArEM_Base_ID::em_begin ( ) const
inherited

begin iterator over full set of EM Identifiers

◆ em_end()

id_iterator LArEM_Base_ID::em_end ( ) const
inherited

end iterator over full set of EM Identifiers

◆ em_range()

id_range LArEM_Base_ID::em_range ( ) const
inherited

Range over full set of EM Identifiers.

◆ eta()

int LArEM_Base_ID::eta ( const Identifier id) const
inherited

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
regHashREGION hash code.

Definition at line 206 of file CaloIDHelper.cxx.

207{
208 if (regHash >= m_vecOfDictRegions.size()) return NOT_VALID;
209 return (m_vecOfDictRegions.at(regHash)->eta0());
210}
std::vector< const IdDictRegion * > m_vecOfDictRegions
List of IdDictRegion objects.

◆ eta_max()

int LArEM_Base_ID::eta_max ( const Identifier regId) const
inherited

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

Warning
input = REGION ID !!

Definition at line 74 of file LArEM_Base_ID.cxx.

75{
76 ExpandedIdentifier expId;
77 IdContext context = region_context();
78 if(!get_expanded_id(regId, expId, &context)) {
79 int result = -999;
80 for (unsigned int i = 0; i < m_full_em_range.size(); ++i) {
81 const Range& range = m_full_em_range[i];
82 if (range.match(expId)) {
83 const Range::field& eta_field = range[m_ETA_INDEX];
84 if (not eta_field.empty()) {
85 int etamax = eta_field.get_maximum();
86 if (result < etamax) result = etamax;
87 }
88 }
89 }
90 return (result);
91 }
92 return (-999); // default
93}
bool empty() const
If true, this field does not have any constraints, and may hold any value representable by element_ty...
element_type get_maximum() const
size_type m_ETA_INDEX

◆ eta_min()

int LArEM_Base_ID::eta_min ( const Identifier regId) const
inherited

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

Warning
input = REGION ID !!

Definition at line 48 of file LArEM_Base_ID.cxx.

49{
50 ExpandedIdentifier expId;
51 IdContext context = region_context();
52 if(!get_expanded_id(regId, expId, &context)) {
53 int result = -999;
54 for (unsigned int i = 0; i < m_full_em_range.size(); ++i) {
55 const Range& range = m_full_em_range[i];
56 if (range.match(expId)) {
57 const Range::field& eta_field = range[m_ETA_INDEX];
58 if (not eta_field.empty()) {
59 int etamin = eta_field.get_minimum();
60 if (-999 == result) {
61 result = etamin;
62 }
63 else {
64 if (etamin < result) result = etamin;
65 }
66 }
67 }
68 }
69 return (result);
70 }
71 return (-999);
72}
element_type get_minimum() const
Query the values.

◆ etaGranularity()

float CaloIDHelper::etaGranularity ( const IdentifierHash regHash) const
inherited

Return the eta granularity of a region, or NOT_VALID.

Parameters
regHashREGION hash code.

Definition at line 184 of file CaloIDHelper.cxx.

185{
186 if (regHash >= m_vecOfDictRegions.size()) return NOT_VALID;
187 return m_vecOfDictRegions.at(regHash)->deta();
188}

◆ file_names()

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

File names for subdet dictionaries.

Definition at line 472 of file AtlasDetectorID.cxx.

472 {
473 return m_file_names;
474}
std::vector< std::string > m_file_names
List of dictionary file names used by this helper.

◆ 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_nameThe group for this helper.
Returns
0 on success; non-zero on failure.

Definition at line 256 of file CaloIDHelper.cxx.

257{
258 m_vecOfDictRegions.clear();
259 m_vecOfDictRegions.reserve (regions().hash_max());
260 IdContext region_cntxt = region_context();
261 ExpandedIdentifier expRegId;
262 for (Identifier id : regions().range()) {
263 if(!get_expanded_id(id, expRegId, &region_cntxt)) {
264 m_vecOfDictRegions.push_back (m_dict->find_region(expRegId,group_name));
265 }
266 }
267 // cppcheck-suppress assertWithSideEffect
268 assert (m_vecOfDictRegions.size() == regions().hash_max());
269 return 0;
270}
const HashGroup & regions() const
Return the HashGroup for regions.
virtual int get_expanded_id(const Identifier &id, ExpandedIdentifier &exp_id, const IdContext *context) const =0
Create an expanded Identifier from an Identifier.
const IdDictDictionary * m_dict
The dictionary for this helper.

◆ 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 524 of file AtlasDetectorID.h.

524{return (m_FWD_ID);}

◆ fwd_exp()

ExpandedIdentifier AtlasDetectorID::fwd_exp ( void ) const
protectedinherited

Definition at line 1077 of file AtlasDetectorID.cxx.

1078{
1079 ExpandedIdentifier result;
1080 return (result << m_FWD_ID);
1081}

◆ get_expanded_id()

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

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

Implements CaloIDHelper.

Definition at line 201 of file LArEM_Base_ID.cxx.

202{
203 // We assume that the context is >= region
204 exp_id.clear();
205 exp_id << lar_field_value()
207 << barrel_ec(id)
208 << sampling(id)
209 << region(id);
210 if(context && context->end_index() >= m_ETA_INDEX) {
211 exp_id << eta(id);
212 if(context->end_index() >= m_PHI_INDEX) {
213 exp_id << phi(id);
214 if ( context->end_index() >= m_SLAR_INDEX) {
215 exp_id << (unsigned)is_supercell(id);
216 }
217 }
218 }
219 return (0);
220}
Scalar eta() const
pseudorapidity method
Scalar phi() const
phi method
int lar_field_value() const
int lar_em_field_value() const
void clear()
Erase all fields.
size_type end_index() const
Definition IdContext.h:46
size_type m_PHI_INDEX
bool is_supercell(const Identifier id) const
Test if the identifier represents a supercell.
size_type m_SLAR_INDEX

◆ 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
idThe identifier to convert.
[out]hash_idThe resulting hash code. Will be invalid if there was an error.
contextThe 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 160 of file CaloIDHelper.cxx.

161{
162 hash_id = IdentifierHash();
163
164 size_t begin = (context) ? context->begin_index(): 0;
165 size_t end = (context) ? context->end_index() : 0;
166
167 if (0 == begin) {
168 const HashGroup* hg = nullptr;
169 if (m_channels.end_index() == end) hg = &m_channels;
170 else if (m_regions.end_index() == end) hg = &m_regions;
171
172 if (hg)
173 return hg->get_hash (id, hash_id);
174 }
175
176 return 1;
177}
Manage a list of identifiers.
HashGroup m_regions
Group of region Identifiers.
HashGroup m_channels
Group of channel (cell) Identifiers.
size_type begin_index() const
Definition IdContext.h:45

◆ 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_idThe hash code to convert.
[out]idThe resulting Identifier. Will be invalid if there was an error.
contextThe 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 118 of file CaloIDHelper.cxx.

121{
122 int result = 1;
123 id.clear();
124
125 size_t begin = (context) ? context->begin_index(): 0;
126 size_t end = (context) ? context->end_index() : 0;
127
128 if (0 == begin) {
129 const HashGroup* hg = nullptr;
130 if (m_channels.end_index() == end) hg = &m_channels;
131 else if (m_regions.end_index() == end) hg = &m_regions;
132
133 if (hg) {
134 if (hash_id < hg->hash_max()) {
135 id = hg->id (hash_id);
136 result = 0;
137 }
138 }
139 }
140
141 return(result);
142}

◆ get_neighbours()

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

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 542 of file LArEM_Base_ID.cxx.

544{
545 int result = 1;
546
547 neighbourList.clear();
548
549 if(!m_do_neighbours) {
550 ATH_MSG_WARNING("neighbours not initialized !!! returning empty list");
551 return result;
552 }
553
554 if(id >= channel_hash_max()) {
555 ATH_MSG_WARNING("neighbours requested for non-existing channel -- id/max " << id << "/" << channel_hash_max());
556 return result;
557 }
558
559 const short int maxNeighb=22;
560 IdentifierHash neighbList[maxNeighb];
561 int neighbourIndex = 0;
562
563 // cell index
564 unsigned int index=id;
565
566 //
567 // .... find in which region is the cell
568 //
569 auto itr = std::upper_bound(m_cells.begin(), m_cells.end(), index);
570 unsigned short int regionN = (itr - m_cells.begin()) - 1;
571 assert (regionN < m_vecOfRegions.size());
572 // get pointer to this region
573 LArEM_region* emRegion = m_vecOfRegions[regionN];
574 // retrieve characteristic numbers for this region
575 short int nPhi = emRegion->phiN();
576 float gPhi = emRegion->phiGranularity();
577 unsigned int minHash = emRegion->hashMin();
578 unsigned int maxHash = emRegion->hashMax();
579
580 bool corners2DOnly = ( (option & LArNeighbours::all2D)
582 //
583 // .... previous neighbour in phi
584 //
585 IdentifierHash prevNeighbInPhi=NOT_VALID_HASH;
586 if( (option & LArNeighbours::prevInPhi)
587 || corners2DOnly ){
588 if(!get_prevInPhi(emRegion, index, nPhi, minHash, neighbourIndex, neighbList)){
589 // always 1 and only 1 neighbour in phi in ATLAS, but 0 or 1 neighbour in phi in TB
590 prevNeighbInPhi=neighbList[neighbourIndex-1];
591 if( corners2DOnly ){
592 neighbourIndex--;
593 }
594 }
595 }
596
597 //
598 // ....next neighbour in phi
599 //
600 IdentifierHash nextNeighbInPhi=NOT_VALID_HASH;
601 if( (option & LArNeighbours::nextInPhi)
602 || corners2DOnly ){
603 if(!get_nextInPhi(emRegion, index, nPhi, minHash, neighbourIndex, neighbList)){
604 // always 1 and only 1 neighbour in phi in ATLAS, but 0 or 1 neighbour in phi in TB
605 nextNeighbInPhi=neighbList[neighbourIndex-1];
606 if( corners2DOnly ){
607 neighbourIndex--;
608 }
609 }
610 }
611
612 //
613 // ....previous neighbours in eta
614 //
615 unsigned int nPrevBiggerCell=NOT_VALID_HASH;
616 if( (option & LArNeighbours::prevInEta) ){
617 get_prevInEta(emRegion, index, nPhi, gPhi, minHash, neighbourIndex, neighbList, nPrevBiggerCell);
618 }
619
620 //
621 // ....next neighbours in eta
622 //
623 unsigned int nNextBiggerCell=NOT_VALID_HASH;
624 if( (option & LArNeighbours::nextInEta) ){
625 get_nextInEta(emRegion, index, nPhi, gPhi, maxHash, neighbourIndex, neighbList, nNextBiggerCell);
626 }
627
628 //
629 // ....corners in the same sampling
630 //
631 if( (option & LArNeighbours::corners2D) ){
632 if(prevNeighbInPhi != NOT_VALID_HASH){
633 unsigned int index1=prevNeighbInPhi;
634 int oldNeighbourIndex = neighbourIndex;
635 // allow only 1 corner cell in order to avoid the problem of
636 // non-mutual neighbourness
637 // since the cells come ordered in phi it should be the last cell for
638 // prevNeighbInPhi as starting points
639 get_prevInEta(emRegion, index1, nPhi, gPhi, minHash, neighbourIndex, neighbList, nPrevBiggerCell);
640 if ( neighbourIndex > oldNeighbourIndex+1 ) {
641 neighbList[oldNeighbourIndex] = neighbList[neighbourIndex-1];
642 neighbourIndex = oldNeighbourIndex+1;
643 }
644 oldNeighbourIndex = neighbourIndex;
645 get_nextInEta(emRegion, index1, nPhi, gPhi, maxHash, neighbourIndex, neighbList, nNextBiggerCell);
646 if ( neighbourIndex > oldNeighbourIndex+1 ) {
647 neighbList[oldNeighbourIndex] = neighbList[neighbourIndex-1];
648 neighbourIndex = oldNeighbourIndex+1;
649 }
650 }
651
652 if(nextNeighbInPhi != NOT_VALID_HASH){
653 unsigned int index2=nextNeighbInPhi;
654 int oldNeighbourIndex = neighbourIndex;
655 // allow only 1 corner cell in order to avoid the problem of
656 // non-mutual neighbourness
657 // since the cells come ordered in phi it should be the 1st cell for
658 // nextNeighbInPhi
659 get_prevInEta(emRegion, index2, nPhi, gPhi, minHash, neighbourIndex, neighbList, nPrevBiggerCell);
660 if ( neighbourIndex > oldNeighbourIndex+1 ) {
661 neighbourIndex = oldNeighbourIndex+1;
662 }
663 oldNeighbourIndex = neighbourIndex;
664 get_nextInEta(emRegion, index2, nPhi, gPhi, maxHash, neighbourIndex, neighbList, nNextBiggerCell);
665 if ( neighbourIndex > oldNeighbourIndex+1 ) {
666 neighbourIndex = oldNeighbourIndex+1;
667 }
668 }
669 }
670
671 //
672 // .... neighbours in sampling (common code)
673 // EM caracteristics = granularity changes in both eta and phi + partial overlap of samplings
674 //
675 if( (option & LArNeighbours::upAndDown) ) {
676 // granularity of the initial region
677 double gEta = (double)(emRegion->etaGranularity());
678 // initial eta
679 int nEta = int( (index-minHash) / nPhi);
680 double absEta = (double)(emRegion->etaMin()) + (double)(nEta * gEta);
681
682 // previous neighbours in sampling
683 if( (option & LArNeighbours::prevInSamp) ){
684 get_prevInSamp(emRegion, index, nPhi, minHash, gEta, gPhi, absEta, neighbourIndex, neighbList);
685 }
686
687 // next neighbours in sampling
688 if( (option & LArNeighbours::nextInSamp) ){
689 get_nextInSamp(emRegion, index, nPhi, minHash, gEta, gPhi, absEta, neighbourIndex, neighbList);
690 }
691 }
692
693 //
694 // .... neighbours across subdet
695 //
697 // granularity of the initial region
698 double gEta = (double)(emRegion->etaGranularity());
699 // initial eta
700 int nEta = int( (index-minHash) / nPhi);
701 double absEta = (double)(emRegion->etaMin()) + (double)(nEta * gEta);
702
703 // prev neighbours in subdet
704 if( (option & LArNeighbours::prevSubDet) ){
705 get_prevInSubdet(emRegion, index, nPhi, minHash, gEta, gPhi, absEta, neighbourIndex, neighbList);
706 }
707 // next neighbours in subdet
708 if( (option & LArNeighbours::nextSubDet) ){
709 get_nextInSubdet(emRegion, index, nPhi, minHash, gEta, gPhi, absEta, neighbourIndex, neighbList);
710 }
711 }
712
713
714 neighbourList.resize(neighbourIndex);
715 if (neighbourIndex > 0) {
716 if (neighbourIndex <= maxNeighb) {
717 std::copy (&neighbList[0], &neighbList[neighbourIndex], neighbourList.begin());
718 result = 0 ;
719 } else {
720 ATH_MSG_WARNING(" more than 22 neighbours for this cell, NONE will be retained");
721 }
722 }
723
724 return result;
725}
#define ATH_MSG_WARNING(x)
size_type channel_hash_max() const
One more than the largest channel (cell) hash code.
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
std::vector< unsigned > m_cells
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_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
std::vector< LArEM_region * > m_vecOfRegions
static int get_nextInPhi(const LArEM_region *emRegion, const unsigned int &index, const short int &nPhi, const unsigned int &minHash, int &neighbourIndex, IdentifierHash *neighbList)
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_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
static int get_prevInPhi(const LArEM_region *emRegion, const unsigned int &index, const short int &nPhi, const unsigned int &minHash, int &neighbourIndex, IdentifierHash *neighbList)
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
float phiGranularity() const
phi granularity
unsigned int hashMax() const
hash Id of the last cell of the region +1
float etaGranularity() const
eta granularity
unsigned int hashMin() const
hash Id of the first cell of the region
float etaMin() const
starting eta
short int phiN() const
number of phi bins
str index
Definition DeMoScan.py:362
bool absEta(const xAOD::TauJet &tau, float &out)
constexpr int nEta
Default bin number of eta for vertex map.
constexpr int nPhi
Default bin number of phi for vertex map.

◆ 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
privateinherited

Definition at line 825 of file LArEM_Base_ID.cxx.

828{
829 int result = 1;
830
831 unsigned int nIndex = 0;
832 IdentifierHash nHash = 0;
833
834 if( emRegion->isEtaMax(index)){
835 // eta == etaMax -> go to next region in eta
836 short int nNextEtaRegion = emRegion->nextEtaRegion();
837 // no neighbour if no next region in eta
838 if( nNextEtaRegion != NOT_VALID_REGION ) {
839 // Tell clang to optimize assuming that FP exceptions can trap.
840 // Otherwise, it can vectorize the division, which can lead to
841 // spurious division-by-zero traps from unused vector lanes.
843 LArEM_region* nextEmRegion = m_vecOfRegions[nNextEtaRegion];
844 float gPhiPlus= nextEmRegion->phiGranularity();
845 unsigned int minHashPlus = nextEmRegion->hashMin();
846 float phiMargin = 0.25*std::min(gPhi,gPhiPlus);
847 float rPhi = (index+nPhi-maxHash)*gPhi+emRegion->phiMin();
848 int nPhiPlusFirst = int(std::floor((rPhi -nextEmRegion->phiMin())
849 /gPhiPlus+phiMargin))+minHashPlus;
850 int nPhiPlusNext = int(std::floor((rPhi+gPhi-nextEmRegion->phiMin())
851 /gPhiPlus+phiMargin))+minHashPlus;
852 if ( nPhiPlusNext == nPhiPlusFirst ) nPhiPlusNext++;
853
854 for(int i=nPhiPlusFirst; i<nPhiPlusNext; i++){
855 nIndex = i ;
856 if(nIndex != nBiggerCell) {
857 nHash = nIndex;
858 neighbList[neighbourIndex] = nHash;
859 neighbourIndex++;
860 result = 0;
861 }
862 // to avoid duplicated cells in corners
863 if(gPhi < gPhiPlus && nBiggerCell == NOT_VALID_HASH) nBiggerCell=nIndex;
864 }
865 }
866 }
867 else {
868 // stay in same region (1 neighbour)
869 nIndex = index + nPhi;
870 nHash = nIndex;
871 neighbList[neighbourIndex] = nHash;
872 neighbourIndex++;
873 result = 0;
874 }
875 return result;
876}
@ NOT_VALID_REGION
short int nextEtaRegion() const
region number of the next region in eta
bool isEtaMax(unsigned int index) const
is the considered cell in the last eta bin of the region ?
float phiMin() const
starting phi
#define CXXUTILS_TRAPPING_FP
Definition trapping_fp.h:24

◆ 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 )
staticprivateinherited

Definition at line 743 of file LArEM_Base_ID.cxx.

745{
746 int result = 1;
747 if(!emRegion->isPhiMax(index)) {
748 unsigned int nIndex = index+1;
749 if( ((index-minHash+1)%(nPhi)) == 0 ) nIndex=index-nPhi+1;
750 IdentifierHash nHash = nIndex;
751 neighbList[neighbourIndex] = nHash;
752 neighbourIndex++;
753 result = 0;
754 }
755 return result;
756}
bool isPhiMax(unsigned int index) const
is the considered cell in the last phi bin of the region ?

◆ 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
privateinherited

Definition at line 946 of file LArEM_Base_ID.cxx.

949{
950 int result = 1;
951
952 // neighbours' indices
953 unsigned int nIndex=0;
954 // neighbours' hash
955 IdentifierHash nHash=0;
956
957 const std::vector<short int>& nextSampRegion= emRegion->nextSamplingRegion();
958 int nNextSampReg = nextSampRegion.size();
959 if(nNextSampReg > 0) {
960 for(int ireg=0; ireg<nNextSampReg; ireg++) {
961 LArEM_region* nextEmRegion = m_vecOfRegions[nextSampRegion[ireg]];
962 double gEtaPlus = (double)(nextEmRegion->etaGranularity());
963 float gPhiPlus= nextEmRegion->phiGranularity();
964 double minEtaPlus = (double)(nextEmRegion->etaMin());
965 double maxEtaPlus = (double)(nextEmRegion->etaMax());
966 double margin = 0.25*std::min(gEta,gEtaPlus);
967 if((minEtaPlus < absEta+gEta-margin) && (absEta+margin < maxEtaPlus)) {
968 // Tell clang to optimize assuming that FP exceptions can trap.
969 // Otherwise, it can vectorize the division, which can lead to
970 // spurious division-by-zero traps from unused vector lanes.
972
973 short int nPhiPlus = nextEmRegion->phiN();
974 unsigned int minHashPlus = nextEmRegion->hashMin();
975 float phiMargin = 0.25*std::min(gPhi,gPhiPlus);
976 // phi 'coordinate' in initial region
977 float rPhi = ((index-minHash)%nPhi)*gPhi+emRegion->phiMin();
978 int nPhiPlusFirst = int(std::floor((rPhi -nextEmRegion->phiMin())
979 /gPhiPlus+phiMargin));
980 int nPhiPlusNext = int(std::floor((rPhi+gPhi-nextEmRegion->phiMin())
981 /gPhiPlus+phiMargin));
982 if ( nPhiPlusNext == nPhiPlusFirst ) nPhiPlusNext++;
983
984 double fEtaPlus = (absEta-minEtaPlus) / gEtaPlus + margin ;
985 // eta 'coordinate' in initial region + 1
986 double fEtaMaxPlus = (absEta+gEta-minEtaPlus) / gEtaPlus + margin ;
987 int nEtaPlus = int(fEtaPlus) ;
988 int nEtaMaxPlus = int(fEtaMaxPlus) ;
989 if (nEtaMaxPlus == nEtaPlus) nEtaMaxPlus++;
990
991 for(int i=nEtaPlus; i<nEtaMaxPlus; i++){
992 for(int j=nPhiPlusFirst; j<nPhiPlusNext; j++){
993 nIndex = minHashPlus + i * nPhiPlus + j;
994 if( (nIndex >= nextEmRegion->hashMin()) && (nIndex < nextEmRegion->hashMax()) ) {
995 nHash = nIndex;
996 neighbList[neighbourIndex] = nHash;
997 neighbourIndex++;
998 result = 0;
999 }
1000 }
1001 }
1002 } // end eta condition
1003 } // end loop on regions
1004 }
1005 return result;
1006}
float etaMax() const
end eta
const std::vector< short int > & nextSamplingRegion() const
region number of the next region in sampling

◆ 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
privateinherited

Definition at line 1077 of file LArEM_Base_ID.cxx.

1080{
1081 int result = 1;
1082
1083 // neighbours' indices
1084 unsigned int nIndex=0;
1085 // neighbours' hash
1086 IdentifierHash nHash=0;
1087
1088 const std::vector<short int>& nextSubdetRegion= emRegion->nextSubdetRegion();
1089 int nNextSubdetReg = nextSubdetRegion.size();
1090 if(nNextSubdetReg > 0) {
1091 for(int ireg=0; ireg<nNextSubdetReg; ireg++) {
1092 LArEM_region* nextEmRegion = m_vecOfRegions[nextSubdetRegion[ireg]];
1093 double gEtaPlus = (double)(nextEmRegion->etaGranularity());
1094 float gPhiPlus= nextEmRegion->phiGranularity();
1095 double minEtaPlus = (double)(nextEmRegion->etaMin());
1096 double maxEtaPlus = (double)(nextEmRegion->etaMax());
1097 double margin = 0.25*std::min(gEta,gEtaPlus);
1098 if((minEtaPlus < absEta+gEta-margin) && (absEta+margin < maxEtaPlus)) {
1099 // Tell clang to optimize assuming that FP exceptions can trap.
1100 // Otherwise, it can vectorize the division, which can lead to
1101 // spurious division-by-zero traps from unused vector lanes.
1103
1104 short int nPhiPlus = nextEmRegion->phiN();
1105 unsigned int minHashPlus = nextEmRegion->hashMin();
1106 float phiMargin = 0.25*std::min(gPhi,gPhiPlus);
1107 // phi 'coordinate' in initial region
1108 float rPhi = ((index-minHash)%nPhi)*gPhi+emRegion->phiMin();
1109 int nPhiPlusFirst = int(std::floor((rPhi -nextEmRegion->phiMin())
1110 /gPhiPlus+phiMargin));
1111 int nPhiPlusNext = int(std::floor((rPhi+gPhi-nextEmRegion->phiMin())
1112 /gPhiPlus+phiMargin));
1113 if ( nPhiPlusNext == nPhiPlusFirst ) nPhiPlusNext++;
1114
1115 double fEtaPlus = (absEta-minEtaPlus) / gEtaPlus + margin ;
1116 // eta 'coordinate' in initial region + 1
1117 double fEtaMaxPlus = (absEta+gEta-minEtaPlus) / gEtaPlus + margin ;
1118 int nEtaPlus = int(fEtaPlus) ;
1119 int nEtaMaxPlus = int(fEtaMaxPlus) ;
1120 if (nEtaMaxPlus == nEtaPlus) nEtaMaxPlus++;
1121
1122 for(int i=nEtaPlus; i<nEtaMaxPlus; i++) {
1123 for(int j=nPhiPlusFirst; j<nPhiPlusNext; j++) {
1124 nIndex = minHashPlus + i * nPhiPlus + j;
1125 if( (nIndex >= nextEmRegion->hashMin()) && (nIndex < nextEmRegion->hashMax()) ) {
1126 nHash = nIndex;
1127 neighbList[neighbourIndex] = nHash;
1128 neighbourIndex++;
1129 result = 0;
1130 }
1131 }
1132 }
1133 } // end eta condition
1134 } // end loop on regions
1135 }
1136 return result;
1137}
const std::vector< short int > & nextSubdetRegion() const
region number of the next region in subdet

◆ 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
privateinherited

Definition at line 758 of file LArEM_Base_ID.cxx.

761{
762 int result = 1;
763
764 unsigned int nIndex = 0;
765 IdentifierHash nHash = 0;
766
767 if( emRegion->isEtaMin(index)){
768 // eta == etaMin -> go to previous region in eta
769 short int nPrevEtaRegion = emRegion->prevEtaRegion();
770 // no neighbour if no previous region in eta
771 if( nPrevEtaRegion != NOT_VALID_REGION ) {
772 LArEM_region* prevEmRegion = m_vecOfRegions[nPrevEtaRegion];
773 if(emRegion->isFirstBarrelRegion()) {
774 // special case: barrel middle
775 unsigned int minHashMinus = prevEmRegion->hashMin();
776 nIndex = minHashMinus + index-minHash ;
777 nHash = nIndex;
778 neighbList[neighbourIndex] = nHash;
779 neighbourIndex++;
780 result = 0;
781 }
782 else {
783 // Tell clang to optimize assuming that FP exceptions can trap.
784 // Otherwise, it can vectorize the division, which can lead to
785 // spurious division-by-zero traps from unused vector lanes.
787 short int nPhiMinus = prevEmRegion->phiN();
788 float gPhiMinus= prevEmRegion->phiGranularity();
789 unsigned int maxHashMinus = prevEmRegion->hashMax();
790 float phiMargin = 0.25*std::min(gPhi,gPhiMinus);
791 float rPhi = (index-minHash)*gPhi+emRegion->phiMin();
792 int nPhiMinusFirst = int(std::floor((rPhi -prevEmRegion->phiMin())
793 /gPhiMinus+phiMargin))
794 +maxHashMinus-nPhiMinus;
795 int nPhiMinusNext = int(std::floor((rPhi+gPhi-prevEmRegion->phiMin())
796 /gPhiMinus+phiMargin))
797 +maxHashMinus-nPhiMinus;
798 if ( nPhiMinusNext == nPhiMinusFirst ) nPhiMinusNext++;
799
800 for(int i=nPhiMinusFirst; i<nPhiMinusNext; i++){
801 nIndex = i ;
802 if(nIndex != nBiggerCell) {
803 nHash = nIndex;
804 neighbList[neighbourIndex] = nHash;
805 neighbourIndex++;
806 result = 0;
807 }
808 // to avoid duplicated cells in corners
809 if(gPhi < gPhiMinus && nBiggerCell == NOT_VALID_HASH) nBiggerCell=nIndex;
810 }
811 }
812 }
813 }
814 else {
815 // stay in same region (1 neighbour)
816 nIndex = index - nPhi;
817 nHash = nIndex;
818 neighbList[neighbourIndex] = nHash;
819 neighbourIndex++;
820 result = 0;
821 }
822 return result;
823}
short int prevEtaRegion() const
region number of the previous region in eta
bool isFirstBarrelRegion() const
true if region close to barrel middle
bool isEtaMin(unsigned int index) const
is the considered cell in the first eta bin of the region ?

◆ 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 )
staticprivateinherited

Definition at line 728 of file LArEM_Base_ID.cxx.

730{
731 int result = 1;
732 unsigned int nIndex = index-1;
733 if(!emRegion->isPhiMin(index)) {
734 if( ((index-minHash)%(nPhi)) == 0 ) nIndex=index+nPhi-1;
735 IdentifierHash nHash = nIndex;
736 neighbList[neighbourIndex] = nHash;
737 neighbourIndex++;
738 result = 0;
739 }
740 return result;
741}
bool isPhiMin(unsigned int index) const
is the considered cell in the first phi bin of the region ?

◆ 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
privateinherited

Definition at line 878 of file LArEM_Base_ID.cxx.

881{
882 int result = 1;
883
884 // neighbours' indices
885 unsigned int nIndex=0;
886 // neighbours' hash
887 IdentifierHash nHash=0;
888
889 // previous region in sampling
890 const std::vector<short int>& prevSampRegion= emRegion->prevSamplingRegion();
891 int nPrevSampReg = prevSampRegion.size();
892 if(nPrevSampReg > 0) {
893 for(int ireg=0; ireg<nPrevSampReg; ireg++) {
894 LArEM_region* prevEmRegion = m_vecOfRegions[prevSampRegion[ireg]];
895 // eta granularity of previous region in sampling
896 double gEtaMinus= (double)(prevEmRegion->etaGranularity());
897 // starting eta of prev region
898 double minEtaMinus = (double)(prevEmRegion->etaMin());
899 double maxEtaMinus = (double)(prevEmRegion->etaMax());
900 double margin = 0.25*std::min(gEta,gEtaMinus);
901 if((minEtaMinus < absEta+gEta-margin) && (absEta+margin < maxEtaMinus)) {
902 // Tell clang to optimize assuming that FP exceptions can trap.
903 // Otherwise, it can vectorize the division, which can lead to
904 // spurious division-by-zero traps from unused vector lanes.
906
907 // phi granularity of previous region in sampling
908 float gPhiMinus= prevEmRegion->phiGranularity();
909 // max phi of previous region in sampling
910 short int nPhiMinus = prevEmRegion->phiN();
911 // first hash of previous region in sampling
912 unsigned int minHashMinus = prevEmRegion->hashMin();
913 float phiMargin = 0.25*std::min(gPhi,gPhiMinus);
914 // phi 'coordinate' in initial region
915 float rPhi = ((index-minHash)%nPhi)*gPhi+emRegion->phiMin();
916 int nPhiMinusFirst = int(std::floor((rPhi -prevEmRegion->phiMin())
917 /gPhiMinus+phiMargin));
918 int nPhiMinusNext = int(std::floor((rPhi+gPhi-prevEmRegion->phiMin())
919 /gPhiMinus+phiMargin));
920 if ( nPhiMinusNext == nPhiMinusFirst ) nPhiMinusNext++;
921
922 // eta 'coordinate' in initial region
923 double fEtaMinus = (absEta-minEtaMinus) / gEtaMinus + margin ;
924 // eta 'coordinate' in initial region + 1
925 double fEtaMaxMinus = (absEta+gEta-minEtaMinus) / gEtaMinus + margin ;
926 int nEtaMinus = int(fEtaMinus);
927 int nEtaMaxMinus = int(fEtaMaxMinus);
928 if ( nEtaMaxMinus == nEtaMinus ) nEtaMaxMinus++;
929 for(int i=nEtaMinus; i<nEtaMaxMinus; i++) {
930 for (int j=nPhiMinusFirst; j<nPhiMinusNext;j++) {
931 nIndex = minHashMinus + i * nPhiMinus + j;
932 if( (nIndex >= prevEmRegion->hashMin()) && (nIndex < prevEmRegion->hashMax()) ) {
933 nHash = nIndex;
934 neighbList[neighbourIndex] = nHash;
935 neighbourIndex++;
936 result = 0;
937 }
938 }
939 }
940 } // end eta condition
941 } // loop on ireg
942 }
943 return result;
944}
const std::vector< short int > & prevSamplingRegion() const
region number of the prev region in sampling

◆ 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
privateinherited

Definition at line 1009 of file LArEM_Base_ID.cxx.

1012{
1013 int result = 1;
1014
1015 // neighbours' indices
1016 unsigned int nIndex=0;
1017 // neighbours' hash
1018 IdentifierHash nHash=0;
1019
1020 // previous region in sampling
1021 const std::vector<short int>& prevSubdetRegion= emRegion->prevSubdetRegion();
1022 int nPrevSubdetReg = prevSubdetRegion.size();
1023 if(nPrevSubdetReg > 0) {
1024 for(int ireg=0; ireg<nPrevSubdetReg; ireg++) {
1025 LArEM_region* prevEmRegion = m_vecOfRegions[prevSubdetRegion[ireg]];
1026 // eta granularity of previous region in sampling
1027 double gEtaMinus= (double)(prevEmRegion->etaGranularity());
1028 // starting eta of prev region
1029 double minEtaMinus = (double)(prevEmRegion->etaMin());
1030 double maxEtaMinus = (double)(prevEmRegion->etaMax());
1031 double margin = 0.25*std::min(gEta,gEtaMinus);
1032 if((minEtaMinus < absEta+gEta-margin) && (absEta+margin < maxEtaMinus)) {
1033 // Tell clang to optimize assuming that FP exceptions can trap.
1034 // Otherwise, it can vectorize the division, which can lead to
1035 // spurious division-by-zero traps from unused vector lanes.
1037
1038 // phi granularity of previous region in sampling
1039 float gPhiMinus= prevEmRegion->phiGranularity();
1040 // max phi of previous region in sampling
1041 short int nPhiMinus = prevEmRegion->phiN();
1042 // first hash of previous region in sampling
1043 unsigned int minHashMinus = prevEmRegion->hashMin();
1044 float phiMargin = 0.25*std::min(gPhi,gPhiMinus);
1045 // phi 'coordinate' in initial region
1046 float rPhi = ((index-minHash)%nPhi)*gPhi+emRegion->phiMin();
1047 int nPhiMinusFirst = int(std::floor((rPhi -prevEmRegion->phiMin())
1048 /gPhiMinus+phiMargin));
1049 int nPhiMinusNext = int(std::floor((rPhi+gPhi-prevEmRegion->phiMin())
1050 /gPhiMinus+phiMargin));
1051 if ( nPhiMinusNext == nPhiMinusFirst ) nPhiMinusNext++;
1052 // eta 'coordinate' in initial region
1053 double fEtaMinus = (absEta-minEtaMinus) / gEtaMinus + margin ;
1054 // eta 'coordinate' in initial region + 1
1055 double fEtaMaxMinus = (absEta+gEta-minEtaMinus) / gEtaMinus + margin ;
1056 int nEtaMinus = int(fEtaMinus);
1057 int nEtaMaxMinus = int(fEtaMaxMinus);
1058 if ( nEtaMaxMinus == nEtaMinus ) nEtaMaxMinus++;
1059
1060 for(int i=nEtaMinus; i<nEtaMaxMinus; i++) {
1061 for (int j=nPhiMinusFirst; j<nPhiMinusNext;j++) {
1062 nIndex = minHashMinus + i * nPhiMinus + j;
1063 if( (nIndex >= prevEmRegion->hashMin()) && (nIndex < prevEmRegion->hashMax()) ) {
1064 nHash = nIndex;
1065 neighbList[neighbourIndex] = nHash;
1066 neighbourIndex++;
1067 result = 0;
1068 }
1069 }
1070 }
1071 } // end eta condition
1072 } // loop on ireg
1073 }
1074 return result;
1075}
const std::vector< short int > & prevSubdetRegion() const
region number of the prev region in subdet

◆ group()

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

Group name for this helper.

Definition at line 34 of file AtlasDetectorID.cxx.

35{
36 return m_group;
37}
std::string m_group
Group name.

◆ helper()

virtual HelperType AtlasDetectorID::helper ( ) const
inlinevirtualinherited

Type of helper, defaulted to 'Unimplemented'.

Reimplemented in PixelID, PLR_ID, and SCT_ID.

Definition at line 90 of file AtlasDetectorID.h.

◆ hgtd()

Identifier AtlasDetectorID::hgtd ( void ) const
inherited

Definition at line 116 of file AtlasDetectorID.cxx.

116 {
117 Identifier result{0};
118 // Pack field
119 m_det_impl.pack(indet_field_value(), result);
120 m_indet_part_impl.pack(m_HGTD_ID, result);
121 return result;
122}
IdDictFieldImplementation m_indet_part_impl
int indet_field_value() const
Provide efficient access to individual field values, for subclass idhelpers.

◆ hgtd_exp()

ExpandedIdentifier AtlasDetectorID::hgtd_exp ( void ) const
protectedinherited

Definition at line 1105 of file AtlasDetectorID.cxx.

1106{
1107 ExpandedIdentifier result(indet_exp());
1108 return (result << m_HGTD_ID);
1109}
ExpandedIdentifier indet_exp(void) const
Detector systems:

◆ hgtd_field_value()

int AtlasDetectorID::hgtd_field_value ( ) const
inlineprotectedinherited

Definition at line 488 of file AtlasDetectorID.h.

488{return (m_HGTD_ID);}

◆ indet()

Identifier AtlasDetectorID::indet ( void ) const
inherited

Detector systems:

Definition at line 57 of file AtlasDetectorID.cxx.

57 {
58 Identifier result{0};
59 // Pack field
60 m_det_impl.pack(indet_field_value(), result);
61 return result;
62}

◆ indet_exp()

ExpandedIdentifier AtlasDetectorID::indet_exp ( void ) const
protectedinherited

Detector systems:

Definition at line 1042 of file AtlasDetectorID.cxx.

1043{
1044 ExpandedIdentifier result;
1045 return (result << m_INDET_ID);
1046}

◆ indet_field_value()

int AtlasDetectorID::indet_field_value ( ) const
inlineprotectedinherited

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

Definition at line 464 of file AtlasDetectorID.h.

464{return (m_INDET_ID);}

◆ init_hashes()

int LArEM_Base_ID::init_hashes ( void )
privateinherited

Definition at line 347 of file LArEM_Base_ID.cxx.

348{
349 if (channels().init (*this, "channels",
352 return 1;
353 if (regions().init (*this, "regions",
356 return 1;
357
358 return (0);
359}
const HashGroup & channels() const
Return the HashGroup for channels (cells).
size_type m_REGION_INDEX
Identifier region_id(const ExpandedIdentifier &exp_id) const
Build a cell identifier from an expanded identifier.
MultiRange m_full_region_range
Identifier channel_id(const ExpandedIdentifier &exp_id) const
Build a cell identifier from an expanded identifier.

◆ init_neighbors()

int LArEM_Base_ID::init_neighbors ( void )
privateinherited

Definition at line 1140 of file LArEM_Base_ID.cxx.

1141{
1142 ATH_MSG_DEBUG("init_neighbors");
1143
1144 const std::vector<const IdDictRegion*>& vecOfDictRegions = dictRegions();
1145
1146 //
1147 // ..... loop on regions -> store vector of LArEM_region*
1148 //
1150 short int reg=0;
1151 std::vector<Identifier>::const_iterator debut=reg_begin() ;
1152 std::vector<Identifier>::const_iterator fin =reg_end() ;
1153 for (; debut != fin; ++debut) {
1154 const Identifier& regId = (*debut);
1155
1156 bool phiWrapAround = (dictionaryVersion() == "fullAtlas" );
1157 bool isBarrelMiddle = false;
1158
1159 //
1160 // ..... translate regId to chanId and get hash
1161 //
1162
1163 Identifier id ;
1164 unsigned int index0 = NOT_VALID_HASH;
1165 int etaMin = eta_min(regId);
1166 int phiMin = phi_min(regId);
1167 if(etaMin >= 0 && phiMin >= 0) {
1168 try{
1169 id = channel_id (regId, eta_min(regId), phi_min(regId) );
1170 }
1171 catch(LArID_Exception & except){
1172 ATH_MSG_ERROR("LArId exception " << (std::string)except);
1173 }
1174 IdentifierHash hashId = channel_hash (id) ;
1175 index0=hashId;
1176 }
1177 else {
1178 ATH_MSG_WARNING("could not find non negative etaMin and phiMin for region " << show_to_string(regId));
1179 index0 = 0;
1180 }
1181
1182 short int deltaEta = eta_max(regId) - eta_min(regId) + 1 ;
1183 short int nPhi = phi_max(regId) - phi_min(regId) + 1 ;
1184 // starting eta
1185 float eta0 = this->eta0(reg);
1186 // eta granularity
1187 float deta = etaGranularity(reg);
1188 // starting phi
1189 float phi0 = this->phi0(reg);
1190 // phi granularity
1191 float dphi = phiGranularity(reg);
1192
1193 // full range of regions
1194 unsigned int ireg0=0;
1195 unsigned int ireg1=region_hash_max();
1196 // if 2 symetric sides, in which side is the current reg.
1197 if(twoSymSides()) {
1198 if(reg < (short int)region_hash_max()/2) {
1199 ireg0=0;
1200 ireg1=region_hash_max()/2;
1201 } else {
1202 ireg0=region_hash_max()/2;
1203 ireg1=region_hash_max();
1204 }
1205 }
1206
1207 //
1208 // .... compute prev/next regions in eta
1209 //
1210 short int regForPrevEta=NOT_VALID_REGION;
1211 const IdDictRegion* prevEtaDicReg = vecOfDictRegions[reg]->prev_abs_eta();
1212 short int regForNextEta=NOT_VALID_REGION;
1213 const IdDictRegion* nextEtaDicReg = vecOfDictRegions[reg]->next_abs_eta();
1214 for(unsigned int ireg=ireg0;ireg<ireg1;ireg++){
1215 if(vecOfDictRegions[ireg] == prevEtaDicReg) regForPrevEta = ireg;
1216 if(vecOfDictRegions[ireg] == nextEtaDicReg) regForNextEta = ireg;
1217 }
1218 // .... special case of barrel middle
1219 if(twoSymSides()) {
1220 if(eta0 < 0.1 ) {
1221 isBarrelMiddle = true;
1222 if(barrel_ec(regId) < 0) {
1223 regForPrevEta = reg+6;
1224 } else {
1225 regForPrevEta = reg-6;
1226 }
1227 }
1228 }
1229
1230 //
1231 // .... compute prev/next regions in sampling
1232 //
1233 std::vector<short int> regForPrevSamp;
1234 for (const IdDictRegion* dictreg : vecOfDictRegions[reg]->prev_samp()) {
1235 for(unsigned int ireg=ireg0;ireg<ireg1;ireg++){
1236 if(vecOfDictRegions[ireg] == dictreg) regForPrevSamp.push_back(ireg);
1237 }
1238 }
1239
1240 std::vector<short int> regForNextSamp;
1241 for (const IdDictRegion* dictreg : vecOfDictRegions[reg]->next_samp()) {
1242 for(unsigned int ireg=ireg0;ireg<ireg1;ireg++){
1243 if(vecOfDictRegions[ireg] == dictreg) regForNextSamp.push_back(ireg);
1244 }
1245 }
1246
1247 //
1248 // .... compute prev/next regions in subdet
1249 //
1250 std::vector<short int> regForPrevSubdet;
1251 for (const IdDictRegion* dictreg : vecOfDictRegions[reg]->prev_subdet()) {
1252 for(unsigned int ireg=ireg0;ireg<ireg1;ireg++){
1253 if(vecOfDictRegions[ireg] == dictreg) regForPrevSubdet.push_back(ireg);
1254 }
1255 }
1256
1257 std::vector<short int> regForNextSubdet;
1258 for (const IdDictRegion* dictreg : vecOfDictRegions[reg]->next_subdet()) {
1259 for(unsigned int ireg=ireg0;ireg<ireg1;ireg++){
1260 if(vecOfDictRegions[ireg] == dictreg) regForNextSubdet.push_back(ireg);
1261 }
1262 }
1263
1264 //
1265 // ....now ready to build region object
1266 //
1267
1268 LArEM_region * emRegion = new LArEM_region(index0,deltaEta,nPhi,eta0,deta,phi0,dphi,phiWrapAround,isBarrelMiddle,
1269 regForPrevEta,regForNextEta,
1270 regForPrevSamp,regForNextSamp,
1271 regForPrevSubdet,regForNextSubdet);
1272 // save in a vector for further use in get_neighbours method
1273 // optimized nov 2005
1274 // m_vecOfRegions.push_back(emRegion);
1275 m_vecOfRegions[reg]=emRegion;
1276 reg++;
1277 } // end of loop on regions
1278
1279 //
1280 // ..... loop on channels
1281 //
1282 // optimized nov 2005
1283 m_cells.reserve(64);
1284 unsigned int i=0;
1285 reg=0;
1286 Identifier lastRegId;
1287 for (Identifier chanId : em_range()) {
1288 const Identifier& regId = region_id(chanId);
1289 if(regId != lastRegId) {
1290 m_cells.push_back(i);
1291 reg++;
1292 }
1293 ++i;
1294
1295 if(m_do_checks) {
1296 // for cross check only
1297 IdentifierHash hashReg = region_hash (regId) ;
1298 if ((short int)hashReg != reg) {
1299 ATH_MSG_ERROR("init_neighbors: problem reg, hashReg = " << reg << " " << hashReg);
1300 }
1301 }
1302
1303 lastRegId=regId;
1304 }
1305
1306 return (0);
1307}
#define ATH_MSG_ERROR(x)
#define ATH_MSG_DEBUG(x)
virtual std::string dictionaryVersion(void) const override
float phi0(const IdentifierHash regHash) const
Return the minimum phi of region, or NOT_VALID.
float eta0(const IdentifierHash regHash) const
Return the minimum eta of region, or NOT_VALID.
const std::vector< const IdDictRegion * > & dictRegions() const
Return the vector of IdDictRegion, accessed via region hash.
float etaGranularity(const IdentifierHash regHash) const
Return the eta granularity of a region, or NOT_VALID.
size_type region_hash_max() const
One more than the largest region hash code.
float phiGranularity(const IdentifierHash regHash) const
Return the phi granularity of a region, or NOT_VALID.
IdentifierHash region_hash(Identifier regionId) const
Convert a connected region Identifier to a hash code.
int eta_max(const Identifier regId) const
max value of eta index (-999 == failure)
int phi_max(const Identifier regId) const
max value of phi index (-999 == failure)
int eta_min(const Identifier regId) const
min value of eta index (-999 == failure)
id_range em_range() const
Range over full set of EM Identifiers.
int phi_min(const Identifier regId) const
min value of phi index (-999 == failure)
id_iterator reg_end() const
end iterator over set of Region Identifiers
bool twoSymSides() const
True if the + and - sides of the calorimeter are identical (true layout).
id_iterator reg_begin() const
begin iterator over set of Region Identifiers
IdentifierHash channel_hash(Identifier channelId) const
create hash id from channel id
double deltaEta(const I4Momentum &p1, const I4Momentum &p2)
Computes efficiently .
Definition P4Helpers.h:66

◆ initialize_base_from_dictionary()

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

initialization from the identifier dictionary

Definition at line 363 of file LArEM_Base_ID.cxx.

366{
367 ATH_MSG_DEBUG("initialize_base_from_dictionary");
368
369 // Check whether this helper should be reinitialized
370 if (!reinitialize(dict_mgr)) {
371 ATH_MSG_DEBUG("Request to reinitialize not satisfied - tags have not changed");
372 return (0);
373 }
374 else {
375 ATH_MSG_DEBUG("(Re)initialize");
376 }
377
378 // init base object
380 "LArCalorimeter"))
381 return (1);
382
383 // initialize dictionary version
384 AtlasDetectorID::setDictVersion(dict_mgr, "LArCalorimeter");
385
386 // Initialize the field indices
387 if (initLevelsFromDict(group_name)) return (1);
388
389 // Find value for the field LAr Calorimeter
390 const IdDictDictionary* atlasDict = dict_mgr.find_dictionary ("ATLAS");
391 int larField = -1;
392 if (atlasDict->get_label_value("subdet", "LArCalorimeter", larField)) {
393 ATH_MSG_ERROR("Could not get value for label 'LArCalorimeter' of field 'subdet' in dictionary "
394 << atlasDict->name());
395 return (1);
396 }
397
398 // Find value for the field LArEM
399 int larEmField = -1;
400 if (dict()->get_label_value("part", "LArEM", larEmField)) {
401 ATH_MSG_ERROR("Could not get value for label 'LArEM' of field 'part' in dictionary "
402 << dict()->name());
403 return (1);
404 }
405
406 // Set up id for region and range prefix
407 ExpandedIdentifier reg_id;
408 reg_id.add(larField);
409 reg_id.add(larEmField);
410 Range prefix;
411
412 m_full_em_range = dict()->build_multirange(reg_id, group_name, prefix);
413 m_full_region_range = dict()->build_multirange(reg_id, group_name, prefix, "region");
414
415 ATH_MSG_DEBUG(" initialize_from_dict : ");
416 ATH_MSG_DEBUG(" region range -> " << (std::string)m_full_region_range);
417 ATH_MSG_DEBUG(" channel range -> " << (std::string)m_full_em_range);
418
419 // initialize m_two_sym_sides
420 m_two_sym_sides = ( dictionaryVersion() == "fullAtlas" );
421
422
423 // Setup the hash tables
424 if(init_hashes()) return (1);
425
426 // initialize dictionary regions
427 if (fill_vec_of_dict_regions (group_name)) return 1;
428
429 m_vecOfPhiMin.resize(regions().hash_max());
430 for (unsigned int i = 0; i < regions().hash_max(); ++i) {
431 Identifier regId = region_id(i);
432 m_vecOfPhiMin[i] = phi_min_init(regId);
433 }
434
435
436 // Setup for hash calculation
437
438 // We use the structure of the region definitions in the
439 // dictionary to optimize. Specifically, each dict region
440 // corresponds to two regions of uniform eta/phi granularity (+/-
441 // in barrel/endcap). The lookup table only needs to contain the
442 // hash offset for each region and the number of phi cells.
443
444 // The implementation requires:
445
446 // 1) a lookup table for each region containing hash offset and
447 // nphi
448 // 2) a decoder to access the "index" corresponding to the
449 // bec/samp/reg fields. These fields use 8 bits, so the
450 // vector has a length of 256 for only 36 regions.
451
452
453 // Create decoder for fields bec to region
455 m_bec_impl.bits() +
456 m_sampling_impl.bits() +
457 m_region_impl.bits();
458 IdDictFieldImplementation::size_type bits_offset = m_bec_impl.bits_offset();
459 m_bec_reg_impl.set_bits(bits, bits_offset);
460
461 // Set up vector as lookup table for hash calculation.
462 m_hash_calcs.resize(256);
463 for (unsigned int i = 0; i < m_full_em_range.size(); ++i) {
464 const Range* range = &m_full_em_range[i];
465 ExpandedIdentifier exp_id = range->minimum ();
466 HashCalc hc;
467
468 Identifier min = channel_id (exp_id[m_BEC_INDEX],
469 exp_id[m_SAMPLING_INDEX],
470 exp_id[m_REGION_INDEX],
471 exp_id[m_ETA_INDEX],
472 exp_id[m_PHI_INDEX]);
473 IdentifierHash min_neg = channel_hash_binary_search(min);
474 hc.m_hash = min_neg;
475 Identifier minReg = region_id(min) ;
476 hc.m_etamin = eta_min(minReg);
477 hc.m_phimin = phi_min(minReg);
478 hc.m_nphi = (*range)[m_PHI_INDEX].get_indices();
479 m_hash_calcs[m_bec_reg_impl.unpack(min)] = hc;
480
481 // Flip sign for bec if 2 symmetric sides (ATLAS case, not TB)
482 if(m_two_sym_sides) {
483 Identifier min1 = channel_id (-exp_id[m_BEC_INDEX],
484 exp_id[m_SAMPLING_INDEX],
485 exp_id[m_REGION_INDEX],
486 exp_id[m_ETA_INDEX],
487 exp_id[m_PHI_INDEX]);
488 IdentifierHash min_pos = channel_hash_binary_search(min1);
489 hc.m_hash = min_pos;
490 m_hash_calcs[m_bec_reg_impl.unpack(min1)] = hc;
491 }
492
493
494 if (m_bec_reg_impl.unpack(min) > 255) {
495 ATH_MSG_WARNING("min > 255 " << i << " " << show_to_string(min) << " " << m_bec_reg_impl.unpack(min) << " ");
496 }
497 }
498
499// Some detailed printout
500// ExpandedIdentifier exp_id = range->maximum ();
501// Identifier max = channel_id (exp_id[m_BEC_INDEX],
502// exp_id[m_SAMPLING_INDEX],
503// exp_id[m_REGION_INDEX],
504// exp_id[m_ETA_INDEX],
505// exp_id[m_PHI_INDEX]);
506// Identifier max0 = channel_id (-exp_id[m_BEC_INDEX],
507// exp_id[m_SAMPLING_INDEX],
508// exp_id[m_REGION_INDEX],
509// exp_id[m_ETA_INDEX],
510// exp_id[m_PHI_INDEX]);
511// std::cout << "channel ranges, id, hash "
512// << i << " "
513// << show_to_string(min) << " "
514// << show_to_string(max0) << " "
515// << show_to_string(min1) << " "
516// << show_to_string(max) << " "
517// << channel_hash_binary_search(min) << " "
518// << channel_hash_binary_search(min1) << " "
519// << min_pos << " "
520// << range->cardinality() << " "
521// << std::endl;
522// }
523
524 // Check hash calculation
525 for (unsigned int i = 0; i < channels().hash_max(); ++i) {
526 Identifier id = channel_id(i);
527 if (channel_hash(id) != i) {
528 ATH_MSG_ERROR("channel ranges, id, hash " << show_to_string(id) << " " << channel_hash(id) << " " << i);
529 }
530 }
531
532 // Setup hash tables for finding neighbors (at the end of initialisation,
533 // to benefit from optimization
534 if(m_do_neighbours) {
535 if(init_neighbors()) return (1);
536 }
537
538 return 0;
539}
#define min(a, b)
Definition cfImp.cxx:40
bool reinitialize(const IdDictMgr &dict_mgr)
Test whether an idhelper should be reinitialized based on the change of tags.
virtual void setDictVersion(const IdDictMgr &dict_mgr, const std::string &name) override
size_type hash_max() const
Return one more than the largest hash code.
int initialize_base_from_dictionary(const IdDictMgr &dict_mgr, const std::string &dict_name)
Do basic initialization of the helper.
int fill_vec_of_dict_regions(const std::string &group_name="")
Initialize the list of detector regions.
const IdDictDictionary * dict() const
Return the dictionary for this subdetector.
const std::string & name() const
Return the name for this helper.
void add(element_type value)
Append a value into a new field.
MultiRange build_multirange() const
Get MultiRange for full dictionary.
int get_label_value(const std::string &field, const std::string &label, int &value) const
const std::string & name() const
Dictionary name.
const IdDictDictionary * find_dictionary(const std::string &name) const
Access dictionary by name.
small class holding the starting hash value, the min eta and the number of phi bins of each region
IdentifierHash channel_hash_binary_search(Identifier channelId) const
create hash id from channel id – method NOT optimised, please use channel_hash() above
size_type m_SAMPLING_INDEX
IdDictFieldImplementation m_sampling_impl
IdDictFieldImplementation m_region_impl
int phi_min_init(const Identifier regId) const
IdDictFieldImplementation m_bec_impl
size_type m_BEC_INDEX
std::vector< int > m_vecOfPhiMin
std::vector< HashCalc > m_hash_calcs
IdDictFieldImplementation m_bec_reg_impl
int initLevelsFromDict(const std::string &group_name)

◆ initialize_from_dictionary()

int LArEM_ID::initialize_from_dictionary ( const IdDictMgr & dict_mgr)
virtual

initialization from the identifier dictionary

Reimplemented from AtlasDetectorID.

Definition at line 23 of file LArEM_ID.cxx.

25{
26 ATH_MSG_DEBUG("initialize_from_dictionary");
27
28 // Check whether this helper should be reinitialized
29 if (!reinitialize(dict_mgr)) {
30 ATH_MSG_DEBUG("Request to reinitialize not satisfied - tags have not changed");
31 return (0);
32 }
33 else {
34 ATH_MSG_DEBUG("(Re)initialize");
35 }
36
37 // init base object
39 return (1);
40
41
42 return 0;
43}
const std::string & group() const
Group name for this helper.
int initialize_base_from_dictionary(const IdDictMgr &dict_mgr, const std::string &group_name)
initialization from the identifier dictionary

◆ initLevelsFromDict()

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

Definition at line 222 of file LArEM_Base_ID.cxx.

223{
224 if(!dict()) {
225 ATH_MSG_ERROR("initLevelsFromDict - dictionary NOT initialized");
226 return (1);
227 }
228
229 // Find out which identifier field corresponds to each level.
230
231 m_LAR_INDEX = 999 ;
232 m_EM_INDEX = 999 ;
233 m_BEC_INDEX = 999 ;
234 m_SAMPLING_INDEX = 999 ;
235 m_REGION_INDEX = 999 ;
236 m_ETA_INDEX = 999 ;
237 m_PHI_INDEX = 999 ;
238 m_SLAR_INDEX = 999 ;
239
240 // Find a EM region
241 const IdDictField* field = dict()->find_field("subdet") ;
242 if (field) {
243 m_LAR_INDEX = field->index();
244 }
245 else {
246 ATH_MSG_ERROR("initLevelsFromDict - unable to find 'subdet' field");
247 return (1);
248 }
249
250 field = dict()->find_field("part") ;
251 if (field) {
252 m_EM_INDEX = field->index();
253 }
254 else {
255 ATH_MSG_ERROR("initLevelsFromDict - unable to find 'part' field");
256 return (1);
257 }
258
259 field = dict()->find_field("barrel-endcap") ;
260 if (field) {
261 m_BEC_INDEX = field->index();
262 }
263 else {
264 ATH_MSG_ERROR("initLevelsFromDict - unable to find 'barrel-endcap' field");
265 return (1);
266 }
267
268 field = dict()->find_field("sampling") ;
269 if (field) {
270 m_SAMPLING_INDEX = field->index();
271 }
272 else {
273 ATH_MSG_ERROR("initLevelsFromDict - unable to find 'sampling' field");
274 return (1);
275 }
276
277 field = dict()->find_field("region") ;
278 if (field) {
279 m_REGION_INDEX = field->index();
280 }
281 else {
282 ATH_MSG_ERROR("initLevelsFromDict - unable to find 'region' field");
283 return (1);
284 }
285
286 field = dict()->find_field("eta") ;
287 if (field) {
288 m_ETA_INDEX = field->index();
289 }
290 else {
291 ATH_MSG_ERROR("initLevelsFromDict - unable to find 'eta' field");
292 return (1);
293 }
294
295 field = dict()->find_field("phi") ;
296 if (field) {
297 m_PHI_INDEX = field->index();
298 }
299 else {
300 ATH_MSG_ERROR("initLevelsFromDict - unable to find 'phi' field");
301 return (1);
302 }
303
304 field = dict()->find_field("is-slar") ;
305 if (field) {
306 m_SLAR_INDEX = field->index();
307 }
308 else {
309 ATH_MSG_ERROR("initLevelsFromDict - unable to find 'is-slar' field");
310 return (1);
311 }
312
313 // Set the field implementations
314
315 const IdDictGroup* group = dict()->find_group(group_name);
316 if ( !group ){
317 ATH_MSG_ERROR("initLevelsFromDict - cannot find " << group_name << " group' field ");
318 }
319 else {
320 m_em_region_index = group->region(0).index();
321 }
322 const IdDictRegion& region = dict()->region(m_em_region_index);
323
324 m_lar_impl = region.implementation(m_LAR_INDEX);
325 m_em_impl = region.implementation(m_EM_INDEX);
326 m_bec_impl = region.implementation(m_BEC_INDEX);
327 m_sampling_impl = region.implementation(m_SAMPLING_INDEX);
328 m_region_impl = region.implementation(m_REGION_INDEX);
329 m_eta_impl = region.implementation(m_ETA_INDEX);
330 m_phi_impl = region.implementation(m_PHI_INDEX);
331 m_slar_impl = region.implementation(m_SLAR_INDEX);
332
333 ATH_MSG_DEBUG("decode index and bit fields for each level: ");
334 ATH_MSG_DEBUG("lar " << m_lar_impl.show_to_string());
335 ATH_MSG_DEBUG("em " << m_em_impl.show_to_string());
336 ATH_MSG_DEBUG("bec " << m_bec_impl.show_to_string());
337 ATH_MSG_DEBUG("samp " << m_sampling_impl.show_to_string());
338 ATH_MSG_DEBUG("reg " << m_region_impl.show_to_string());
339 ATH_MSG_DEBUG("eta " << m_eta_impl.show_to_string());
340 ATH_MSG_DEBUG("phi " << m_phi_impl.show_to_string());
341 ATH_MSG_DEBUG("is-slar " << m_slar_impl.show_to_string());
342
343 return(0) ;
344}
IdDictGroup * find_group(const std::string &group_name)
const IdDictField * find_field(const std::string &name) const
const IdDictRegion & region(size_t i) const
Region at index i.
IdDictFieldImplementation m_em_impl
IdDictFieldImplementation m_phi_impl
size_type m_EM_INDEX
size_type m_LAR_INDEX
size_type m_em_region_index
IdDictFieldImplementation m_lar_impl
IdDictFieldImplementation m_slar_impl
IdDictFieldImplementation m_eta_impl

◆ 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.

40{
42 // If user did not set an explicit level, set a default
43 if (m_lvl == MSG::NIL) {
44 m_lvl = m_imsg ?
45 static_cast<MSG::Level>( m_imsg.load()->outputLevel(m_nm) ) :
46 MSG::INFO;
47 }
48}
std::string m_nm
Message source name.
std::atomic< IMessageSvc * > m_imsg
MessageSvc pointer.
std::atomic< MSG::Level > m_lvl
Current logging level.
IMessageSvc * getMessageSvc(bool quiet=false)

◆ is_alfa()

bool AtlasDetectorID::is_alfa ( Identifier id) const
inlineinherited

Definition at line 794 of file AtlasDetectorID.h.

795{
796 bool result = false;
797 if(is_forward(id)) {
798 result = (abs(m_lar_part_impl.unpack(id)) == m_ALFA_ID);
799 }
800 return result;
801}
IdDictFieldImplementation m_lar_part_impl
bool is_forward(Identifier id) const

◆ is_bcm()

bool AtlasDetectorID::is_bcm ( Identifier id) const
inlineinherited

Definition at line 804 of file AtlasDetectorID.h.

805{
806 bool result = false;
807 if(is_forward(id)) {
808 result = (abs(m_lar_part_impl.unpack(id)) == m_BCM_ID);
809 }
810 return result;
811}

◆ is_calo() [1/2]

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

Definition at line 298 of file AtlasDetectorID.cxx.

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

◆ is_calo() [2/2]

bool AtlasDetectorID::is_calo ( Identifier id) const
inlineinherited

Definition at line 560 of file AtlasDetectorID.h.

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

◆ is_csc() [1/2]

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

Definition at line 340 of file AtlasDetectorID.cxx.

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

◆ is_csc() [2/2]

bool AtlasDetectorID::is_csc ( Identifier id) const
inlineinherited

Definition at line 744 of file AtlasDetectorID.h.

745{
746 bool result = false;
747 if (!is_muon(id)) return false;
748 unsigned int stationNameIndex = m_muon_station_name_impl.unpack(id);
749 unsigned int techBit = m_muon_tech_bits[stationNameIndex];
750 result = (is_muon(id) && (techBit == AtlasDetDescr::fAtlasCSC));
751 return result;
752}
bool is_muon(Identifier id) const
std::vector< unsigned int > m_muon_tech_bits
IdDictFieldImplementation m_muon_station_name_impl

◆ is_em_barrel()

bool LArEM_Base_ID::is_em_barrel ( const Identifier id) const
inherited

test if the id belongs to the EM barrel

◆ is_em_endcap()

bool LArEM_Base_ID::is_em_endcap ( const Identifier id) const
inherited

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
inherited

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
inherited

test if the id belongs to the EM Endcap outer wheel

◆ is_forward()

bool AtlasDetectorID::is_forward ( Identifier id) const
inlineinherited

Definition at line 788 of file AtlasDetectorID.h.

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

◆ is_hgtd() [1/2]

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

Definition at line 311 of file AtlasDetectorID.cxx.

311 {
312 return is_indet(id) && id.fields() > 1 && id[1] == m_HGTD_ID;
313}
bool is_indet(Identifier id) const

◆ is_hgtd() [2/2]

bool AtlasDetectorID::is_hgtd ( Identifier id) const
inlineinherited

Definition at line 647 of file AtlasDetectorID.h.

648{
649 bool result = false;
650 // Must check is_pixel to allow for special bits
651 // (don't need this check for 64-bit identifier, but leave it in for now)
652 if(is_indet(id) && !is_pixel(id)) {
653 result = (m_indet_part_impl.unpack(id) == m_HGTD_ID);
654 }
655 return result;
656}
bool is_pixel(Identifier id) const

◆ is_indet() [1/2]

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

Definition at line 286 of file AtlasDetectorID.cxx.

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

◆ is_indet() [2/2]

bool AtlasDetectorID::is_indet ( Identifier id) const
inlineinherited

Definition at line 536 of file AtlasDetectorID.h.

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

◆ is_lar() [1/2]

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

Definition at line 289 of file AtlasDetectorID.cxx.

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

◆ is_lar() [2/2]

bool AtlasDetectorID::is_lar ( Identifier id) const
inlineinherited

Definition at line 542 of file AtlasDetectorID.h.

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

◆ is_lar_dm()

bool AtlasDetectorID::is_lar_dm ( Identifier id) const
inlineinherited

LAr/Tile dead material:

Definition at line 589 of file AtlasDetectorID.h.

590{
591 bool result = false;
592 if (is_calo(id)) {
593 int temp = m_calo_side_impl.unpack(id);
594 result = (m_lar_dm_field.match(temp));
595 }
596 return result;
597}
Range::field m_lar_dm_field
IdDictFieldImplementation m_calo_side_impl
bool is_calo(Identifier id) const

◆ is_lar_em() [1/2]

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

Definition at line 321 of file AtlasDetectorID.cxx.

321 {
322 return is_lar(id) && id.fields() > 1 && std::abs(id[1]) == m_LAR_EM_ID;
323}
bool is_lar(Identifier id) const

◆ is_lar_em() [2/2]

bool AtlasDetectorID::is_lar_em ( Identifier id) const
inlineinherited

Definition at line 671 of file AtlasDetectorID.h.

672{
673 bool result = false;
674 if(is_lar(id)) {
675 result = (abs(m_lar_part_impl.unpack(id)) == m_LAR_EM_ID);
676 }
677 return result;
678}

◆ is_lar_fcal() [1/2]

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

Definition at line 328 of file AtlasDetectorID.cxx.

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

◆ is_lar_fcal() [2/2]

bool AtlasDetectorID::is_lar_fcal ( Identifier id) const
inlineinherited

Definition at line 692 of file AtlasDetectorID.h.

693{
694 bool result = false;
695 if(is_lar(id)) {
696 result = (abs(m_lar_part_impl.unpack(id)) == m_LAR_FCAL_ID);
697 }
698 return result;
699}

◆ is_lar_hec() [1/2]

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

Definition at line 324 of file AtlasDetectorID.cxx.

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

◆ is_lar_hec() [2/2]

bool AtlasDetectorID::is_lar_hec ( Identifier id) const
inlineinherited

Definition at line 682 of file AtlasDetectorID.h.

683{
684 bool result = false;
685 if(is_lar(id)) {
686 result = (abs(m_lar_part_impl.unpack(id)) == m_LAR_HEC_ID);
687 }
688 return result;
689}

◆ is_lar_minifcal() [1/2]

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

Definition at line 332 of file AtlasDetectorID.cxx.

332 {
333 return is_lar_fcal(id) && id.fields() > 3 &&std::abs(id[3]) == 0;
334}
bool is_lar_fcal(Identifier id) const

◆ is_lar_minifcal() [2/2]

bool AtlasDetectorID::is_lar_minifcal ( Identifier id) const
inlineinherited

Definition at line 702 of file AtlasDetectorID.h.

703{
704 bool result = false;
705 if(is_lar_fcal(id)) {
706 result = (m_lar_fcal_module_impl.unpack(id) == 0);
707 }
708 return result;
709}
IdDictFieldImplementation m_lar_fcal_module_impl

◆ is_lucid()

bool AtlasDetectorID::is_lucid ( Identifier id) const
inlineinherited

Definition at line 814 of file AtlasDetectorID.h.

815{
816 bool result = false;
817 if(is_forward(id)) {
818 result = (abs(m_lar_part_impl.unpack(id)) == m_LUCID_ID);
819 }
820 return result;
821}

◆ is_lumi() [1/2]

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

Definition at line 314 of file AtlasDetectorID.cxx.

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

◆ is_lumi() [2/2]

bool AtlasDetectorID::is_lumi ( Identifier id) const
inlineinherited

Definition at line 659 of file AtlasDetectorID.h.

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

◆ is_lvl1_online()

bool AtlasDetectorID::is_lvl1_online ( Identifier id) const
inlineinherited

Definition at line 577 of file AtlasDetectorID.h.

578{
579 bool result = false;
580 if (is_calo(id)) {
581 int temp = m_calo_side_impl.unpack(id);
582 result = (m_lvl1_onl_field.match(temp));
583 }
584 return result;
585}
Range::field m_lvl1_onl_field

◆ is_lvl1_trig_towers()

bool AtlasDetectorID::is_lvl1_trig_towers ( Identifier id) const
inlineinherited

Definition at line 566 of file AtlasDetectorID.h.

567{
568 bool result = false;
569 if (is_calo(id)) {
570 int temp = m_calo_side_impl.unpack(id);
571 result = (m_lvl1_field.match(temp));
572 }
573 return result;
574}
Range::field m_lvl1_field

◆ is_mdt() [1/2]

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

Definition at line 336 of file AtlasDetectorID.cxx.

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

◆ is_mdt() [2/2]

bool AtlasDetectorID::is_mdt ( Identifier id) const
inlineinherited

Definition at line 712 of file AtlasDetectorID.h.

713{
714 bool result = false;
715 if (!is_muon(id)) return false;
716 unsigned int stationNameIndex = m_muon_station_name_impl.unpack(id);
717 unsigned int techBit = m_muon_tech_bits[stationNameIndex];
718 // MDT and RPC can only be destinguished by the additional bit in the ID
719 // since the station names are ambiguous
720 if (is_muon(id) && ((techBit == AtlasDetDescr::fAtlasMDT)
721 || (techBit == AtlasDetDescr::fAtlasRPC))) {
722 result = (m_muon_mdt_impl.unpack(id) == m_MDT_ID);
723 }
724 return result;
725}
IdDictFieldImplementation m_muon_mdt_impl

◆ is_mm() [1/2]

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

Definition at line 356 of file AtlasDetectorID.cxx.

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

◆ is_mm() [2/2]

bool AtlasDetectorID::is_mm ( Identifier id) const
inlineinherited

Definition at line 766 of file AtlasDetectorID.h.

767{
768 bool result = false;
769 if (!is_muon(id)) return false;
770 unsigned int stationNameIndex = m_muon_station_name_impl.unpack(id);
771 unsigned int techBit = m_muon_tech_bits[stationNameIndex];
772 result = (is_muon(id) && (techBit == AtlasDetDescr::fAtlasMM));
773 return result;
774}

◆ is_muon() [1/2]

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

Definition at line 295 of file AtlasDetectorID.cxx.

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

◆ is_muon() [2/2]

bool AtlasDetectorID::is_muon ( Identifier id) const
inlineinherited

Definition at line 554 of file AtlasDetectorID.h.

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

◆ is_pixel() [1/2]

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

Definition at line 301 of file AtlasDetectorID.cxx.

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

◆ is_pixel() [2/2]

bool AtlasDetectorID::is_pixel ( Identifier id) const
inlineinherited

Definition at line 613 of file AtlasDetectorID.h.

614{
615 bool result = false;
616 if(is_indet(id)) {
617 result = (m_indet_part_impl.unpack(id) == m_PIXEL_ID);
618 }
619 return result;
620}

◆ is_plr() [1/2]

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

Definition at line 317 of file AtlasDetectorID.cxx.

317 {
318 return is_lumi(id) && id.fields() > 2 && id[2] == m_LUMI_PLR_ID;
319}
bool is_lumi(Identifier id) const

◆ 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 344 of file AtlasDetectorID.cxx.

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

◆ is_rpc() [2/2]

bool AtlasDetectorID::is_rpc ( Identifier id) const
inlineinherited

Definition at line 728 of file AtlasDetectorID.h.

729{
730 bool result = false;
731 if (!is_muon(id)) return false;
732 unsigned int stationNameIndex = m_muon_station_name_impl.unpack(id);
733 unsigned int techBit = m_muon_tech_bits[stationNameIndex];
734 // MDT and RPC can only be destinguished by the additional bit in the ID
735 // since the station names are ambiguous
736 if (is_muon(id) && ((techBit == AtlasDetDescr::fAtlasMDT)
737 || (techBit == AtlasDetDescr::fAtlasRPC))) {
738 result = (m_muon_rpc_impl.unpack(id) == m_RPC_ID);
739 }
740 return result;
741}
IdDictFieldImplementation m_muon_rpc_impl

◆ is_sct() [1/2]

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

Definition at line 305 of file AtlasDetectorID.cxx.

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

◆ is_sct() [2/2]

bool AtlasDetectorID::is_sct ( Identifier id) const
inlineinherited

Definition at line 623 of file AtlasDetectorID.h.

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

◆ is_stgc() [1/2]

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

Definition at line 352 of file AtlasDetectorID.cxx.

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

◆ is_stgc() [2/2]

bool AtlasDetectorID::is_stgc ( Identifier id) const
inlineinherited

Definition at line 777 of file AtlasDetectorID.h.

778{
779 bool result = false;
780 if (!is_muon(id)) return false;
781 unsigned int stationNameIndex = m_muon_station_name_impl.unpack(id);
782 unsigned int techBit = m_muon_tech_bits[stationNameIndex];
783 result = (is_muon(id) && (techBit == AtlasDetDescr::fAtlasSTGC));
784 return result;
785}

◆ is_supercell()

bool LArEM_Base_ID::is_supercell ( const Identifier id) const
inherited

Test if the identifier represents a supercell.

Definition at line 42 of file LArEM_Base_ID.cxx.

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

◆ is_tgc() [1/2]

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

Definition at line 348 of file AtlasDetectorID.cxx.

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

◆ is_tgc() [2/2]

bool AtlasDetectorID::is_tgc ( Identifier id) const
inlineinherited

Definition at line 755 of file AtlasDetectorID.h.

756{
757 bool result = false;
758 if (!is_muon(id)) return false;
759 unsigned int stationNameIndex = m_muon_station_name_impl.unpack(id);
760 unsigned int techBit = m_muon_tech_bits[stationNameIndex];
761 result = (is_muon(id) && (techBit == AtlasDetDescr::fAtlasTGC));
762 return result;
763}

◆ is_tile() [1/2]

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

Definition at line 292 of file AtlasDetectorID.cxx.

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

◆ is_tile() [2/2]

bool AtlasDetectorID::is_tile ( Identifier id) const
inlineinherited

Definition at line 548 of file AtlasDetectorID.h.

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

◆ is_tile_dm()

bool AtlasDetectorID::is_tile_dm ( Identifier id) const
inlineinherited

Definition at line 601 of file AtlasDetectorID.h.

602{
603 bool result = false;
604 if (is_calo(id)) {
605 int temp = m_calo_side_impl.unpack(id);
606 result = (m_tile_dm_field.match(temp));
607 }
608 return result;
609}
Range::field m_tile_dm_field

◆ is_trt() [1/2]

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

Definition at line 308 of file AtlasDetectorID.cxx.

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

◆ is_trt() [2/2]

bool AtlasDetectorID::is_trt ( Identifier id) const
inlineinherited

Definition at line 635 of file AtlasDetectorID.h.

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

◆ is_zdc()

bool AtlasDetectorID::is_zdc ( Identifier id) const
inlineinherited

Definition at line 824 of file AtlasDetectorID.h.

825{
826 bool result = false;
827 if(is_forward(id)) {
828 result = (abs(m_lar_part_impl.unpack(id)) == m_ZDC_ID);
829 }
830 return result;
831}

◆ lar()

Identifier AtlasDetectorID::lar ( void ) const
inherited

Definition at line 64 of file AtlasDetectorID.cxx.

64 {
65 Identifier result{0};
66 // Pack field
67 m_det_impl.pack(lar_field_value(), result);
68 return result;
69}

◆ lar_dm()

Identifier AtlasDetectorID::lar_dm ( void ) const
inherited

Definition at line 148 of file AtlasDetectorID.cxx.

148 {
149 Identifier result{0};
150 // Pack field
151 m_det_impl.pack(calo_field_value(), result);
152 m_calo_side_impl.pack(-4, result);
153 return result;
154}

◆ lar_em()

Identifier AtlasDetectorID::lar_em ( void ) const
inherited

Definition at line 132 of file AtlasDetectorID.cxx.

132 {
133 Identifier result{0};
134 // Pack field
135 m_det_impl.pack(lar_field_value(), result);
136 m_lar_part_impl.pack(m_LAR_EM_ID, result);
137 return result;
138}

◆ lar_em_exp()

ExpandedIdentifier AtlasDetectorID::lar_em_exp ( void ) const
protectedinherited

LAr.

Definition at line 1119 of file AtlasDetectorID.cxx.

1120{
1121 ExpandedIdentifier result(lar_exp());
1122 return (result << m_LAR_EM_ID);
1123}
ExpandedIdentifier lar_exp(void) const

◆ lar_em_field_value()

int AtlasDetectorID::lar_em_field_value ( ) const
inlineprotectedinherited

Definition at line 497 of file AtlasDetectorID.h.

497{return (m_LAR_EM_ID);}

◆ lar_exp()

ExpandedIdentifier AtlasDetectorID::lar_exp ( void ) const
protectedinherited

Definition at line 1049 of file AtlasDetectorID.cxx.

1050{
1051 ExpandedIdentifier result;
1052 return (result << m_LAR_ID);
1053}

◆ lar_fcal()

Identifier AtlasDetectorID::lar_fcal ( void ) const
inherited

Definition at line 172 of file AtlasDetectorID.cxx.

172 {
173 Identifier result{0};
174 // Pack field
175 m_det_impl.pack(lar_field_value(), result);
176 m_lar_part_impl.pack(m_LAR_FCAL_ID, result);
177 return result;
178}

◆ lar_fcal_exp()

ExpandedIdentifier AtlasDetectorID::lar_fcal_exp ( void ) const
protectedinherited

Definition at line 1133 of file AtlasDetectorID.cxx.

1134{
1135 ExpandedIdentifier result(lar_exp());
1136 return (result << m_LAR_FCAL_ID);
1137}

◆ lar_fcal_field_value()

int AtlasDetectorID::lar_fcal_field_value ( ) const
inlineprotectedinherited

Definition at line 503 of file AtlasDetectorID.h.

503{return (m_LAR_FCAL_ID);}

◆ lar_field_value()

int AtlasDetectorID::lar_field_value ( ) const
inlineprotectedinherited

Definition at line 467 of file AtlasDetectorID.h.

467{return (m_LAR_ID);}

◆ lar_hec()

Identifier AtlasDetectorID::lar_hec ( void ) const
inherited

Definition at line 164 of file AtlasDetectorID.cxx.

164 {
165 Identifier result{0};
166 // Pack field
167 m_det_impl.pack(lar_field_value(), result);
168 m_lar_part_impl.pack(m_LAR_HEC_ID, result);
169 return result;
170}

◆ lar_hec_exp()

ExpandedIdentifier AtlasDetectorID::lar_hec_exp ( void ) const
protectedinherited

Definition at line 1126 of file AtlasDetectorID.cxx.

1127{
1128 ExpandedIdentifier result(lar_exp());
1129 return (result << m_LAR_HEC_ID);
1130}

◆ lar_hec_field_value()

int AtlasDetectorID::lar_hec_field_value ( ) const
inlineprotectedinherited

Definition at line 500 of file AtlasDetectorID.h.

500{return (m_LAR_HEC_ID);}

◆ lar_lvl1()

Identifier AtlasDetectorID::lar_lvl1 ( void ) const
inherited

Definition at line 140 of file AtlasDetectorID.cxx.

140 {
141 Identifier result{0};
142 // Pack field
143 m_det_impl.pack(calo_field_value(), result);
144 m_calo_side_impl.pack(-1, result);
145 return result;
146}

◆ lucid_exp()

ExpandedIdentifier AtlasDetectorID::lucid_exp ( void ) const
protectedinherited

Definition at line 1154 of file AtlasDetectorID.cxx.

1155{
1156 ExpandedIdentifier result(fwd_exp());
1157 return (result << m_LUCID_ID);
1158}

◆ lucid_field_value()

int AtlasDetectorID::lucid_field_value ( ) const
inlineprotectedinherited

Definition at line 530 of file AtlasDetectorID.h.

530{return (m_LUCID_ID);}

◆ lumi()

Identifier AtlasDetectorID::lumi ( void ) const
inherited

Definition at line 124 of file AtlasDetectorID.cxx.

124 {
125 Identifier result{0};
126 // Pack field
127 m_det_impl.pack(indet_field_value(), result);
128 m_indet_part_impl.pack(m_LUMI_ID, result);
129 return result;
130}

◆ lumi_exp()

ExpandedIdentifier AtlasDetectorID::lumi_exp ( void ) const
protectedinherited

Definition at line 1112 of file AtlasDetectorID.cxx.

1113{
1114 ExpandedIdentifier result(indet_exp());
1115 return (result << m_LUMI_ID);
1116}

◆ lumi_field_value()

int AtlasDetectorID::lumi_field_value ( ) const
inlineprotectedinherited

Definition at line 491 of file AtlasDetectorID.h.

491{return (m_LUMI_ID);}

◆ mdt()

Identifier AtlasDetectorID::mdt ( void ) const
inherited

Definition at line 39 of file AtlasDetectorID.cxx.

39 {
40 return Identifier{};
41}

◆ mdt_field_value()

int AtlasDetectorID::mdt_field_value ( ) const
inlineprotectedinherited

Definition at line 506 of file AtlasDetectorID.h.

506{return (m_MDT_ID);}

◆ mm()

Identifier AtlasDetectorID::mm ( void ) const
inherited

Definition at line 54 of file AtlasDetectorID.cxx.

54 {
55 return Identifier{};
56}

◆ mm_field_value()

int AtlasDetectorID::mm_field_value ( ) const
inlineprotectedinherited

Definition at line 521 of file AtlasDetectorID.h.

521{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 163 of file AthMessaging.h.

164{
165 MsgStream* ms = m_msg_tls.get();
166 if (!ms) {
167 if (!m_initialized.test_and_set()) initMessaging();
168 ms = new MsgStream(m_imsg,m_nm);
169 m_msg_tls.reset( ms );
170 }
171
172 ms->setLevel (m_lvl);
173 return *ms;
174}
boost::thread_specific_ptr< MsgStream > m_msg_tls
MsgStream instance (a std::cout like with print-out levels)
void initMessaging() const
Initialize our message level and MessageSvc.

◆ 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 178 of file AthMessaging.h.

179{ return msg() << lvl; }
MsgStream & msg() const
The standard message stream.

◆ msgLvl()

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

Test the output level.

Parameters
lvlThe message level to test against
Returns
boolean Indicating if messages at given level will be printed
Return values
trueMessages at level "lvl" will be printed

Definition at line 151 of file AthMessaging.h.

152{
153 if (m_lvl <= lvl) {
154 msg() << lvl;
155 return true;
156 } else {
157 return false;
158 }
159}

◆ muon()

Identifier AtlasDetectorID::muon ( void ) const
inherited

Definition at line 78 of file AtlasDetectorID.cxx.

78 {
79 Identifier result{0};
80 // Pack field
81 m_det_impl.pack(muon_field_value(), result);
82 return result;
83}
int muon_field_value() const

◆ muon_exp()

ExpandedIdentifier AtlasDetectorID::muon_exp ( void ) const
protectedinherited

Definition at line 1063 of file AtlasDetectorID.cxx.

1064{
1065 ExpandedIdentifier result;
1066 return (result << m_MUON_ID);
1067}

◆ muon_field_value()

int AtlasDetectorID::muon_field_value ( ) const
inlineprotectedinherited

Definition at line 473 of file AtlasDetectorID.h.

473{return (m_MUON_ID);}

◆ name()

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

Return the name for this helper.

◆ phi()

int LArEM_Base_ID::phi ( const Identifier id) const
inherited

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
regHashREGION hash code.

Definition at line 217 of file CaloIDHelper.cxx.

218{
219 if (regHash >= m_vecOfDictRegions.size()) return NOT_VALID;
220 return (m_vecOfDictRegions.at(regHash)->phi0());
221}

◆ phi_max()

int LArEM_Base_ID::phi_max ( const Identifier regId) const
inherited

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

Warning
input = REGION ID !!

Definition at line 121 of file LArEM_Base_ID.cxx.

122{
123 ExpandedIdentifier expId;
124 IdContext context = region_context();
125 if(!get_expanded_id(regId, expId, &context)) {
126 int result = -999;
127 for (unsigned int i = 0; i < m_full_em_range.size(); ++i) {
128 const Range& range = m_full_em_range[i];
129 if (range.match(expId)) {
130 const Range::field& phi_field = range[m_PHI_INDEX];
131 if (not phi_field.empty()) {
132 int phimax = phi_field.get_maximum();
133 if (result < phimax) result = phimax;
134 }
135 }
136 }
137 return (result);
138 }
139 return (-999); // default
140}

◆ phi_min()

int LArEM_Base_ID::phi_min ( const Identifier regId) const
inherited

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
privateinherited

Definition at line 95 of file LArEM_Base_ID.cxx.

96{
97 ExpandedIdentifier expId;
98 IdContext region_cntxt = region_context();
99 if(!get_expanded_id(regId, expId, &region_cntxt)) {
100 int result = -999;
101 for (unsigned int i = 0; i < m_full_em_range.size(); ++i) {
102 const Range& range = m_full_em_range[i];
103 if (range.match(expId)) {
104 const Range::field& phi_field = range[m_PHI_INDEX];
105 if (not phi_field.empty()) {
106 int phimin = phi_field.get_minimum();
107 if (-999 == result) {
108 result = phimin;
109 }
110 else {
111 if (phimin < result) result = phimin;
112 }
113 }
114 }
115 }
116 return (result);
117 }
118 return (-999); // default
119}

◆ phiGranularity()

float CaloIDHelper::phiGranularity ( const IdentifierHash regHash) const
inherited

Return the phi granularity of a region, or NOT_VALID.

Parameters
regHashREGION hash code.

Definition at line 195 of file CaloIDHelper.cxx.

196{
197 if (regHash >= m_vecOfDictRegions.size()) return NOT_VALID;
198 return 2. * M_PI / m_vecOfDictRegions.at(regHash)->dphi();
199}
#define M_PI

◆ pixel()

Identifier AtlasDetectorID::pixel ( void ) const
inherited

Definition at line 92 of file AtlasDetectorID.cxx.

92 {
93 Identifier result{0};
94 // Pack field
95 m_det_impl.pack(indet_field_value(), result);
96 m_indet_part_impl.pack(m_PIXEL_ID, result);
97 return result;
98}

◆ pixel_exp()

ExpandedIdentifier AtlasDetectorID::pixel_exp ( void ) const
protectedinherited

Inner Detector:

Definition at line 1084 of file AtlasDetectorID.cxx.

1085{
1086 ExpandedIdentifier result(indet_exp());
1087 return (result << m_PIXEL_ID);
1088}

◆ pixel_field_value()

int AtlasDetectorID::pixel_field_value ( ) const
inlineprotectedinherited

Definition at line 479 of file AtlasDetectorID.h.

479{return (m_PIXEL_ID);}

◆ plr_field_value()

int AtlasDetectorID::plr_field_value ( ) const
inlineprotectedinherited

Definition at line 494 of file AtlasDetectorID.h.

494{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 425 of file AtlasDetectorID.cxx.

425 {
426 ATH_MSG_INFO(print_to_string(id, context));
427}
#define ATH_MSG_INFO(x)
std::string print_to_string(Identifier id, const IdContext *context=0) const
or provide the printout in string form

◆ 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 429 of file AtlasDetectorID.cxx.

430 {
431 // Print out for any Atlas identifier
432 std::string result;
434
435 // Do a generic printout of identifier from dictionary
436 unsigned int max_index = (context) ? context->end_index() : 999;
437
438 // Find the dictionary to use:
439 const IdDictDictionary *dict{nullptr};
440 ExpandedIdentifier expId;
441 ExpandedIdentifier prefix; // default is null prefix
442 Identifier compact = id;
443
444 if (is_indet(id)) {
445 dict = m_indet_dict;
446 } else if (is_lar(id)) {
447 dict = m_lar_dict;
448 } else if (is_tile(id)) {
449 dict = m_tile_dict;
450 } else if (is_muon(id)) {
451 dict = m_muon_dict;
452 } else if (is_lvl1_trig_towers(id) || is_lvl1_online(id) ||
453 is_lar_dm(id) || is_tile_dm(id)) {
454 dict = m_calo_dict;
455 } else if (is_forward(id)) {
456 dict = m_fwd_dict;
457 }
458
459 if (!dict) {
460 ATH_MSG_WARNING(__func__<<":"<<__LINE__<<" No dictionary could be associated to "<<id);
461 return result;
462 }
463 if (dict->unpack(m_group, compact, prefix, max_index," ", result)) {
464 return result;
465 }
466 }
467 return result;
468}
const IdDictDictionary * m_calo_dict
const IdDictDictionary * m_muon_dict
bool is_lar_dm(Identifier id) const
LAr/Tile dead material:
bool is_lvl1_online(Identifier id) const
const IdDictDictionary * m_tile_dict
const IdDictDictionary * m_fwd_dict
bool is_tile_dm(Identifier id) const
bool is_tile(Identifier id) const
const IdDictDictionary * m_indet_dict
const IdDictDictionary * m_lar_dict
bool is_lvl1_trig_towers(Identifier id) const
int unpack(const std::string &group, const Identifier &id, const ExpandedIdentifier &prefix, size_t index2, ExpandedIdentifier &unpackedId) const
Unpack the value_type id to an expanded Identifier for a given group, considering the provided prefix...

◆ reg_begin()

id_iterator LArEM_Base_ID::reg_begin ( ) const
inherited

begin iterator over set of Region Identifiers

◆ reg_end()

id_iterator LArEM_Base_ID::reg_end ( ) const
inherited

end iterator over set of Region Identifiers

◆ reg_range()

id_range LArEM_Base_ID::reg_range ( ) const
inherited

Range over set of Region Identifiers.

◆ region()

int LArEM_Base_ID::region ( const Identifier id) const
inherited

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()

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_max()

size_type CaloIDHelper::region_hash_max ( ) const
inherited

One more than the largest region hash code.

◆ region_id() [1/5]

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

Build a cell identifier from an expanded identifier.

◆ region_id() [2/5]

Identifier LArEM_Base_ID::region_id ( const Identifier channelId) const
inherited

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

◆ region_id() [3/5]

Identifier CaloIDHelper::region_id ( IdentifierHash hashId) const
inherited

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

◆ region_id() [4/5]

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

build a region identifier

◆ region_id() [5/5]

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

◆ region_id_checks()

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

Definition at line 142 of file LArEM_Base_ID.cxx.

143{
144 // Check that id is within allowed range
145
146 // Fill expanded id
147 ExpandedIdentifier expId(lar_em_exp());
148 expId << barrel_ec << sampling << region ;
149
150 if (!m_full_region_range.match(expId)) {
151 std::string errorMessage = "LArEM_Base_ID::region_id_checks() result is not OK: ID, range = "
152 + std::string(expId) + " , " + (std::string)m_full_region_range;
153 throw LArID_Exception(errorMessage , 5);
154 }
155}

◆ 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 203 of file AtlasDetectorID.cxx.

204 {
205 // Register version of dictionary dict_name
206
207 // Access dictionary by name
208 const IdDictDictionary *dict = dict_mgr.find_dictionary(dict_name);
209 if (!dict) {
210 ATH_MSG_ERROR(__func__<<":"<<__LINE__<<" No dictionary found");
211 return 1;
212
213 }
214 // Add in dict name, file name and version
215 m_dict_names.push_back(dict_name);
216 m_file_names.push_back(dict->file_name());
217 m_dict_tags.push_back(dict->dict_tag());
218 return 0;
219}
const std::string & dict_tag() const
Access to the dictionary tag.
const std::string & file_name() const
Access to file name.

◆ 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 223 of file AtlasDetectorID.cxx.

223 {
224 // If no tag has been registered, then reinitialize
225 if (m_dict_tags.size() == 0){
226 return true;
227 }
228 // If no dict names have been registered, then reinitialize
229 if (m_dict_names.size() == 0){
230 return true;
231 }
232 // Loop over dict names and check version tags
233 if (m_dict_names.size() != m_dict_tags.size()) {
234 ATH_MSG_ERROR("reinitialize: dict names and tags vectors not the same length ");
235 ATH_MSG_ERROR("names: " << m_dict_names.size() << " tags: " << m_dict_tags.size());
236 }
237 for (unsigned int i = 0; i < m_dict_names.size(); ++i) {
238 // Access dictionary by name
239 const IdDictDictionary *dict = dict_mgr.find_dictionary(m_dict_names[i]);
240 if (!dict) {
241 ATH_MSG_ERROR("reinitialize: could not find dict - " << m_dict_names[i]);
242 return false;
243 }
244 if (m_dict_tags[i] != dict->dict_tag()) {
245 // Remove all memory of versions
246 m_dict_names.clear();
247 m_dict_tags.clear();
248 m_file_names.clear();
249 return true;
250 }
251 }
252
253 // Tags match - don't reinitialize
254 return false;
255}

◆ rpc()

Identifier AtlasDetectorID::rpc ( void ) const
inherited

Definition at line 45 of file AtlasDetectorID.cxx.

45 {
46 return Identifier{};
47}

◆ rpc_field_value()

int AtlasDetectorID::rpc_field_value ( ) const
inlineprotectedinherited

Definition at line 512 of file AtlasDetectorID.h.

512{return (m_RPC_ID);}

◆ sampling()

int LArEM_Base_ID::sampling ( const Identifier id) const
inherited

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 100 of file AtlasDetectorID.cxx.

100 {
101 Identifier result{0};
102 // Pack field
103 m_det_impl.pack(indet_field_value(), result);
104 m_indet_part_impl.pack(m_SCT_ID, result);
105 return result;
106}

◆ sct_exp()

ExpandedIdentifier AtlasDetectorID::sct_exp ( void ) const
protectedinherited

Definition at line 1091 of file AtlasDetectorID.cxx.

1092{
1093 ExpandedIdentifier result(indet_exp());
1094 return (result << m_SCT_ID);
1095}

◆ sct_field_value()

int AtlasDetectorID::sct_field_value ( ) const
inlineprotectedinherited

Definition at line 482 of file AtlasDetectorID.h.

482{return (m_SCT_ID);}

◆ set_do_checks()

void AtlasDetectorID::set_do_checks ( bool do_checks)
overridevirtualinherited

Implements IdHelper.

Definition at line 481 of file AtlasDetectorID.cxx.

481 {
483}
virtual bool do_checks(void) const override
Checks are performed by default in debug compilation and NOT in optimized compilation.

◆ set_do_neighbours()

void AtlasDetectorID::set_do_neighbours ( bool do_neighbours)
overridevirtualinherited

Implements IdHelper.

Definition at line 489 of file AtlasDetectorID.cxx.

489 {
491}
virtual bool do_neighbours(void) const override
Neighbour initialization is performed by default One can switch or query this mode for any idHelper w...

◆ setDictVersion()

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

Implements IdHelper.

Definition at line 493 of file AtlasDetectorID.cxx.

493 {
494 const IdDictDictionary *dict = dict_mgr.find_dictionary(name);
495 m_dict_version = dict->version();
496}
const std::string & version() const
Dictionary 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.

29{
30 m_lvl = lvl;
31}

◆ 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 361 of file AtlasDetectorID.cxx.

361 {
362 ATH_MSG_INFO(show_to_string(id, context, sep));
363}

◆ 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 367 of file AtlasDetectorID.cxx.

367 {
368 // Do a generic printout of identifier
369
370 std::string result("Unable to decode id");
371 unsigned int max_index = (context) ? context->end_index() : 999;
372
373 if (!id.is_valid()) {
374 return "[INVALID]";
375 }
376
378 return result;
379
380 // Find the dictionary to use:
381 const IdDictDictionary *dict{nullptr};
382 ExpandedIdentifier expId{};
383 ExpandedIdentifier prefix{}; // default is null prefix
384 Identifier compact = id;
385
386 if (is_indet(id)) {
387 dict = m_indet_dict;
388 } else if (is_lar(id)) {
389 dict = m_lar_dict;
390 } else if (is_tile(id)) {
391 dict = m_tile_dict;
392 } else if (is_muon(id)) {
393 dict = m_muon_dict;
394 } else if (is_lvl1_trig_towers(id) || is_lvl1_online(id) ||
395 is_lar_dm(id) || is_tile_dm(id)) {
396 dict = m_calo_dict;
397 } else if (is_forward(id)) {
398 dict = m_fwd_dict;
399 }
400
401 if (!dict) {
402 ATH_MSG_WARNING(__func__<<" No detector type associated to id "<<id);
403 return result;
404 }
405 if (dict->unpack(m_group, compact, prefix, max_index, expId)) {
406 return result;
407 }
408
409 bool first = true;
410 result = "";
411 if ('.' == sep)
412 result = "[";
413 for (unsigned int i = 0; i < expId.fields(); ++i) {
414 if (first)
415 first = false;
416 else
417 result += sep;
418 result += std::format("{}", expId[i]);
419 }
420 if ('.' == sep)
421 result += "]";
422 return result;
423}
size_type fields() const
bool first
Definition DeMoScan.py:534

◆ stgc()

Identifier AtlasDetectorID::stgc ( void ) const
inherited

Definition at line 51 of file AtlasDetectorID.cxx.

51 {
52 return Identifier{};
53}

◆ stgc_field_value()

int AtlasDetectorID::stgc_field_value ( ) const
inlineprotectedinherited

Definition at line 518 of file AtlasDetectorID.h.

518{return (m_STGC_ID);}

◆ subdet_context()

IdContext AtlasDetectorID::subdet_context ( void ) const
inherited

IdContext (indicates id length) for sub-detector.

Definition at line 186 of file AtlasDetectorID.cxx.

186 {
187 ExpandedIdentifier id{};
188 return IdContext{id, 0, m_SUBDET_INDEX};
189}
size_type m_SUBDET_INDEX

◆ tgc()

Identifier AtlasDetectorID::tgc ( void ) const
inherited

Definition at line 48 of file AtlasDetectorID.cxx.

48 {
49 return Identifier{};
50}

◆ tgc_field_value()

int AtlasDetectorID::tgc_field_value ( ) const
inlineprotectedinherited

Definition at line 515 of file AtlasDetectorID.h.

515{return (m_TGC_ID);}

◆ tile()

Identifier AtlasDetectorID::tile ( void ) const
inherited

Definition at line 71 of file AtlasDetectorID.cxx.

71 {
72 Identifier result{0};
73 // Pack field
74 m_det_impl.pack(tile_field_value(), result);
75 return result;
76}
int tile_field_value() const

◆ tile_dm()

Identifier AtlasDetectorID::tile_dm ( void ) const
inherited

Definition at line 156 of file AtlasDetectorID.cxx.

156 {
157 Identifier result{0};
158 // Pack field
159 m_det_impl.pack(calo_field_value(), result);
160 m_calo_side_impl.pack(-5, result);
161 return result;
162}

◆ tile_exp()

ExpandedIdentifier AtlasDetectorID::tile_exp ( void ) const
protectedinherited

Definition at line 1056 of file AtlasDetectorID.cxx.

1057{
1058 ExpandedIdentifier result;
1059 return (result << m_TILE_ID);
1060}

◆ tile_field_value()

int AtlasDetectorID::tile_field_value ( ) const
inlineprotectedinherited

Definition at line 470 of file AtlasDetectorID.h.

470{return (m_TILE_ID);}

◆ to_range()

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

Definition at line 498 of file AtlasDetectorID.cxx.

498 {
499
500 // Build a string from the contents of an identifier
501 int fields = id.fields();
502 std::string result("");
503 for (int i = 0; i < fields; ++i) {
504 if (i > 0) {
505 result += '/'; // add '/' only if NOT last one
506 }
507 result += std::format("{}", id[i]);
508 }
509 return result;
510}

◆ trt()

Identifier AtlasDetectorID::trt ( void ) const
inherited

Definition at line 108 of file AtlasDetectorID.cxx.

108 {
109 Identifier result{0};
110 // Pack field
111 m_det_impl.pack(indet_field_value(), result);
112 m_indet_part_impl.pack(m_TRT_ID, result);
113 return result;
114}

◆ trt_exp()

ExpandedIdentifier AtlasDetectorID::trt_exp ( void ) const
protectedinherited

Definition at line 1098 of file AtlasDetectorID.cxx.

1099{
1100 ExpandedIdentifier result(indet_exp());
1101 return (result << m_TRT_ID);
1102}

◆ trt_field_value()

int AtlasDetectorID::trt_field_value ( ) const
inlineprotectedinherited

Definition at line 485 of file AtlasDetectorID.h.

485{return (m_TRT_ID);}

◆ twoSymSides()

bool LArEM_Base_ID::twoSymSides ( ) const
inherited

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
protectedinherited

Definition at line 1161 of file AtlasDetectorID.cxx.

1162{
1163 ExpandedIdentifier result(fwd_exp());
1164 return (result << m_ZDC_ID);
1165}

◆ zdc_field_value()

int AtlasDetectorID::zdc_field_value ( ) const
inlineprotectedinherited

Definition at line 532 of file AtlasDetectorID.h.

532{return (m_ZDC_ID);}

Member Data Documentation

◆ ATLAS_THREAD_SAFE

std::atomic_flag m_initialized AthMessaging::ATLAS_THREAD_SAFE = ATOMIC_FLAG_INIT
mutableprivateinherited

Messaging initialized (initMessaging)

Definition at line 141 of file AthMessaging.h.

◆ m_ALFA_ID

int AtlasDetectorID::m_ALFA_ID {1}
privateinherited

Definition at line 409 of file AtlasDetectorID.h.

409{1};

◆ m_atlas_dict

const IdDictDictionary* AtlasDetectorID::m_atlas_dict {}
privateinherited

Definition at line 420 of file AtlasDetectorID.h.

420{};

◆ m_BCM_ID

int AtlasDetectorID::m_BCM_ID {3}
privateinherited

Definition at line 410 of file AtlasDetectorID.h.

410{3};

◆ m_bec_impl

IdDictFieldImplementation LArEM_Base_ID::m_bec_impl
privateinherited

Definition at line 420 of file LArEM_Base_ID.h.

◆ m_BEC_INDEX

size_type LArEM_Base_ID::m_BEC_INDEX {999}
privateinherited

Definition at line 411 of file LArEM_Base_ID.h.

411{999};

◆ m_bec_reg_impl

IdDictFieldImplementation LArEM_Base_ID::m_bec_reg_impl
privateinherited

Definition at line 450 of file LArEM_Base_ID.h.

◆ m_calo_dict

const IdDictDictionary* AtlasDetectorID::m_calo_dict {}
privateinherited

Definition at line 425 of file AtlasDetectorID.h.

425{};

◆ m_CALO_ID

int AtlasDetectorID::m_CALO_ID {10}
privateinherited

Definition at line 391 of file AtlasDetectorID.h.

391{10};

◆ m_calo_side_impl

IdDictFieldImplementation AtlasDetectorID::m_calo_side_impl
privateinherited

Definition at line 430 of file AtlasDetectorID.h.

◆ m_cells

std::vector<unsigned> LArEM_Base_ID::m_cells
privateinherited

Definition at line 453 of file LArEM_Base_ID.h.

◆ m_channels

HashGroup CaloIDHelper::m_channels
privateinherited

Group of channel (cell) Identifiers.

Definition at line 326 of file CaloIDHelper.h.

◆ m_CSC_ID

int AtlasDetectorID::m_CSC_ID {1}
privateinherited

Definition at line 403 of file AtlasDetectorID.h.

403{1};

◆ m_det_impl

IdDictFieldImplementation AtlasDetectorID::m_det_impl
privateinherited

Definition at line 428 of file AtlasDetectorID.h.

◆ m_DET_INDEX

size_type AtlasDetectorID::m_DET_INDEX {999}
privateinherited

Definition at line 384 of file AtlasDetectorID.h.

384{999};

◆ m_dict

const IdDictDictionary* CaloIDHelper::m_dict
privateinherited

The dictionary for this helper.

Definition at line 332 of file CaloIDHelper.h.

◆ m_dict_names

std::vector<std::string> AtlasDetectorID::m_dict_names
protectedinherited

List of dictionary names used by this helper.

Definition at line 360 of file AtlasDetectorID.h.

◆ m_dict_tags

std::vector<std::string> AtlasDetectorID::m_dict_tags
protectedinherited

List of dictionary versions used by this helper.

Definition at line 366 of file AtlasDetectorID.h.

◆ m_dict_version

std::string AtlasDetectorID::m_dict_version
privateinherited

Definition at line 382 of file AtlasDetectorID.h.

◆ m_do_checks

bool AtlasDetectorID::m_do_checks {}
protectedinherited

Flag for subclasses to know whether or not to perform checks.

In general, this is set to false in optimized mode.

Definition at line 354 of file AtlasDetectorID.h.

354{};

◆ m_do_neighbours

bool AtlasDetectorID::m_do_neighbours {true}
protectedinherited

Flag for subclasses to know whether or not to perform neighbour initialization.

Definition at line 357 of file AtlasDetectorID.h.

357{true};

◆ m_em_impl

IdDictFieldImplementation LArEM_Base_ID::m_em_impl
privateinherited

Definition at line 419 of file LArEM_Base_ID.h.

◆ m_EM_INDEX

size_type LArEM_Base_ID::m_EM_INDEX {999}
privateinherited

Definition at line 410 of file LArEM_Base_ID.h.

410{999};

◆ m_em_region_index

size_type LArEM_Base_ID::m_em_region_index {0}
privateinherited

Definition at line 408 of file LArEM_Base_ID.h.

408{0};

◆ m_eta_impl

IdDictFieldImplementation LArEM_Base_ID::m_eta_impl
privateinherited

Definition at line 423 of file LArEM_Base_ID.h.

◆ m_ETA_INDEX

size_type LArEM_Base_ID::m_ETA_INDEX {999}
privateinherited

Definition at line 414 of file LArEM_Base_ID.h.

414{999};

◆ m_file_names

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

List of dictionary file names used by this helper.

Definition at line 363 of file AtlasDetectorID.h.

◆ m_full_em_range

MultiRange LArEM_Base_ID::m_full_em_range
privateinherited

Definition at line 406 of file LArEM_Base_ID.h.

◆ m_full_region_range

MultiRange LArEM_Base_ID::m_full_region_range
privateinherited

Definition at line 405 of file LArEM_Base_ID.h.

◆ m_fwd_dict

const IdDictDictionary* AtlasDetectorID::m_fwd_dict {}
privateinherited

Definition at line 426 of file AtlasDetectorID.h.

426{};

◆ m_FWD_ID

int AtlasDetectorID::m_FWD_ID {13}
privateinherited

Definition at line 408 of file AtlasDetectorID.h.

408{13};

◆ m_fwd_part_impl

IdDictFieldImplementation AtlasDetectorID::m_fwd_part_impl
privateinherited

Definition at line 436 of file AtlasDetectorID.h.

◆ m_group

std::string AtlasDetectorID::m_group
protectedinherited

Group name.

Definition at line 350 of file AtlasDetectorID.h.

◆ m_hash_calcs

std::vector<HashCalc> LArEM_Base_ID::m_hash_calcs
privateinherited

Definition at line 448 of file LArEM_Base_ID.h.

◆ m_helper

AtlasDetectorIDHelper* AtlasDetectorID::m_helper {}
privateinherited

Definition at line 427 of file AtlasDetectorID.h.

427{};

◆ m_HGTD_ID

int AtlasDetectorID::m_HGTD_ID {4}
privateinherited

Definition at line 395 of file AtlasDetectorID.h.

395{4};

◆ m_imsg

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

MessageSvc pointer.

Definition at line 135 of file AthMessaging.h.

135{ nullptr };

◆ m_indet_dict

const IdDictDictionary* AtlasDetectorID::m_indet_dict {}
privateinherited

Definition at line 421 of file AtlasDetectorID.h.

421{};

◆ m_INDET_ID

int AtlasDetectorID::m_INDET_ID {2}
privateinherited

Definition at line 387 of file AtlasDetectorID.h.

387{2};

◆ m_indet_part_impl

IdDictFieldImplementation AtlasDetectorID::m_indet_part_impl
privateinherited

Definition at line 429 of file AtlasDetectorID.h.

◆ m_is_initialized_from_dict

bool AtlasDetectorID::m_is_initialized_from_dict {}
privateinherited

Definition at line 383 of file AtlasDetectorID.h.

383{};

◆ m_isHighLuminosityLHC

bool AtlasDetectorID::m_isHighLuminosityLHC {}
privateinherited

Definition at line 414 of file AtlasDetectorID.h.

414{};

◆ m_lar_dict

const IdDictDictionary* AtlasDetectorID::m_lar_dict {}
privateinherited

Definition at line 422 of file AtlasDetectorID.h.

422{};

◆ m_lar_dm_field

Range::field AtlasDetectorID::m_lar_dm_field
privateinherited

Definition at line 418 of file AtlasDetectorID.h.

◆ m_LAR_EM_ID

int AtlasDetectorID::m_LAR_EM_ID {1}
privateinherited

Definition at line 398 of file AtlasDetectorID.h.

398{1};

◆ m_LAR_FCAL_ID

int AtlasDetectorID::m_LAR_FCAL_ID {3}
privateinherited

Definition at line 400 of file AtlasDetectorID.h.

400{3};

◆ m_lar_fcal_module_impl

IdDictFieldImplementation AtlasDetectorID::m_lar_fcal_module_impl
privateinherited

Definition at line 432 of file AtlasDetectorID.h.

◆ m_LAR_FCAL_MODULE_INDEX

int AtlasDetectorID::m_LAR_FCAL_MODULE_INDEX {999}
privateinherited

Definition at line 401 of file AtlasDetectorID.h.

401{999};

◆ m_LAR_HEC_ID

int AtlasDetectorID::m_LAR_HEC_ID {2}
privateinherited

Definition at line 399 of file AtlasDetectorID.h.

399{2};

◆ m_LAR_ID

int AtlasDetectorID::m_LAR_ID {4}
privateinherited

Definition at line 388 of file AtlasDetectorID.h.

388{4};

◆ m_lar_impl

IdDictFieldImplementation LArEM_Base_ID::m_lar_impl
privateinherited

Definition at line 418 of file LArEM_Base_ID.h.

◆ m_LAR_INDEX

size_type LArEM_Base_ID::m_LAR_INDEX {999}
privateinherited

Definition at line 409 of file LArEM_Base_ID.h.

409{999};

◆ m_lar_part_impl

IdDictFieldImplementation AtlasDetectorID::m_lar_part_impl
privateinherited

Definition at line 431 of file AtlasDetectorID.h.

◆ m_LUCID_ID

int AtlasDetectorID::m_LUCID_ID {5}
privateinherited

Definition at line 411 of file AtlasDetectorID.h.

411{5};

◆ m_LUMI_ID

int AtlasDetectorID::m_LUMI_ID {3}
privateinherited

Definition at line 396 of file AtlasDetectorID.h.

396{3};

◆ m_LUMI_PLR_ID

int AtlasDetectorID::m_LUMI_PLR_ID {1}
privateinherited

Definition at line 397 of file AtlasDetectorID.h.

397{1};

◆ m_lvl

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

Current logging level.

Definition at line 138 of file AthMessaging.h.

138{ MSG::NIL };

◆ m_lvl1_field

Range::field AtlasDetectorID::m_lvl1_field
privateinherited

Definition at line 416 of file AtlasDetectorID.h.

◆ m_lvl1_onl_field

Range::field AtlasDetectorID::m_lvl1_onl_field
privateinherited

Definition at line 417 of file AtlasDetectorID.h.

◆ m_MDT_ID

int AtlasDetectorID::m_MDT_ID {0}
privateinherited

Definition at line 402 of file AtlasDetectorID.h.

402{0};

◆ m_MM_ID

int AtlasDetectorID::m_MM_ID {5}
privateinherited

Definition at line 407 of file AtlasDetectorID.h.

407{5};

◆ m_msg_tls

boost::thread_specific_ptr<MsgStream> AthMessaging::m_msg_tls
mutableprivateinherited

MsgStream instance (a std::cout like with print-out levels)

Definition at line 132 of file AthMessaging.h.

◆ m_muon_dict

const IdDictDictionary* AtlasDetectorID::m_muon_dict {}
privateinherited

Definition at line 424 of file AtlasDetectorID.h.

424{};

◆ m_MUON_ID

int AtlasDetectorID::m_MUON_ID {7}
privateinherited

Definition at line 390 of file AtlasDetectorID.h.

390{7};

◆ m_muon_mdt_impl

IdDictFieldImplementation AtlasDetectorID::m_muon_mdt_impl
privateinherited

Definition at line 434 of file AtlasDetectorID.h.

◆ m_muon_rpc_impl

IdDictFieldImplementation AtlasDetectorID::m_muon_rpc_impl
privateinherited

Definition at line 435 of file AtlasDetectorID.h.

◆ m_muon_station_name_impl

IdDictFieldImplementation AtlasDetectorID::m_muon_station_name_impl
privateinherited

Definition at line 433 of file AtlasDetectorID.h.

◆ m_MUON_SUBDET_INDEX

size_type AtlasDetectorID::m_MUON_SUBDET_INDEX {999}
privateinherited

Definition at line 386 of file AtlasDetectorID.h.

386{999};

◆ m_muon_tech_bits

std::vector<unsigned int> AtlasDetectorID::m_muon_tech_bits
privateinherited

Definition at line 439 of file AtlasDetectorID.h.

◆ m_name

std::string CaloIDHelper::m_name
privateinherited

Name of this helper.

Definition at line 323 of file CaloIDHelper.h.

◆ m_nm

std::string AthMessaging::m_nm
privateinherited

Message source name.

Definition at line 129 of file AthMessaging.h.

◆ m_phi_impl

IdDictFieldImplementation LArEM_Base_ID::m_phi_impl
privateinherited

Definition at line 424 of file LArEM_Base_ID.h.

◆ m_PHI_INDEX

size_type LArEM_Base_ID::m_PHI_INDEX {999}
privateinherited

Definition at line 415 of file LArEM_Base_ID.h.

415{999};

◆ m_PIXEL_ID

int AtlasDetectorID::m_PIXEL_ID {1}
privateinherited

Definition at line 392 of file AtlasDetectorID.h.

392{1};

◆ m_region_impl

IdDictFieldImplementation LArEM_Base_ID::m_region_impl
privateinherited

Definition at line 422 of file LArEM_Base_ID.h.

◆ m_REGION_INDEX

size_type LArEM_Base_ID::m_REGION_INDEX {999}
privateinherited

Definition at line 413 of file LArEM_Base_ID.h.

413{999};

◆ m_regions

HashGroup CaloIDHelper::m_regions
privateinherited

Group of region Identifiers.

Definition at line 329 of file CaloIDHelper.h.

◆ m_RPC_ID

int AtlasDetectorID::m_RPC_ID {2}
privateinherited

Definition at line 404 of file AtlasDetectorID.h.

404{2};

◆ m_sampling_impl

IdDictFieldImplementation LArEM_Base_ID::m_sampling_impl
privateinherited

Definition at line 421 of file LArEM_Base_ID.h.

◆ m_SAMPLING_INDEX

size_type LArEM_Base_ID::m_SAMPLING_INDEX {999}
privateinherited

Definition at line 412 of file LArEM_Base_ID.h.

412{999};

◆ m_SCT_ID

int AtlasDetectorID::m_SCT_ID {2}
privateinherited

Definition at line 393 of file AtlasDetectorID.h.

393{2};

◆ m_slar

unsigned LArEM_Base_ID::m_slar {0}
privateinherited

Definition at line 401 of file LArEM_Base_ID.h.

401{0};

◆ m_slar_impl

IdDictFieldImplementation LArEM_Base_ID::m_slar_impl
privateinherited

Definition at line 426 of file LArEM_Base_ID.h.

◆ m_SLAR_INDEX

size_type LArEM_Base_ID::m_SLAR_INDEX {999}
privateinherited

Definition at line 416 of file LArEM_Base_ID.h.

416{999};

◆ m_STGC_ID

int AtlasDetectorID::m_STGC_ID {4}
privateinherited

Definition at line 406 of file AtlasDetectorID.h.

406{4};

◆ m_SUBDET_INDEX

size_type AtlasDetectorID::m_SUBDET_INDEX {999}
privateinherited

Definition at line 385 of file AtlasDetectorID.h.

385{999};

◆ m_TGC_ID

int AtlasDetectorID::m_TGC_ID {3}
privateinherited

Definition at line 405 of file AtlasDetectorID.h.

405{3};

◆ m_tile_dict

const IdDictDictionary* AtlasDetectorID::m_tile_dict {}
privateinherited

Definition at line 423 of file AtlasDetectorID.h.

423{};

◆ m_tile_dm_field

Range::field AtlasDetectorID::m_tile_dm_field
privateinherited

Definition at line 419 of file AtlasDetectorID.h.

◆ m_TILE_ID

int AtlasDetectorID::m_TILE_ID {5}
privateinherited

Definition at line 389 of file AtlasDetectorID.h.

389{5};

◆ m_TRT_ID

int AtlasDetectorID::m_TRT_ID {3}
privateinherited

Definition at line 394 of file AtlasDetectorID.h.

394{3};

◆ m_two_sym_sides

bool LArEM_Base_ID::m_two_sym_sides {true}
privateinherited

Definition at line 403 of file LArEM_Base_ID.h.

403{true};

◆ m_vecOfDictRegions

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

List of IdDictRegion objects.

Definition at line 335 of file CaloIDHelper.h.

◆ m_vecOfPhiMin

std::vector<int> LArEM_Base_ID::m_vecOfPhiMin
privateinherited

Definition at line 428 of file LArEM_Base_ID.h.

◆ m_vecOfRegions

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

Definition at line 452 of file LArEM_Base_ID.h.

◆ m_ZDC_ID

int AtlasDetectorID::m_ZDC_ID {7}
privateinherited

Definition at line 412 of file AtlasDetectorID.h.

412{7};

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