General decay vertex. More...

#include <EdbDecaySearch.h>

Inheritance diagram for EdbDecayVertex:

Collaboration diagram for EdbDecayVertex:

[legend]

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

Public Member Functions
	EdbDecayVertex ()

	EdbDecayVertex (EdbVertex v2ry, EdbVertex v1ry, EdbTrackDS parent, TObjArray daughters)

	EdbDecayVertex (EdbVertex v2ry, EdbVertex v1ry, EdbTrackDS parent=NULL, EdbTrackDS daugter1=NULL, EdbTrackDS daugheter2=NULL, EdbTrackDS daughter3=NULL, EdbTrackDS daughter4=NULL, EdbTrackDS 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 (EdbTrackDS *daughter)

void	SetDaughters (TObjArray *daughters)

void	SetParent (EdbTrackDS *parent)

void	SetPartner (EdbTrackDS *partner)

void	SetPrimaryVertex (EdbVertex *v)

void	SetType (int type)

int	Type ()

	~EdbDecayVertex ()

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 ()

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 (EdbTrackDS *t)

Private Attributes
TObjArray *	eDaughters

EdbTrackDS *	eParent

EdbTrackDS *	ePartner

EdbVertex *	ePrimaryVertex

int	eType

Detailed Description

General decay vertex.

Member Enumeration Documentation

◆ TopologyType

enum EdbDecayVertex::TopologyType

Enumerator
kShort
kLong
kSmallKink

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

EdbDecayVertex::kShort

@ kShort

Definition: EdbDecaySearch.h:126

EdbDecayVertex::kLong

@ kLong

Definition: EdbDecaySearch.h:126

EdbDecayVertex::kSmallKink

@ kSmallKink

Definition: EdbDecaySearch.h:126

Constructor & Destructor Documentation

◆ EdbDecayVertex() [1/3]

EdbDecayVertex::EdbDecayVertex	(	EdbVertex *	v2ry,
		EdbVertex *	v1ry,
		EdbTrackDS *	parent = `NULL`,
		EdbTrackDS *	daugter1 = `NULL`,
		EdbTrackDS *	daugheter2 = `NULL`,
		EdbTrackDS *	daughter3 = `NULL`,
		EdbTrackDS *	daughter4 = `NULL`,
		EdbTrackDS *	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);
    
    EdbDecayVertex( v2ry, v1ry, parent, &daughters);
    
}

◆ EdbDecayVertex() [2/3]

EdbDecayVertex::EdbDecayVertex	(	EdbVertex *	v2ry,
		EdbVertex *	v1ry,
		EdbTrackDS *	parent,
		TObjArray *	daughters
	)

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

◆ EdbDecayVertex() [3/3]

EdbDecayVertex::EdbDecayVertex ( )

inline

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

EdbDecayVertex::eParent

EdbTrackDS * eParent

Definition: EdbDecaySearch.h:119

EdbDecayVertex::eType

int eType

Definition: EdbDecaySearch.h:123

EdbDecayVertex::eDaughters

TObjArray * eDaughters

Definition: EdbDecaySearch.h:121

NULL

#define NULL

Definition: nidaqmx.h:84

◆ ~EdbDecayVertex()

EdbDecayVertex::~EdbDecayVertex ( )

                               {
    if(eDaughters) delete eDaughters;
}

Member Function Documentation

◆ AddTrack()

void EdbDecayVertex::AddTrack ( EdbTrackDS * 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 * EdbDecayVertex::GetDaughter ( int i = 0 )

inline

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

EdbTrackDS

Tracks with DecaySearch information.

Definition: EdbDecaySearch.h:8

◆ GetParent()

EdbTrackP * EdbDecayVertex::GetParent ( )

inline

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

EdbTrackDS::GetOriginal

EdbTrackP * GetOriginal()

Definition: EdbDecaySearch.h:107

◆ GetPartner()

EdbTrackP * EdbDecayVertex::GetPartner ( )

inline

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

EdbDecayVertex::ePartner

EdbTrackDS * ePartner

Definition: EdbDecaySearch.h:120

◆ GetPrimaryVertex()

EdbVertex * EdbDecayVertex::GetPrimaryVertex ( )

inline

143{ return ePrimaryVertex;}

◆ IsLong()

bool EdbDecayVertex::IsLong ( )

inline

149{ return IsType(kLong);}

EdbDecayVertex::IsType

bool IsType(int type)

Definition: EdbDecaySearch.h:147

◆ IsShort()

bool EdbDecayVertex::IsShort ( )

inline

148{ return IsType(kShort);}

◆ IsSmallKink()

bool EdbDecayVertex::IsSmallKink ( )

inline

150{ return IsType(kSmallKink);}

◆ IsType()

bool EdbDecayVertex::IsType ( int type )

inline

147{ return type&eType? kTRUE:kFALSE;}

type

Int_t type

Definition: testBGReduction_By_ANN.C:15

◆ NDaughters()

int EdbDecayVertex::NDaughters ( )

inline

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

◆ SetDaughter()

void EdbDecayVertex::SetDaughter ( EdbTrackDS * daughter )

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

◆ SetDaughters()

void EdbDecayVertex::SetDaughters ( TObjArray * daughters )

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

◆ SetParent()

void EdbDecayVertex::SetParent ( EdbTrackDS * parent )

                                                 {
    eParent = parent;
    AddTrack( eParent);
}

◆ SetPartner()

void EdbDecayVertex::SetPartner ( EdbTrackDS * partner )

inline

136{ ePartner = partner;}

◆ SetPrimaryVertex()

void EdbDecayVertex::SetPrimaryVertex ( EdbVertex * v )

inline

137{ ePrimaryVertex = v;}

◆ SetType()

void EdbDecayVertex::SetType ( int type )

inline

145{ eType=type;}

◆ Type()

int EdbDecayVertex::Type ( )

inline

146{ return eType;}

Member Data Documentation

◆ eDaughters

TObjArray* EdbDecayVertex::eDaughters

private

◆ eParent

EdbTrackDS* EdbDecayVertex::eParent

private

◆ ePartner

EdbTrackDS* EdbDecayVertex::ePartner

private

◆ ePrimaryVertex

EdbVertex* EdbDecayVertex::ePrimaryVertex

private

◆ eType

int EdbDecayVertex::eType

private

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

/home/antonio/fedra_doxygen/src/libAnalysis/EdbDecaySearch.h
/home/antonio/fedra_doxygen/src/libAnalysis/EdbDecaySearch.C

Public Types

Public Member Functions

Private Member Functions

Private Attributes

Detailed Description

Member Enumeration Documentation

◆ TopologyType

Constructor & Destructor Documentation

◆ EdbDecayVertex() [1/3]

◆ EdbDecayVertex() [2/3]

◆ EdbDecayVertex() [3/3]

◆ ~EdbDecayVertex()

Member Function Documentation

◆ AddTrack()

◆ GetDaughter()

◆ GetParent()

◆ GetPartner()

◆ GetPrimaryVertex()

◆ IsLong()

◆ IsShort()

◆ IsSmallKink()

◆ IsType()

◆ NDaughters()

◆ SetDaughter()

◆ SetDaughters()

◆ SetParent()

◆ SetPartner()

◆ SetPrimaryVertex()

◆ SetType()

◆ Type()

Member Data Documentation

◆ eDaughters

◆ eParent

◆ ePartner

◆ ePrimaryVertex

◆ eType