#include <EdbPattern.h>

Inheritance diagram for EdbTrackP:

[legend]

Collaboration diagram for EdbTrackP:

[legend]

Public Member Functions
void	AddSegment (EdbSegP *s)

void	AddSegmentF (EdbSegP *s)

void	AddTrack (const EdbTrackP &tr)

void	AddVTA (EdbVTA *vta)

int	CheckAliasSegments ()

int	CheckMaxGap ()

float	CHI2 ()

float	CHI2F ()

void	Clear ()

void	ClearF ()

void	ClearVTA ()

void	ClearVTA (EdbVTA *vta)

void	Copy (const EdbTrackP &tr)

Float_t	DE () const

Int_t	Dir () const

	EdbTrackP (EdbSegP &seg)

	EdbTrackP (EdbSegP *seg, float m=0.12)

	EdbTrackP (EdbTrackP &track)

	EdbTrackP (int nseg=0)
	vertex track end is attached to More...

int	EstimatePositionAt (Float_t z, EdbSegP &ss)

void	FitTrack ()

int	FitTrackKFS (bool zmax=false, float X0=5810., int design=0)

Double_t	GetBTEfficiency ()

EdbSegP *	GetSegment (int i) const

EdbSegP *	GetSegmentF (int i) const

EdbSegP *	GetSegmentFFirst () const

EdbSegP *	GetSegmentFirst () const

EdbSegP *	GetSegmentFLast () const

EdbSegP *	GetSegmentLast () const

Int_t	GetSegmentsAid (int &nseg) const

Int_t	GetSegmentsFlag (int &nseg) const

Int_t	GetSegmentsMCTrack (int &nseg) const

EdbSegP *	GetSegmentWithClosestZ (float z, float dz)

Float_t	M () const

float	MakePredictionTo (Float_t z, EdbSegP &ss)

int	MakeSelector (EdbSegP &ss, bool followZ=true)

Int_t	N () const

Int_t	N0 () const

Int_t	NF () const

Int_t	Npl () const

Int_t	PDG () const

Float_t	PerrDown () const

Float_t	PerrUp () const

void	Print ()

void	PrintNice ()

int	RemoveAliasSegments ()

void	RemoveSegment (EdbSegP *s)

void	Set0 ()

void	SetCounters ()

void	SetDE (float de)

void	SetM (float m)

void	SetN0 ()

void	SetN0 (int n0)

void	SetNpl ()

void	SetNpl (int npl)

void	SetOwner ()

void	SetPDG (int pdg)

void	SetPerr (Float_t perrDown, Float_t perrUp)

void	SetPerrDown (Float_t perrDown)

void	SetPerrUp (Float_t perrUp)

int	SetSegmentsP (float p)

int	SetSegmentsTrack ()

int	SetSegmentsTrack (int id)

void	SubstituteSegment (EdbSegP sold, EdbSegP snew)

const EdbSegP *	TrackEnd () const

EdbSegP *	TrackExtremity (bool zpos, bool usesegpar=false) const

const EdbSegP *	TrackStart () const

EdbSegP *	TrackZmax (bool usesegpar=false) const

EdbSegP *	TrackZmin (bool usesegpar=false) const

void	Transform (const EdbAffine2D &tr)

EdbVertex *	Vertex (int zpos)

EdbVertex *	VertexE ()

EdbVertex *	VertexS ()

EdbVTA *	VTAE () const

EdbVTA *	VTAS () const

Float_t	Wgrains () const

Float_t	Wmean () const

Float_t	Zend () const

Float_t	Zmax () const

Float_t	Zmin () const

Float_t	Zstart () const

virtual	~EdbTrackP ()

Public Member Functions inherited from EdbSegP
void	addEMULDigit (TObject *a)

Int_t	Aid (int i) const

bool	CheckCOV () const

Float_t	Chi2 () const

void	Clear ()

Int_t	Compare (const TObject *obj) const

void	Copy (const EdbSegP &s)

TMatrixD &	COV () const

Float_t	DeltaR (EdbSegP *seg1) const

Float_t	DeltaTheta (EdbSegP *seg1) const

Float_t	DZ () const

Float_t	DZem () const

	EdbSegP ()

	EdbSegP (const EdbSegP &s)

	EdbSegP (int id, float x, float y, float tx, float ty, float w=0, int flag=0)

TRefArray *	EMULDigitArray () const

Int_t	Flag () const

void	ForceCOV (TMatrixD &cov)

Int_t	ID () const

bool	IsCompatible (EdbSegP &s, float nsigx, float nsigt) const

Bool_t	IsEqual (const TObject *obj) const

bool	IsInside (float xmin, float xmax, float ymin, float ymax) const

bool	IsInside (float xmin, float xmax, float ymin, float ymax, float zmin, float zmax) const

Bool_t	IsSortable () const

Int_t	MCEvt () const

Int_t	MCTrack () const

void	MergeTo (EdbSegP &s)

Float_t	P () const

Float_t	Phi () const

Int_t	PID () const

Int_t	Plate () const

void	Print (Option_t *opt="") const

void	PrintNice () const

Float_t	Prob () const

Float_t	ProbLink (EdbSegP &s1, EdbSegP &s2)

void	PropagateTo (float z)

void	PropagateToCOV (float z)

void	PropagateToDZ (float dz)

EdbID	ScanID () const

void	Set (int id, float x, float y, float tx, float ty, float w, int flag)

void	Set0 ()

void	SetAid (int a, int v, int side=0)

void	SetChi2 (float chi2)

void	SetCOV (double *array, int dim=5)

void	SetCOV (TMatrixD &cov)

void	SetDZ (float dz)

void	SetDZem (float dz)

void	SetErrorP (float sp2)

void	SetErrors ()

void	SetErrors (float sx2, float sy2, float sz2, float stx2, float sty2, float sp2=1.)

void	SetErrors0 ()

void	SetErrorsCOV (float sx2, float sy2, float sz2, float stx2, float sty2, float sp2=1.)

void	SetFlag (int flag)

void	SetID (int id)

void	SetMC (int mEvt, int mTrack)

void	SetP (float p)

void	SetPID (int pid)

void	SetPlate (int plateid)

void	SetProb (float prob)

void	SetProbability (float p)

void	SetScanID (EdbID id)

void	SetSide (int side=0)

void	SetSZ (float sz)

void	SetTrack (int trid)

void	SetTX (Float_t tx)

void	SetTY (Float_t ty)

void	SetVid (int vid, int sid)

void	SetVolume (float w)

void	SetW (float w)

void	SetX (Float_t x)

void	SetY (Float_t y)

