ATLAS Offline Software
Loading...
Searching...
No Matches
Trk::FsmwMode1dFinder Class Referencefinal

Algotool which calculates the mode of a unidimenensional distribution using the Fraction of Sample Mode with Weights algorithm, which is an iterative Least Median estimator. More...

#include <FsmwMode1dFinder.h>

Inheritance diagram for Trk::FsmwMode1dFinder:
Collaboration diagram for Trk::FsmwMode1dFinder:

Classes

struct  CompareTheTwoDoubleAndWeights
struct  CompareTheTwoDoubles

Public Member Functions

 FsmwMode1dFinder (const std::string &t, const std::string &n, const IInterface *p)
virtual ~FsmwMode1dFinder ()
virtual double getMode (std::vector< DoubleAndWeight >) const override final
virtual double getMode (std::vector< double >) const override final
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 sysInitialize () override
 Perform system initialization for an algorithm.
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

Static Public Member Functions

static const InterfaceID & interfaceID ()
 AlgTool interface methods.

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

double m_fraction
double m_firstfraction
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

Algotool which calculates the mode of a unidimenensional distribution using the Fraction of Sample Mode with Weights algorithm, which is an iterative Least Median estimator.

It's like an iterative "Half Sample Mode", but the fraction you take at each step can be configured by the user (in the job option file).

Configuration possibilities: (1) fraction (default is 50 %)

Details on this and other kinds of mode finders can be found in Waltenberger's PhD thesis, done collaborating with CMS.

Author
Giaci.nosp@m.nto..nosp@m.Piacq.nosp@m.uadi.nosp@m.o@phy.nosp@m.sik..nosp@m.uni-f.nosp@m.reib.nosp@m.urg.d.nosp@m.e

Definition at line 37 of file FsmwMode1dFinder.h.

Member Typedef Documentation

◆ StoreGateSvc_t

typedef ServiceHandle<StoreGateSvc> AthCommonDataStore< AthCommonMsg< AlgTool > >::StoreGateSvc_t
privateinherited

Definition at line 388 of file AthCommonDataStore.h.

Constructor & Destructor Documentation

◆ FsmwMode1dFinder()

Trk::FsmwMode1dFinder::FsmwMode1dFinder ( const std::string & t,
const std::string & n,
const IInterface * p )

Definition at line 19 of file FsmwMode1dFinder.cxx.

19 :
20 AthAlgTool(t,n,p),
21 m_fraction(0.5),
23 {
24 declareProperty("Fraction", m_fraction);
25 declareProperty("FirstFraction", m_firstfraction);
26 declareInterface<IMode1dFinder>(this);
27 }
AthAlgTool()
Default constructor:
Gaudi::Details::PropertyBase & declareProperty(Gaudi::Property< T, V, H > &t)

◆ ~FsmwMode1dFinder()

Trk::FsmwMode1dFinder::~FsmwMode1dFinder ( )
virtualdefault

Member Function Documentation

◆ declareGaudiProperty()

Gaudi::Details::PropertyBase & AthCommonDataStore< AthCommonMsg< AlgTool > >::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 }

◆ declareProperty()

Gaudi::Details::PropertyBase & AthCommonDataStore< AthCommonMsg< AlgTool > >::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< AlgTool > >::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< AlgTool > >::evtStore ( )
inlineinherited

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

Definition at line 85 of file AthCommonDataStore.h.

◆ extraDeps_update_handler()

void AthCommonDataStore< AthCommonMsg< AlgTool > >::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

◆ getMode() [1/2]

double Trk::FsmwMode1dFinder::getMode ( std::vector< double > Doubles) const
finaloverridevirtual

Implements Trk::IMode1dFinder.

Definition at line 175 of file FsmwMode1dFinder.cxx.

