#include <TRTStrawEfficiency.h>

Inheritance diagram for TRTStrawEfficiency:

Collaboration diagram for TRTStrawEfficiency:

Public Member Functions
	TRTStrawEfficiency (const std::string &name, ISvcLocator *pSvcLocator)
StatusCode	initialize ()
StatusCode	finalize ()
StatusCode	execute (const EventContext &ctx)
	Execute method.
virtual StatusCode	sysInitialize () override
	Override sysInitialize.
virtual bool	isClonable () const override
	Specify if the algorithm is clonable.
virtual StatusCode	sysExecute (const EventContext &ctx) override
	Execute an algorithm.
virtual const DataObjIDColl &	extraOutputDeps () const override
	Return the list of extra output dependencies.
virtual bool	filterPassed (const EventContext &ctx) const
	Get filter decision:
virtual void	setFilterPassed (bool state, const EventContext &ctx) const
	Set filter decision:
ServiceHandle< StoreGateSvc > &	evtStore ()
	The standard `StoreGateSvc` (event store) Returns (kind of) a pointer to the `StoreGateSvc`.
const ServiceHandle< StoreGateSvc > &	detStore () const
	The standard `StoreGateSvc/DetectorStore` Returns (kind of) a pointer to the `StoreGateSvc`.
virtual StatusCode	sysStart () override
	Handle START transition.
virtual std::vector< Gaudi::DataHandle * >	inputHandles () const override
	Return this algorithm's input handles.
virtual std::vector< Gaudi::DataHandle * >	outputHandles () const override
	Return this algorithm's output handles.
Gaudi::Details::PropertyBase &	declareProperty (Gaudi::Property< T, V, H > &t)
void	updateVHKA (Gaudi::Details::PropertyBase &)
MsgStream &	msg () const
bool	msgLvl (const MSG::Level lvl) const

Protected Member Functions
virtual bool	isReEntrant () const override final
	Legacy algorithms are not thread-safe.
void	renounceArray (SG::VarHandleKeyArray &handlesArray)
	remove all handles from I/O resolution
std::enable_if_t< std::is_void_v< std::result_of_t< decltype(&T::renounce)(T)> > &&!std::is_base_of_v< SG::VarHandleKeyArray, T > &&std::is_base_of_v< Gaudi::DataHandle, T >, void >	renounce (T &h)
void	extraDeps_update_handler (Gaudi::Details::PropertyBase &ExtraDeps)
	Add StoreName to extra input/output deps as needed.

Private Types
typedef ServiceHandle< StoreGateSvc >	StoreGateSvc_t

Private Member Functions
void	make_branches ()
void	clear_branches ()
int	fill_hit_data (const Trk::TrackStateOnSurface &hit)
int	fill_hole_data (const Trk::TrackStateOnSurface &hole)
Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
	specialization for handling Gaudi::Property<SG::VarHandleKey>

Private Attributes
ToolHandle< Trk::ITrackHoleSearchTool >	m_trt_hole_finder {this, "trt_hole_finder","TRTTrackHoleSearchTool"}
FloatProperty	m_max_abs_d0 {this, "max_abs_d0", 600*CLHEP::mm}
FloatProperty	m_max_abs_z0 {this, "max_abs_z0", 600*CLHEP::mm}
FloatProperty	m_min_pT {this, "min_pT", 1.0*CLHEP::GeV}
FloatProperty	m_min_p {this, "min_p", 2.0*CLHEP::GeV}
FloatProperty	m_max_abs_eta {this, "max_abs_eta", 2.5}
IntegerProperty	m_min_pixel_hits {this, "min_pixel_hits", 0}
IntegerProperty	m_min_sct_hits {this, "min_sct_hits", 2}
IntegerProperty	m_min_trt_hits {this, "min_trt_hits", 15}
ServiceHandle< ITHistSvc >	m_hist_svc {this, "hist_svc", "THistSvc"}
ServiceHandle< ITRT_StrawNeighbourSvc >	m_TRTStrawNeighbourSvc {this, "straw_neighbour_svc", "TRT_StrawNeighbourSvc"}
StringProperty	m_tree_name {this, "tree_name", "trt_eff"}
StringProperty	m_stream_name {this, "stream_name", "TRTEffStream"}
StringProperty	m_required_trigger {this, "required_trigger", ""}
TTree *	m_tree {nullptr}
const TRT_ID *	m_TRT_ID {nullptr}
PublicToolHandle< Trk::IUpdator >	m_updator {this,"KalmanUpdator","Trk::KalmanUpdator/TrkKalmanUpdator",""}
PublicToolHandle< Trig::ITrigDecisionTool >	m_trigDec {this,"ITrigDecisionTool","Trig::ITrigDecisionTool/TrigDecisionTool",""}
SG::ReadHandleKey< TrackCollection >	m_tracksKey {this, "track_collection", "CombinedInDetTracks", "Tracks container key"}
SG::ReadHandleKey< xAOD::EventInfo >	m_eventInfoKey {this, "event_info_key", "EventInfo", "Event info key"}
SG::ReadHandleKey< xAOD::VertexContainer >	m_vertexContainerKey {this, "VertexContainerName", "PrimaryVertices", "Vertex container key"}
unsigned int	m_num_events {0}
unsigned int	m_num_tracks {0}
unsigned int	m_num_preselected_tracks {0}
unsigned int	m_event_number {0}
unsigned int	m_run_number {0}
unsigned int	m_lumi_block {0}
float	m_track_pt {0.}
float	m_track_eta {0.}
float	m_track_phi {0.}
float	m_track_d0 {0.}
float	m_track_z0 {0.}
int	m_n_pixel_hits {0}
int	m_n_sct_hits {0}
int	m_n_trt_hits {0}
std::vector< int >	m_hit_bec
std::vector< int >	m_hit_phi
std::vector< int >	m_hit_layer
std::vector< int >	m_hit_strawlayer
std::vector< int >	m_hit_straw
std::vector< int >	m_hit_chip
std::vector< int >	m_hit_pad
std::vector< float >	m_hit_x
std::vector< float >	m_hit_y
std::vector< float >	m_hit_z
std::vector< float >	m_hit_center_x
std::vector< float >	m_hit_center_y
std::vector< float >	m_hit_center_z
std::vector< float >	m_hit_R
std::vector< float >	m_hit_locR
std::vector< int >	m_hit_HL
std::vector< int >	m_hit_det
std::vector< float >	m_hit_ub_locR
std::vector< float >	m_hit_ub_x
std::vector< float >	m_hit_ub_y
std::vector< float >	m_hit_ub_z
int	m_n_pixel_holes {0}
int	m_n_sct_holes {0}
int	m_n_trt_holes {0}
std::vector< int >	m_hole_bec
std::vector< int >	m_hole_phi
std::vector< int >	m_hole_layer
std::vector< int >	m_hole_strawlayer
std::vector< int >	m_hole_straw
std::vector< int >	m_hole_chip
std::vector< int >	m_hole_pad
std::vector< float >	m_hole_x
std::vector< float >	m_hole_y
std::vector< float >	m_hole_z
std::vector< float >	m_hole_center_x
std::vector< float >	m_hole_center_y
std::vector< float >	m_hole_center_z
std::vector< float >	m_hole_locR
std::vector< float >	m_hole_locR_error
std::vector< int >	m_hole_det
std::vector< int >	m_hit_tube_hit
int	m_n_primary_vertex {0}
int	m_n_tube_hits {0}
DataObjIDColl	m_extendedExtraObjects
	Extra output dependency collection, extended by AthAlgorithmDHUpdate to add symlinks.
