EdbEDADecayVertex Class Reference

#include <EdbEDADecaySearch.h>

Inheritance diagram for EdbEDADecayVertex:

Collaboration diagram for EdbEDADecayVertex:

Public Types
enum	TopologyType { kShort =0x01 , kLong = 0x02 , kSmallKink = 0x04 }

Public Member Functions
	EdbEDADecayVertex ()
	EdbEDADecayVertex (EdbVertex *v2ry, EdbVertex *v1ry, EdbEDATrackP *parent, TObjArray *daughters)
	EdbEDADecayVertex (EdbVertex *v2ry, EdbVertex *v1ry, EdbEDATrackP *parent=NULL, EdbEDATrackP *daugter1=NULL, EdbEDATrackP *daugheter2=NULL, EdbEDATrackP *daughter3=NULL, EdbEDATrackP *daughter4=NULL, EdbEDATrackP *daughter5=NULL)
EdbTrackP *	GetDaughter (int i=0)
EdbTrackP *	GetParent ()
EdbTrackP *	GetPartner ()
EdbVertex *	GetPrimaryVertex ()
bool	IsLong ()
bool	IsShort ()
bool	IsSmallKink ()
bool	IsType (int type)
int	NDaughters ()
void	SetDaughter (EdbEDATrackP *daughter)
void	SetDaughters (TObjArray *daughters)
void	SetParent (EdbEDATrackP *parent)
void	SetPartner (EdbEDATrackP *partner)
void	SetPrimaryVertex (EdbVertex *v)
void	SetType (int type)
int	Type ()
	~EdbEDADecayVertex ()
Public Member Functions inherited from EdbVertex
void	AddVTA (EdbVTA *vta)
Int_t	CheckDiscardedTracks ()
float	CheckImp (const EdbTrackP *tr)
EdbVTA *	CheckImp (const EdbTrackP *tr, float ImpMax, int zpos, float dist)
float	CheckImpGeom (const EdbTrackP *tr)
Float_t	Chi2Track (EdbTrackP *tr, int zpos, float X0=0.)
void	Clear ()
void	ClearNeighborhood ()
void	ClearV ()
Int_t	Compare (const TObject *o) const
Float_t	DistSeg (EdbSegP *seg, float X0=0.)
Float_t	DistTrack (EdbTrackP *tr, int zpos, float X0=0.)
void	Edb2Vt (const EdbSegP &s, VERTEX::Track &t, float X0=0., float m=0.139)
void	Edb2Vt (const EdbTrackP &tr, VERTEX::Track &t, float X0=0., float m=0.139)
	EdbVertex ()
Int_t	EstimateVertexFlag ()
Bool_t	EstimateVertexMath (float &xv, float &yv, float &zv, float &d)
Int_t	Flag () const
EdbVertex *	GetConnectedVertex (int nv)
EdbVertex *	GetConnectedVertexForTrack (int it)
EdbVTA *	GetMaxImpVTA ()
EdbTrackP *	GetTrack (int i)
EdbTrackP *	GetTrackN (int i)
EdbSegP *	GetTrackV (int i, bool usesegpar=false)
EdbVTA *	GetVTa (int i)
EdbVTA *	GetVTn (int i)
ULong_t	Hash () const
Int_t	ID () const
Float_t	Impact (int i)
Float_t	ImpTrack (int i)
Bool_t	IsEqual (const TObject *o) const
Bool_t	IsSortable () const
Float_t	MaxAperture ()
Float_t	MaxImpact ()
Int_t	MCEvt () const
EdbTrackP *	MeanTrack ()
Float_t	MinDist ()
Int_t	N () const
Int_t	Nn () const
Int_t	Nv ()
void	Print ()
void	PrintGeom ()
Float_t	Quality ()
void	RemoveVTA (EdbVTA *vta)
void	ResetTracks ()
void	SetFlag (int flag=0)
void	SetID (int ID=0)
void	SetMC (int mEvt=0)
void	SetQuality (float q=0)
void	SetV (VERTEX::Vertex *v)
void	SetXYZ (float x, float y, float z)
Bool_t	TrackInVertex (EdbTrackP *t)
VERTEX::Vertex *	V () const
Float_t	Volume ()
TList *	VTa ()
TList *	VTn ()
Float_t	VX () const
Float_t	VY () const
Float_t	VZ () const
Float_t	X () const
Float_t	Y () const
Float_t	Z () const
Int_t	Zpos (int i)
virtual	~EdbVertex ()

Private Member Functions
void	AddTrack (EdbEDATrackP *t)

Private Attributes
TObjArray *	eDaughters
EdbEDATrackP *	eParent
EdbEDATrackP *	ePartner
EdbVertex *	ePrimaryVertex
int	eType

Member Enumeration Documentation

TopologyType

enum EdbEDADecayVertex::TopologyType

Enumerator
kShort
kLong
kSmallKink

{ kShort=0x01, kLong = 0x02, kSmallKink = 0x04};

Constructor & Destructor Documentation

EdbEDADecayVertex() [1/3]

