Main Page | Namespace List | Class Hierarchy | Alphabetical List | Class List | Directories | File List | Namespace Members | Class Members | File Members | Related Pages

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

List of all members.

Public Member Functions

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

Private Attributes

std::vector< const CandidateClass * > m_list
std::vector< const CandidateClass * > m_list

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

Constructor & Destructor Documentation

template<class DecayClass, class CandidateClass>
dchain::FillDecayList< DecayClass, CandidateClass >::ChildList::ChildList (   )  [inline]
  

00140                      {
00141             m_list.reserve(4);
00142          }

template<class DecayClass, class CandidateClass>
dchain::FillDecayList< DecayClass, CandidateClass >::ChildList::ChildList (  const DecayClass *  decay  )  [inline]
  

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

template<class DecayClass, class CandidateClass>
dchain::FillDecayList< DecayClass, CandidateClass >::ChildList::ChildList (   )  [inline]
  

00140                      {
00141             m_list.reserve(4);
00142          }

template<class DecayClass, class CandidateClass>
dchain::FillDecayList< DecayClass, CandidateClass >::ChildList::ChildList (  const DecayClass *  decay  )  [inline]
  

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

Member Function Documentation

template<class DecayClass, class CandidateClass>
void dchain::FillDecayList< DecayClass, CandidateClass >::ChildList::eraseAll (   )  [inline]
  

00156                          {
00157             m_list.erase(m_list.begin(), m_list.end());
00158          }

template<class DecayClass, class CandidateClass>
void dchain::FillDecayList< DecayClass, CandidateClass >::ChildList::eraseAll (   )  [inline]
  

00156                          {
00157             m_list.erase(m_list.begin(), m_list.end());
00158          }

template<class DecayClass, class CandidateClass>
DecayClass* dchain::FillDecayList< DecayClass, CandidateClass >::ChildList::makeDecay (   )  [inline]
  

00172                                  {
00173             DecayClass* returnValue = new DecayClass( *(m_list.front()) );
00174             for( typename std::vector<const CandidateClass*>::iterator itChild = m_list.begin()+1;
00175                   itChild != m_list.end();
00176                   ++itChild ) {
00177                returnValue->addChild( *(*itChild) );
00178             }
00179             return returnValue;
00180          }

template<class DecayClass, class CandidateClass>
DecayClass* dchain::FillDecayList< DecayClass, CandidateClass >::ChildList::makeDecay (   )  [inline]
  

00172                                  {
00173             DecayClass* returnValue = new DecayClass( *(m_list.front()) );
00174             for( typename std::vector<const CandidateClass*>::iterator itChild = m_list.begin()+1;
00175                   itChild != m_list.end();
00176                   ++itChild ) {
00177                returnValue->addChild( *(*itChild) );
00178             }
00179             return returnValue;
00180          }

template<class DecayClass, class CandidateClass>
bool dchain::FillDecayList< DecayClass, CandidateClass >::ChildList::overlap (  const CandidateClass &  iCandidate  )  const [inline]
  

00160                                                                 {
00161             for( typename std::vector<const CandidateClass*>::const_iterator itChild =
00162                   m_list.begin();
00163                   itChild != m_list.end();
00164                   ++itChild ) {
00165                if( iCandidate.overlap( *(*itChild) ) ) {
00166                   return true;
00167                }
00168             }
00169             return false;
00170          }

template<class DecayClass, class CandidateClass>
bool dchain::FillDecayList< DecayClass, CandidateClass >::ChildList::overlap (  const CandidateClass &  iCandidate  )  const [inline]
  

00160                                                                 {
00161             for( typename std::vector<const CandidateClass*>::const_iterator itChild =
00162                   m_list.begin();
00163                   itChild != m_list.end();
00164                   ++itChild ) {
00165                if( iCandidate.overlap( *(*itChild) ) ) {
00166                   return true;
00167                }
00168             }
00169             return false;
00170          }

template<class DecayClass, class CandidateClass>
void dchain::FillDecayList< DecayClass, CandidateClass >::ChildList::pop_back (   )  [inline]
  

00153                          {
00154             m_list.pop_back();
00155          }

template<class DecayClass, class CandidateClass>
void dchain::FillDecayList< DecayClass, CandidateClass >::ChildList::pop_back (   )  [inline]
  

00153                          {
00154             m_list.pop_back();
00155          }

template<class DecayClass, class CandidateClass>
void dchain::FillDecayList< DecayClass, CandidateClass >::ChildList::push_back (  const CandidateClass *  iCandidate  )  [inline]
  

00150                                                             {
00151             m_list.push_back( iCandidate );
00152          }

template<class DecayClass, class CandidateClass>
void dchain::FillDecayList< DecayClass, CandidateClass >::ChildList::push_back (  const CandidateClass *  iCandidate  )  [inline]
  

00150                                                             {
00151             m_list.push_back( iCandidate );
00152          }

Member Data Documentation

template<class DecayClass, class CandidateClass>
std::vector<const CandidateClass*> dchain::FillDecayList< DecayClass, CandidateClass >::ChildList::m_list [private]
 

template<class DecayClass, class CandidateClass>
std::vector<const CandidateClass*> dchain::FillDecayList< DecayClass, CandidateClass >::ChildList::m_list [private]
 

The documentation for this class was generated from the following files:
Generated on Wed Feb 2 19:16:44 2011 for BOSS6.5.5 by  doxygen 1.3.9.1