StoreGateSvc_t	m_evtStore
	Pointer to StoreGate (event store by default).
StoreGateSvc_t	m_detStore
	Pointer to StoreGate (detector store by default).
std::vector< SG::VarHandleKeyArray * >	m_vhka
bool	m_varHandleArraysDeclared

Detailed Description

Definition at line 42 of file TRTStrawEfficiency.h.

Member Typedef Documentation

◆ StoreGateSvc_t

typedef ServiceHandle<StoreGateSvc> AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::StoreGateSvc_t

privateinherited

Definition at line 388 of file AthCommonDataStore.h.

Constructor & Destructor Documentation

◆ TRTStrawEfficiency()

TRTStrawEfficiency::TRTStrawEfficiency	(	const std::string &	name,
		ISvcLocator *	pSvcLocator )

Definition at line 34 of file TRTStrawEfficiency.cxx.

34: AthAlgorithm(name, pSvcLocator) {}

AthAlgorithm::AthAlgorithm

AthAlgorithm(const std::string &name, ISvcLocator *pSvcLocator)

Constructor.

Definition AthAlgorithm.cxx:10

Member Function Documentation

◆ clear_branches()

void TRTStrawEfficiency::clear_branches ( )

private

Definition at line 332 of file TRTStrawEfficiency.cxx.

                                        {
    m_event_number = 0;
    m_run_number = 0;
    m_lumi_block = 0;
    m_track_pt = 0.0;
    m_track_eta = 0.0;
    m_track_phi = 0.0;
    m_track_d0 = 0.0;
    m_track_z0 = 0.0;
    m_n_pixel_hits = 0;
    m_n_sct_hits = 0;
    m_n_trt_hits = 0;
    m_hit_bec.clear();
    m_hit_phi.clear();
    m_hit_layer.clear();
    m_hit_strawlayer.clear();
    m_hit_straw.clear();
    m_hit_chip.clear();
    m_hit_pad.clear();
    m_hit_x.clear();
    m_hit_y.clear();
    m_hit_z.clear();
    m_hit_center_x.clear();
    m_hit_center_y.clear();
    m_hit_center_z.clear();
    m_hit_R.clear();
    m_hit_locR.clear();
    m_hit_HL.clear();
    m_hit_det.clear();
    m_hit_ub_locR.clear();
    m_hit_ub_x.clear();
    m_hit_ub_y.clear();
    m_hit_ub_z.clear();
    m_n_pixel_holes = 0;
    m_n_sct_holes = 0;
    m_n_trt_holes = 0;
    m_hole_bec.clear();
    m_hole_phi.clear();
    m_hole_layer.clear();
    m_hole_strawlayer.clear();
    m_hole_straw.clear();
    m_hole_chip.clear();
    m_hole_pad.clear();
    m_hole_x.clear();
    m_hole_y.clear();
    m_hole_z.clear();
    m_hole_center_x.clear();
    m_hole_center_y.clear();
    m_hole_center_z.clear();
    m_hole_locR.clear();
    m_hole_locR_error.clear();
    m_hole_det.clear();
 
    m_n_primary_vertex = 0;  // added by dan
    m_hit_tube_hit.clear();  // added by dan
    m_n_tube_hits = 0;       // added by dan
}

◆ declareGaudiProperty()

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

inlineprivateinherited

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

Definition at line 156 of file AthCommonDataStore.h.

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

◆ declareProperty()

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

inlineinherited

Definition at line 145 of file AthCommonDataStore.h.

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

◆ detStore()

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

inlineinherited

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

Definition at line 95 of file AthCommonDataStore.h.

95{ return m_detStore; }

AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::m_detStore

StoreGateSvc_t m_detStore

Definition AthCommonDataStore.h:393

◆ evtStore()

ServiceHandle< StoreGateSvc > & AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::evtStore ( )

inlineinherited

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

Definition at line 85 of file AthCommonDataStore.h.

85{ return m_evtStore; }

AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::m_evtStore

StoreGateSvc_t m_evtStore

Definition AthCommonDataStore.h:390

◆ execute()

StatusCode TRTStrawEfficiency::execute ( const EventContext & ctx )

virtual

Execute method.

Implements AthAlgorithm.