void	SetZ (float z)

Int_t	Side () const

Float_t	SP () const

Float_t	STX () const

Float_t	STY () const

Float_t	SX () const

Float_t	SY () const

Float_t	SZ () const

Float_t	Theta () const

Int_t	Track () const

Float_t	TX () const

Float_t	TY () const

Int_t	Vid (int i) const

Float_t	Volume () const

Float_t	W () const

Float_t	X () const

Float_t	Y () const

Float_t	Z () const

virtual	~EdbSegP ()

Public Member Functions inherited from EdbTrack2D
virtual void	Substruct (EdbTrack2D *t)

virtual void	Test () const

virtual void	Transform (const EdbAffine2D *a)

virtual	~EdbTrack2D ()

Public Member Functions inherited from EdbPoint2D
virtual void	SetX (float x)=0

virtual void	SetY (float y)=0

virtual void	Substruct (EdbPoint *p)

virtual void	TestPoint2D () const

virtual	~EdbPoint2D ()

Public Member Functions inherited from EdbPoint
virtual void	Transform (const EdbAffine3D *a)

virtual	~EdbPoint ()

Public Member Functions inherited from EdbAngle2D
virtual void	SetTX (float x)=0

virtual void	SetTY (float y)=0

virtual void	Substruct (const EdbAngle2D *a)

virtual	~EdbAngle2D ()

Private Attributes
Float_t	eDE

Float_t	eM

Int_t	eN0

Int_t	eNpl

Int_t	ePDG

Float_t	ePerrDown

Float_t	ePerrUp

TSortedList *	eS

TSortedList *	eSF

EdbVTA *	eVTAE
	vertex track start is attached to More...

EdbVTA *	eVTAS

Additional Inherited Members
Static Public Member Functions inherited from EdbSegP
static Float_t	Angle (const EdbSegP &s1, const EdbSegP &s2)

static Float_t	Distance (const EdbSegP &s1, const EdbSegP &s2)

static void	LinkMT (const EdbSegP s1, const EdbSegP s2, EdbSegP *s)

Public Attributes inherited from EdbSegP
Float_t	eTX

Float_t	eTY

Float_t	eX

Float_t	eY

Float_t	eZ

Protected Attributes inherited from EdbSegP
TMatrixD *	eCOV

Constructor & Destructor Documentation

◆ EdbTrackP() [1/4]

EdbTrackP::EdbTrackP ( int nseg = 0 )

vertex track end is attached to

 {
   Set0();
   if(nseg>0) eS  = new TSortedList();
   if(nseg>0) { eSF = new TSortedList();    eSF->SetOwner(); }
 }

◆ EdbTrackP() [2/4]

EdbTrackP::EdbTrackP ( EdbSegP & seg )

                                  : EdbSegP(seg)
 {
   //create empty track with segment parameters
   eS=0;
   eSF=0;
   eM=0;
   eDE=0;
   ePDG=-999;
   eVTAS = 0;
   eVTAE = 0;
   eNpl=0;
   eN0=0;
 }

◆ EdbTrackP() [3/4]

EdbTrackP::EdbTrackP	(	EdbSegP *	seg,
		float	m = `0.12`
	)

                                           : EdbSegP( *seg )
 {
   eS=0;
   eSF=0;
   eM=0;
   eDE=0;
   ePDG=-999;
   eVTAS = 0;
   eVTAE = 0;
   eNpl=0;
   eN0=0;
   AddSegment(seg);
   SetM(m);
 }

◆ EdbTrackP() [4/4]

EdbTrackP::EdbTrackP ( EdbTrackP & track )

inline

139 { Set0(); Copy(track); }

EdbTrackP::Copy

void Copy(const EdbTrackP &tr)

Definition: EdbPattern.cxx:516

track

Definition: bitview.h:14

◆ ~EdbTrackP()

EdbTrackP::~EdbTrackP ( )

virtual

 {
   if(eS)    { eS->Clear();  delete eS;  eS=0;  }
   if(eSF)   { eSF->Clear(); delete eSF; eSF=0; }
 }

Member Function Documentation

◆ AddSegment()

void EdbTrackP::AddSegment ( EdbSegP * s )

inline

   { 
     if(!eS) eS = new TSortedList();
     eS->Add(s);
   }

◆ AddSegmentF()

void EdbTrackP::AddSegmentF ( EdbSegP * s )

inline

   { 
     if(!eSF) 
       {
         eSF = new TSortedList();
     eSF->SetOwner();
       }
     eSF->Add(s);
   }

◆ AddTrack()

void EdbTrackP::AddTrack ( const EdbTrackP & tr )

 {
   int nseg=tr.N();
   int nsegf=tr.NF();
   for(int i=0; i<nseg; i++)
     AddSegment(tr.GetSegment(i));
   for(int i=0; i<nsegf; i++)
     AddSegmentF(new EdbSegP(*(tr.GetSegmentF(i))));
 }

◆ AddVTA()

void EdbTrackP::AddVTA ( EdbVTA * vta )

 {
   if(vta) {
     if(vta->Zpos()==0)      eVTAE=vta;
     else if(vta->Zpos()==1) eVTAS=vta;
   }
 }

◆ CheckAliasSegments()

int EdbTrackP::CheckAliasSegments ( )

 {
   int nalias=0;
   for(int i=0; i<N(); i++) 
     if( GetSegment(i)->Track() != ID()) nalias++;
   return nalias;
 }

◆ CheckMaxGap()

int EdbTrackP::CheckMaxGap ( )

 {
   int ngap=0;
   if(N()<2) return 0;
   EdbSegP *s1=0, *s2=0;
   int gap = 0;
   for(int i=0; i<N()-1; i++) {
     s1 = GetSegment(i);
     s2 = GetSegment(i+1);
     gap = TMath::Abs(s2->PID()-s1->PID());
     if( gap > ngap) ngap = gap;
   }
   return ngap;
 }

◆ CHI2()

float EdbTrackP::CHI2 ( )

 {
   double dtx=0,dty=0,chi2=0;
   EdbSegP *seg=0;
   int    nseg=N();
   for(int i=0; i<nseg; i++) {
     seg = GetSegment(i);
     dtx = seg->TX()-TX();
     dty = seg->TY()-TY();
     chi2 += TMath::Sqrt( dtx*dtx/seg->STX() + 
              dty*dty/seg->STY() );
   }
   chi2  /= nseg;
   return chi2;
 }

◆ CHI2F()

