ATLAS Offline Software
Loading...
Searching...
No Matches
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 (const std::string &name, ISvcLocator *pSvcLocator)
 ~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< StoreGateSvcStoreGateSvc_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< MuonCandidateCollectionm_muonCandidateKeys {this, "MuonCandidateMaps", {"MuonCandidates"}, "Muon candidates"}
 Name of all MuonCandidate tags (Main / LRT / EMEO)
SG::ReadHandleKeyArray< MuonCombined::InDetCandidateToTagMapm_tagMaps
 List of all InDetCandidate tags MuidCo, MuGirl from all muon reconstruction streams.
SG::ReadHandleKeyArray< Trk::SegmentCollectionm_inputSegContainerName
 Optionally segments from containers that are not associated with any segment candidate are dumped into a seperate container.
SG::WriteHandleKey< Trk::SegmentCollectionm_segTrkContainerName
 Name of the bulk segment output container.
SG::WriteHandleKey< MuonCombined::MuonTagToSegMapm_assocMapKey {this, "AssocMapKey", "MuonTagSegMap"}
SG::WriteHandleKey< Trk::SegmentCollectionm_unassocTrkContainerName {this, "UnassociatedSegmentKey", "UnAssocMuonTrkSegments"}
 Name of the unassociated segment container name.
ToolHandle< Trk::ITrackAmbiguityProcessorToolm_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 ( const std::string & name,
ISvcLocator * pSvcLocator )

Definition at line 20 of file MuonSegContainerMergerAlg.cxx.

20 :
21 AthReentrantAlgorithm(name, pSvcLocator) {}

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

64{
65 return 0;
66}

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

158 {
160 hndl.value(),
161 hndl.documentation());
162
163 }
Gaudi::Details::PropertyBase & declareProperty(Gaudi::Property< T, V, H > &t)

◆ declareProperty()

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

Definition at line 145 of file AthCommonDataStore.h.