Definition at line 81 of file TRTStrawEfficiency.cxx.

                                                              {
    ATH_MSG_DEBUG( "TRTStrawEfficiency::execute()  event: " << m_num_events );
 
    //    ATH_MSG_DEUBG( "getListOfTriggers: " << m_trigDec->getListOfTriggers() );
 
    // require trigger
    if ( !m_required_trigger.empty() ) {
        if ( !m_trigDec->isPassed(m_required_trigger) ) {
            // skip event
            ATH_MSG_DEBUG( "  trigger: " << m_required_trigger << " failed.  Skipping event.");
            return StatusCode::SUCCESS;
        } else {
            ATH_MSG_DEBUG( "  trigger: " << m_required_trigger << " passed.");
        }
    }
 
    // retrieve tracks
    SG::ReadHandle<TrackCollection> tracks(m_tracksKey, ctx);
    if (!tracks.isValid()) {
        ATH_MSG_FATAL( "Failed to retrieve " << m_tracksKey.key() );
        return StatusCode::FAILURE;
    }
 
    // retrieve event info
    SG::ReadHandle<xAOD::EventInfo> event_info(m_eventInfoKey, ctx);
    if (!event_info.isValid()) {
        ATH_MSG_FATAL( "Failed to retrieve " << m_eventInfoKey.key() );
        return StatusCode::FAILURE;
    }
 
    m_event_number = event_info->eventNumber();
    m_run_number = event_info->runNumber();
    m_lumi_block = event_info->lumiBlock();
 
    ATH_MSG_DEBUG( "run_number = " << m_run_number << ", lumi_block = " << m_lumi_block << ", event_number = " << m_event_number );
 
    // loop over tracks
    ATH_MSG_DEBUG( "This event has " << tracks->size() << " tracks." );
    for (const auto *track : *tracks) {
        m_num_tracks++;
 
        // clear branches
        clear_branches();
 
        // get perigee
        const Trk::Perigee* perigee = track->perigeeParameters();
        if (perigee) {
            m_track_pt = perigee->pT();
            m_track_eta = perigee->eta();
            m_track_phi = perigee->parameters()[Trk::phi0];
            m_track_d0 = perigee->parameters()[Trk::d0];
            m_track_z0 = perigee->parameters()[Trk::z0];
            ATH_MSG_DEBUG( "  This track has perigee parameters:\n"
                           << "                 pT     = " << m_track_pt/CLHEP::GeV << " CLHEP::GeV" << "\n"
                           << "                 eta =    " << m_track_eta << "\n"
                           << "                 phi0 =   " << m_track_phi << "\n"
                           << "                 d0 =     " << m_track_d0 << "\n"
                           << "                 z0 =     " << m_track_z0 << "\n"
                           << "                 theta =  " << perigee->parameters()[Trk::theta] << "\n"
                           << "                 qOverP = " << perigee->parameters()[Trk::qOverP] );
        } else {
            ATH_MSG_ERROR( "  This track has null perigeeParameters." );
            continue;
        }
 
        // get TrackStateOnSurfaces
        const Trk::TrackStates* track_states = track->trackStateOnSurfaces();
        if (track_states) {
            ATH_MSG_DEBUG( "  This track has " << track_states->size() << " track states on surface." );
        } else {
            ATH_MSG_ERROR( "  This track has null track states on surface." );
            continue;
        }
 
        // count hits
        for (const auto *trackState : *track_states) {
            if (trackState->type(Trk::TrackStateOnSurface::Measurement)) {
                if (dynamic_cast<const InDet::TRT_DriftCircleOnTrack*> (trackState->measurementOnTrack())) m_n_trt_hits++;
                else if (dynamic_cast<const InDet::SCT_ClusterOnTrack*> (trackState->measurementOnTrack())) m_n_sct_hits++;
                else if (dynamic_cast<const InDet::PixelClusterOnTrack*> (trackState->measurementOnTrack())) m_n_pixel_hits++;
            }
        }
 
        ATH_MSG_DEBUG( "  This track has\n"
                       << "        # Pixel hits = " << m_n_pixel_hits << "\n"
                       << "        # SCT hits =   " << m_n_sct_hits << "\n"
                       << "        # TRT hits =   " << m_n_trt_hits );
 
        // preselect tracks
        bool passed_track_preselection =
            ( fabs(perigee->parameters()[Trk::d0]) < m_max_abs_d0 )&&
            ( fabs(perigee->parameters()[Trk::z0]) < m_max_abs_z0 )&&
            ( 1/fabs(perigee->parameters()[Trk::qOverP]) > m_min_p )&& // added by dan
            ( perigee->pT() > m_min_pT )&&
            ( fabs(perigee->eta()) < m_max_abs_eta )&&
            ( m_n_pixel_hits >= m_min_pixel_hits)&&
            ( m_n_sct_hits >= m_min_sct_hits)&&
            ( m_n_trt_hits >= m_min_trt_hits);
 
        if (!passed_track_preselection) {
            ATH_MSG_DEBUG( "  This track failed preselection." );
            continue;
        }
 
        ATH_MSG_DEBUG( "  This track passed preselection." );
        m_num_preselected_tracks++;
 
        for (const auto *trackState : *track_states ) {
            if (trackState->type(Trk::TrackStateOnSurface::Measurement)) {
                fill_hit_data(*trackState);
            }
        }
 
        const Trk::TrackStates* holes = m_trt_hole_finder->getHolesOnTrack(*track);
        if (!holes) {
            ATH_MSG_WARNING( "  TRTTrackHoleSearchTool returned null results." );
            continue;
        } else {
            m_n_pixel_holes = 0;
            m_n_sct_holes = 0;
            m_n_trt_holes = 0;
            for (const auto *hole : *holes) {
                if (hole->type(Trk::TrackStateOnSurface::Hole)) {
                    int hole_det = fill_hole_data(*hole);
                    switch (hole_det) {
                    case 1:
                        m_n_pixel_holes++;
                        break;
                    case 2:
                        m_n_sct_holes++;
                        break;
                    case 3:
                        m_n_trt_holes++;
                        break;
                    default:
                        ATH_MSG_ERROR("fill_hole_data returned an invalid det type: " << hole_det);
                    }
                } else {
                    ATH_MSG_WARNING("  hole finder returned a TrackStateOnSurface not of type Hole.");
                }
            }
            delete holes;
        }
 
        //------- added by dan -------
 
        SG::ReadHandle<xAOD::VertexContainer> vxContainer(m_vertexContainerKey, ctx);
 
        if (!vxContainer.isValid()) {
            ATH_MSG_ERROR("  Failed to retrieve VxContainer: " << m_vertexContainerKey.key());
            return StatusCode::FAILURE;
        }
        m_n_primary_vertex = vxContainer->size() - 1;
        //-----------------------------
 
 
        m_tree->Fill();
 
        ATH_MSG_DEBUG( "  This track has\n"
                       << "        # Pixel holes = " << m_n_pixel_holes << "\n"
                       << "        # SCT holes =   " << m_n_sct_holes << "\n"
                       << "        # TRT holes =   " << m_n_trt_holes );
 
    } // end loop over tracks
 
    m_num_events++;
    return StatusCode::SUCCESS;
}

◆ extraDeps_update_handler()

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

protectedinherited

Add StoreName to extra input/output deps as needed.

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

◆ extraOutputDeps()

const DataObjIDColl & AthCommonAlgorithm< Gaudi::Algorithm >::extraOutputDeps ( ) const

overridevirtualinherited

Return the list of extra output dependencies.

This list is extended to include symlinks implied by inheritance relations.

Definition at line 89 of file AthCommonAlgorithm.cxx.

{
  // If we didn't find any symlinks to add, just return the collection
  // from the base class.  Otherwise, return the extended collection.
  if (!m_extendedExtraObjects.empty()) {
    return m_extendedExtraObjects;
  }
  return BaseAlg::extraOutputDeps();
}

◆ fill_hit_data()

int TRTStrawEfficiency::fill_hit_data ( const Trk::TrackStateOnSurface & hit )

private

Definition at line 392 of file TRTStrawEfficiency.cxx.

                                                                       {
    const Trk::TrackParameters* track_parameters = hit.trackParameters();
    if (!track_parameters) {
        ATH_MSG_ERROR("fill_hit_data(hit): null track_parameters");
        return 0;
    }
 
    m_hit_x.push_back( track_parameters->position().x() );
    m_hit_y.push_back( track_parameters->position().y() );
    m_hit_z.push_back( track_parameters->position().z() );
 
    m_hit_center_x.push_back( track_parameters->associatedSurface().center().x() );
    m_hit_center_y.push_back( track_parameters->associatedSurface().center().y() );
    m_hit_center_z.push_back( track_parameters->associatedSurface().center().z() );
 
    Identifier id = track_parameters->associatedSurface().associatedDetectorElementIdentifier();
 
    int det = 0;
    if(m_TRT_ID->is_pixel(id)) {
        det = 1;
    }   else if(m_TRT_ID->is_sct(id)) {
        det = 2;
    }   else if(m_TRT_ID->is_trt(id)) {
        det = 3;
    }
    m_hit_det.push_back( det );
 
    m_hit_bec.push_back( det == 3 ?         m_TRT_ID->barrel_ec(id) : 0 );
    m_hit_phi.push_back( det == 3 ?         m_TRT_ID->phi_module(id) : -1 );
    m_hit_layer.push_back( det == 3 ?       m_TRT_ID->layer_or_wheel(id) : -1 );
    m_hit_strawlayer.push_back( det == 3 ?  m_TRT_ID->straw_layer(id) : -1 );
    m_hit_straw.push_back( det == 3 ?       m_TRT_ID->straw(id) : -1 );
 
    int chip = -1;
    if(det == 3) {
        m_TRTStrawNeighbourSvc->getChip(id, chip);
    }
    m_hit_chip.push_back(chip);
 
    int pad = -1;
    if(det == 3) {
        m_TRTStrawNeighbourSvc->getPad(id, pad);
    }
    m_hit_pad.push_back(pad);
 
    m_hit_locR.push_back( det == 3 ? track_parameters->parameters()[Trk::locR] : -1 );
 
    const Trk::MeasurementBase* measurement = hit.measurementOnTrack();
    const InDet::TRT_DriftCircleOnTrack* trtcircle = nullptr;
    if(measurement) {
        trtcircle = dynamic_cast<const InDet::TRT_DriftCircleOnTrack*> (measurement);
    }   else {
        ATH_MSG_ERROR("fill_hit_data(hit): null measurement");
    }
 
    if(!trtcircle) {
        ATH_MSG_DEBUG("fill_hit_data(hit): null trtcircle");
    }
 
    m_hit_R.push_back( (det == 3)&&(trtcircle != nullptr) ? trtcircle->localParameters()[Trk::driftRadius] : -1 );
    m_hit_HL.push_back( (det == 3)&&(trtcircle != nullptr) ? trtcircle->highLevel() : -1 );
 
    // unbiased trk parameters
  std::unique_ptr<Trk::TrackParameters> unbiased_track_parameters =
    m_updator->removeFromState(
      *(hit.trackParameters()),
      hit.measurementOnTrack()->localParameters(),
      hit.measurementOnTrack()->localCovariance());
 
  m_hit_ub_locR.push_back( det == 3 && unbiased_track_parameters ? unbiased_track_parameters->parameters()[Trk::locR] : -1 );
    m_hit_ub_x.push_back( unbiased_track_parameters ? unbiased_track_parameters->position().x() : -1 );
    m_hit_ub_y.push_back( unbiased_track_parameters ? unbiased_track_parameters->position().y() : -1 );
    m_hit_ub_z.push_back( unbiased_track_parameters ? unbiased_track_parameters->position().z() : -1 );
 
    // ------- added by dan -------
    int is_tube_hit = -1;
    if (measurement && (det == 3) ) {
        is_tube_hit = ((measurement->localCovariance())(Trk::locX,Trk::locX) > 1.0)? 1 : 0;
        if (is_tube_hit) m_n_tube_hits++;
    }
 
    m_hit_tube_hit.push_back( (det == 3)&&(measurement != nullptr) ? is_tube_hit : -1);
 
    // ----------------------------
 
 
    return det;
}

