MuonSegContainerMergerAlg Class Reference

The MuonSegContainerMergerAlg merges all MuonSegments assocaited with the combined muon tags into a single Trk::Segment container. More...

#include <MuonSegContainerMergerAlg.h>

Inheritance diagram for MuonSegContainerMergerAlg:

Collaboration diagram for MuonSegContainerMergerAlg:

Public Member Functions
	~MuonSegContainerMergerAlg ()=default
virtual StatusCode	initialize () override
virtual StatusCode	execute (const EventContext &ctx) const override
virtual StatusCode	sysInitialize () override
	Override sysInitialize.
virtual bool	isClonable () const override
	Specify if the algorithm is clonable.
virtual unsigned int	cardinality () const override
	Cardinality (Maximum number of clones that can exist) special value 0 means that algorithm is reentrant.
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
virtual void	setFilterPassed (bool state, const EventContext &ctx) const
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
void	renounceArray (SG::VarHandleKeyArray &handlesArray)
	remove all handles from I/O resolution
std::enable_if_t< std::is_void_v< std::result_of_t< decltype(&T::renounce)(T)> > &&!std::is_base_of_v< SG::VarHandleKeyArray, T > &&std::is_base_of_v< Gaudi::DataHandle, T >, void >	renounce (T &h)
void	extraDeps_update_handler (Gaudi::Details::PropertyBase &ExtraDeps)
	Add StoreName to extra input/output deps as needed.

Private Types
typedef ServiceHandle< StoreGateSvc >	StoreGateSvc_t

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

Private Attributes
SG::ReadHandleKeyArray< MuonCandidateCollection >	m_muonCandidateKeys {this, "MuonCandidateMaps", {"MuonCandidates"}, "Muon candidates"}
	Name of all MuonCandidate tags (Main / LRT / EMEO).
SG::ReadHandleKeyArray< MuonCombined::InDetCandidateToTagMap >	m_tagMaps
	List of all InDetCandidate tags MuidCo, MuGirl from all muon reconstruction streams.
SG::ReadHandleKeyArray< Trk::SegmentCollection >	m_inputSegContainerName
	Optionally segments from containers that are not associated with any segment candidate are dumped into a seperate container.
SG::WriteHandleKey< Trk::SegmentCollection >	m_segTrkContainerName
	Name of the bulk segment output container.
SG::WriteHandleKey< MuonCombined::MuonTagToSegMap >	m_assocMapKey {this, "AssocMapKey", "MuonTagSegMap"}
SG::WriteHandleKey< Trk::SegmentCollection >	m_unassocTrkContainerName {this, "UnassociatedSegmentKey", "UnAssocMuonTrkSegments"}
	Name of the unassociated segment container name.
ToolHandle< Trk::ITrackAmbiguityProcessorTool >	m_ambiguityProcessor {this, "AmbiguityProcessor", ""}
Gaudi::Property< bool >	m_saveUnassocSegs
Gaudi::Property< bool >	m_solveAmbi {this, "solveAmbiguities", true, "Solves the ambiguities between unassociated segments"}
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

The MuonSegContainerMergerAlg merges all MuonSegments assocaited with the combined muon tags into a single Trk::Segment container.

The container is further converted into a xAOD::MuonSegmentContainer downstream and finally dumped to disk. In order to avoid an unnecssary coping of all muon tags in memory, the MuonTagToSegMap is saved into the storegate which allows for a mapping of the transient segments associated with the segment container to the persistent ones in the MuonCreatorAlg downstream

Definition at line 23 of file MuonSegContainerMergerAlg.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

~MuonSegContainerMergerAlg()

MuonSegContainerMergerAlg::~MuonSegContainerMergerAlg ( )

default

Member Function Documentation

cardinality()

unsigned int AthCommonReentrantAlgorithm< Gaudi::Algorithm >::cardinality ( ) const

overridevirtualinherited

Cardinality (Maximum number of clones that can exist) special value 0 means that algorithm is reentrant.

Override this to return 0 for reentrant algorithms.

Definition at line 75 of file AthCommonReentrantAlgorithm.cxx.

