a type using a generic bool function pointer since - for some reason, I can not fathom, people like to use eg MC::isTau(p) rather than say, just t->pdfId() == MC::Tau - I mean why just use a value you can change at runtime, when you could hard code an actual function that you can't change at all, even if you need to More...

#include <AncestorFinder.h>

Inheritance diagram for IDTPM2::PredicateAncestorFinder< T, P >:

Collaboration diagram for IDTPM2::PredicateAncestorFinder< T, P >:

Public Member Functions
	PredicateAncestorFinder (P p)
bool	predicate (const T *t) const override
const T *	findAncestor (const T *t) const

Private Attributes
Predicate	m_predicate

Detailed Description

template<typename T, typename P = bool (*)(const T*)>
class IDTPM2::PredicateAncestorFinder< T, P >

a type using a generic bool function pointer since - for some reason, I can not fathom, people like to use eg MC::isTau(p) rather than say, just t->pdfId() == MC::Tau - I mean why just use a value you can change at runtime, when you could hard code an actual function that you can't change at all, even if you need to

Definition at line 182 of file AncestorFinder.h.

Constructor & Destructor Documentation

◆ PredicateAncestorFinder()

template<typename T, typename P = bool (*)(const T*)>

IDTPM2::PredicateAncestorFinder< T, P >::PredicateAncestorFinder ( P p )

inline

Definition at line 184 of file AncestorFinder.h.

184: GenericAncestorFinder<T, P>(p) { }

IDTPM2::GenericAncestorFinder::GenericAncestorFinder

GenericAncestorFinder(Predicate p)

Definition AncestorFinder.h:66

IDTPM2::PredicateAncestorFinder

a type using a generic bool function pointer since - for some reason, I can not fathom,...

Definition AncestorFinder.h:182

Member Function Documentation

◆ findAncestor()

template<typename T>

const T * IDTPM2::IFinder< T >::findAncestor ( const T * t ) const

inlineinherited

successful stopping condition ...

isn't recursion great boys and girls ?

Definition at line 33 of file AncestorFinder.h.

                                          {
 
    // reached the end ...
    if (!t) return 0;
    if ( predicate(t) ) return t;
 
    for ( size_t p=0 ; p<t->nParents() ; p++ ) {
        const T* parent = t->parent(p);
 
        if ( parent==t ) continue;
        if ( const T* found = findAncestor(parent) ) return found;
    }
 
    return 0;
  }