◆ fill_hole_data()

int TRTStrawEfficiency::fill_hole_data ( const Trk::TrackStateOnSurface & hole )

private

Definition at line 483 of file TRTStrawEfficiency.cxx.

                                                                         {
    const Trk::TrackParameters* track_parameters = hole.trackParameters();
    if (!track_parameters) {
        ATH_MSG_ERROR("fill_hole_data(hole): null track_parameters");
        return 0;
    }
 
    m_hole_x.push_back( track_parameters->position().x() );
    m_hole_y.push_back( track_parameters->position().y() );
    m_hole_z.push_back( track_parameters->position().z() );
 
    m_hole_center_x.push_back( track_parameters->associatedSurface().center().x() );
    m_hole_center_y.push_back( track_parameters->associatedSurface().center().y() );
    m_hole_center_z.push_back( track_parameters->associatedSurface().center().z() );
 
    Identifier id = track_parameters->associatedSurface().associatedDetectorElementIdentifier();
 
    int det = 0;
    if(m_TRT_ID->is_pixel(id)) {
        det = 1;
    }   else if(m_TRT_ID->is_sct(id)) {
        det = 2;
    }   else if(m_TRT_ID->is_trt(id)) {
        det = 3;
    }
    m_hole_det.push_back( det );
 
    m_hole_bec.push_back( det == 3 ? m_TRT_ID->barrel_ec(id) : -1 );
    m_hole_phi.push_back( det == 3 ? m_TRT_ID->phi_module(id) : -1 );
    m_hole_layer.push_back( det == 3 ? m_TRT_ID->layer_or_wheel(id) : -1 );
    m_hole_strawlayer.push_back( det == 3 ? m_TRT_ID->straw_layer(id) : -1 );
    m_hole_straw.push_back( det == 3 ? m_TRT_ID->straw(id) : -1 );
 
    int chip = -1;
    if (det == 3) {
        m_TRTStrawNeighbourSvc->getChip(id, chip);
    }
    m_hole_chip.push_back(chip);
 
    int pad = -1;
    if (det == 3) {
        m_TRTStrawNeighbourSvc->getPad(id, pad);
    }
    m_hole_pad.push_back(pad);
 
    float locR = track_parameters->parameters()[Trk::locR];
    m_hole_locR.push_back( det == 3 ? locR : -1 );
 
    float locR_error = 0.0;
    //const Trk::MeasuredTrackParameters* meas = dynamic_cast< const Trk::MeasuredTrackParameters* >(track_parameters);
    //if(meas)
    //{
 
    const AmgSymMatrix(5)* merr = track_parameters->covariance();
    if(merr){
        locR_error = Amg::error(*merr,Trk::locR);
    }   else {
        ATH_MSG_ERROR("Track parameters have no covariance attached.");
    }
    m_hole_locR_error.push_back( det == 3 ? locR_error : 0.0 );
 
    /*
      ATH_MSG_DEBUG("hole trk x = " << track_parameters->position().x() <<
      ", surf x = " << track_parameters->associatedSurface()->center().x());
      ATH_MSG_DEBUG("hole trk y = " << track_parameters->position().y() <<
      ", surf y = " << track_parameters->associatedSurface()->center().y());
      ATH_MSG_DEBUG("hole trk z = " << track_parameters->position().z() <<
      ", surf z = " << track_parameters->associatedSurface()->center().z());
    */
 
    return det;
}

◆ filterPassed()

virtual bool AthCommonAlgorithm< Gaudi::Algorithm >::filterPassed ( const EventContext & ctx ) const

inlinevirtualinherited

Get filter decision:

Definition at line 93 of file AthCommonAlgorithm.h.

                                                           {
    return execState( ctx ).filterPassed();
  }

◆ finalize()

StatusCode TRTStrawEfficiency::finalize ( )

Definition at line 252 of file TRTStrawEfficiency.cxx.

                                        {
    ATH_MSG_DEBUG( "# tracks = " << m_num_tracks );
    ATH_MSG_DEBUG( "# preselected tracks = " << m_num_preselected_tracks );
 
#ifdef ANP_CPU_PROFILER
    ATH_MSG_ALWAYS("ProfilerStop.");
    ProfilerStop();
#endif
 
    return StatusCode::SUCCESS;
}

◆ initialize()

StatusCode TRTStrawEfficiency::initialize ( )

Definition at line 38 of file TRTStrawEfficiency.cxx.

                                          {
 
    // retrieve TRTTrackHoleSearchTool
    ATH_CHECK(m_trt_hole_finder.retrieve());
 
    // retrieve TRT_ID
    ATH_CHECK(detStore()->retrieve(m_TRT_ID, "TRT_ID"));
 
    ATH_CHECK(m_TRTStrawNeighbourSvc.retrieve());
 
    // retrieve the Trk::KalmanUpdator to calculate unbiased track states
    ATH_CHECK(m_updator.retrieve());
 
    // retrieve THistSvc
    ATH_CHECK(m_hist_svc.retrieve());
 
    // retrieve TrigDecisionTool
    if (!m_required_trigger.empty()) {
        ATH_CHECK(m_trigDec.retrieve());
    }
 
    // ntuple
    m_tree = new TTree(m_tree_name.value().c_str(), m_tree_name.value().c_str());
    ATH_CHECK(m_hist_svc->regTree(std::string("/") + m_stream_name + std::string("/") + m_tree_name, m_tree));
 
    // Read handles
    ATH_CHECK(m_tracksKey.initialize());
    ATH_CHECK(m_eventInfoKey.initialize());
    ATH_CHECK(m_vertexContainerKey.initialize());
 
    make_branches();
 
#ifdef CPU_PROFILER
    std::string profile_file = "cpu.prof";
    ATH_MSG_ALWAYS( "ProfilerStart(" << profile_file << ")" );
    ProfilerStart(profile_file.c_str());
#endif
 
    return StatusCode::SUCCESS;
}

◆ inputHandles()

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

overridevirtualinherited

Return this algorithm's input handles.

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

◆ isClonable()

virtual bool AthCommonAlgorithm< Gaudi::Algorithm >::isClonable ( ) const

inlineoverridevirtualinherited

Specify if the algorithm is clonable.

Only relevant for non-reentrant algorithms. Actual number of clones needs to be set via the "Cardinality" property.

Reimplemented in AFP_DigiTop, AlgB, AlgT, BCM_Digitization, CscDigitBuilder, CscDigitToCscRDO, G4AtlasAlg, G4RunAlg, HGTD_Digitization, HiveAlgBase, InDet::GNNSeedingTrackMaker, InDet::SCT_Clusterization, InDet::SiSPGNNTrackMaker, InDet::SiSPSeededTrackFinder, InDet::SiTrackerSpacePointFinder, ISF::SimKernelMT, ITk::StripDigitization, ITkPixelCablingAlg, ITkStripCablingAlg, LArHitEMapMaker, LArTTL1Maker, LUCID_DigiTop, LVL1::L1TopoSimulation, MergeCalibHits, MergeGenericMuonSimHitColl, MergeHijingPars, MergeMcEventCollection, MergeTrackRecordCollection, MergeTruthJets, MergeTruthParticles, MuonDigitizer, PileUpMTAlg, PixelDigitization, RoIBResultToxAOD, SCT_ByteStreamErrorsTestAlg, SCT_CablingCondAlgFromCoraCool, SCT_CablingCondAlgFromText, SCT_ConditionsParameterTestAlg, SCT_ConditionsSummaryTestAlg, SCT_ConfigurationConditionsTestAlg, SCT_Digitization, SCT_FlaggedConditionTestAlg, SCT_LinkMaskingTestAlg, SCT_MajorityConditionsTestAlg, SCT_ModuleVetoTestAlg, SCT_MonitorConditionsTestAlg, SCT_PrepDataToxAOD, SCT_RawDataToxAOD, SCT_ReadCalibChipDataTestAlg, SCT_ReadCalibDataTestAlg, SCT_RODVetoTestAlg, SCT_SensorsTestAlg, SCT_SiliconConditionsTestAlg, SCT_StripVetoTestAlg, SCT_TdaqEnabledTestAlg, SCT_TestCablingAlg, SCTEventFlagWriter, SCTRawDataProvider, SCTSiLorentzAngleTestAlg, SCTSiPropertiesTestAlg, SGInputLoader, Simulation::BeamEffectsAlg, TileHitVecToCnt, TileMuonFitter, TilePulseForTileMuonReceiver, TileRawChannelMaker, TRTDigitization, and ZDC_DigiTop.

Definition at line 68 of file AthCommonAlgorithm.h.

                                           {
    return true;
  }

◆ isReEntrant()

virtual bool AthAlgorithm::isReEntrant ( ) const

inlinefinaloverrideprotectedvirtualinherited

Legacy algorithms are not thread-safe.

Definition at line 47 of file AthAlgorithm.h.

47{ return false; }

◆ make_branches()

void TRTStrawEfficiency::make_branches ( )

private

Definition at line 270 of file TRTStrawEfficiency.cxx.

                                       {
    m_tree->Branch("event_number", &m_event_number, "event_number/i");
    m_tree->Branch("run_number", &m_run_number, "run_number/i");
    m_tree->Branch("lumi_block", &m_lumi_block, "lumi_block/i");
    m_tree->Branch("track_pt", &m_track_pt, "track_pt/F");
    m_tree->Branch("track_eta", &m_track_eta, "track_eta/F");
    m_tree->Branch("track_phi", &m_track_phi, "track_phi/F");
    m_tree->Branch("track_d0", &m_track_d0, "track_d0/F");
    m_tree->Branch("track_z0", &m_track_z0, "track_z0/F");
    m_tree->Branch("n_pixel_hits", &m_n_pixel_hits, "n_pixel_hits/I");
    m_tree->Branch("n_sct_hits", &m_n_sct_hits, "n_sct_hits/I");
    m_tree->Branch("n_trt_hits", &m_n_trt_hits, "n_trt_hits/I");
    m_tree->Branch("hit_bec", &m_hit_bec);
    m_tree->Branch("hit_phi", &m_hit_phi);
    m_tree->Branch("hit_layer", &m_hit_layer);
    m_tree->Branch("hit_strawlayer", &m_hit_strawlayer);
    m_tree->Branch("hit_straw", &m_hit_straw);
    m_tree->Branch("hit_chip", &m_hit_chip);
    m_tree->Branch("hit_pad", &m_hit_pad);
    m_tree->Branch("hit_x", &m_hit_x);
    m_tree->Branch("hit_y", &m_hit_y);
    m_tree->Branch("hit_z", &m_hit_z);
    m_tree->Branch("hit_center_x", &m_hit_center_x);
    m_tree->Branch("hit_center_y", &m_hit_center_y);
    m_tree->Branch("hit_center_z", &m_hit_center_z);
    m_tree->Branch("hit_R", &m_hit_R);
    m_tree->Branch("hit_locR", &m_hit_locR);
    m_tree->Branch("hit_HL", &m_hit_HL);
    m_tree->Branch("hit_det", &m_hit_det);
    m_tree->Branch("hit_ub_locR", &m_hit_ub_locR);
    m_tree->Branch("hit_ub_x", &m_hit_ub_x);
    m_tree->Branch("hit_ub_y", &m_hit_ub_y);
    m_tree->Branch("hit_ub_z", &m_hit_ub_z);
    m_tree->Branch("n_pixel_holes", &m_n_pixel_holes, "n_pixel_holes/I");
    m_tree->Branch("n_sct_holes", &m_n_sct_holes, "n_sct_holes/I");
    m_tree->Branch("n_trt_holes", &m_n_trt_holes, "n_trt_holes/I");
    m_tree->Branch("hole_bec", &m_hole_bec);
    m_tree->Branch("hole_phi", &m_hole_phi);
    m_tree->Branch("hole_layer", &m_hole_layer);
    m_tree->Branch("hole_strawlayer", &m_hole_strawlayer);
    m_tree->Branch("hole_straw", &m_hole_straw);
    m_tree->Branch("hole_chip", &m_hole_chip);
    m_tree->Branch("hole_pad", &m_hole_pad);
    m_tree->Branch("hole_x", &m_hole_x);
    m_tree->Branch("hole_y", &m_hole_y);
    m_tree->Branch("hole_z", &m_hole_z);
    m_tree->Branch("hole_center_x", &m_hole_center_x);
    m_tree->Branch("hole_center_y", &m_hole_center_y);
    m_tree->Branch("hole_center_z", &m_hole_center_z);
    m_tree->Branch("hole_locR", &m_hole_locR);
    m_tree->Branch("hole_locR_error", &m_hole_locR_error);
    m_tree->Branch("hole_det", &m_hole_det);
 
    // ---- branches added by dan ------
    m_tree->Branch("n_primary_vertex", &m_n_primary_vertex, "n_primary_vertex/I");
    m_tree->Branch("hit_tube_hit", &m_hit_tube_hit);
    m_tree->Branch("n_tube_hits", &m_n_tube_hits, "n_tube_hits/I");
    // -------------------------------
}

◆ msg()

MsgStream & AthCommonMsg< Gaudi::Algorithm >::msg ( ) const