{
  return 0;
}

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.

{ return m_detStore; }

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.

{ return m_evtStore; }

execute()

StatusCode MuonSegContainerMergerAlg::execute ( const EventContext & ctx ) const

overridevirtual

Create the output segment containers

Copy over all segments stemming from the Muon Candidates

Next proceed with the segment candidates the Combined tags

Sort according to the author

2 times a combined muon track

One of them has a primary track

Retrieve the list of associated segments

Write the segment container & the map to the store gate

If the remainder segment container is not needed we can quit here

Retrieve the list of segments to be copied

The segment has already been used

Solve ambiguities between the segments to keep the container size small

Convert the segments to tracks

Should never happen but we never know

Dynamic cast to the MuonSegment pointer

Definition at line 44 of file MuonSegContainerMergerAlg.cxx.

                                                                           {
    std::unique_ptr<MuonCombined::MuonTagToSegMap> persistency_link = std::make_unique<MuonCombined::MuonTagToSegMap>();
    std::unique_ptr<Trk::SegmentCollection> out_container = std::make_unique<Trk::SegmentCollection>();

    for (SG::ReadHandle<MuonCandidateCollection>& candidate_coll : m_muonCandidateKeys.makeHandles(ctx)) {
        if (!candidate_coll.isValid()) {
            ATH_MSG_FATAL("Failed to retrieve Muon segment candidates " << candidate_coll.fullKey());
            return StatusCode::FAILURE;
        } else {
            ATH_MSG_VERBOSE("Retrieved "<<candidate_coll.fullKey()<< " with size "<<candidate_coll->size());
        }
        for (const MuonCombined::MuonCandidate* ms_cand : *candidate_coll) {
            const std::vector<const Muon::MuonSegment*>& assoc_segs = ms_cand->getSegments();
            if (assoc_segs.empty()) { ATH_MSG_WARNING("Muon candidate " << ms_cand->toString() << " does not have associated segments."); }
            for (const Muon::MuonSegment* seg : assoc_segs) { persistency_link->persistify(seg, out_container.get()); }
        }
    }
    std::vector<const MuonCombined::TagBase*> good_tags{};
    for (SG::ReadHandle<MuonCombined::InDetCandidateToTagMap>& tag_map : m_tagMaps.makeHandles(ctx)) {
        if (!tag_map.isValid()) {
            ATH_MSG_FATAL("Failed to retrieve combined tag map "<<tag_map.fullKey());
            return StatusCode::FAILURE;
        } else {
            ATH_MSG_VERBOSE("Retrieved "<<tag_map.fullKey()<< " with size "<<tag_map->size());
        }
        good_tags.reserve(tag_map->size() + good_tags.size());
        for (const auto& tag_pair : *tag_map) {
            good_tags.push_back(tag_pair.second.get());
        }
    }
    std::stable_sort(good_tags.begin(),good_tags.end(),[](const MuonCombined::TagBase* a, const MuonCombined::TagBase* b){
        const int auth_a = MuonCombined::authorRank(a->author());
        const int auth_b = MuonCombined::authorRank(b->author());
        if (auth_a != auth_b) return auth_a < auth_b;
        const Trk::Track* prim_a = a->primaryTrack();
        const Trk::Track* prim_b = b->primaryTrack();
        if (prim_a && prim_b) {
            const Trk::Perigee* per_a = prim_a->perigeeParameters();
            const Trk::Perigee* per_b = prim_b->perigeeParameters();
            return per_a->pT() > per_b->pT();        
        }
        if (prim_a || prim_b) return prim_a != nullptr;
        std::vector<const Muon::MuonSegment*> seg_a = a->associatedSegments();
        std::vector<const Muon::MuonSegment*> seg_b = b->associatedSegments();
        const size_t n_segs_a = seg_a.size();
        const size_t n_segs_b = seg_b.size();        
        if (n_segs_a != n_segs_b) return n_segs_a > n_segs_b;
        if (!n_segs_a) return false;
        return chi2(seg_a[0]) < chi2(seg_b[0]);        
    });
    
    for (const MuonCombined::TagBase* cmb_tag : good_tags) {
        std::vector<const Muon::MuonSegment*> assoc_segs = cmb_tag->associatedSegments();
        if (assoc_segs.empty() && cmb_tag->type() != xAOD::Muon::CaloTagged) {
            ATH_MSG_WARNING("Combined candidate " << cmb_tag->toString() << " does not have associated segments");
        }
        for (const Muon::MuonSegment* seg : assoc_segs) { 
            persistency_link->persistify(seg, out_container.get()); 
        }
    }
    
    std::set<const Trk::Segment*> assoc_segs = persistency_link->getPersistifiedSegments();
    SG::WriteHandle<Trk::SegmentCollection> usedSegWriteHandle{m_segTrkContainerName, ctx};
    ATH_CHECK(usedSegWriteHandle.record(std::move(out_container)));
    SG::WriteHandle<MuonCombined::MuonTagToSegMap> assocMapWriteHandle{m_assocMapKey, ctx};
    ATH_CHECK(assocMapWriteHandle.record(std::move(persistency_link)));
    if (!m_saveUnassocSegs) return StatusCode::SUCCESS;
 
    std::vector<const Trk::Segment*> to_copy{};
    
    for (SG::ReadHandle<Trk::SegmentCollection>& inputSegColl : m_inputSegContainerName.makeHandles(ctx)) {
        if (!inputSegColl.isValid()) {
            ATH_MSG_FATAL("Failed to retrieve segment collection " << inputSegColl.fullKey());
            return StatusCode::FAILURE;
        }
        for (const Trk::Segment* seg : *inputSegColl) {
            if (assoc_segs.count(seg)) continue;
            to_copy.emplace_back(seg);
        }
    }
    if (m_solveAmbi && to_copy.size() > 1) {
        std::map<const Trk::Track*, const Trk::Segment*> track_seg_map{};
        TrackCollection ambi_tracks{};
        for (const Trk::Segment* seg : to_copy) {
            auto tsos = std::make_unique<Trk::TrackStates>();
            Trk::TrackInfo dummy_info{};
            for (const Trk::MeasurementBase* meas : seg->containedMeasurements()) {
                tsos->push_back(Muon::MuonTSOSHelper::createMeasTSOS(meas->uniqueClone(), nullptr, Trk::TrackStateOnSurface::Measurement));
            }
            std::unique_ptr<Trk::Track> trk =
                std::make_unique<Trk::Track>(dummy_info, std::move(tsos), seg->fitQuality() ? seg->fitQuality()->uniqueClone() : nullptr);
            track_seg_map[trk.get()] = seg;
            ambi_tracks.push_back(std::move(trk));
        }
        std::unique_ptr<const TrackCollection> resolved_trks{m_ambiguityProcessor->process(&ambi_tracks)};
        std::vector<const Trk::Segment*> resolved_copies{};
        for (const Trk::Track* res : *resolved_trks) {
            const Trk::Segment* seg = track_seg_map[res];
            if (!seg) continue;
            resolved_copies.emplace_back(seg);
        }
        ATH_MSG_DEBUG("Number of segments before the ambiguity solving " << to_copy.size() << " vs. after solving "
                                                                         << resolved_copies.size());
        to_copy = std::move(resolved_copies);
    }
 
    out_container = std::make_unique<Trk::SegmentCollection>();
    for (const Trk::Segment* seg : to_copy) {
        const Muon::MuonSegment* muon_seg = dynamic_cast<const Muon::MuonSegment*>(seg);
        if (!muon_seg) continue;
        std::unique_ptr<Muon::MuonSegment> copy = std::make_unique<Muon::MuonSegment>(*muon_seg);
        out_container->push_back(std::move(copy));
    }
    SG::WriteHandle<Trk::SegmentCollection> unUsedSegWriteHandle{m_unassocTrkContainerName, ctx};
    ATH_CHECK(unUsedSegWriteHandle.record(std::move(out_container)));
    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 & AthCommonReentrantAlgorithm< 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 94 of file AthCommonReentrantAlgorithm.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();
}