175 {
176
177
178
179#ifdef FSMWMODE1DFINDER_DEBUG
180 msg(MSG::DEBUG) << "entered FsmwMode1dFinder::GetMode " << endmsg;
181#endif
182
183 //first of all order the vector according to the double value
184 std::sort(Doubles.begin(),Doubles.end(),CompareTheTwoDoubles() );
185
186 //ok now begin to consider a certain number of elements according to the fraction
187 std::vector<double>::const_iterator begin=Doubles.begin();
188 std::vector<double>::const_iterator end=Doubles.end();
189
190 // double overallweight(0.);
191 std::vector<double>::const_iterator best_begin=begin;
192 std::vector<double>::const_iterator best_end=end;
193
194#ifdef FSMWMODE1DFINDER_DEBUG
195 msg(MSG::DEBUG) << "Size of incoming vector is" << Doubles.size() << endmsg;
196#endif
197
198
199 double last_value(1e100);
200
201 bool isthelast=false;
202 while (!isthelast) {
203#ifdef FSMWMODE1DFINDER_DEBUG
204 if(msgLvl(MSG::VERBOSE)) msg(MSG::VERBOSE) << "Before \"int step = (int)std::floor(m_fraction*(end-begin+1))\" " << endmsg;
205#endif
206 int step = (int)std::floor(m_fraction*(end-begin+1));
207#ifdef FSMWMODE1DFINDER_DEBUG
208 if(msgLvl(MSG::VERBOSE)) msg(MSG::VERBOSE) << "After \"int step = (int)std::floor(m_fraction*(end-begin+1))\" " << endmsg;
209#endif
210 for (std::vector<double>::const_iterator i=begin;i!=(end-step+1);++i) {
211#ifdef FSMWMODE1DFINDER_DEBUG
212 if(msgLvl(MSG::VERBOSE)) msg(MSG::VERBOSE) << "Interval number unknown, value: " << i->first << endmsg;
213#endif
214 //calculate the weight the interval should be divided into
215 // overallweight=0.;
216 //for (std::vector<double>::const_iterator j=i;j!=i+step;j++) {
217 //#ifdef FSMWMODE1DFINDER_DEBUG
218 //if(msgLvl(MSG::VERBOSE)) msg(MSG::VERBOSE) << "In the single interval, the component number unknown, value: " << j->first << " weight "
219 //<< j->second << endmsg;
220 //#endif
221 //overallweight+=j->second;
222 //}
223 if ((*(i+step-1)-*i)<last_value) {
224#ifdef FSMWMODE1DFINDER_DEBUG
225 msg(MSG::DEBUG) << "New value: " << *(i+step-1)-*i << " while the previous one was " <<
226 last_value << endmsg;
227 if(msgLvl(MSG::VERBOSE)) msg(MSG::VERBOSE) << "Best case since ever now" << endmsg;
228#endif
229 last_value=*(i+step-1)-*i;
230 best_begin=i;
231 best_end=i+step-1;
232 }
233 }
234
235#ifdef FSMWMODE1DFINDER_DEBUG
236 if(msgLvl(MSG::DEBUG)) msg(MSG::DEBUG) << "Ended a cycle with success" << endmsg;
237#endif
238
239 //assign the new begin and end...
240 begin=best_begin;
241 end=best_end;
242 last_value=1e100;
243
244 //Now it should have returned the value with smallest (x2-x1)/weight
245 if (best_end-best_begin<=2) isthelast=true;
246 }
247
248 if (best_end-best_begin==2)
249 {
250 std::vector<double>::const_iterator medium=begin;
251 ++medium;
252 return (*begin+*medium+*end)/3.;
253 }
254
255 //return the weighted mean of the best_begin and best_end
256 return (*begin+*end)/2.;
257
258
259 }
#define endmsg
bool msgLvl(const MSG::Level lvl) const
MsgStream & msg() const
void sort(typename DataModel_detail::iterator< DVL > beg, typename DataModel_detail::iterator< DVL > end)
Specialization of sort for DataVector/List.

◆ getMode() [2/2]

double Trk::FsmwMode1dFinder::getMode ( std::vector< DoubleAndWeight > DoubleAndWeights) const
finaloverridevirtual

Implements Trk::IMode1dFinder.

Definition at line 38 of file FsmwMode1dFinder.cxx.