float EdbTrackP::CHI2F ( )

 {
   double dtx=0,dty=0,chi2=0;
   EdbSegP *s=0, *sf=0;
   int    nseg=N();
   for(int i=0; i<nseg; i++) {
     s  = GetSegment(i);
     sf = GetSegmentF(i);
     dtx = s->TX() - sf->TX();
     dty = s->TY() - sf->TY();
     chi2 += TMath::Sqrt( dtx*dtx/s->STX() + 
              dty*dty/s->STY() );
   }
   chi2  /= nseg;
   return chi2;
 }

◆ Clear()

void EdbTrackP::Clear ( )

inline

271 { if(eS) eS->Clear(); if(eSF) eSF->Clear(); }

◆ ClearF()

void EdbTrackP::ClearF ( )

inline

272 { if(eSF) eSF->Clear(); }

◆ ClearVTA() [1/2]

void EdbTrackP::ClearVTA ( )

 {
   eVTAE=0;
   eVTAS=0;
 }

◆ ClearVTA() [2/2]

void EdbTrackP::ClearVTA ( EdbVTA * vta )

 {
   if(vta->Zpos()==0)      eVTAE=0;
   else if(vta->Zpos()==1) eVTAS=0;
 }

◆ Copy()

void EdbTrackP::Copy ( const EdbTrackP & tr )

 {
   // do the physical copy of segments
   Clear();
   ((EdbSegP*)(this))->Copy( *((EdbSegP*)(&tr)) );
   SetM(tr.M());
   SetPDG(tr.PDG());
   SetNpl(tr.Npl());  
   SetN0(tr.N0());
   SetDE(tr.DE());
   AddVTA(tr.VTAS());
   AddVTA(tr.VTAE());
  
   int nseg=tr.N();
   for(int i=0; i<nseg; i++)
     AddSegment(new EdbSegP(*tr.GetSegment(i)));
   nseg=tr.NF();
   for(int i=0; i<nseg; i++)
     AddSegmentF(new EdbSegP(*tr.GetSegmentF(i)));
   if (eS) eS->SetOwner();
   if (eSF) eSF->SetOwner();
 }

◆ DE()

Float_t EdbTrackP::DE ( ) const

inline

171 {return eDE;}

◆ Dir()

Int_t EdbTrackP::Dir ( ) const

inline

212 {return (DZ()<0) ? -1 : 1;}

EdbSegP::DZ

Float_t DZ() const

Definition: EdbSegP.h:151

◆ EstimatePositionAt()

int EdbTrackP::EstimatePositionAt	(	Float_t	z,
		EdbSegP &	ss
	)

 {
   // use coordinates of 2 nearest to z points for track extrapolation or interpolation
   // TODO: dz=0: mean?
  
   float x1,y1,tx,ty,dz;
   if( N()<2 )
   {
     x1=X();
     y1=Y();
     tx=TX();
     ty=TY();
     dz=z-GetSegment(0)->Z();
   }
   else
   {
     EdbSegP *s1=0,*s2=0;
     float   dz1,dz2;   dz1=dz2=kMaxInt;
     for(int i=0; i<N(); i++)
     {
       EdbSegP *s = GetSegment(i);
       float dz = Abs(s->Z()-z);
       if( dz < dz1 ) { dz1 = dz; s1=s; }
     }
     for(int i=0; i<N(); i++)
     {
       EdbSegP *s = GetSegment(i);
       float dz = Abs(s->Z()-z);
       if( dz < dz2 && s != s1 ) { dz2 = dz; s2=s; }
     }
     float dz0 = s2->Z()-s1->Z();
     if(abs(dz0)<0.000000001) {printf("dz0==0\n"); return 0;}
     float dx0 = s2->X()-s1->X();
     float dy0 = s2->Y()-s1->Y();
     tx  = dx0/dz0;
     ty  = dy0/dz0;
     dz  = z-s1->Z();
     x1  = s1->X();
     y1  = s1->Y();
   }
   ss.SetX( x1 + dz*tx );
   ss.SetY( y1 + dz*ty );
   ss.SetZ( z );
   ss.SetDZ( dz );           // keep dz distance
   ss.SetTX( tx );
   ss.SetTY( ty );
   return 1;
 }

◆ FitTrack()

void EdbTrackP::FitTrack ( )

 {
   // track fit by averaging of segments parameters
  
   int nseg=N();
   float x=0,y=0,z=0,tx=0,ty=0,w=0;
   EdbSegP *seg=0;
   for(int i=0; i<nseg; i++) {
     seg = GetSegment(i);
     x  += seg->X();
     y  += seg->Y();
     z  += seg->Z();
     tx += seg->TX();
     ty += seg->TY();
     w  += seg->W();
   }
   x  /= nseg;
   y  /= nseg;
   z  /= nseg;
   tx /= nseg;
   ty /= nseg;
   Set(ID(),x,y,tx,ty,w,Flag());
   SetZ(z);
 }

◆ FitTrackKFS()