inlineinherited

Definition at line 24 of file AthCommonMsg.h.

                                {
    return this->msgStream();
  }

◆ msgLvl()

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

inlineinherited

Definition at line 30 of file AthCommonMsg.h.

                                               {
    return this->msgLevel(lvl);
  }

◆ outputHandles()

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

overridevirtualinherited

Return this algorithm's output handles.

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

◆ renounce()

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

inlineprotectedinherited

Definition at line 380 of file AthCommonDataStore.h.

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

◆ renounceArray()

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

inlineprotectedinherited

remove all handles from I/O resolution

Definition at line 364 of file AthCommonDataStore.h.

                                                          {
    handlesArray.renounce();
  }

◆ setFilterPassed()

virtual void AthCommonAlgorithm< Gaudi::Algorithm >::setFilterPassed	(	bool	state,
		const EventContext &	ctx ) const

inlinevirtualinherited

Set filter decision:

Reimplemented in AthFilterAlgorithm.

Definition at line 99 of file AthCommonAlgorithm.h.

                                                                            {
    execState( ctx ).setFilterPassed( state );
  }

◆ sysExecute()

StatusCode AthCommonAlgorithm< Gaudi::Algorithm >::sysExecute ( const EventContext & ctx )

overridevirtualinherited

Execute an algorithm.

We override this in order to work around an issue with the Algorithm base class storing the event context in a member variable that can cause crashes in MT jobs.

Reimplemented in AthAnalysisAlgorithm.

Definition at line 80 of file AthCommonAlgorithm.cxx.

{
  return BaseAlg::sysExecute (ctx);
}

◆ sysInitialize()

StatusCode AthCommonAlgorithm< Gaudi::Algorithm >::sysInitialize ( )

overridevirtualinherited

Override sysInitialize.

Override sysInitialize from the base class.

Loop through all output handles, and if they're WriteCondHandles, automatically register them and this Algorithm with the CondSvc

Scan through all outputHandles, and if they're WriteCondHandles, register them with the CondSvc

Reimplemented from AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >.

Reimplemented in AthAnalysisAlgorithm, AthFilterAlgorithm, AthHistogramAlgorithm, HypoBase, InputMakerBase, and PyAthena::Alg.

Definition at line 60 of file AthCommonAlgorithm.cxx.

                                                      {
  StatusCode sc=AthCommonDataStore<AthCommonMsg<BaseAlg>>::sysInitialize();
 
  if (sc.isFailure()) {
    return sc;
  }
  
  ServiceHandle<ICondSvc> cs("CondSvc",name());
  for (auto h : outputHandles()) {
    if (h->isCondition() && h->mode() == Gaudi::DataHandle::Writer) {
      // do this inside the loop so we don't create the CondSvc until needed
      if ( cs.retrieve().isFailure() ) {
        ATH_MSG_WARNING("no CondSvc found: won't autoreg WriteCondHandles");
        return StatusCode::SUCCESS;
      }      
      if (cs->regHandle(this,*h).isFailure()) {
        sc = StatusCode::FAILURE;
        ATH_MSG_ERROR("unable to register WriteCondHandle " << h->fullKey()
                      << " with CondSvc");
      }
    }
  }
  return sc;  
}

◆ sysStart()

virtual StatusCode AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::sysStart ( )

overridevirtualinherited

Handle START transition.

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

◆ updateVHKA()

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

inlineinherited

Definition at line 308 of file AthCommonDataStore.h.

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

Member Data Documentation

◆ m_detStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::m_detStore

privateinherited

Pointer to StoreGate (detector store by default).

Definition at line 393 of file AthCommonDataStore.h.

◆ m_event_number

unsigned int TRTStrawEfficiency::m_event_number {0}

private

Definition at line 90 of file TRTStrawEfficiency.h.

90{0};

◆ m_eventInfoKey

SG::ReadHandleKey<xAOD::EventInfo> TRTStrawEfficiency::m_eventInfoKey {this, "event_info_key", "EventInfo", "Event info key"}

private

Definition at line 82 of file TRTStrawEfficiency.h.

82{this, "event_info_key", "EventInfo", "Event info key"};

◆ m_evtStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::m_evtStore

privateinherited

Pointer to StoreGate (event store by default).

Definition at line 390 of file AthCommonDataStore.h.

◆ m_extendedExtraObjects

DataObjIDColl AthCommonAlgorithm< Gaudi::Algorithm >::m_extendedExtraObjects

privateinherited

Extra output dependency collection, extended by AthAlgorithmDHUpdate to add symlinks.

Empty if no symlinks were found.

Definition at line 108 of file AthCommonAlgorithm.h.

◆ m_hist_svc

ServiceHandle<ITHistSvc> TRTStrawEfficiency::m_hist_svc {this, "hist_svc", "THistSvc"}

private

Definition at line 64 of file TRTStrawEfficiency.h.

64{this, "hist_svc", "THistSvc"};

◆ m_hit_bec

std::vector<int> TRTStrawEfficiency::m_hit_bec

private

Definition at line 101 of file TRTStrawEfficiency.h.

◆ m_hit_center_x

std::vector<float> TRTStrawEfficiency::m_hit_center_x

private

Definition at line 111 of file TRTStrawEfficiency.h.

◆ m_hit_center_y

std::vector<float> TRTStrawEfficiency::m_hit_center_y

private

Definition at line 112 of file TRTStrawEfficiency.h.

◆ m_hit_center_z

std::vector<float> TRTStrawEfficiency::m_hit_center_z

private

Definition at line 113 of file TRTStrawEfficiency.h.

◆ m_hit_chip

std::vector<int> TRTStrawEfficiency::m_hit_chip

private

Definition at line 106 of file TRTStrawEfficiency.h.

◆ m_hit_det

std::vector<int> TRTStrawEfficiency::m_hit_det

private

Definition at line 117 of file TRTStrawEfficiency.h.

◆ m_hit_HL

std::vector<int> TRTStrawEfficiency::m_hit_HL

private

Definition at line 116 of file TRTStrawEfficiency.h.

◆ m_hit_layer

std::vector<int> TRTStrawEfficiency::m_hit_layer

private

Definition at line 103 of file TRTStrawEfficiency.h.

◆ m_hit_locR

std::vector<float> TRTStrawEfficiency::m_hit_locR

private

Definition at line 115 of file TRTStrawEfficiency.h.

◆ m_hit_pad

std::vector<int> TRTStrawEfficiency::m_hit_pad

private

Definition at line 107 of file TRTStrawEfficiency.h.

◆ m_hit_phi

std::vector<int> TRTStrawEfficiency::m_hit_phi

private

Definition at line 102 of file TRTStrawEfficiency.h.

◆ m_hit_R

std::vector<float> TRTStrawEfficiency::m_hit_R

private

Definition at line 114 of file TRTStrawEfficiency.h.

◆ m_hit_straw

std::vector<int> TRTStrawEfficiency::m_hit_straw

private

Definition at line 105 of file TRTStrawEfficiency.h.

◆ m_hit_strawlayer

std::vector<int> TRTStrawEfficiency::m_hit_strawlayer

private

Definition at line 104 of file TRTStrawEfficiency.h.

◆ m_hit_tube_hit

std::vector<int> TRTStrawEfficiency::m_hit_tube_hit

private

Definition at line 143 of file TRTStrawEfficiency.h.

◆ m_hit_ub_locR

std::vector<float> TRTStrawEfficiency::m_hit_ub_locR

