#include <ChosenChargeList.h>
Inheritance diagram for dchain::ChosenChargeList< Charged, CandidateClass >:
|
Reimplemented from dchain::ConjugateList< CandidateClass >. |
|
Reimplemented from dchain::ConjugateList< CandidateClass >. |
|
Reimplemented from dchain::ConjugateList< CandidateClass >. |
|
Reimplemented from dchain::ConjugateList< CandidateClass >. |
|
Reimplemented from dchain::ConjugateList< CandidateClass >. |
|
Reimplemented from dchain::ConjugateList< CandidateClass >. |
|
|
|
00110 { 00111 }
|
|
00102 : 00103 ConjugateList< CandidateClass >( aLabel ) , 00104 m_list( &aLabeledDecayList ) 00105 { 00106 }
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Reimplemented in dchain::CombinatoricList< CandidateClass >, and dchain::CombinatoricList< CandidateClass >. |
|
Reimplemented in dchain::CombinatoricList< CandidateClass >, and dchain::CombinatoricList< CandidateClass >. |
|
Reimplemented in dchain::CombinatoricList< CandidateClass >, and dchain::CombinatoricList< CandidateClass >. 00152 { 00153 // do this casting to make sure const 'begin' function is called 00154 return ( static_cast<const dchain::LabeledCandidateList< CandidateClass >*>(&labeledCandidateList())->begin() ); 00155 }
|
|
Reimplemented in dchain::CombinatoricList< CandidateClass >, and dchain::CombinatoricList< CandidateClass >. 00116 { 00117 return ( labeledCandidateList().begin() ) ; 00118 }
|
|
|
|
00153 { 00154 return ( this->labeledCandidateList().begin( otherLabel( m_label ) ) ) ; 00155 }
|
|
|
|
00159 { 00160 return ( this->labeledCandidateList().end( otherLabel( m_label ) ) ) ; 00161 }
|
|
TAnalyzer takes two arguments 1) const CandidateClass& 2) a bool which is 'true' if the candiate matches the present conjugation Reimplemented from dchain::ConjugateList< CandidateClass >. 00090 { 00091 const_iterator finished ( particle_end() ) ; 00092 for ( const_iterator entry ( particle_begin() ) ; 00093 entry != finished ; 00094 ++entry ) { 00095 analyze( (*entry)() , (*entry).label() == this->label() ) ; 00096 } 00097 }
|
|
TAnalyzer takes two arguments 1) const CandidateClass& 2) a bool which is 'true' if the candiate matches the present conjugation Reimplemented from dchain::ConjugateList< CandidateClass >. 00090 { 00091 const_iterator finished ( particle_end() ) ; 00092 for ( const_iterator entry ( particle_begin() ) ; 00093 entry != finished ; 00094 ++entry ) { 00095 analyze( (*entry)() , (*entry).label() == this->label() ) ; 00096 } 00097 }
|
|
|
|
00136 { 00137 return ( labeledCandidateList().empty() ) ; 00138 }
|
|
Reimplemented in dchain::CombinatoricList< CandidateClass >, and dchain::CombinatoricList< CandidateClass >. |
|
Reimplemented in dchain::CombinatoricList< CandidateClass >, and dchain::CombinatoricList< CandidateClass >. |
|
Reimplemented in dchain::CombinatoricList< CandidateClass >, and dchain::CombinatoricList< CandidateClass >. 00161 { 00162 // do this casting to make sure const 'end' function is called 00163 return ( static_cast<const dchain::LabeledCandidateList< CandidateClass >*>(&labeledCandidateList())->end() ); 00164 }
|
|
Reimplemented in dchain::CombinatoricList< CandidateClass >, and dchain::CombinatoricList< CandidateClass >. 00124 { 00125 return ( labeledCandidateList().end() ) ; 00126 }
|
|
|
|
00128 { 00129 return ( ( &(this->labeledCandidateList()) == &(aList.labeledCandidateList()) ) && 00130 ( label() == otherLabel( aList.label() ) ) ) ; 00131 }
|
|
Reimplemented in dchain::CombinatoricList< CandidateClass >, and dchain::CombinatoricList< CandidateClass >. |
|
Reimplemented in dchain::CombinatoricList< CandidateClass >, and dchain::CombinatoricList< CandidateClass >. 00122 {
00123 return ( conjugation::kNone == m_label ) ;
00124 }
|
|
Reimplemented from dchain::CandidateList< CandidateClass >. 00080 { 00081 const_iterator finished ( particle_end() ) ; 00082 for ( const_iterator entry ( particle_begin() ) ; 00083 entry != finished ; 00084 ++entry ) { 00085 analyze( (*entry)() ) ; 00086 } 00087 }
|
|
Reimplemented from dchain::CandidateList< CandidateClass >. 00080 { 00081 const_iterator finished ( particle_end() ) ; 00082 for ( const_iterator entry ( particle_begin() ) ; 00083 entry != finished ; 00084 ++entry ) { 00085 analyze( (*entry)() ) ; 00086 } 00087 }
|
|
Reimplemented in dchain::CombinatoricList< CandidateClass >, and dchain::CombinatoricList< CandidateClass >. |
|
Reimplemented in dchain::CombinatoricList< CandidateClass >, and dchain::CombinatoricList< CandidateClass >. 00166 {
00167 return ( m_label ) ;
00168 }
|
|
Implements dchain::CandidateList< CandidateClass >. |
|
Implements dchain::CandidateList< CandidateClass >. |
|
Implements dchain::CandidateList< CandidateClass >. 00175 {
00176 return ( *m_list ) ;
00177 }
|
|
Implements dchain::CandidateList< CandidateClass >. 00138 {
00139 return ( *m_list ) ;
00140 }
|
|
|
|
|
|
Reimplemented in dchain::CombinatoricList< CandidateClass >, and dchain::CombinatoricList< CandidateClass >. |
|
Reimplemented in dchain::CombinatoricList< CandidateClass >, and dchain::CombinatoricList< CandidateClass >. 00141 { 00142 return ( this->labeledCandidateList().begin( m_label ) ) ; 00143 }
|
|
Reimplemented in dchain::CombinatoricList< CandidateClass >, and dchain::CombinatoricList< CandidateClass >. |
|
Reimplemented in dchain::CombinatoricList< CandidateClass >, and dchain::CombinatoricList< CandidateClass >. 00147 { 00148 return ( this->labeledCandidateList().end( m_label ) ) ; 00149 }
|
|
Reimplemented from dchain::ConjugateList< CandidateClass >. 00100 { 00101 const_partial_iterator finished ( partial_particle_end() ) ; 00102 for ( const_partial_iterator entry ( partial_particle_begin() ) ; 00103 entry != finished ; 00104 ++entry ) { 00105 analyze( (*entry)() ) ; 00106 } 00107 }
|
|
Reimplemented from dchain::ConjugateList< CandidateClass >. 00100 { 00101 const_partial_iterator finished ( partial_particle_end() ) ; 00102 for ( const_partial_iterator entry ( partial_particle_begin() ) ; 00103 entry != finished ; 00104 ++entry ) { 00105 analyze( (*entry)() ) ; 00106 } 00107 }
|
|
|
|
00161 { 00162 // Need to cast to 'const' to get the right function call 00163 return ( (*(const dchain::LabeledParticleList< Charged , CandidateClass >*)(m_list.pointer())).begin( this->label() ) ) ; 00164 }
|
|
|
|
00168 { 00169 // Need to cast to 'const' to get the right function call 00170 return ( (*(const dchain::LabeledParticleList< Charged , CandidateClass >*)(m_list.pointer())).end( this->label() ) ) ; 00171 }
|
|
|
|
00135 { 00136 return ( this->labeledCandidateList().size( m_label ) ) ; 00137 }
|
|
|
|
|
|
00147 { 00148 // Need to cast to 'const' to get the right function call 00149 return ( (*(const dchain::LabeledParticleList< Charged , CandidateClass >*)(m_list.pointer())).begin() ) ; 00150 }
|
|
00126 { 00127 return ( m_list->begin() ) ; 00128 }
|
|
|
|
|
|
00154 { 00155 // Need to cast to 'const' to get the right function call 00156 return ( (*(const dchain::LabeledParticleList< Charged , CandidateClass >*)(m_list.pointer())).end() ) ; 00157 }
|
|
00132 { 00133 return ( m_list->end() ) ; 00134 }
|
|
Reimplemented in FillableCDDecayList. |
|
Reimplemented in FillableCDDecayList. 00112 { 00113 m_label = aLabel ; 00114 }
|
|
|
|
00144 { 00145 return ( labeledCandidateList().size() ) ; 00146 }
|
|
|
|
|
|
|