int EdbTrackP::FitTrackKFS	(	bool	zmax = `false`,
		float	X0 = `5810.`,
		int	design = `0`
	)

 {
   // if (zmax==true)  track parameters are calculated at segment with max Z
   // if (zmax==false) track parameters are calculated at segment with min Z
   // TODO: track parameters??
   //
   // Note: momentum for track must be defined with SetP() prior to call this routine!
   // Note: momentum dispersion for track should be defined with SetErrorP()
   //       prior to call this routine - it is necessary for vertex fit
   //
   // on the output: Chi2: the full chi-square (not divided by NDF); NDF = 4
   //                Prob: is Chi2 probability (area of the tail of Chi2-distribution)
   //                      If we accept events with Prob >= ProbMin then ProbMin is the 
   //                      probability to reject the good event
  
  
   int nseg=N();
   if(nseg<=0) return 0;
   if(NF()) {
     eSF->Delete();
   }
  
   if(SP()<0.000001) SetErrorP(1.);    // TODO: razobratsia s etimi impul'sami!
   //printf("%d segments to fit\n",N());
  
   //TODO - eliminate constants!!!
  
   float dPb = 0., p = 0., m = 0.13957, e = 0.13957, de = 0., pa = 0., pn = 0.;
   float e0 = e;
   float eTPb = 1000./1300.;
   float pcut = 0.050;
   double teta0sq;
   double dz, ptx, pty;
   int step;
   int istart, iend;
  
   VtVector *par[260], *parpred[260], *pars[260], *meas[260];
   VtSqMatrix *pred[260];
   VtSymMatrix *cov[260], *covpred[260], *covpredinv[260], *covs[260], *dmeas[260];
  
   int i=0;
   if(nseg == 1) {
     EdbSegP *s = GetSegment(0);
     EdbSegP segf(*s);
  
     segf.Set(s->ID(),s->X(),s->Y(),s->TX(),s->TY(),1.,s->Flag());
     segf.SetZ(s->Z());
     segf.SetErrorP ( SP() );
     segf.SetChi2(0.);
     segf.SetProb(1.);
     segf.SetP( P() );
     segf.SetPID( s->PID() );
     segf.SetDZ(s->DZ());
  
     AddSegmentF(new EdbSegP(segf));
     return 0;
   }
  
   if(nseg>259)   return -1;
  
   EdbSegP *seg0=0;
   EdbSegP *seg=0;
  
   if(  GetSegment(N()-1)->Z() <  GetSegment(0)->Z() )
   {
     if (zmax)
     {
     step=-1;
     istart=nseg-1;
     iend=0;
     }
     else
     {
     step=1;
     istart=0;
     iend=nseg-1;
     }
   }
   else
   {
     if (!zmax)
     {
     step=-1;
     istart=nseg-1;
     iend=0;
     }
     else
     {
     step=1;
     istart=0;
     iend=nseg-1;
     }
  
   }
  
   seg0 = GetSegment(istart);
  
   par[istart] = new VtVector(  (double)(seg0->X()), 
                    (double)(seg0->Y()),  
                    (double)(seg0->TX()), 
                    (double)(seg0->TY()) );
   meas[istart] = new VtVector(*par[istart]);
   pred[iend] = new VtSqMatrix(4);
 //  (*pred[istart]).clear();
 //  (*pred[istart])(0,0) = 1.;
 //  (*pred[istart])(1,1) = 1.;
 //  (*pred[istart])(2,2) = 1.;
 //  (*pred[istart])(3,3) = 1.;
   cov[istart] = new VtSymMatrix(4);             // covariance matrix for seg0
   for(int k=0; k<4; k++) 
     for(int l=0; l<4; l++) (*cov[istart])(k,l) = (seg0->COV())(k,l);
   dmeas[istart] = new VtSymMatrix(*cov[istart]);             // covariance matrix for seg0
  
   Double_t chi2=0.; 
  
   i = istart;
   p = P();
   m = M();
   if (p < pcut) p = pcut; 
   e = TMath::Sqrt((double)p*(double)p + (double)m*(double)m);
   e0 = e;
   while( (i+=step) != iend+step ) {
  
     seg = GetSegment(i);
  
     VtSymMatrix dms(4);   // multiple scattering matrix
     dms.clear();
  
     dz = seg->Z()-seg0->Z();
     ptx = (*par[i-step])(2);                        // previous tx
     pty = (*par[i-step])(3);                        // previous ty
     dPb = dz*TMath::Sqrt(1.+ptx*ptx+pty*pty); // thickness of the Pb+emulsion cell in microns
     if ((design != 0) && (p > pcut))
     {
     de = EdbPhysics::DeAveragePb(p, m, TMath::Abs(eTPb*dPb));
     if (de < 0.) de = 0.;
     if (design < 0) de = -de;
     if (dz >= 0.)
         e = e - de;
     else
         e = e + de;
     if (e < m) e = m;
     pn = TMath::Sqrt((double)e*(double)e - (double)m*(double)m);
     if (pn <= pcut) pn = pcut;
     pa = 0.5*(p + pn);
     p  = pn;
     }
     else
     {
     pa = p;
     }
     teta0sq = EdbPhysics::ThetaMS2( pa, m, dPb, X0 );
     dms(0,0) = teta0sq*dz*dz/3.;
     dms(1,1) = dms(0,0);
     dms(2,2) = teta0sq;
     dms(3,3) = dms(2,2);
 //    dms(2,0) = teta0sq*TMath::Abs(dz)/2.;
     dms(2,0) = teta0sq*dz/2.;
     dms(3,1) = dms(2,0);
     dms(0,2) = dms(2,0);
     dms(1,3) = dms(2,0);
  
     pred[i-step] = new VtSqMatrix(4);        //propagation matrix for track parameters (x,y,tx,ty)
     pred[i-step]->clear();
  
     (*pred[i-step])(0,0) = 1.;
     (*pred[i-step])(1,1) = 1.;
     (*pred[i-step])(2,2) = 1.;
     (*pred[i-step])(3,3) = 1.;
     (*pred[i-step])(0,2) = dz;
     (*pred[i-step])(1,3) = dz;
  
     parpred[i] = new VtVector(4);            // prediction from seg0 to seg
     *parpred[i] = (*pred[i-step])*(*par[i-step]);
  
     covpred[i] = new VtSymMatrix(4);         // covariation matrix for prediction
     *covpred[i] = (*pred[i-step])*((*cov[i-step])*((*pred[i-step]).T()))+dms;
  
     dmeas[i] = new VtSymMatrix(4);           // original covariation  matrix for seg
     for(int k=0; k<4; k++) 
       for(int l=0; l<4; l++) (*dmeas[i])(k,l) = (seg->COV())(k,l);
  
     covpredinv[i] = new VtSymMatrix(4);
     (*covpredinv[i]) = (*covpred[i]).dsinv();
     VtSymMatrix dmeasinv(4);
     dmeasinv  = (*dmeas[i]).dsinv();
     cov[i] = new VtSymMatrix(4);
     (*cov[i]) = (*covpredinv[i]) + dmeasinv;
     (*cov[i]) = (*cov[i]).dsinv();
  
     meas[i] = new VtVector( (double)(seg->X()), 
                 (double)(seg->Y()),  
                 (double)(seg->TX()), 
                 (double)(seg->TY()) );
  
     par[i] = new VtVector(4);
     (*par[i]) = (*cov[i])*((*covpredinv[i])*(*parpred[i]) + dmeasinv*(*meas[i]));   // new parameters for seg
  
 //    chi2 += ((*par[i])-(*parpred[i]))*((*covpredinv[i])*((*par[i])-(*parpred[i]))) + 
 //      ((*par[i])-(*meas[i]))*(dmeasinv*((*par[i])-(*meas[i])));
  
     VtSymMatrix dresid(4);
     dresid = (*dmeas[i]) - (*cov[i]);
     dresid = dresid.dsinv();
  
     chi2 += ((*par[i])-(*meas[i]))*(dresid*((*par[i])-(*meas[i])));
  
     seg0 = seg;
   }
  
   Set(ID(),(float)(*par[iend])(0),(float)(*par[iend])(1),
        (float)(*par[iend])(2),(float)(*par[iend])(3),1.,Flag());
   SetZ(GetSegment(iend)->Z());
   SetPID(GetSegment(iend)->PID());
   SetCOV( (*cov[iend]).array(), 4 );
  
   //SetChi2((float)chi2);
   //SetProb( (float)TMath::Prob(chi2,nseg*4));
  
 // Smoothing
  
   double chi2p=0;
  
   pars[iend] = new VtVector(*par[iend]);
   covs[iend] = new VtSymMatrix(*cov[iend]);
   VtSymMatrix dresid(4);
   dresid = (*dmeas[iend]) - (*covs[iend]);
   dresid = dresid.dsinv();
   chi2p = ((*pars[iend])-(*meas[iend]))*(dresid*((*pars[iend])-(*meas[iend])));
  
   EdbSegP segf;
   segf.Set(ID(),(float)(*pars[iend])(0),(float)(*pars[iend])(1),
        (float)(*pars[iend])(2),(float)(*pars[iend])(3),1.,Flag());
   segf.SetZ(GetSegment(iend)->Z());
   segf.SetCOV( (*covs[iend]).array(), 4 );
   segf.SetErrorP ( SP() );
   segf.SetChi2((float)chi2p);
   segf.SetProb( (float)TMath::Prob(chi2p,4));
   segf.SetW( (float)nseg );
   segf.SetP( P() );
   segf.SetPID( GetSegment(iend)->PID() );
   segf.SetDZ(seg->DZ());
   
   AddSegmentF(new EdbSegP(segf));
  
   i=iend; 
   double DE=0.;
   EdbPhysics::DeAveragePbFastSet(P(), M());
    
   while( (i-=step) != istart-step ) {
     VtSqMatrix BackTr(4);
     BackTr = (*cov[i])*(((*pred[i]).T())*(*covpredinv[i+step]));
     pars[i] = new VtVector(4);
     covs[i] = new VtSymMatrix(4);
     (*pars[i]) = (*par[i]) + BackTr*((*pars[i+step])-(*parpred[i+step]));
     (*covs[i]) = (*cov[i]) + BackTr*(((*covs[i+step])-(*covpred[i+step]))*BackTr.T());
     dresid = (*dmeas[i]) - (*covs[i]);
     dresid = dresid.dsinv();
     chi2p = ((*pars[i])-(*meas[i]))*(dresid*((*pars[i])-(*meas[i])));
 //  chi2 += chi2p;
  
     segf.Set(ID(),(float)(*pars[i])(0),(float)(*pars[i])(1),
          (float)(*pars[i])(2),(float)(*pars[i])(3),1.,Flag());
     segf.SetZ(GetSegment(i)->Z());
     segf.SetCOV( (*covs[i]).array(), 4 );
     segf.SetErrorP ( SP() );
     segf.SetChi2((float)chi2p);
     segf.SetProb( (float)TMath::Prob(chi2p,4));
     segf.SetW( (float)nseg );
     segf.SetP( P() );
     segf.SetPID( GetSegment(i)->PID() );
     segf.SetDZ(seg->DZ());
     AddSegmentF(new EdbSegP(segf));
     dz = eTPb*TMath::Abs(GetSegment(i)->Z() - GetSegment(i+step)->Z()); 
         dPb = dz*TMath::Sqrt(1.+(*pars[i])(2)*(*pars[i])(2)+(*pars[i])(3)*(*pars[i])(3)); // thickness of the Pb+emulsion cell in microns
     DE += EdbPhysics::DeAveragePbFast(P(),M(),TMath::Abs(dPb));
   }
   SetChi2((float)chi2);
   SetProb((float)TMath::Prob(chi2,4*(nseg-1)));
   SetW( (float)nseg );
   SetDE( (float)DE );
  
 //  DEBUG
 //  printf(" e0 - e = %f, de = %f\n", e0-e, DE);
  
 // Delete matrixes and vectors
  
   delete par[istart];
   par[istart] = 0;
   delete cov[istart];
   cov[istart] = 0;
   delete meas[istart];
   meas[istart] = 0;
   delete dmeas[istart];
   dmeas[istart] = 0;
   delete pred[istart];
   pred[istart] = 0;
   delete pars[istart];
   pars[istart] = 0;
   delete covs[istart];
   covs[istart] = 0;
   i=istart; 
   while( (i+=step) != iend+step ) {
     delete pred[i];
     pred[i] = 0;
     delete parpred[i];
     parpred[i] = 0;
     delete covpred[i];
     covpred[i] = 0;
     delete covpredinv[i];
     covpredinv[i] = 0;
     delete par[i];
     par[i] = 0;
     delete cov[i];
     cov[i] = 0;
     delete meas[i];
     meas[i] = 0;
     delete dmeas[i];
     dmeas[i] = 0;
     delete pars[i];
     pars[i] = 0;
     delete covs[i];
     covs[i] = 0;
   }
   return 0;
 }

◆ GetBTEfficiency()

Double_t EdbTrackP::GetBTEfficiency ( )

 {
   // Returns Basetrack Scanning efficiency, estimated
   // by BT in the Tracks and the number of holes.
   // Formula: efficiency_per_BT = ( N()-2 ) / ( Npl()-2 ) 
   // This makes sense when having a track with 
   // at least 3 plates crossing.
   Double_t nseg=(Double_t)N();
   Double_t npl=(Double_t)Npl();
   
   if (nseg==2 && npl==2) return 1;
   Double_t BTEfficiency=(nseg-2)/(npl-2);
   
   return BTEfficiency;
 }

◆ GetSegment()

EdbSegP* EdbTrackP::GetSegment ( int i ) const

inline

200 {return (eS) ? (EdbSegP*)(eS->At(i)) : 0; }

◆ GetSegmentF()

EdbSegP* EdbTrackP::GetSegmentF ( int i ) const

inline

201 {return (eSF) ? (EdbSegP*)(eSF->At(i)) : 0;}

◆ GetSegmentFFirst()

EdbSegP* EdbTrackP::GetSegmentFFirst ( ) const

inline

197 {return (eSF) ? (EdbSegP*)(eSF->First()) : 0;}

◆ GetSegmentFirst()

EdbSegP* EdbTrackP::GetSegmentFirst ( ) const

inline

194 {return (eS) ? (EdbSegP*)(eS->First()) : 0;}

◆ GetSegmentFLast()

EdbSegP* EdbTrackP::GetSegmentFLast ( ) const

inline

198 {return (eSF) ? (EdbSegP*)(eSF->Last()) : 0;}

◆ GetSegmentLast()

EdbSegP* EdbTrackP::GetSegmentLast ( ) const

inline

195 {return (eS) ? (EdbSegP*)(eS->Last()) : 0;}

◆ GetSegmentsAid()