145 {
146 typedef typename SG::HandleClassifier<T>::type htype;
148 }
Gaudi::Details::PropertyBase & declareGaudiProperty(Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
specialization for handling Gaudi::Property<SG::VarHandleKey>

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

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

◆ 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 47 of file MuonSegContainerMergerAlg.cxx.

47 {
49 std::unique_ptr<MuonCombined::MuonTagToSegMap> persistency_link = std::make_unique<MuonCombined::MuonTagToSegMap>();
50 std::unique_ptr<Trk::SegmentCollection> out_container = std::make_unique<Trk::SegmentCollection>();
51
53 for (SG::ReadHandle<MuonCandidateCollection>& candidate_coll : m_muonCandidateKeys.makeHandles(ctx)) {
54 if (!candidate_coll.isValid()) {
55 ATH_MSG_FATAL("Failed to retrieve Muon segment candidates " << candidate_coll.fullKey());
56 return StatusCode::FAILURE;
57 } else {
58 ATH_MSG_VERBOSE("Retrieved "<<candidate_coll.fullKey()<< " with size "<<candidate_coll->size());
59 }
60 for (const MuonCombined::MuonCandidate* ms_cand : *candidate_coll) {
61 const std::vector<const Muon::MuonSegment*>& assoc_segs = ms_cand->getSegments();
62 if (assoc_segs.empty()) { ATH_MSG_WARNING("Muon candidate " << ms_cand->toString() << " does not have associated segments."); }
63 for (const Muon::MuonSegment* seg : assoc_segs) { persistency_link->persistify(seg, out_container.get()); }
64 }
65 }
67 std::vector<const MuonCombined::TagBase*> good_tags{};
68 for (SG::ReadHandle<MuonCombined::InDetCandidateToTagMap>& tag_map : m_tagMaps.makeHandles(ctx)) {
69 if (!tag_map.isValid()) {
70 ATH_MSG_FATAL("Failed to retrieve combined tag map "<<tag_map.fullKey());
71 return StatusCode::FAILURE;
72 } else {
73 ATH_MSG_VERBOSE("Retrieved "<<tag_map.fullKey()<< " with size "<<tag_map->size());
74 }
75 good_tags.reserve(tag_map->size() + good_tags.size());
76 for (const auto& tag_pair : *tag_map) {
77 good_tags.push_back(tag_pair.second.get());
78 }
79 }
80 std::stable_sort(good_tags.begin(),good_tags.end(),[](const MuonCombined::TagBase* a, const MuonCombined::TagBase* b){
81 if (a->isCommissioning() != b->isCommissioning()) return b->isCommissioning();
83 const int auth_a = MuonCombined::authorRank(a->author());
84 const int auth_b = MuonCombined::authorRank(b->author());
85 if (auth_a != auth_b) return auth_a < auth_b;
86 const Trk::Track* prim_a = a->primaryTrack();
87 const Trk::Track* prim_b = b->primaryTrack();
89 if (prim_a && prim_b) {
90 const Trk::Perigee* per_a = prim_a->perigeeParameters();
91 const Trk::Perigee* per_b = prim_b->perigeeParameters();
92 return per_a->pT() > per_b->pT();
93 }
95 if (prim_a || prim_b) return prim_a != nullptr;
96 std::vector<const Muon::MuonSegment*> seg_a = a->associatedSegments();
97 std::vector<const Muon::MuonSegment*> seg_b = b->associatedSegments();
98 const size_t n_segs_a = seg_a.size();
99 const size_t n_segs_b = seg_b.size();
100 if (n_segs_a != n_segs_b) return n_segs_a > n_segs_b;
101 if (!n_segs_a) return false;
102 return chi2(seg_a[0]) < chi2(seg_b[0]);
103 });
104
105 for (const MuonCombined::TagBase* cmb_tag : good_tags) {
106 std::vector<const Muon::MuonSegment*> assoc_segs = cmb_tag->associatedSegments();
107 if (assoc_segs.empty() && cmb_tag->type() != xAOD::Muon::CaloTagged) {
108 ATH_MSG_WARNING("Combined candidate " << cmb_tag->toString() << " does not have associated segments");
109 }
110 for (const Muon::MuonSegment* seg : assoc_segs) {
111 persistency_link->persistify(seg, out_container.get());
112 }
113 }
114
116 std::set<const Trk::Segment*> assoc_segs = persistency_link->getPersistifiedSegments();
118 SG::WriteHandle<Trk::SegmentCollection> usedSegWriteHandle{m_segTrkContainerName, ctx};
119 ATH_CHECK(usedSegWriteHandle.record(std::move(out_container)));
120 SG::WriteHandle<MuonCombined::MuonTagToSegMap> assocMapWriteHandle{m_assocMapKey, ctx};
121 ATH_CHECK(assocMapWriteHandle.record(std::move(persistency_link)));
123 if (!m_saveUnassocSegs) return StatusCode::SUCCESS;
124
125 std::vector<const Trk::Segment*> to_copy{};
126
128 for (SG::ReadHandle<Trk::SegmentCollection>& inputSegColl : m_inputSegContainerName.makeHandles(ctx)) {
129 if (!inputSegColl.isValid()) {
130 ATH_MSG_FATAL("Failed to retrieve segment collection " << inputSegColl.fullKey());
131 return StatusCode::FAILURE;
132 }
133 for (const Trk::Segment* seg : *inputSegColl) {
135 if (assoc_segs.count(seg)) continue;
136 to_copy.emplace_back(seg);
137 }
138 }
140 if (m_solveAmbi && to_copy.size() > 1) {
141 std::map<const Trk::Track*, const Trk::Segment*> track_seg_map{};
142 TrackCollection ambi_tracks{};
144 for (const Trk::Segment* seg : to_copy) {
145 auto tsos = std::make_unique<Trk::TrackStates>();
146 Trk::TrackInfo dummy_info{};
147 for (const Trk::MeasurementBase* meas : seg->containedMeasurements()) {
148 tsos->push_back(Muon::MuonTSOSHelper::createMeasTSOS(meas->uniqueClone(), nullptr, Trk::TrackStateOnSurface::Measurement));
149 }
150 std::unique_ptr<Trk::Track> trk =
151 std::make_unique<Trk::Track>(dummy_info, std::move(tsos), seg->fitQuality() ? seg->fitQuality()->uniqueClone() : nullptr);
152 track_seg_map[trk.get()] = seg;
153 ambi_tracks.push_back(std::move(trk));
154 }
155 std::unique_ptr<const TrackCollection> resolved_trks{m_ambiguityProcessor->process(&ambi_tracks)};
156 std::vector<const Trk::Segment*> resolved_copies{};
157 for (const Trk::Track* res : *resolved_trks) {
158 const Trk::Segment* seg = track_seg_map[res];
160 if (!seg) continue;
161 resolved_copies.emplace_back(seg);
162 }
163 ATH_MSG_DEBUG("Number of segments before the ambiguity solving " << to_copy.size() << " vs. after solving "
164 << resolved_copies.size());
165 to_copy = std::move(resolved_copies);
166 }
167
168 out_container = std::make_unique<Trk::SegmentCollection>();
169 for (const Trk::Segment* seg : to_copy) {
171 const Muon::MuonSegment* muon_seg = dynamic_cast<const Muon::MuonSegment*>(seg);
172 if (!muon_seg) continue;
173 std::unique_ptr<Muon::MuonSegment> copy = std::make_unique<Muon::MuonSegment>(*muon_seg);
174 out_container->push_back(std::move(copy));
175 }
176 SG::WriteHandle<Trk::SegmentCollection> unUsedSegWriteHandle{m_unassocTrkContainerName, ctx};
177 ATH_CHECK(unUsedSegWriteHandle.record(std::move(out_container)));
178 return StatusCode::SUCCESS;
179}
#define ATH_CHECK
Evaluate an expression and check for errors.
#define ATH_MSG_FATAL(x)
#define ATH_MSG_VERBOSE(x)
#define ATH_MSG_WARNING(x)
#define ATH_MSG_DEBUG(x)
std::pair< std::vector< unsigned int >, bool > res
static Double_t a
if(febId1==febId2)
DataVector< Trk::Track > TrackCollection
This typedef represents a collection of Trk::Track objects.
value_type push_back(value_type pElem)
Add an element to the end of the collection.
SG::ReadHandleKeyArray< Trk::SegmentCollection > m_inputSegContainerName
Optionally segments from containers that are not associated with any segment candidate are dumped int...
Gaudi::Property< bool > m_solveAmbi
SG::WriteHandleKey< MuonCombined::MuonTagToSegMap > m_assocMapKey
Gaudi::Property< bool > m_saveUnassocSegs
SG::WriteHandleKey< Trk::SegmentCollection > m_segTrkContainerName
Name of the bulk segment output container.
ToolHandle< Trk::ITrackAmbiguityProcessorTool > m_ambiguityProcessor
SG::ReadHandleKeyArray< MuonCombined::InDetCandidateToTagMap > m_tagMaps
List of all InDetCandidate tags MuidCo, MuGirl from all muon reconstruction streams.
SG::WriteHandleKey< Trk::SegmentCollection > m_unassocTrkContainerName
Name of the unassociated segment container name.
SG::ReadHandleKeyArray< MuonCandidateCollection > m_muonCandidateKeys
Name of all MuonCandidate tags (Main / LRT / EMEO)
static std::unique_ptr< Trk::TrackStateOnSurface > createMeasTSOS(std::unique_ptr< Trk::MeasurementBase > meas, std::unique_ptr< Trk::TrackParameters > pars, Trk::TrackStateOnSurface::TrackStateOnSurfaceType type)
create a TSOS with a measurement, takes ownership of the pointers
StatusCode record(std::unique_ptr< T > data)
Record a const object to the store.
@ Measurement
This is a measurement, and will at least contain a Trk::MeasurementBase.
double chi2(TH1 *h0, TH1 *h1)
bool copy
Definition calibdata.py:26
void stable_sort(DataModel_detail::iterator< DVL > beg, DataModel_detail::iterator< DVL > end)
Specialization of stable_sort for DataVector/List.

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

90{
91 // If we didn't find any symlinks to add, just return the collection
92 // from the base class. Otherwise, return the extended collection.
93 if (!m_extendedExtraObjects.empty()) {
95 }
97}
An algorithm that can be simultaneously executed in multiple threads.

◆ filterPassed()

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

Definition at line 96 of file AthCommonReentrantAlgorithm.h.

96 {
97 return execState( ctx ).filterPassed();
98 }
virtual bool filterPassed(const EventContext &ctx) const

◆ initialize()

StatusCode MuonSegContainerMergerAlg::initialize ( )
overridevirtual

Initialize the data dependencies

Definition at line 23 of file MuonSegContainerMergerAlg.cxx.

23 {
25 ATH_CHECK(m_muonCandidateKeys.initialize());
26 ATH_CHECK(m_tagMaps.initialize());
27 if ( !(m_tagMaps.size() + m_muonCandidateKeys.size() ) ){
28 ATH_MSG_FATAL("No candidates were given to read the segments from");
29 return StatusCode::FAILURE;
30 }
31 ATH_MSG_INFO("Use the following Muon tags to dump the segments");
32 for (const SG::ReadHandleKey<MuonCandidateCollection>& key : m_muonCandidateKeys){
33 ATH_MSG_INFO(" *** "<<key.fullKey());
34 }
35 ATH_MSG_INFO("Use the following combined tags to dump the segments");
36 for (SG::ReadHandleKey<MuonCombined::InDetCandidateToTagMap>& key : m_tagMaps){
37 ATH_MSG_INFO(" --- "<<key.fullKey());
38 }
39 ATH_CHECK(m_segTrkContainerName.initialize());
40 ATH_CHECK(m_assocMapKey.initialize());
44
45 return StatusCode::SUCCESS;
46}
#define ATH_MSG_INFO(x)

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

◆ msg()

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

Definition at line 24 of file AthCommonMsg.h.

24 {
25 return this->msgStream();
26 }

◆ msgLvl()

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

Definition at line 30 of file AthCommonMsg.h.

30 {
31 return this->msgLevel(lvl);
32 }

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

381 {
382 h.renounce();
384 }
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)

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