private

Definition at line 118 of file TRTStrawEfficiency.h.

◆ m_hit_ub_x

std::vector<float> TRTStrawEfficiency::m_hit_ub_x

private

Definition at line 119 of file TRTStrawEfficiency.h.

◆ m_hit_ub_y

std::vector<float> TRTStrawEfficiency::m_hit_ub_y

private

Definition at line 120 of file TRTStrawEfficiency.h.

◆ m_hit_ub_z

std::vector<float> TRTStrawEfficiency::m_hit_ub_z

private

Definition at line 121 of file TRTStrawEfficiency.h.

◆ m_hit_x

std::vector<float> TRTStrawEfficiency::m_hit_x

private

Definition at line 108 of file TRTStrawEfficiency.h.

◆ m_hit_y

std::vector<float> TRTStrawEfficiency::m_hit_y

private

Definition at line 109 of file TRTStrawEfficiency.h.

◆ m_hit_z

std::vector<float> TRTStrawEfficiency::m_hit_z

private

Definition at line 110 of file TRTStrawEfficiency.h.

◆ m_hole_bec

std::vector<int> TRTStrawEfficiency::m_hole_bec

private

Definition at line 125 of file TRTStrawEfficiency.h.

◆ m_hole_center_x

std::vector<float> TRTStrawEfficiency::m_hole_center_x

private

Definition at line 135 of file TRTStrawEfficiency.h.

◆ m_hole_center_y

std::vector<float> TRTStrawEfficiency::m_hole_center_y

private

Definition at line 136 of file TRTStrawEfficiency.h.

◆ m_hole_center_z

std::vector<float> TRTStrawEfficiency::m_hole_center_z

private

Definition at line 137 of file TRTStrawEfficiency.h.

◆ m_hole_chip

std::vector<int> TRTStrawEfficiency::m_hole_chip

private

Definition at line 130 of file TRTStrawEfficiency.h.

◆ m_hole_det

std::vector<int> TRTStrawEfficiency::m_hole_det

private

Definition at line 140 of file TRTStrawEfficiency.h.

◆ m_hole_layer

std::vector<int> TRTStrawEfficiency::m_hole_layer

private

Definition at line 127 of file TRTStrawEfficiency.h.

◆ m_hole_locR

std::vector<float> TRTStrawEfficiency::m_hole_locR

private

Definition at line 138 of file TRTStrawEfficiency.h.

◆ m_hole_locR_error

std::vector<float> TRTStrawEfficiency::m_hole_locR_error

private

Definition at line 139 of file TRTStrawEfficiency.h.

◆ m_hole_pad

std::vector<int> TRTStrawEfficiency::m_hole_pad

private

Definition at line 131 of file TRTStrawEfficiency.h.

◆ m_hole_phi

std::vector<int> TRTStrawEfficiency::m_hole_phi

private

Definition at line 126 of file TRTStrawEfficiency.h.

◆ m_hole_straw

std::vector<int> TRTStrawEfficiency::m_hole_straw

private

Definition at line 129 of file TRTStrawEfficiency.h.

◆ m_hole_strawlayer

std::vector<int> TRTStrawEfficiency::m_hole_strawlayer

private

Definition at line 128 of file TRTStrawEfficiency.h.

◆ m_hole_x

std::vector<float> TRTStrawEfficiency::m_hole_x

private

Definition at line 132 of file TRTStrawEfficiency.h.

◆ m_hole_y

std::vector<float> TRTStrawEfficiency::m_hole_y

private

Definition at line 133 of file TRTStrawEfficiency.h.

◆ m_hole_z

std::vector<float> TRTStrawEfficiency::m_hole_z

private

Definition at line 134 of file TRTStrawEfficiency.h.

◆ m_lumi_block

unsigned int TRTStrawEfficiency::m_lumi_block {0}

private

Definition at line 92 of file TRTStrawEfficiency.h.

92{0};

◆ m_max_abs_d0

FloatProperty TRTStrawEfficiency::m_max_abs_d0 {this, "max_abs_d0", 600*CLHEP::mm}

private

Definition at line 56 of file TRTStrawEfficiency.h.

56{this, "max_abs_d0", 600*CLHEP::mm};

◆ m_max_abs_eta

FloatProperty TRTStrawEfficiency::m_max_abs_eta {this, "max_abs_eta", 2.5}

private

Definition at line 60 of file TRTStrawEfficiency.h.

60{this, "max_abs_eta", 2.5};

◆ m_max_abs_z0

FloatProperty TRTStrawEfficiency::m_max_abs_z0 {this, "max_abs_z0", 600*CLHEP::mm}

private

Definition at line 57 of file TRTStrawEfficiency.h.

57{this, "max_abs_z0", 600*CLHEP::mm};

◆ m_min_p

FloatProperty TRTStrawEfficiency::m_min_p {this, "min_p", 2.0*CLHEP::GeV}

private

Definition at line 59 of file TRTStrawEfficiency.h.

59{this, "min_p", 2.0*CLHEP::GeV};

◆ m_min_pixel_hits

IntegerProperty TRTStrawEfficiency::m_min_pixel_hits {this, "min_pixel_hits", 0}

private

Definition at line 61 of file TRTStrawEfficiency.h.

61{this, "min_pixel_hits", 0};

◆ m_min_pT

FloatProperty TRTStrawEfficiency::m_min_pT {this, "min_pT", 1.0*CLHEP::GeV}

private

Definition at line 58 of file TRTStrawEfficiency.h.

58{this, "min_pT", 1.0*CLHEP::GeV};

◆ m_min_sct_hits

IntegerProperty TRTStrawEfficiency::m_min_sct_hits {this, "min_sct_hits", 2}

private

Definition at line 62 of file TRTStrawEfficiency.h.

62{this, "min_sct_hits", 2};

◆ m_min_trt_hits

IntegerProperty TRTStrawEfficiency::m_min_trt_hits {this, "min_trt_hits", 15}

private

Definition at line 63 of file TRTStrawEfficiency.h.

63{this, "min_trt_hits", 15};

◆ m_n_pixel_hits

int TRTStrawEfficiency::m_n_pixel_hits {0}

private

Definition at line 98 of file TRTStrawEfficiency.h.

98{0};

◆ m_n_pixel_holes

int TRTStrawEfficiency::m_n_pixel_holes {0}

private

Definition at line 122 of file TRTStrawEfficiency.h.

122{0};

◆ m_n_primary_vertex

int TRTStrawEfficiency::m_n_primary_vertex {0}

private

Definition at line 144 of file TRTStrawEfficiency.h.

144{0};

◆ m_n_sct_hits

int TRTStrawEfficiency::m_n_sct_hits {0}

private

Definition at line 99 of file TRTStrawEfficiency.h.

99{0};

◆ m_n_sct_holes

int TRTStrawEfficiency::m_n_sct_holes {0}

private

Definition at line 123 of file TRTStrawEfficiency.h.

123{0};

◆ m_n_trt_hits

int TRTStrawEfficiency::m_n_trt_hits {0}

private

Definition at line 100 of file TRTStrawEfficiency.h.

100{0};

◆ m_n_trt_holes

int TRTStrawEfficiency::m_n_trt_holes {0}

private

Definition at line 124 of file TRTStrawEfficiency.h.

124{0};

◆ m_n_tube_hits

int TRTStrawEfficiency::m_n_tube_hits {0}

private

Definition at line 145 of file TRTStrawEfficiency.h.