filterPassed()

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

inlinevirtualinherited

Definition at line 96 of file AthCommonReentrantAlgorithm.h.

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

initialize()

StatusCode MuonSegContainerMergerAlg::initialize ( )

overridevirtual

Initialize the data dependencies

Definition at line 20 of file MuonSegContainerMergerAlg.cxx.

                                                 {
    ATH_CHECK(m_muonCandidateKeys.initialize());
    ATH_CHECK(m_tagMaps.initialize());
    if ( !(m_tagMaps.size() + m_muonCandidateKeys.size() ) ){
        ATH_MSG_FATAL("No candidates were given to read the segments from");
        return StatusCode::FAILURE;
    }
    ATH_MSG_INFO("Use the following Muon tags to dump the segments");
    for (const SG::ReadHandleKey<MuonCandidateCollection>& key : m_muonCandidateKeys){
        ATH_MSG_INFO(" *** "<<key.fullKey());
    }
    ATH_MSG_INFO("Use the following combined tags to dump the segments");
    for (SG::ReadHandleKey<MuonCombined::InDetCandidateToTagMap>& key : m_tagMaps){
        ATH_MSG_INFO(" --- "<<key.fullKey());
    }
    ATH_CHECK(m_segTrkContainerName.initialize());
    ATH_CHECK(m_assocMapKey.initialize());
    ATH_CHECK(m_inputSegContainerName.initialize(m_saveUnassocSegs));
    ATH_CHECK(m_unassocTrkContainerName.initialize(m_saveUnassocSegs));
    ATH_CHECK(m_ambiguityProcessor.retrieve(EnableTool{m_solveAmbi}));
 
    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()

bool AthCommonReentrantAlgorithm< Gaudi::Algorithm >::isClonable ( ) const

overridevirtualinherited

Specify if the algorithm is clonable.

Reentrant algorithms are clonable.

Reimplemented in HiveAlgBase, InDet::GNNSeedingTrackMaker, InDet::SCT_Clusterization, InDet::SiSPGNNTrackMaker, InDet::SiSPSeededTrackFinder, InDet::SiTrackerSpacePointFinder, ITkPixelCablingAlg, ITkStripCablingAlg, RoIBResultToxAOD, SCT_ByteStreamErrorsTestAlg, SCT_CablingCondAlgFromCoraCool, SCT_CablingCondAlgFromText, SCT_ConditionsParameterTestAlg, SCT_ConditionsSummaryTestAlg, SCT_ConfigurationConditionsTestAlg, 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, and Simulation::BeamEffectsAlg.

Definition at line 68 of file AthCommonReentrantAlgorithm.cxx.

{
  // Reentrant algorithms are clonable.
  return true;
}

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 AthCommonReentrantAlgorithm< Gaudi::Algorithm >::setFilterPassed ( bool state, const EventContext & ctx ) const

inlinevirtualinherited

Definition at line 100 of file AthCommonReentrantAlgorithm.h.

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

sysExecute()

StatusCode AthCommonReentrantAlgorithm< 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.

Definition at line 85 of file AthCommonReentrantAlgorithm.cxx.

{
  return BaseAlg::sysExecute (ctx);
}

sysInitialize()

StatusCode AthCommonReentrantAlgorithm< 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 HypoBase, and InputMakerBase.

Definition at line 61 of file AthCommonReentrantAlgorithm.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_ambiguityProcessor

ToolHandle<Trk::ITrackAmbiguityProcessorTool> MuonSegContainerMergerAlg::m_ambiguityProcessor {this, "AmbiguityProcessor", ""}

private

Definition at line 52 of file MuonSegContainerMergerAlg.h.

{this, "AmbiguityProcessor", ""};

m_assocMapKey

SG::WriteHandleKey<MuonCombined::MuonTagToSegMap> MuonSegContainerMergerAlg::m_assocMapKey {this, "AssocMapKey", "MuonTagSegMap"}

private

Definition at line 47 of file MuonSegContainerMergerAlg.h.

{this, "AssocMapKey", "MuonTagSegMap"};

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_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 AthCommonReentrantAlgorithm< Gaudi::Algorithm >::m_extendedExtraObjects

privateinherited

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

Empty if no symlinks were found.

Definition at line 114 of file AthCommonReentrantAlgorithm.h.

m_inputSegContainerName

SG::ReadHandleKeyArray<Trk::SegmentCollection> MuonSegContainerMergerAlg::m_inputSegContainerName

private

Initial value:

{
        this, "InputSegmentContainers", {"TrackMuonSegments"}, "Container names of muon segments not used in muon reconstruction"}

Optionally segments from containers that are not associated with any segment candidate are dumped into a seperate container.

Definition at line 41 of file MuonSegContainerMergerAlg.h.

                                                                      {
        this, "InputSegmentContainers", {"TrackMuonSegments"}, "Container names of muon segments not used in muon reconstruction"};

m_muonCandidateKeys

SG::ReadHandleKeyArray<MuonCandidateCollection> MuonSegContainerMergerAlg::m_muonCandidateKeys {this, "MuonCandidateMaps", {"MuonCandidates"}, "Muon candidates"}

private

Name of all MuonCandidate tags (Main / LRT / EMEO).

Definition at line 34 of file MuonSegContainerMergerAlg.h.

{this, "MuonCandidateMaps", {"MuonCandidates"}, "Muon candidates"};

m_saveUnassocSegs

Gaudi::Property<bool> MuonSegContainerMergerAlg::m_saveUnassocSegs

private

Initial value:

{this, "saveUnusedSegments", true,
                                            "Dumps segments that were not fed into muon reconstruction into a second container"}

Definition at line 54 of file MuonSegContainerMergerAlg.h.

                                         {this, "saveUnusedSegments", true,
                                            "Dumps segments that were not fed into muon reconstruction into a second container"};

m_segTrkContainerName

SG::WriteHandleKey<Trk::SegmentCollection> MuonSegContainerMergerAlg::m_segTrkContainerName

private

Initial value:

{this, "TrackSegmentContainerName", "TrkMuonSegments",
                                                                     "Track segments"}

Name of the bulk segment output container.

Definition at line 45 of file MuonSegContainerMergerAlg.h.

                                                                {this, "TrackSegmentContainerName", "TrkMuonSegments",
                                                                     "Track segments"};

m_solveAmbi

Gaudi::Property<bool> MuonSegContainerMergerAlg::m_solveAmbi {this, "solveAmbiguities", true, "Solves the ambiguities between unassociated segments"}

private

Definition at line 56 of file MuonSegContainerMergerAlg.h.

{this, "solveAmbiguities", true, "Solves the ambiguities between unassociated segments"};

m_tagMaps

SG::ReadHandleKeyArray<MuonCombined::InDetCandidateToTagMap> MuonSegContainerMergerAlg::m_tagMaps

private

Initial value:

{
        this, "TagMaps", {"muidcoTagMap", "stacoTagMap", "muGirlTagMap", "caloTagMap", "segmentTagMap"}, "ID candidate to tag maps"}

List of all InDetCandidate tags MuidCo, MuGirl from all muon reconstruction streams.

Definition at line 36 of file MuonSegContainerMergerAlg.h.

                                                                      {
        this, "TagMaps", {"muidcoTagMap", "stacoTagMap", "muGirlTagMap", "caloTagMap", "segmentTagMap"}, "ID candidate to tag maps"};

m_unassocTrkContainerName

SG::WriteHandleKey<Trk::SegmentCollection> MuonSegContainerMergerAlg::m_unassocTrkContainerName {this, "UnassociatedSegmentKey", "UnAssocMuonTrkSegments"}

private

Name of the unassociated segment container name.

Definition at line 50 of file MuonSegContainerMergerAlg.h.

{this, "UnassociatedSegmentKey", "UnAssocMuonTrkSegments"};

m_varHandleArraysDeclared

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

privateinherited

Definition at line 399 of file AthCommonDataStore.h.

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:

• MuonSegContainerMergerAlg.h
• MuonSegContainerMergerAlg.cxx