int EdbTrackP::GetSegmentsAid ( int & nseg ) const

 {
   int nseg = N();
   if (nseg < 2) return -1;
   if (nseg > 300) nseg = 300;
   int count[300];
   int aid[300], ai;
   int i, f = 0;
   for(i=0; i<nseg; i++)
   {
     count[i] = 0;
     aid[i] = -1;
     ai = GetSegment(i)->Aid(1);
     f = ai + (GetSegment(i)->Aid(0))*1000;
     if (f < 0) continue;
     aid[i] = ai;
     for (int j=0; j<nseg; j++)
     {
     if ( f == (GetSegment(j)->Aid(1) + (GetSegment(i)->Aid(0))*1000)) count[i]++;
     }
   }
   int cmax = 0;
   int aidmax = -1;
   for(i=0; i<nseg; i++)
   {
     if (count[i] > cmax)
     {
         cmax = count[i];
         aidmax = aid[i];
     }
   }
   nsegf = cmax;
   return aidmax;
 }

◆ GetSegmentsFlag()

int EdbTrackP::GetSegmentsFlag ( int & nseg ) const

 {
   printf(" EdbTrackP::GetSegmentsFlag: obsolete, to be deleted!  now replaced by GetSegmentsMCTrack\n");
  
   int nseg = N();
   if (nseg < 2) return -1;
   if (nseg > 300) nseg = 300;
   int count[300];
   int i, f = 0;
   for(i=0; i<nseg; i++)
   {
     count[i] = 0;
     f = GetSegment(i)->Flag();
     if (f < 0) continue;
     for (int j=0; j<nseg; j++)
     {
     if ( f == GetSegment(j)->Flag()) count[i]++;
     }
   }
   int cmax = 0;
   int flagmax = -1;
   for(i=0; i<nseg; i++)
   {
     if (count[i] > cmax)
     {
         cmax = count[i];
         flagmax = GetSegment(i)->Flag();
     }
   }
   nsegf = cmax;
   return flagmax;
 }

◆ GetSegmentsMCTrack()

int EdbTrackP::GetSegmentsMCTrack ( int & nseg ) const

 {
   // return: ID of the MC track contributed to this reconstructed track 
   //         with the maximal number of segments
   // nsegf - return number of segments originated from the selected MC track
  
   int nseg = N();
   if (nseg < 2) return -1;
   if (nseg > 300) nseg = 300;
   int count[300];
   int i, f = 0;
   for(i=0; i<nseg; i++)
   {
     count[i] = 0;
     f = GetSegment(i)->MCTrack();
     if (f < 0) continue;
     for (int j=0; j<nseg; j++)
     {
     if ( f == GetSegment(j)->MCTrack()) count[i]++;
     }
   }
   int cmax = 0;
   int mctrackmax = -1;
   for(i=0; i<nseg; i++)
   {
     if (count[i] > cmax)
     {
         cmax = count[i];
         mctrackmax = GetSegment(i)->MCTrack();
     }
   }
   nsegf = cmax;
   return mctrackmax;
 }

◆ GetSegmentWithClosestZ()

EdbSegP * EdbTrackP::GetSegmentWithClosestZ	(	float	z,
		float	dz
	)

 {
   float dzmin=dzMax;
   EdbSegP *sbest=0;
   int nseg=N();
   for(int i=0; i<nseg; i++) {
      EdbSegP *s = GetSegment(i);
      float dz = Abs(s->eZ-z);
      if( dz < dzmin ) {
        dzmin=dz;
        sbest=s;
      }
    }
   return sbest;
 }

◆ M()

Float_t EdbTrackP::M ( ) const

inline

160 {return eM;}

◆ MakePredictionTo()

float EdbTrackP::MakePredictionTo	(	Float_t	z,
		EdbSegP &	ss
	)

 {
   float dz = Zmax()-Zmin();
   const EdbSegP *tr=0;
   if     ( z <= Zmin() )      tr = TrackZmin();   //TODO: fitted - not fitted
   else if( z >= Zmax() )      tr = TrackZmax();
   else {
     for(int i=0; i<N(); i++)       {
       EdbSegP *s = GetSegment(i);
       if( Abs(s->Z()-z) < dz ) { dz = Abs(s->Z()-z); tr=s; }     // select nearest segment (TODO: correct interpolation)
     }
   }
   if(!tr) // no segments in this track: use track body
     tr = this;
   dz = Abs(tr->Z()-z);
   ss.Copy(*tr);
   ss.PropagateTo(z);
   return dz;
 }

◆ MakeSelector()

int EdbTrackP::MakeSelector	(	EdbSegP &	ss,
		bool	followZ = `true`
	)

 {
   if(N()<2) return 0;
   ss.SetCOV( GetSegment(0)->COV() );             // TODO ?
   const EdbSegP *tr;
   if (NF())
   {
     if( followZ ) tr = TrackZmax();
     else  tr = TrackZmin();
   }
   else
   {
     if( followZ ) tr = GetSegmentLast();
     else  tr = GetSegmentFirst();
   }
   ss.SetTX(tr->TX());
   ss.SetTY(tr->TY());
   ss.SetX(tr->X());
   ss.SetY(tr->Y());
   ss.SetZ(tr->Z());
   ss.SetPID(tr->PID());
  
   if( tr->PID() > GetSegment(0)->PID() )     return 1;
   if( tr->PID() > GetSegment(N()-1)->PID() ) return 1;
   return -1;
 }

◆ N()

Int_t EdbTrackP::N ( ) const

inline

182 { return (eS) ? eS->GetSize() : 0; }

◆ N0()

Int_t EdbTrackP::N0 ( ) const

inline

168 {return eN0;}

◆ NF()

Int_t EdbTrackP::NF ( ) const

inline

183 { return (eSF)? eSF->GetSize() : 0; }

◆ Npl()

Int_t EdbTrackP::Npl ( ) const

inline

176 {return eNpl;}

◆ PDG()

Int_t EdbTrackP::PDG ( ) const

inline

155 {return ePDG;}

◆ PerrDown()

Float_t EdbTrackP::PerrDown ( ) const

inline

268 {return ePerrDown;}

EdbTrackP::ePerrDown

Float_t ePerrDown

Definition: EdbPattern.h:130

◆ PerrUp()

Float_t EdbTrackP::PerrUp ( ) const

inline

267 {return ePerrUp;}

EdbTrackP::ePerrUp

Float_t ePerrUp

Definition: EdbPattern.h:129

◆ Print()