145{0};

◆ m_num_events

unsigned int TRTStrawEfficiency::m_num_events {0}

private

Definition at line 85 of file TRTStrawEfficiency.h.

85{0};

◆ m_num_preselected_tracks

unsigned int TRTStrawEfficiency::m_num_preselected_tracks {0}

private

Definition at line 87 of file TRTStrawEfficiency.h.

87{0};

◆ m_num_tracks

unsigned int TRTStrawEfficiency::m_num_tracks {0}

private

Definition at line 86 of file TRTStrawEfficiency.h.

86{0};

◆ m_required_trigger

StringProperty TRTStrawEfficiency::m_required_trigger {this, "required_trigger", ""}

private

Definition at line 69 of file TRTStrawEfficiency.h.

69{this, "required_trigger", ""};

◆ m_run_number

unsigned int TRTStrawEfficiency::m_run_number {0}

private

Definition at line 91 of file TRTStrawEfficiency.h.

91{0};

◆ m_stream_name

StringProperty TRTStrawEfficiency::m_stream_name {this, "stream_name", "TRTEffStream"}

private

Definition at line 68 of file TRTStrawEfficiency.h.

68{this, "stream_name", "TRTEffStream"};

◆ m_track_d0

float TRTStrawEfficiency::m_track_d0 {0.}

private

Definition at line 96 of file TRTStrawEfficiency.h.

96{0.};

◆ m_track_eta

float TRTStrawEfficiency::m_track_eta {0.}

private

Definition at line 94 of file TRTStrawEfficiency.h.

94{0.};

◆ m_track_phi

float TRTStrawEfficiency::m_track_phi {0.}

private

Definition at line 95 of file TRTStrawEfficiency.h.

95{0.};

◆ m_track_pt

float TRTStrawEfficiency::m_track_pt {0.}

private

Definition at line 93 of file TRTStrawEfficiency.h.

93{0.};

◆ m_track_z0

float TRTStrawEfficiency::m_track_z0 {0.}

private

Definition at line 97 of file TRTStrawEfficiency.h.

97{0.};

◆ m_tracksKey

SG::ReadHandleKey<TrackCollection> TRTStrawEfficiency::m_tracksKey {this, "track_collection", "CombinedInDetTracks", "Tracks container key"}

private

Definition at line 81 of file TRTStrawEfficiency.h.

81{this, "track_collection", "CombinedInDetTracks", "Tracks container key"};

◆ m_tree

TTree* TRTStrawEfficiency::m_tree {nullptr}

private

Definition at line 73 of file TRTStrawEfficiency.h.

73{nullptr};

◆ m_tree_name

StringProperty TRTStrawEfficiency::m_tree_name {this, "tree_name", "trt_eff"}

private

Definition at line 67 of file TRTStrawEfficiency.h.

67{this, "tree_name", "trt_eff"};

◆ m_trigDec

PublicToolHandle<Trig::ITrigDecisionTool> TRTStrawEfficiency::m_trigDec {this,"ITrigDecisionTool","Trig::ITrigDecisionTool/TrigDecisionTool",""}

private

Definition at line 77 of file TRTStrawEfficiency.h.

78{this,"ITrigDecisionTool","Trig::ITrigDecisionTool/TrigDecisionTool",""};

◆ m_trt_hole_finder

ToolHandle<Trk::ITrackHoleSearchTool> TRTStrawEfficiency::m_trt_hole_finder {this, "trt_hole_finder","TRTTrackHoleSearchTool"}

private

Definition at line 54 of file TRTStrawEfficiency.h.

55{this, "trt_hole_finder","TRTTrackHoleSearchTool"};

◆ m_TRT_ID

const TRT_ID* TRTStrawEfficiency::m_TRT_ID {nullptr}

private

Definition at line 74 of file TRTStrawEfficiency.h.

74{nullptr};

◆ m_TRTStrawNeighbourSvc

ServiceHandle<ITRT_StrawNeighbourSvc> TRTStrawEfficiency::m_TRTStrawNeighbourSvc {this, "straw_neighbour_svc", "TRT_StrawNeighbourSvc"}

private

Definition at line 65 of file TRTStrawEfficiency.h.

66{this, "straw_neighbour_svc", "TRT_StrawNeighbourSvc"};

◆ m_updator

PublicToolHandle<Trk::IUpdator> TRTStrawEfficiency::m_updator {this,"KalmanUpdator","Trk::KalmanUpdator/TrkKalmanUpdator",""}

private

Definition at line 75 of file TRTStrawEfficiency.h.

76{this,"KalmanUpdator","Trk::KalmanUpdator/TrkKalmanUpdator",""};

◆ m_varHandleArraysDeclared

bool AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::m_varHandleArraysDeclared

privateinherited

Definition at line 399 of file AthCommonDataStore.h.

◆ m_vertexContainerKey

SG::ReadHandleKey<xAOD::VertexContainer> TRTStrawEfficiency::m_vertexContainerKey {this, "VertexContainerName", "PrimaryVertices", "Vertex container key"}

private

Definition at line 83 of file TRTStrawEfficiency.h.

83{this, "VertexContainerName", "PrimaryVertices", "Vertex container key"};

◆ m_vhka

std::vector<SG::VarHandleKeyArray*> AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::m_vhka

privateinherited

Definition at line 398 of file AthCommonDataStore.h.

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

Public Member Functions

Protected Member Functions

Private Types

Private Member Functions

Private Attributes

Detailed Description

Member Typedef Documentation

◆ StoreGateSvc_t

Constructor & Destructor Documentation

◆ TRTStrawEfficiency()

Member Function Documentation

◆ clear_branches()

◆ declareGaudiProperty()

◆ declareProperty()

◆ detStore()

◆ evtStore()

◆ execute()

◆ extraDeps_update_handler()

◆ extraOutputDeps()

◆ fill_hit_data()

◆ fill_hole_data()

◆ filterPassed()

◆ finalize()

◆ initialize()

◆ inputHandles()

◆ isClonable()

◆ isReEntrant()

◆ make_branches()

◆ msg()

◆ msgLvl()

◆ outputHandles()

◆ renounce()

◆ renounceArray()

◆ setFilterPassed()

◆ sysExecute()

◆ sysInitialize()

◆ sysStart()

◆ updateVHKA()

Member Data Documentation

◆ m_detStore

◆ m_event_number

◆ m_eventInfoKey

◆ m_evtStore

◆ m_extendedExtraObjects

◆ m_hist_svc

◆ m_hit_bec

◆ m_hit_center_x

◆ m_hit_center_y

◆ m_hit_center_z

◆ m_hit_chip

◆ m_hit_det

◆ m_hit_HL

◆ m_hit_layer

◆ m_hit_locR

◆ m_hit_pad

◆ m_hit_phi

◆ m_hit_R

◆ m_hit_straw

◆ m_hit_strawlayer

◆ m_hit_tube_hit

◆ m_hit_ub_locR

◆ m_hit_ub_x

◆ m_hit_ub_y

◆ m_hit_ub_z

◆ m_hit_x

◆ m_hit_y

◆ m_hit_z

◆ m_hole_bec

◆ m_hole_center_x

◆ m_hole_center_y

◆ m_hole_center_z

◆ m_hole_chip

◆ m_hole_det

◆ m_hole_layer

◆ m_hole_locR

◆ m_hole_locR_error

◆ m_hole_pad

◆ m_hole_phi

◆ m_hole_straw

◆ m_hole_strawlayer