EdbEDADecayVertex::EdbEDADecayVertex	(	EdbVertex *	v2ry,
		EdbVertex *	v1ry,
		EdbEDATrackP *	parent = NULL,
		EdbEDATrackP *	daugter1 = NULL,
		EdbEDATrackP *	daugheter2 = NULL,
		EdbEDATrackP *	daughter3 = NULL,
		EdbEDATrackP *	daughter4 = NULL,
		EdbEDATrackP *	daughter5 = NULL
	)

                                                                                                                                                                                                                       {
    
    
    TObjArray daughters;
    if( daughter1 ) daughters.Add(daughter1);
    if( daughter2 ) daughters.Add(daughter2);
    if( daughter3 ) daughters.Add(daughter3);
    if( daughter4 ) daughters.Add(daughter4);
    if( daughter5 ) daughters.Add(daughter5);
    
    EdbEDADecayVertex( v2ry, v1ry, parent, &daughters);
    
}

EdbEDADecayVertex() [2/3]

EdbEDADecayVertex::EdbEDADecayVertex	(	EdbVertex *	v2ry,
		EdbVertex *	v1ry,
		EdbEDATrackP *	parent,
		TObjArray *	daughters
	)

                                                                                                                 {
    EdbEDADecayVertex();
    if(v2ry) EdbVertex::SetXYZ( v2ry->X(), v2ry->Y(), v2ry->Z());
    ePrimaryVertex = v1ry;
    
    if(parent) SetParent( parent);
    if(daughters) SetDaughters( daughters);
    
}

EdbEDADecayVertex() [3/3]

EdbEDADecayVertex::EdbEDADecayVertex ( )

inline

:ePrimaryVertex(NULL), eParent(NULL), eDaughters(NULL), eType(0) {};

~EdbEDADecayVertex()

EdbEDADecayVertex::~EdbEDADecayVertex

(

)

                                     {
    if(eDaughters) delete eDaughters;
}

Member Function Documentation

AddTrack()

void EdbEDADecayVertex::AddTrack ( EdbEDATrackP *  t )

private

                                                {
    EdbVTA *vta = new EdbVTA(t->GetOriginal(), (EdbVertex *)this);
    vta->SetZpos( t->Z()>this->Z() ? 1 : 0);
    vta->SetFlag(2);
    vta->SetImp( CalcIP( t, (EdbVertex *) this));
    AddVTA(vta);
}

GetDaughter()

EdbTrackP* EdbEDADecayVertex::GetDaughter ( int  i = 0 )

inline

{ return eDaughters ? ((EdbEDATrackP *) eDaughters->At(i))->GetOriginal() : NULL;}

GetParent()

EdbTrackP* EdbEDADecayVertex::GetParent ( )

inline

{ return eParent?eParent->GetOriginal():NULL;}

GetPartner()

EdbTrackP* EdbEDADecayVertex::GetPartner ( )

inline

{ return ePartner?ePartner->GetOriginal():NULL;}

GetPrimaryVertex()

EdbVertex* EdbEDADecayVertex::GetPrimaryVertex ( )

inline

{ return ePrimaryVertex;}

IsLong()

bool EdbEDADecayVertex::IsLong ( )

inline

{ return IsType(kLong);}

IsShort()

bool EdbEDADecayVertex::IsShort ( )

inline

{ return IsType(kShort);}

IsSmallKink()

bool EdbEDADecayVertex::IsSmallKink ( )

inline

{ return IsType(kSmallKink);}

IsType()

bool EdbEDADecayVertex::IsType ( int  type )

inline

{ return type&eType? kTRUE:kFALSE;}

NDaughters()

int EdbEDADecayVertex::NDaughters ( )

inline

{ return eDaughters? eDaughters->GetEntriesFast() : 0;}

SetDaughter()

void EdbEDADecayVertex::SetDaughter

(

EdbEDATrackP *

daughter

)

                                                          {
    if(eDaughters==NULL) eDaughters=new TObjArray;
    if(!eDaughters->FindObject(daughter)) {
        eDaughters->Add(daughter);
        AddTrack(daughter);
    }
}

SetDaughters()

void EdbEDADecayVertex::SetDaughters

(

TObjArray *

daughters

)

                                                         {
    for(int i=0; i<daughters->GetEntriesFast(); i++){
        SetDaughter( (EdbEDATrackP *) daughters->At(i));
    }
}

SetParent()

void EdbEDADecayVertex::SetParent

(

EdbEDATrackP *

parent

)

                                                      {
    eParent = parent;
    AddTrack( eParent);
}

SetPartner()

void EdbEDADecayVertex::SetPartner ( EdbEDATrackP *  partner )

inline

{ ePartner = partner;}

SetPrimaryVertex()

void EdbEDADecayVertex::SetPrimaryVertex ( EdbVertex *  v )

inline

{ ePrimaryVertex = v;}

SetType()

void EdbEDADecayVertex::SetType ( int  type )

inline

{ eType=type;}

Type()

int EdbEDADecayVertex::Type ( )

inline

{ return eType;}

Member Data Documentation

eDaughters

TObjArray* EdbEDADecayVertex::eDaughters

private

eParent

EdbEDATrackP* EdbEDADecayVertex::eParent

private

ePartner

EdbEDATrackP* EdbEDADecayVertex::ePartner

private

ePrimaryVertex

EdbVertex* EdbEDADecayVertex::ePrimaryVertex

private

eType

int EdbEDADecayVertex::eType

private

---

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

• src/libEDA/EdbEDADecaySearch.h
• src/libEDA/EdbEDADecaySearch.C