void EdbTrackP::Print ( )

 {
   int nseg=0, nsegf=0;
   nseg = N();
   nsegf = NF();
  
   printf("EdbTrackP with %d segments and %d fitted segments\n", nseg, nsegf );
   printf("particle mass = %f\n", M() );
   ((EdbSegP*)this)->Print(); 
  
   if(nseg) 
     for(int i=0; i<nseg; i++)
       ((EdbSegP*)(eS->At(i)))->Print(); 
  
 }

◆ PrintNice()

void EdbTrackP::PrintNice ( )

 {
   int nseg=0, nsegf=0;
   nseg = N();
   nsegf = NF();
  
   printf("EdbTrackP with %d segments and %d fitted segments. Estimated BT Scanning efficiency = %.02f \n", nseg, nsegf, GetBTEfficiency() );
   printf("  N  PID     ID          X             Y              Z        TX       TY     W      P      Flag     MC     Track    Chi2    Prob     Mass\n");
   printf("    %3d %8d %13.2f %13.2f %13.2f %7.4f  %7.4f %5.1f  %7.2f %7d %7d %7d  %7.4f  %7.4f  %5.3f\n",
        PID(), ID(),X(),Y(),Z(),     TX(),   TY(),  W(),  P(), Flag(), MCEvt(),   Track(), Chi2(), Prob(),   M());
  
   EdbSegP *s=0;
   if(nseg) 
     for(int i=0; i<nseg; i++) {
       s = GetSegment(i);
       printf("%3d %3d %8d %13.2f %13.2f %13.2f %7.4f  %7.4f %5.1f  %7.2f %7d %7d %7d  %7.4f  %7.4f\n",
          i, s->PID(), s->ID(),s->X(),s->Y(),s->Z(),  s->TX(),s->TY(),  s->W(),  s->P(), s->Flag(), s->MCEvt(), s->Track(),s->Chi2(),s->Prob());
     }
 }

◆ RemoveAliasSegments()

int EdbTrackP::RemoveAliasSegments ( )

 {
   int nalias=0;
   EdbSegP *s=0;
   for(int i=0; i<N(); i++) {
     s = GetSegment(i);
     if( s->Track() != ID()) { 
       nalias++;
       RemoveSegment(s);
     }
   }
   return nalias;
 }

◆ RemoveSegment()

void EdbTrackP::RemoveSegment ( EdbSegP * s )

inline

   { 
     if(!eS) return;
     eS->Remove(s);
     s->SetTrack(-1);
     SetCounters();
   }

◆ Set0()

void EdbTrackP::Set0 ( )

 {
   ((EdbSegP*)this)->Set0();
   eS=0;
   eSF=0;
   eM=0;
   eDE=0;
   ePDG=-999;
   eVTAS = 0;
   eVTAE = 0;
   eNpl=0;
   eN0=0;
   ePerrUp=0;
   ePerrDown=0;
   return;
 }

◆ SetCounters()

void EdbTrackP::SetCounters ( )

inline

164 { SetNpl(); SetN0(); }

◆ SetDE()

void EdbTrackP::SetDE ( float de )

inline

170 { eDE=de; }

◆ SetM()

void EdbTrackP::SetM ( float m )

inline

159 { eM=m; }

◆ SetN0() [1/2]

void EdbTrackP::SetN0 ( )

inline

167 { eN0 = eNpl-N(); }

◆ SetN0() [2/2]

void EdbTrackP::SetN0 ( int n0 )

inline

166 { eN0 = n0; }

◆ SetNpl() [1/2]

void EdbTrackP::SetNpl ( )

inline

175 { if(eS) eNpl = 1+TMath::Abs(GetSegment(0)->PID() - GetSegment(N()-1)->PID()); }

◆ SetNpl() [2/2]

void EdbTrackP::SetNpl ( int npl )

inline

173 { eNpl=npl; }

◆ SetOwner()

void EdbTrackP::SetOwner ( )

inline

144 { if(eS) eS->SetOwner(true); }

◆ SetPDG()

void EdbTrackP::SetPDG ( int pdg )

inline

154 { ePDG=pdg; }

◆ SetPerr()

void EdbTrackP::SetPerr	(	Float_t	perrDown,
		Float_t	perrUp
	)

 {
   ePerrUp=perrUp;
   ePerrDown=perrDown;
 }

◆ SetPerrDown()

void EdbTrackP::SetPerrDown ( Float_t perrDown )

 {
   ePerrDown=perrDown;
 }

◆ SetPerrUp()

void EdbTrackP::SetPerrUp ( Float_t perrUp )

 {
   ePerrUp=perrUp;
 }

◆ SetSegmentsP()

int EdbTrackP::SetSegmentsP ( float p )

inline

251 {for(int i=0; i<N(); i++) GetSegment(i)->SetP(p); return N();}

◆ SetSegmentsTrack() [1/2]

int EdbTrackP::SetSegmentsTrack ( )

inline

253 {return SetSegmentsTrack(ID());}

EdbTrackP::SetSegmentsTrack

int SetSegmentsTrack()

Definition: EdbPattern.h:253

◆ SetSegmentsTrack() [2/2]

int EdbTrackP::SetSegmentsTrack ( int id )

inline

252 {for(int i=0; i<N(); i++) GetSegment(i)->SetTrack(id); return N();}

◆ SubstituteSegment()

void EdbTrackP::SubstituteSegment	(	EdbSegP *	sold,
		EdbSegP *	snew
	)

inline

   { 
     if(!eS) return;
     eS->Remove(sold);
     eS->Add(snew);
     sold->SetTrack(-1);
   }

◆ TrackEnd()

const EdbSegP * EdbTrackP::TrackEnd ( ) const

 { 
   if(!N())    return (EdbSegP*)this;
   if(Dir()>0) return GetSegmentLast();
   if(Dir()<0) return GetSegmentFirst();
   return (EdbSegP*)this;
 }

◆ TrackExtremity()

EdbSegP* EdbTrackP::TrackExtremity	(	bool	zpos,
		bool	usesegpar = `false`
	)		const

inline

207 { return zpos? TrackZmin(usesegpar) : TrackZmax(usesegpar); } // 0-end, 1-start (as in vertex class)

◆ TrackStart()

const EdbSegP * EdbTrackP::TrackStart ( ) const

 { 
   if(!N())    return (EdbSegP*)this;
   if(Dir()<0) return GetSegmentLast();
   if(Dir()>0) return GetSegmentFirst();
   return (EdbSegP*)this;
 }

◆ TrackZmax()

EdbSegP* EdbTrackP::TrackZmax ( bool usesegpar = false ) const

inline

204 { if(usesegpar || (!eSF)) return GetSegmentLast(); else return GetSegmentFLast(); }

