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

Public Member Functions
	ChildList ()
	ChildList (const DecayClass *decay)
void	push_back (const CandidateClass *iCandidate)
void	pop_back ()
void	eraseAll ()
bool	overlap (const CandidateClass &iCandidate) const
DecayClass *	makeDecay ()

Detailed Description

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

Definition at line 137 of file CombinatoricList.cc.

Constructor & Destructor Documentation

ChildList() [1/2]

template<class DecayClass , class CandidateClass >

dchain::FillDecayList< DecayClass, CandidateClass >::ChildList::ChildList ( )

inline

Definition at line 140 of file CombinatoricList.cc.

                 {
        m_list.reserve(4);
     }

ChildList() [2/2]

template<class DecayClass , class CandidateClass >

dchain::FillDecayList< DecayClass, CandidateClass >::ChildList::ChildList ( const DecayClass *  decay )

inline

Definition at line 144 of file CombinatoricList.cc.

                                        {
        //fill the m_list with decay
        uint32_t n = decay->numberChildren();
        for ( uint32_t i = 0; i < n; i++) m_list.push_back(&(decay->child(i)));
     }

Member Function Documentation

eraseAll()

template<class DecayClass , class CandidateClass >

void dchain::FillDecayList< DecayClass, CandidateClass >::ChildList::eraseAll ( )

inline

Definition at line 156 of file CombinatoricList.cc.

                     {
        m_list.erase(m_list.begin(), m_list.end());
     }

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

makeDecay()

template<class DecayClass , class CandidateClass >

DecayClass * dchain::FillDecayList< DecayClass, CandidateClass >::ChildList::makeDecay ( )

inline

Definition at line 172 of file CombinatoricList.cc.

                             {
        DecayClass* returnValue = new DecayClass( *(m_list.front()) );
        for( typename std::vector<const CandidateClass*>::iterator itChild = m_list.begin()+1;
          itChild != m_list.end();
          ++itChild ) {
           returnValue->addChild( *(*itChild) );
        }
        return returnValue;
     }

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

overlap()

template<class DecayClass , class CandidateClass >

bool dchain::FillDecayList< DecayClass, CandidateClass >::ChildList::overlap ( const CandidateClass &  iCandidate ) const

inline

Definition at line 160 of file CombinatoricList.cc.

                                                            {
        for( typename std::vector<const CandidateClass*>::const_iterator itChild =
          m_list.begin();
          itChild != m_list.end();
          ++itChild ) {
           if( iCandidate.overlap( *(*itChild) ) ) {
          return true;
           }
        }
        return false;
     }

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

pop_back()

template<class DecayClass , class CandidateClass >

void dchain::FillDecayList< DecayClass, CandidateClass >::ChildList::pop_back ( )

inline

Definition at line 153 of file CombinatoricList.cc.

                     {
        m_list.pop_back();
     }

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

push_back()

template<class DecayClass , class CandidateClass >

void dchain::FillDecayList< DecayClass, CandidateClass >::ChildList::push_back ( const CandidateClass *  iCandidate )

inline

Definition at line 150 of file CombinatoricList.cc.

                                                        {
        m_list.push_back( iCandidate );
     }

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

---

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

• CombinatoricList.cc