38 {
39
40 if(DoubleAndWeights.empty()) return 0.;
41 if(DoubleAndWeights.size() == 1) return DoubleAndWeights.begin()->first;
42
43#ifdef FSMWMODE1DFINDER_DEBUG
44 msg(MSG::DEBUG) << "entered FsmwMode1dFinder::GetMode " << endmsg;
45#endif
46
47 //first of all order the vector according to the double value
48 std::sort(DoubleAndWeights.begin(),DoubleAndWeights.end(),CompareTheTwoDoubleAndWeights() );
49
50 //ok now begin to consider a certain number of elements according to the fraction
51 std::vector<DoubleAndWeight>::const_iterator begin=DoubleAndWeights.begin();
52 std::vector<DoubleAndWeight>::const_iterator end=DoubleAndWeights.end();
53
54 double overallweight(0.);
55 std::vector<DoubleAndWeight>::const_iterator best_begin=begin;
56 std::vector<DoubleAndWeight>::const_iterator best_end=end;
57
58#ifdef FSMWMODE1DFINDER_DEBUG
59 msg(MSG::DEBUG) << "Size of incoming vector is" << DoubleAndWeights.size() << endmsg;
60#endif
61
62
63 double last_value(1e100);
64
65 bool isthelast=false;
66
67 int counter=0;
68 double fraction=m_firstfraction;
69 while (!isthelast) {
70
71 counter+=1;
72 if (counter==2) {
73 fraction = m_fraction;
74 }
75
76#ifdef FSMWMODE1DFINDER_DEBUG
77 if(msgLvl(MSG::VERBOSE)) msg(MSG::VERBOSE) << "Before \"int step = (int)std::floor(fraction*(end-begin+1))\" " << endmsg;
78#endif
79 int step = (int)std::floor(fraction*(end-begin+1));
80 overallweight=0.;
81 {
82 std::vector<DoubleAndWeight>::const_iterator i=begin;
83 if (step>0) {
84 std::vector<DoubleAndWeight>::const_iterator j_end=i+step-1;
85 for (std::vector<DoubleAndWeight>::const_iterator j=i;j!=j_end;++j) {
86#ifdef FSMWMODE1DFINDER_DEBUG
87 if(msgLvl(MSG::VERBOSE)) msg(MSG::VERBOSE) << "In the single interval, the component number unknown, value: " << j->first << " weight "
88 << j->second << endmsg;
89#endif
90 overallweight+=j->second;
91 }
92 }
93 }
94
95 std::vector<DoubleAndWeight>::const_iterator i_last = begin+step-1;
96
97#ifdef FSMWMODE1DFINDER_DEBUG
98 if(msgLvl(MSG::VERBOSE)) msg(MSG::VERBOSE) << "After \"int step = (int)std::floor(fraction*(end-begin+1))\" " << endmsg;
99#endif
100 for (std::vector<DoubleAndWeight>::const_iterator i=begin;i!=(end-step+1);++i, ++i_last) {
101#ifdef FSMWMODE1DFINDER_DEBUG
102 if(msgLvl(MSG::VERBOSE)) msg(MSG::VERBOSE) << "Interval number unknown, value: " << i->first << endmsg;
103#endif
104
105 //calculate the weight the interval should be divided into
106 overallweight+= i_last->second;
107
108 #ifdef FSMWMODE1DFINDER_DEBUG
109 if (debug_counter>0)
110 {
111 --debug_counter;
112 double alt_overallweight=0.;
113 for (std::vector<DoubleAndWeight>::const_iterator j=i;j!=i+step;j++) {
114#ifdef FSMWMODE1DFINDER_DEBUG
115 if(msgLvl(MSG::VERBOSE)) msg(MSG::VERBOSE) << "In the single interval, the component number unknown, value: " << j->first << " weight "
116 << j->second << endmsg;
117#endif
118 alt_overallweight+=j->second;
119 }
120 if (std::abs(alt_overallweight - overallweight) > alt_overallweight * std::numeric_limits<double>::epsilon() * 16 ) {
121 ATH_MSG_ERROR("Weights differ: " << alt_overallweight << " != " << overallweight);
122 }
123 }
124 #endif
125
126
127 double new_value = ((i+step-1)->first-i->first)/overallweight;
128 if (new_value<last_value) {
129#ifdef FSMWMODE1DFINDER_DEBUG
130 msg(MSG::DEBUG) << "New value: " << ((i+step-1)->first-i->first)/overallweight << " while the previous one was " <<
131 last_value << endmsg;
132 if(msgLvl(MSG::VERBOSE)) msg(MSG::VERBOSE) << "Best case since ever now" << endmsg;
133#endif
134 last_value=((i+step-1)->first-i->first)/overallweight;
135 best_begin=i;
136 best_end=i+step-1;
137 }
138 overallweight-= i->second;
139
140 }
141
142#ifdef FSMWMODE1DFINDER_DEBUG
143 msg(MSG::DEBUG) << "Ended a cycle with success" << endmsg;
144 if (begin==best_begin && end ==best_end) {
145 ATH_MSG_ERROR( "No change at step=" << step );
146 }
147#endif
148 //assign the new begin and end...
149 begin=best_begin;
150 end=best_end;
151 last_value=1e100;
152
153 //Now it should have returned the value with smallest (x2-x1)/weight
154 if (best_end-best_begin<=2) isthelast=true;
155 }
156
157 //return the weighted mean of the best_begin and best_end
158
159 //you are working only on first and last
160 //(but what about taking all three ???)
161
162 if (best_end-best_begin==2)
163 {
164 std::vector<DoubleAndWeight>::const_iterator medium=begin;
165 ++medium;
166 return (begin->first*begin->second+medium->first*medium->second+end->first*end->second)/(begin->second+medium->second+end->second);
167 }
168
169
170 return (begin->first*begin->second+end->first*end->second)/(begin->second+end->second);
171
172 }
#define ATH_MSG_ERROR(x)

◆ inputHandles()

virtual std::vector< Gaudi::DataHandle * > AthCommonDataStore< AthCommonMsg< AlgTool > >::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.

◆ interfaceID()

const InterfaceID & Trk::IMode1dFinder::interfaceID ( )
inlinestaticinherited

AlgTool interface methods.

Definition at line 40 of file IMode1dFinder.h.

40{ return IID_IMODE1DFINDER; };
static const InterfaceID IID_IMODE1DFINDER("IMode1dFinder", 1, 0)

◆ msg()

MsgStream & AthCommonMsg< AlgTool >::msg ( ) const
inlineinherited

Definition at line 24 of file AthCommonMsg.h.

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

◆ msgLvl()

bool AthCommonMsg< AlgTool >::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< AlgTool > >::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< AlgTool > >::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< AlgTool > >::renounceArray ( SG::VarHandleKeyArray & handlesArray)
inlineprotectedinherited

remove all handles from I/O resolution

Definition at line 364 of file AthCommonDataStore.h.

364 {
366 }

◆ sysInitialize()

virtual StatusCode AthCommonDataStore< AthCommonMsg< AlgTool > >::sysInitialize ( )
overridevirtualinherited

Perform system initialization for an algorithm.

We override this to declare all the elements of handle key arrays at the end of initialization. See comments on updateVHKA.

Reimplemented in asg::AsgMetadataTool, AthCheckedComponent< AthAlgTool >, AthCheckedComponent<::AthAlgTool >, and DerivationFramework::CfAthAlgTool.

◆ sysStart()

virtual StatusCode AthCommonDataStore< AthCommonMsg< AlgTool > >::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< AlgTool > >::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 }
std::vector< SG::VarHandleKeyArray * > m_vhka

Member Data Documentation

◆ m_detStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< AlgTool > >::m_detStore
privateinherited

Pointer to StoreGate (detector store by default)

Definition at line 393 of file AthCommonDataStore.h.

◆ m_evtStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< AlgTool > >::m_evtStore
privateinherited

Pointer to StoreGate (event store by default)

Definition at line 390 of file AthCommonDataStore.h.

◆ m_firstfraction

double Trk::FsmwMode1dFinder::m_firstfraction
private

Definition at line 71 of file FsmwMode1dFinder.h.

◆ m_fraction

double Trk::FsmwMode1dFinder::m_fraction
private

Definition at line 70 of file FsmwMode1dFinder.h.

◆ m_varHandleArraysDeclared

bool AthCommonDataStore< AthCommonMsg< AlgTool > >::m_varHandleArraysDeclared
privateinherited

Definition at line 399 of file AthCommonDataStore.h.

◆ m_vhka

std::vector<SG::VarHandleKeyArray*> AthCommonDataStore< AthCommonMsg< AlgTool > >::m_vhka
privateinherited

Definition at line 398 of file AthCommonDataStore.h.


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