EdbTrackP::GetSegmentFLast

EdbSegP * GetSegmentFLast() const

Definition: EdbPattern.h:198

◆ TrackZmin()

EdbSegP* EdbTrackP::TrackZmin ( bool usesegpar = false ) const

inline

203 { if(usesegpar || (!eSF)) return GetSegmentFirst(); else return GetSegmentFFirst(); }

EdbTrackP::GetSegmentFFirst

EdbSegP * GetSegmentFFirst() const

Definition: EdbPattern.h:197

◆ Transform()

void EdbTrackP::Transform ( const EdbAffine2D & tr )

 {
   // apply transformation to all track elements
   ((EdbSegP*)(this))->Transform(&aff);
   for(int i=0; i<N(); i++)  GetSegment(i)->Transform(&aff);
   for(int i=0; i<NF(); i++) GetSegmentF(i)->Transform(&aff);
 }

◆ Vertex()

EdbVertex* EdbTrackP::Vertex ( int zpos )

inline

152 {return zpos? VertexS(): VertexE();}

EdbTrackP::VertexS

EdbVertex * VertexS()

Definition: EdbPattern.cxx:1284

EdbTrackP::VertexE

EdbVertex * VertexE()

Definition: EdbPattern.cxx:1291

◆ VertexE()

EdbVertex * EdbTrackP::VertexE ( )

 {
     if(eVTAE) return eVTAE->GetVertex();
     return 0;
 }

◆ VertexS()

EdbVertex * EdbTrackP::VertexS ( )

 {
     if(eVTAS) return eVTAS->GetVertex();
     return 0;
 }

◆ VTAE()

EdbVTA* EdbTrackP::VTAE ( ) const

inline

149 {return eVTAE;}

◆ VTAS()

EdbVTA* EdbTrackP::VTAS ( ) const

inline

148 {return eVTAS;}

◆ Wgrains()

float EdbTrackP::Wgrains ( ) const

 {
   float w=0.;
   int nseg=N();
   for(int i=0; i<nseg; i++)    w+=GetSegment(i)->W();
   return w;
 }

◆ Wmean()

Float_t EdbTrackP::Wmean ( ) const

 {
   int n = N();
   double wtot=0;
   for(int i=0; i<n; i++) wtot+=GetSegment(i)->W();
   wtot/=n;
   return (Float_t)wtot;
 }

◆ Zend()

Float_t EdbTrackP::Zend ( ) const

inline

216 {return TrackEnd()->Z();}

EdbTrackP::TrackEnd

const EdbSegP * TrackEnd() const

Definition: EdbPattern.cxx:1339

◆ Zmax()

Float_t EdbTrackP::Zmax ( ) const

 {
   Float_t zmax = Z(); 
   if (N() && GetSegmentLast()->Z() > zmax) zmax = GetSegmentLast()->Z();
   return zmax;
 }

◆ Zmin()

Float_t EdbTrackP::Zmin ( ) const

 {
   Float_t zmin = Z(); 
   if (N() && GetSegmentFirst()->Z() < zmin) zmin = GetSegmentFirst()->Z();
   return zmin;
 }

◆ Zstart()

Float_t EdbTrackP::Zstart ( ) const

inline

215 {return TrackStart()->Z();}

EdbTrackP::TrackStart

const EdbSegP * TrackStart() const

Definition: EdbPattern.cxx:1330

Member Data Documentation

◆ eDE

Float_t EdbTrackP::eDE

private

◆ eM

Float_t EdbTrackP::eM

private

◆ eN0

Int_t EdbTrackP::eN0

private

◆ eNpl

Int_t EdbTrackP::eNpl

private

◆ ePDG

Int_t EdbTrackP::ePDG

private

◆ ePerrDown

Float_t EdbTrackP::ePerrDown

private

◆ ePerrUp

Float_t EdbTrackP::ePerrUp

private

◆ eS

TSortedList* EdbTrackP::eS

private

◆ eSF

TSortedList* EdbTrackP::eSF

private

◆ eVTAE

EdbVTA* EdbTrackP::eVTAE

private

vertex track start is attached to

◆ eVTAS

EdbVTA* EdbTrackP::eVTAS

private

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

src/libEdr/EdbPattern.h
src/libEdr/EdbPattern.cxx

Public Member Functions

Private Attributes

Additional Inherited Members

Constructor & Destructor Documentation

◆ EdbTrackP() [1/4]

◆ EdbTrackP() [2/4]

◆ EdbTrackP() [3/4]

◆ EdbTrackP() [4/4]

◆ ~EdbTrackP()

Member Function Documentation

◆ AddSegment()

◆ AddSegmentF()

◆ AddTrack()

◆ AddVTA()

◆ CheckAliasSegments()

◆ CheckMaxGap()

◆ CHI2()

◆ CHI2F()

◆ Clear()

◆ ClearF()

◆ ClearVTA() [1/2]

◆ ClearVTA() [2/2]

◆ Copy()

◆ DE()

◆ Dir()

◆ EstimatePositionAt()

◆ FitTrack()

◆ FitTrackKFS()

◆ GetBTEfficiency()

◆ GetSegment()

◆ GetSegmentF()

◆ GetSegmentFFirst()

◆ GetSegmentFirst()

◆ GetSegmentFLast()

◆ GetSegmentLast()

◆ GetSegmentsAid()

◆ GetSegmentsFlag()

◆ GetSegmentsMCTrack()

◆ GetSegmentWithClosestZ()

◆ M()

◆ MakePredictionTo()

◆ MakeSelector()

◆ N()

◆ N0()

◆ NF()

◆ Npl()

◆ PDG()

◆ PerrDown()

◆ PerrUp()

◆ Print()

◆ PrintNice()

◆ RemoveAliasSegments()

◆ RemoveSegment()

◆ Set0()

◆ SetCounters()

◆ SetDE()

◆ SetM()

◆ SetN0() [1/2]

◆ SetN0() [2/2]

◆ SetNpl() [1/2]

◆ SetNpl() [2/2]

◆ SetOwner()

◆ SetPDG()

◆ SetPerr()

◆ SetPerrDown()

◆ SetPerrUp()

◆ SetSegmentsP()

◆ SetSegmentsTrack() [1/2]

◆ SetSegmentsTrack() [2/2]

◆ SubstituteSegment()

◆ TrackEnd()

◆ TrackExtremity()

◆ TrackStart()

◆ TrackZmax()

◆ TrackZmin()

◆ Transform()

◆ Vertex()

◆ VertexE()

◆ VertexS()

◆ VTAE()