364 {
366 }

◆ setFilterPassed()

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

Definition at line 100 of file AthCommonReentrantAlgorithm.h.

100 {
102 }
virtual void setFilterPassed(bool state, const EventContext &ctx) const

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

77{
78 return BaseAlg::sysExecute (ctx);
79}

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

107 {
109
110 if (sc.isFailure()) {
111 return sc;
112 }
113
114 ServiceHandle<ICondSvc> cs("CondSvc",name());
115 for (auto h : outputHandles()) {
116 if (h->isCondition() && h->mode() == Gaudi::DataHandle::Writer) {
117 // do this inside the loop so we don't create the CondSvc until needed
118 if ( cs.retrieve().isFailure() ) {
119 ATH_MSG_WARNING("no CondSvc found: won't autoreg WriteCondHandles");
120 return StatusCode::SUCCESS;
121 }
122 if (cs->regHandle(this,*h).isFailure()) {
124 ATH_MSG_ERROR("unable to register WriteCondHandle " << h->fullKey()
125 << " with CondSvc");
126 }
127 }
128 }
129 return sc;
130}
#define ATH_MSG_ERROR(x)
virtual std::vector< Gaudi::DataHandle * > outputHandles() const override

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

308 {
309 // debug() << "updateVHKA for property " << p.name() << " " << p.toString()
310 // << " size: " << m_vhka.size() << endmsg;
311 for (auto &a : m_vhka) {
313 for (auto k : keys) {
314 k->setOwner(this);
315 }
316 }
317 }

Member Data Documentation

◆ m_ambiguityProcessor

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

Definition at line 52 of file MuonSegContainerMergerAlg.h.

52{this, "AmbiguityProcessor", ""};

◆ m_assocMapKey

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

Definition at line 47 of file MuonSegContainerMergerAlg.h.

47{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.

41 {
42 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.

34{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.

54 {this, "saveUnusedSegments", true,
55 "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.

45 {this, "TrackSegmentContainerName", "TrkMuonSegments",
46 "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.

56{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.

36 {
37 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.

50{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: