dchain::FillDecayList< DecayClass, CandidateClass > Class Template Reference

List of all members.

Static Public Member Functions
static void	fill (CombinatoricLoop< CandidateClass > &iLoop, const typename _combinatoricloop_vector_::iterator &aBegin, const typename _combinatoricloop_vector_::iterator &aEnd, const conjugation::Label aLabel, dchain::LabeledParticleList< DecayClass, CandidateClass > &aDecayList)
static void	doIt (const typename _combinatoricloop_vector_::iterator &aBegin, const typename _combinatoricloop_vector_::iterator &aEnd, ChildList &iList, const conjugation::Label aLabel, dchain::LabeledParticleList< DecayClass, CandidateClass > &aDecayList)
Classes
class	ChildList

---

Detailed Description

template<class DecayClass, class CandidateClass>
class dchain::FillDecayList< DecayClass, CandidateClass >

Definition at line 135 of file CombinatoricList.cc.

---

Member Function Documentation

template<class DecayClass, class CandidateClass>

static void dchain::FillDecayList< DecayClass, CandidateClass >::doIt	(	const typename _combinatoricloop_vector_::iterator &	aBegin,
		const typename _combinatoricloop_vector_::iterator &	aEnd,
		ChildList &	iList,
		const conjugation::Label	aLabel,
		dchain::LabeledParticleList< DecayClass, CandidateClass > &	aDecayList
	)			[inline, static]

Definition at line 215 of file CombinatoricList.cc.

References dchain::FillDecayList< DecayClass, CandidateClass >::ChildList::makeDecay(), dchain::FillDecayList< DecayClass, CandidateClass >::ChildList::overlap(), dchain::FillDecayList< DecayClass, CandidateClass >::ChildList::pop_back(), dchain::FillDecayList< DecayClass, CandidateClass >::ChildList::push_back(), and dchain::LabeledParticleList< ParticleClass, CandidateClass >::push_back().

Referenced by dchain::FillDecayList< DecayClass, CandidateClass >::fill().

   {
      if ( aBegin == aEnd ) {
         //
         // if all ConjuagetLists have been used add Decay to the final list
         //
         DecayClass* ptr = iList.makeDecay();
         ReferenceHolder<DecayClass> pHolder(ptr);
         aDecayList.push_back(dchain::LabeledParticle< DecayClass >( 
                  ptr,
                  aLabel ) ) ;
      }
      else {
         //
         // make iterator for next ConjugateList loop
         //
         const typename _combinatoricloop_vector_::iterator newBegin( aBegin + 1 ) ;
         //
         // loop over each entry in the current ConjugateList
         //
         typename dchain::CandidateList< CandidateClass >::const_partial_iterator finished( (*(*aBegin)).partial_end() ) ;
         for ( typename dchain::CandidateList< CandidateClass >::const_partial_iterator entry( (*(*aBegin)).partial_begin() ) ;
               entry != finished ;
               ++entry ) {
            if ( !( iList.overlap( (*entry)() ) ) ) {
               //
               // If baseDecay does not overlap current element in the this ConjugateList,
               //   record the current element of this Loop
               //
               (*(*aBegin)).setCurrentIterator( entry ) ;
               //
               // build new baseDecay with old baseDecay plus the current element
               //
               iList.push_back( & (*entry).labeledClass() );
               //
               // do all successive ConjugateList loops
               //
               doIt( newBegin ,
                     aEnd ,
                     iList ,
                     aLabel ,
                     aDecayList ) ;

               iList.pop_back();

            }
         }
      }
   }

template<class DecayClass, class CandidateClass>

static void dchain::FillDecayList< DecayClass, CandidateClass >::fill	(	CombinatoricLoop< CandidateClass > &	iLoop,
		const typename _combinatoricloop_vector_::iterator &	aBegin,
		const typename _combinatoricloop_vector_::iterator &	aEnd,
		const conjugation::Label	aLabel,
		dchain::LabeledParticleList< DecayClass, CandidateClass > &	aDecayList
	)			[inline, static]

Definition at line 185 of file CombinatoricList.cc.

References dchain::FillDecayList< DecayClass, CandidateClass >::doIt(), dchain::FillDecayList< DecayClass, CandidateClass >::ChildList::eraseAll(), dchain::CombinatoricLoop< CandidateClass >::partial_begin(), dchain::CombinatoricLoop< CandidateClass >::partial_end(), dchain::FillDecayList< DecayClass, CandidateClass >::ChildList::push_back(), and dchain::CombinatoricLoop< CandidateClass >::setCurrentIterator().

   {
      ChildList childList;

      typename dchain::CandidateList<CandidateClass >::const_partial_iterator itEnd = iLoop.partial_end();
      for( typename dchain::CandidateList<CandidateClass >::const_partial_iterator entry = iLoop.partial_begin();
            entry != itEnd;
            ++entry ) {

         iLoop.setCurrentIterator( entry ) ;

         childList.push_back( & (*entry).labeledClass() );

         //
         // Note: need to cast way `const' to make sure a non-const LabeledParticleList
         //         is returned 
         //
         doIt( aBegin,
               aEnd,
               childList ,
               aLabel,
               aDecayList );
         childList.eraseAll();
      }
   }

---