dchain::CombinatoricLoop< CandidateClass > Class Template Reference

#include <CombinatoricLoop.h>

Public Member Functions
virtual	~CombinatoricLoop ()
void	setCurrentIterator (typename dchain::CandidateList< CandidateClass >::const_partial_iterator &aIterator)
const dchain::CandidateList< CandidateClass >::const_partial_iterator	partial_begin () const
const dchain::CandidateList< CandidateClass >::const_partial_iterator	partial_end () const
	CombinatoricLoop (const typename dchain::CandidateList< CandidateClass >::const_partial_iterator &aBegin, const typename dchain::CandidateList< CandidateClass >::const_partial_iterator &aEnd, _combinatoricloop_vector_ &aLoopList)

Detailed Description

template<class CandidateClass>
class dchain::CombinatoricLoop< CandidateClass >

Definition at line 97 of file CombinatoricLoop.h.

Constructor & Destructor Documentation

~CombinatoricLoop()

template<class CandidateClass >

dchain::CombinatoricLoop< CandidateClass >::~CombinatoricLoop

virtual

Definition at line 117 of file CombinatoricLoop.cc.

{
   delete m_previousDuplicate ;
}

CombinatoricLoop()

template<class CandidateClass >

dchain::CombinatoricLoop< CandidateClass >::CombinatoricLoop	(	const typename dchain::CandidateList< CandidateClass >::const_partial_iterator &	aBegin,
		const typename dchain::CandidateList< CandidateClass >::const_partial_iterator &	aEnd,
		_combinatoricloop_vector_ &	aLoopList
	)

Definition at line 94 of file CombinatoricLoop.cc.

                                                           :
   m_beginIterator( aBegin ) ,
   m_endIterator( aEnd ) ,
   m_previousDuplicate( 0 )
{
   typename _combinatoricloop_vector_::const_iterator lastLoop( aLoopList.begin() ) ;
   typename _combinatoricloop_vector_::const_iterator loopToCheck( aLoopList.end() ) ;
   while ( loopToCheck != lastLoop ) {
      --loopToCheck ;
      if ( ( (*(*loopToCheck)).m_beginIterator ) == m_beginIterator ) {
     m_previousDuplicate = new typename _combinatoricloop_vector_::const_iterator( loopToCheck ) ;
     (*(*(*m_previousDuplicate))).adjustEnd() ;
//
// only require one match, so prepare to terminate search for duplicate
//
     loopToCheck = lastLoop ;
      }
   } 
}

Member Function Documentation

partial_begin()

template<class CandidateClass >

const dchain::CandidateList< CandidateClass >::const_partial_iterator dchain::CombinatoricLoop< CandidateClass >::partial_begin

Definition at line 144 of file CombinatoricLoop.cc.

{
   if ( 0 == m_previousDuplicate ) {
      return( m_beginIterator ) ;
   }
   typename dchain::CandidateList< CandidateClass >::const_partial_iterator newBegin( ( (*(*(*m_previousDuplicate))).m_currentIterator ) ) ;
   return( ++newBegin ) ;
}

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

partial_end()

template<class CandidateClass >

const dchain::CandidateList< CandidateClass >::const_partial_iterator dchain::CombinatoricLoop< CandidateClass >::partial_end

Definition at line 154 of file CombinatoricLoop.cc.

{
   return( m_endIterator ) ;
}

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

setCurrentIterator()

template<class CandidateClass >

void dchain::CombinatoricLoop< CandidateClass >::setCurrentIterator

(

typename dchain::CandidateList< CandidateClass >::const_partial_iterator &

aIterator

)

Definition at line 134 of file CombinatoricLoop.cc.

{
   m_currentIterator = aIterator ;
}

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

---

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

• CombinatoricLoop.h
• CombinatoricLoop.cc