#include <EdbPVRec.h>

Inheritance diagram for EdbPVRec:

Collaboration diagram for EdbPVRec:

[legend]

Public Member Functions
void	AddCouple (EdbPatCouple *c)

EdbPatCouple *	AddCouple (int id1, int id2)

void	AddCouplesToTracks (EdbPatCouple *pc, TIndex2 &itracks)

void	AddCouplesToTracksM (EdbPatCouple *pc, TIndex2 &itracks)

EdbSegP *	AddSegment (EdbSegP &s)

int	AddSegments (EdbPVRec &ali)

int	AddSegments (EdbTrackP &track)

void	AddTrack (EdbTrackP *track)

void	AddVertex (EdbVertex *vtx)

int	Align (int alignFlag)

int	AlignOld (int alignFlag)

int	AlignPlates (EdbScanSet &sci, EdbScanSet &sca, const char *reportdir=0)

float	Chi2Fast (EdbSegP &s1, EdbSegP &s2)

float	Chi2Max () const

int	CollectSegment (TIndexCell ct, TIndexCell cross)

int	CollectSegment1 (TIndexCell ct, THashList cross)

int	CombTracks (int nplmin, int ngapMax, float probMin=0.01)

void	DeleteCouples ()

void	DummyCycle ()

	EdbPVRec ()
	============================================================================= More...

int	ExtractDataVolumeSeg (EdbTrackP &tr, TObjArray &arr, float binx, float bint)

int	ExtractDataVolumeSegAll (TObjArray &arr)

void	FillCell (float stepx, float stepy, float steptx, float stepty)

void	FillTracksCell ()

void	FillTracksCell1 ()

void	FillTracksCell2 ()

void	FillTracksCellFast ()

EdbSegP *	FindSegment (int PlateID, int SegmentID) const

EdbTrackP *	FindTrack (int id) const

int	FineCorrF (int ipat, EdbAffine2D &aff, EdbAffine2D &afft)

int	FineCorrShr (int ipat, float &shr)

int	FineCorrTXTY (int ipat, EdbAffine2D &aff)

int	FineCorrXY (int ipat, EdbAffine2D &aff, int flag)

int	FineCorrZ (int ipat, float &dz)

int	FineCorrZnew ()

void	FitTracks (float p=10., float mass=0.139, TObjArray *gener=0, int design=0)

EdbPatCouple *	GetCouple (int i) const

EdbPattern *	GetPatternByPID (int pid)

EdbScanCond const *	GetScanCond ()

EdbTrackP *	GetTrack (int i) const

TObjArray *	GetTracks ()

TIndexCell *	GetTracksCell () const

EdbVertex *	GetVertex (Int_t &i)

TObjArray *	GetVertices ()

int	InsertHole (const EdbSegP s1, const EdbSegP s2, int pid)

void	InsertTrack (const EdbTrackP &t)

int	Link ()

int	LinkSlow ()

int	MakeHoles (int ort)

int	MakeSummaryTracks ()

int	MakeTracks (int nsegments=2, int flag=0)

int	MergeTracks (int maxgap=2)

int	MergeTracks1 (int maxgap)

Int_t	Ncouples () const

Int_t	NSeg ()

Int_t	Ntracks () const

Int_t	Nvtx () const

void	PrintSummary ()

int	PropagateTrack (EdbTrackP &tr, bool followZ, float probMin=0.05, int ngapMax=3, int design=0)

int	PropagateTracks (int nplmax, int nplmin, float probMin=0.05, int ngapMax=3, int design=0)

void	ResetCouples ()

void	ResetTracks ()

int	SelectLongTracks (int nsegments)

void	SetBinsCheck (int nx, int ny, int ntx, int nty)

void	SetChi2Max (float chi)

void	SetCouples ()

void	SetCouplesAll ()

void	SetCouplesExclude (TArrayI &exclude)

void	SetCouplesPeriodic (int istart, int iperiod)

void	SetOffsetsMax (float ox, float oy)

void	SetScanCond (EdbScanCond *scan)

void	SetScanIDPatSeg (EdbID id)

void	SetScanIDTrackSeg (EdbID id)

void	SetSegmentErrors (EdbSegP &seg)

void	SetSegmentProbability (EdbSegP &seg)

void	SetSegmentsErrors ()

void	SetSegmentsTracks ()

float	Xmax ()

float	Xmin ()

float	Ymax ()

float	Ymin ()

	~EdbPVRec ()

Public Member Functions inherited from EdbPatternsVolume
void	AddPattern (EdbPattern *pat)

void	AddPatternAt (EdbPattern *pat, int id)

void	Centralize ()

void	Centralize (float xc, float yc)

void	DropCell ()

int	DropCouples ()

	EdbPatternsVolume ()

	EdbPatternsVolume (EdbPatternsVolume &pvol)

int	FindComplimentsVol (EdbSegP &s, TObjArray &arr, float nsig, float nsigt, int dpat)

EdbPattern *	GetPattern (int id) const

EdbPattern *	GetPatternByPID (int pid) const

EdbPattern *	GetPatternByPlate (int plate, int side)

EdbPattern *	GetPatternByZ (float z, float tolerance=5) const
	EdbPattern* GetPatternByZ(float z) const;. More...

EdbPattern *	GetPatternNext (float z, int dir) const

EdbPattern *	GetPatternPreceding (EdbPattern *pat) const

EdbPattern *	GetPatternSucceding (EdbPattern *pat) const

EdbPattern *	GetPatternZLowestHighest (Bool_t lowestZ=kTRUE) const

EdbSegP *	GetSegment (Long_t vid) const

EdbPattern *	InsertPattern (EdbPattern *pat, Bool_t descendingZ=0)

EdbPattern *	NextPattern (float z, int dir) const

Int_t	Npatterns () const

void	PassProperties (EdbPatternsVolume &pvol)

Int_t	Pid (Long_t vid) const

void	Print () const

void	PrintAff () const

void	PrintStat (EdbPattern &pat) const

void	PrintStat (Option_t *opt="") const

void	Set0 ()

void	SetPatternsID ()

void	SetXYZ (float x, float y, float z)

void	Shift (float x, float y)

Int_t	Sid (Long_t vid) const

void	SortPatternsByZ (Bool_t descendingZ=0)

void	Transform (const EdbAffine2D *aff)

Long_t	Vid (int pid, int sid) const

Float_t	X () const

Float_t	Xmean ()

Float_t	Y () const

Float_t	Ymean ()

Float_t	Z () const

virtual	~EdbPatternsVolume ()

Static Public Member Functions
static bool	AttachSeg (EdbTrackP &tr, EdbSegP *s, const float X0, const float ProbMin, float &prob)

static double	ProbeSeg (const EdbSegP s1, EdbSegP s2, const float X0=5810., const float mass=0.1396)

static double	ProbeSeg (const EdbTrackP s1, EdbSegP s2, const float X0=5810.)

static double	ProbeSeg (const EdbTrackP s1, EdbTrackP s2, const float X0=5810.)

Public Attributes
TObjArray *	eTracks

TObjArray *	eVTX
	array of vertex More...

Public Attributes inherited from EdbPatternsVolume
Bool_t	eDescendingZ
	if =0 - z increase in the pattrens array; if =1 - decrease More...

TObjArray *	ePatterns
	collection of patterns More...

TIndexCell *	ePatternsCell
	"pid:id1:chi2:id2" - all found couples More...

TIndexCell *	eTracksCell
	"vidt:vids" - connected segments cell More...

Private Attributes
float	eChi2Max

TObjArray *	ePatCouples
	patterns couples More...

EdbScanCond *	eScanCond
	scanning conditions (sigma, puls, etc) More...

TIndexCell *	eTracksCell

Long_t	eVdiff [4]
	how many ajenced bins should be taken into account More...

Constructor & Destructor Documentation

◆ EdbPVRec()

EdbPVRec::EdbPVRec ( )

=============================================================================

{
  ePatCouples = new TObjArray();
  eTracks = 0;
  eVTX    = 0;
  eScanCond = 0;
  eChi2Max=999.;
  eVdiff[0]=eVdiff[1]=eVdiff[2]=eVdiff[3]=0;
  eTracksCell = new TIndexCell();
  gROOT->GetListOfSpecials()->Add(this);
}

◆ ~EdbPVRec()

EdbPVRec::~EdbPVRec ( )

{
  
  if(ePatCouples) {
    ePatCouples->Delete();
    SafeDelete(ePatCouples);
  }
  if(eTracks) {
    eTracks->Delete();
    SafeDelete(eTracks);
  }
//  if(eVTX)    {
//    eVTX->Delete();
//    SafeDelete(eVTX);
//  }
  SafeDelete(eTracksCell);
  if (gROOT->GetListOfSpecials()->FindObject(this))
    {
      gROOT->GetListOfSpecials()->Remove(this);
    }
}

Member Function Documentation

◆ AddCouple() [1/2]

void EdbPVRec::AddCouple ( EdbPatCouple * c )

inline

177{ ePatCouples->Add(c); }

◆ AddCouple() [2/2]

EdbPatCouple * EdbPVRec::AddCouple	(	int	id1,
		int	id2
	)

{
  EdbPatCouple *c = new EdbPatCouple();
  c->SetID(id1,id2);
  ePatCouples->Add(c);
  return c;
}

◆ AddCouplesToTracks()

void EdbPVRec::AddCouplesToTracks	(	EdbPatCouple *	pc,
		TIndex2 &	itracks
	)

{
  EdbTrackP  *track = 0;
 
  EdbSegCouple *sc = 0;
  int ncpp = pc->Ncouples();
 
  Double_t *w    = new Double_t[ncpp];
 
  int ind=-1;
  int nind=itracks.GetSize();
 
  for(int ip=0; ip<ncpp; ip++) {
    sc = pc->GetSegCouple(ip);
    track=0; 
 
    if(nind)    ind = itracks.FindIndex( sc->ID1() );
    else        ind = -1;
 
    if(ind>-1)  track = (EdbTrackP*)(eTracks->At(ind));
    if(!track)  {
      track = new EdbTrackP();
      track->AddSegment( GetPattern(pc->ID1())->GetSegment(sc->ID1()) );
      AddTrack(track);
      ind = eTracks->GetLast();
    }
    track->AddSegment( GetPattern(pc->ID2())->GetSegment(sc->ID2()) );
 
    w[ip] = TIndex2::BuildValue( sc->ID2(), ind );
  }
  itracks.Set(0);
  itracks.BuildIndex(ncpp,w);
  delete[] w;
}

◆ AddCouplesToTracksM()

void EdbPVRec::AddCouplesToTracksM	(	EdbPatCouple *	pc,
		TIndex2 &	itracks
	)

merge segments into clusters

{
 
  EdbTrackP  *track = 0;
 
  EdbSegCouple *sc = 0;
  int ncpp = pc->Ncouples();
 
  Double_t *w    = new Double_t[ncpp];
 
  int ind=-1;
  int nind=itracks.GetSize();
 
  //make starting tracks: I10
  if(nind==0) {
    for(int ip=0;  ip<ncpp; ip++) {
      sc = pc->GetSegCouple(ip);
      w[ip] = TIndex2::BuildValue( sc->ID1(), ip );
    }
    itracks.Set(0);
    itracks.BuildIndex(ncpp,w);
 
    int maj0=-10, maj=0;
    for(int i=0; i<ncpp; i++) {
      maj = itracks.Major(i);
      if( maj0<maj ) {
    track = new EdbTrackP();
    AddTrack( track );
    track->SetID(eTracks->GetLast());
    maj0=maj;
      }
      itracks.SetMinor( i, eTracks->GetLast() );
    }
  }
 
  // make I12
 
  for(int ip=0; ip<ncpp; ip++) {
    sc = pc->GetSegCouple(ip);
    track=0; 
 
    ind = itracks.FindIndex( sc->ID1() );
 
    if(ind>-1)  track = (EdbTrackP*)(eTracks->At(ind));
    if(!track)  {
      track = new EdbTrackP();
      track->AddSegment( GetPattern(pc->ID1())->GetSegment(sc->ID1()) );
      AddTrack(track);
      ind = eTracks->GetLast();
      track->SetID(ind);
    }
    track->AddSegment( GetPattern(pc->ID2())->GetSegment(sc->ID2()) );
 
    w[ip] = TIndex2::BuildValue( sc->ID2(), ind );
  }
  itracks.Set(0);
  itracks.BuildIndex(ncpp,w);
  delete[] w;
 
  //merge tracks
 
  int maj0=-10, maj=0, id0=-1, id=-1;
  for(int i=0; i<ncpp; i++) {
    maj = itracks.Major(i);
    id  = itracks.Minor(i);
    track = (EdbTrackP*)(eTracks->At(id));
    if( maj0!=maj ) id0=id;
    else {
      track->SetID(id0);
      itracks.SetMinor(i, id0 );
    }
    maj0=maj;
  }
}

◆ AddSegment()

EdbSegP * EdbPVRec::AddSegment ( EdbSegP & s )

add new segment to this create and insert new pattern if needed plate, side and Z for the segment should be correctly defined Note: slow function - use for additional segments only as "manual check" etc

{
 
  EdbPattern *p  = GetPatternByPlate( s.Plate(), s.Side() );
  if(!p) {
    Log(1,"EdbPVRec::AddSegment",
    "WARNING: The pattern for plate/side %d/%d  does not found, add new one with z = %f ", 
    s.Plate(), s.Side(), s.Z() );
    p = new EdbPattern( 0., 0., s.Z() );
    p->SetID(s.PID());
    p->SetScanID( s.ScanID() );
    p->SetSide( s.Side() );
    InsertPattern(p, eDescendingZ);
  }
  return p->AddSegment(s);
}

◆ AddSegments() [1/2]

int EdbPVRec::AddSegments ( EdbPVRec & ali )

{
  // copy the segments from ali and add them to this
  int nseg=0;
  for(int i=0; i<ali.Npatterns(); i++) {
    EdbPattern *pa = GetPattern(i);
    for(int j=0; j<pa->N(); j++) {
      AddSegment(  *(pa->GetSegment(j)) );
      nseg++;
    }
  }
  Log(2,"EdbPVRec::AddSegments","%d new segments are inserted",nseg);
  return nseg;
}

◆ AddSegments() [2/2]

int EdbPVRec::AddSegments ( EdbTrackP & track )

{
  // copy the segments from track and add them to this
  int nseg=0;
  for(int i=0; i<track.N(); i++) {
    AddSegment(  *(track.GetSegment(i)) );
    nseg++;
  }
  Log(2,"EdbPVRec::AddSegments","%d new segments are inserted for using track %d",nseg, track.ID() );
  return nseg;
}

◆ AddTrack()

void EdbPVRec::AddTrack ( EdbTrackP * track )

inline

                                  {
    if (!eTracks) eTracks = new TObjArray();
    eTracks->Add(track);
  }

◆ AddVertex()

void EdbPVRec::AddVertex ( EdbVertex * vtx )

inline

                                 {
    if(!eVTX) eVTX = new TObjArray();
    eVTX->Add((TObject*)vtx);
  }

◆ Align()

int EdbPVRec::Align ( int alignFlag )

{
  if(alignFlag<10)  return AlignOld(alignFlag);
  else {
    EdbScanSet sci, sca;
    for(int i=0; i<Npatterns(); i++) {
      EdbPlateP *pl = new EdbPlateP();
      EdbPattern *p = GetPattern(i);
      pl->SetID( p->PID() );
      pl->SetZlayer( p->Z(), p->Z(), p->Z() );
      sci.eB.AddPlate(pl);
    }
    sci.MakePIDList();
    sca.Copy(sci);
    return AlignPlates( sci, sca );
  }
}

◆ AlignOld()

int EdbPVRec::AlignOld ( int alignFlag )

align patterns in volume

{
  int npat=Npatterns();
 
  TObjArray aKeep(Npatterns());  
  EdbAffine2D *a0;
 
  int i;
  for(i=0; i<npat; i++ ) {
    a0 = new EdbAffine2D();
    GetPattern(i)->GetKeep(*a0);
    aKeep[i]=a0;
  }
 
 
  SetCouples();
  EdbPatCouple *pc = 0;
  int ncp = Ncouples();
  for(i=0; i<ncp; i++ ) {
    pc = GetCouple(i);
    pc->Align(alignFlag);
  }
 
 
  EdbAffine2D a;
  npat = Npatterns();
  for(i=npat-1; i>0; i-- ) {
    GetPattern(i)->GetKeep(a);
    a0=(EdbAffine2D *)(aKeep.At(i));
    a0->Invert();
    a0->Transform(&a);
    GetPattern(i-1)->Transform(a0);
  }
 
  return npat;
}

◆ AlignPlates()

int EdbPVRec::AlignPlates	(	EdbScanSet &	sci,
		EdbScanSet &	sca,
		const char *	reportdir = `0`
	)

{
  int npat = Npatterns();
  if(npat<2) return 0;
  for(int i=0; i<npat-1; i++) {
    EdbPattern *p1 = GetPattern(i);
    EdbPattern *p2 = GetPattern(i+1);
    EdbPlateP *plate1 = sc.GetPlate(p1->PID());
    EdbPlateP *plate2 = sc.GetPlate(p2->PID());
    Log(1,"AlignPlates","\n align %d -> %d", p1->PID(), p2->PID() );
    EdbPlateP *pc = new EdbPlateP(); // "couple" to be used for the alignment
    pc->GetLayer(1)->SetID(plate1->ID());
    pc->GetLayer(2)->SetID(plate2->ID());
    float DZ = plate2->Z()-plate1->Z();
 
    gROOT->SetBatch();
    EdbPlateAlignment av;
 
    if(reportdir)
      av.InitOutputFile( Form("%6d/%2.2d_%2.2d.al.root",sc.eB.ID(),p1->PID(),p2->PID()) );
 
    av.Align( *p1, *p2 , DZ );
    p1->SetNAff( av.eNcoins );
 
    if(reportdir)
      av.CloseOutputFile();
 
    if( av.eStatus ) {
      pc->GetLayer(1)->CopyCorr( av.eCorrL[0] );
      pc->GetLayer(2)->CopyCorr( av.eCorrL[1] );
      pc->GetLayer(1)->SetZlayer( -(pc->GetLayer(1)->Zcorr()), 0, 0);
    } else pc->GetLayer(1)->SetZlayer( -DZ, 0, 0 );
 
    sca.ePC.Add(pc);
  }
  sca.eB.SetID(sca.eB.ID());
  sca.AssembleBrickFromPC();
  sca.SetAsReferencePlate( sc.eB.GetPlate(npat-1)->ID() );   // last plate is the reference one
 
  for(int i=0; i<npat; i++) {
    EdbPattern *p = GetPattern(i);
    p->Transform( sca.eB.GetPlate(i)->GetAffineXY() );
    p->SetZ( sca.eB.GetPlate(i)->Z() );
    p->SetSegmentsZ();
    p->SetSegmentsDZ(300);
  }
 
  return npat;
}

◆ AttachSeg()

bool EdbPVRec::AttachSeg	(	EdbTrackP &	tr,
		EdbSegP *	s,
		const float	X0,
		const float	ProbMin,
		float &	prob
	)

static

Return value: Prob: is Chi2 probability (area of the tail of Chi2-distribution) If we accept couples with Prob >= ProbMinP then ProbMinP is the probability to reject the good couple

The mass and momentum of the tr are used for multiple scattering estimation

{
 
  float  ds;        // distance in the media for MS estimation
  double teta0sq;
  double dz;
 
  const EdbSegP *snear=0;
  if( TMath::Abs( s->Z() - tr.TrackZmin()->Z() ) < 
      TMath::Abs( s->Z() - tr.TrackZmax()->Z() ) )  snear = tr.TrackZmin();
  else snear = tr.TrackZmax();
 
  VtVector par( (double)(snear->X()), 
        (double)(snear->Y()),  
        (double)(snear->TX()), 
        (double)(snear->TY()) );
 
  VtSymMatrix cov(4);             // covariance matrix for seg0 (measurements errors)
  for(int k=0; k<4; k++) 
    for(int l=0; l<4; l++) cov(k,l) = (snear->COV())(k,l);
 
  Double_t chi2=0.; 
 
 
  VtSymMatrix dms(4);   // multiple scattering matrix (depends on P,m)
  dms.clear();
 
  dz = s->Z()-snear->Z();
  ds = dz*TMath::Sqrt(1.+par(2)*par(2)+par(3)*par(3)); // thickness of media in microns
  teta0sq = EdbPhysics::ThetaMS2( tr.P(), tr.M(), ds, 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*dz/2.;
  dms(3,1) = dms(2,0);
  dms(0,2) = dms(2,0);
  dms(1,3) = dms(2,0);
 
  VtSqMatrix pred(4);        //propagation matrix for track parameters (x,y,tx,ty)
  pred.clear();
 
  pred(0,0) = 1.;
  pred(1,1) = 1.;
  pred(2,2) = 1.;
  pred(3,3) = 1.;
  pred(0,2) = dz;
  pred(1,3) = dz;
 
  VtVector parpred(4);            // prediction from seg0 to seg
  parpred = pred*par;
  
  VtSymMatrix covpred(4);         // covariance matrix for prediction
  covpred = pred*(cov*pred.T())+dms;
 
  VtSymMatrix dmeas(4);           // original covariance  matrix for seg2
  for(int k=0; k<4; k++) 
    for(int l=0; l<4; l++) dmeas(k,l) = (s->COV())(k,l);
  
  covpred = covpred.dsinv();
  dmeas   = dmeas.dsinv();
  cov = covpred + dmeas;
  cov = cov.dsinv();
  
  VtVector meas( (double)(s->X()), 
         (double)(s->Y()),  
         (double)(s->TX()), 
         (double)(s->TY()) );
 
  par = cov*(covpred*parpred + dmeas*meas);   // new parameters for seg
 
  chi2 = (par-parpred)*(covpred*(par-parpred)) + (par-meas)*(dmeas*(par-meas));
 
  prob = (float)TMath::Prob(chi2,4);
 
  if (prob >= ProbMinP)
  {
    EdbSegP *sfnew = new EdbSegP( tr.ID(),
                  (float)par(0),(float)par(1),(float)par(2),(float)par(3),
                  tr.W()+1.,tr.Flag() );
 
    sfnew->SetCOV( cov.array(), 4 );
    sfnew->SetChi2((float)chi2);
    sfnew->SetProb(prob);
    sfnew->SetZ(s->Z());
 
    tr.AddSegment(s);
    tr.AddSegmentF(sfnew);
 
    return true;
  }
  return false;
}

◆ Chi2Fast()

float EdbPVRec::Chi2Fast	(	EdbSegP &	s1,
		EdbSegP &	s2
	)

{
  float kSZ = 1., kSX=.5, kSY=.5; // pattern to pattern errors: TODO
 
  float tx0,ty0, stx2,sty2; //mean angle
  float w1,w2;
  float tx, ty;
  float dz = s2.Z()-s1.Z();
  float chi2=0;
 
  w1  = 1./s1.SX();  w2  = 1./s2.SX();
  tx0 = (w1*s1.TX() + w2*s2.TX())/(w1+w2);
  w1 += w2;
  if( TMath::Abs(dz)>kSZ ) {
    tx   = (s2.X()-s1.X())/dz;
    w2 = 1./((s1.SX() + s2.SX() + kSX*kSX)/dz/dz);
    tx0 = (tx0*w1 + tx*w2)/(w1+w2);
    w1 += w2;
  }
  stx2 = 1./w1;
 
  w1  = 1./s1.SY();  w2  = 1./s2.SY();
  ty0 = (w1*s1.TY() + w2*s2.TY())/(w1+w2);
  w1 += w2;
  if( TMath::Abs(dz)>kSZ ) {  
    ty   = (s2.Y()-s1.Y())/dz;
    w2 = 1./((s1.SY() + s2.SY() + kSY*kSY)/dz/dz);
    ty0 = (ty0*w1 + ty*w2)/(w1+w2);
    w1 += w2;
  }
  sty2 = 1./w1;
 
  float dx =  (s2.X() - tx0*dz/2.) - (s1.X() + tx0*dz/2.);
  float dy =  (s2.Y() - ty0*dz/2.) - (s1.Y() + ty0*dz/2.);
  float sx2 = s1.SX()+s2.SX() + stx2*dz*dz;
  float sy2 = s1.SY()+s2.SY() + sty2*dz*dz;
 
  chi2  = (s2.TX()-s1.TX())*(s2.TX()-s1.TX())/(s1.SX()+s2.SX());
  chi2 += (s2.TY()-s1.TY())*(s2.TY()-s1.TY())/(s1.SY()+s2.SY());
  chi2 += dx*dx/sx2 + dy*dy/sy2;
 
  chi2 /=4.;
  if(chi2<100) printf("%f \t%f %f \t%f %f \tchi2=%f\n",
             dz , dx,dy, s2.TX()-s1.TX(), s2.TY()-s1.TY(),chi2 );
  return chi2;
}

◆ Chi2Max()

float EdbPVRec::Chi2Max ( ) const

inline

185{ return eChi2Max; }

◆ CollectSegment()

int EdbPVRec::CollectSegment	(	TIndexCell *	ct,
		TIndexCell *	cross
	)

{
  TIndexCell *cc =0;
  int ncc =0;
  int nct = ct->N(1);
  int flag=0;
  for(int j=0; j<nct; j++) {
    cc  =  cross->Find( ct->At(j)->Value() );
    ncc = cc->N(1);
    if(!ncc) continue;
    flag++;
    for(int icc=0; icc<ncc; icc++) {
      ct->FindAdd(cc->At(icc)->Value());
    }
    cc->List()->Delete();
    if(!CollectSegment(ct,cross)) return 0;
  }
  return flag;
}

◆ CollectSegment1()

int EdbPVRec::CollectSegment1	(	TIndexCell *	ct,
		THashList *	cross
	)

{
  TIndexCell *cc =0;
  int ncc =0;
  int nct = ct->N(1);
  int flag=0;
  for(int j=0; j<nct; j++) {
    cc  =  (TIndexCell*)(cross->FindObject( ct->At(j) ));
    ncc = cc->N(1);
    if(!ncc) continue;
    flag++;
    for(int icc=0; icc<ncc; icc++) {
      ct->FindAdd(cc->At(icc)->Value());
    }
    cc->List()->Delete();
    if(!CollectSegment1(ct,cross)) return 0;
  }
  return flag;
}

◆ CombTracks()

int EdbPVRec::CombTracks	(	int	nplmin,
		int	ngapMax,
		float	probMin = `0.01`
	)

eliminate crossing&overlapping tracks with multiple segments usage discard tracks with probability < probMin

{
 
  int ntr = eTracks->GetEntries();
  Log(3,"EdbPVRec::CombTracks","Comb %d tracks, longer then %d; ngaps <= %d ..."
     ,ntr,nplmin, ngapMax );
 
  int nseg=0, nsegtot=0;
 
  // *** sort tracks by quality
 
  TIndexCell cn;  //"npl:prob:entry"
  Long_t v[3];
 
  EdbTrackP *tr=0;
  for(int i=0; i<ntr; i++) {
    tr = (EdbTrackP*)(eTracks->At(i));
    tr->SetID(i);
    tr->SetCounters();
    nsegtot += tr->SetSegmentsTrack(-1);
    v[0]= -(tr->Npl());
    v[1]= (Long_t)((1.-tr->Prob())*100);
    v[2]= i;
    cn.Add(3,v);
  }
  cn.Sort();
 
  Log(3,"EdbPVRec::CombTracks","%d tracks with %d segments for processing...",ntr,nsegtot);
 
  // *** set track ID for segments attached to
 
  TIndexCell *cp=0, *c=0;
  int nn=cn.GetEntries();
  for(int i=nn-1; i>=0; i--) {
    cp = cn.At(i);                              // tracks with fixed npl
    int np = cp->GetEntries();
    for(int ip=np-1; ip>=0; ip--) {
      c = cp->At(ip);                           // tracks with fixed Npl & Prob
      int nt = c->GetEntries();
      for(int it=0; it<nt; it++) {
    tr = (EdbTrackP*)(eTracks->At( c->At(it)->Value() ) );
    tr->SetSegmentsTrack();
      }
    }
  }
 
  // discard bad tracks with flag -10
 
  cp=0; 
  c=0;
  nn=cn.GetEntries();
  Log(3,"EdbPVRec::CombTracks","1 nn = %d",nn);
  for(int i=0; i<nn; i++) {
    cp = cn.At(i);                              // tracks with fixed npl
 
    int np = cp->GetEntries();
    Log(3,"EdbPVRec::CombTracks","1 np = %d",np);
    for(int ip=0; ip<np; ip++) {
      c = cp->At(ip);                           // tracks with fixed Npl & Prob
 
      int nt = c->GetEntries();
      Log(3,"EdbPVRec::CombTracks","1 nt = %d",nt);
      for(int it=0; it<nt; it++) {
    
        tr = (EdbTrackP*)(eTracks->At( c->At(it)->Value() ) );
        
        if(!tr) Log(1,"EdbPVRec::CombTracks","ERROR: nn:np:nt:it = %d:%d:%d     value = %d",nn,np,nt,it, c->At(it)->Value() );
 
 
        if(tr->RemoveAliasSegments()>0){
          if(tr->N()<nplmin)             tr->SetFlag(-10);
          if(tr->CheckMaxGap()>ngapMax)  tr->SetFlag(-10);
        }
 
      }
    }
  }
  Log(3,"EdbPVRec::CombTracks","2");
 
 
  // discard tracks with low probability
//   for(int i=0; i<ntr; i++) {
//     tr = GetTrack(i);
//     if(tr->Prob() < probMin) tr->SetFlag(-10);
//   }
 
  // release the segments and eliminate bad tracks from the tracks array
 
  int trind;
  EdbSegP *seg=0;
  for(int i=0; i<ntr; i++) {
    tr = GetTrack(i);
    if(tr->Flag() != -10) continue;
    nseg = tr->N();
    for (int iseg=0; iseg<nseg; iseg++) {
      seg = tr->GetSegment(iseg);
      trind = seg->Track();
      if ( trind  < 0 )   continue;                                // segment is already free
      if ( GetTrack(trind)->Flag() == -10 ) seg->SetTrack(-1);     // release segment
    }
  }
  Log(3,"EdbPVRec::CombTracks","3");
 
  for(int i=ntr-1; i>-1; i--) {
    tr = GetTrack(i);
    if(tr->Flag() != -10) continue;
    eTracks->RemoveAt(i);
    SafeDelete(tr);
  }
  eTracks->Compress();
  Log(3,"EdbPVRec::CombTracks","4");
 
 
  nsegtot = 0;
 
  ntr = eTracks->GetEntries();
  for(int i=0; i<ntr; i++) {
    tr = GetTrack(i);
    tr->SetID(i);
    nsegtot += tr->SetSegmentsTrack();
  }
 
  Log(3,"EdbPVRec::CombTracks","%d tracks with %d segments remaining",ntr,nsegtot);
  return ntr;
}

◆ DeleteCouples()

void EdbPVRec::DeleteCouples ( )

inline

180{ if(ePatCouples) ePatCouples->Delete(); }

◆ DummyCycle()

void EdbPVRec::DummyCycle ( )

{
  int npat=Npatterns();
  Log(3,"EdbPVRec::DummiCycle","npat=%d",npat);
  for(int ipat=0; ipat<npat; ipat++) {
    EdbPattern *p = GetPattern(ipat);
    int nseg=p->N();
    Log(3,"EdbPVRec::DummiCycle","pat %d, nseg= %d",ipat, nseg);
    for(int iseg=0; iseg<nseg; iseg++) {
      EdbSegP *s = p->GetSegment(iseg);
      if(s->Flag()==-999)  Log(1,"EdbPVRec::DummiCycle","jo pa");
    }
  }
}

◆ ExtractDataVolumeSeg()

int EdbPVRec::ExtractDataVolumeSeg	(	EdbTrackP &	tr,
		TObjArray &	arr,
		float	binx,
		float	bint
	)

{
  int npat = Npatterns();
 
  EdbSegP ss; // the "selector" segment 
 
  tr.MakeSelector(ss);
 
  EdbPattern *pat  = 0;
  int nseg =0;
 
  for(int i=0; i<npat; i++) {
    pat = GetPattern(i);
    if(!pat)                   continue;
    
    ss.PropagateTo(pat->Z());
 
    nseg += pat->FindCompliments(ss,arr,binx,bint);
  }
  Log(2,"EdbPVRec::ExtractDataVolumeSeg","%d segments are selected\n",nseg);
  return nseg;
}

◆ ExtractDataVolumeSegAll()

int EdbPVRec::ExtractDataVolumeSegAll ( TObjArray & arr )

{
  int npat = Npatterns();
 
  EdbPattern *pat  = 0;
  int nseg =0;
 
  for(int i=0; i<npat; i++) {
    pat = GetPattern(i);
    if(!pat)                   continue;
 
    for(int j=0; j<pat->N(); j++) {
      arr.Add(pat->GetSegment(j));
      nseg++;
    }
  }
  Log(2,"EdbPVRec::ExtractDataVolumeSegAll","%d segments are selected\n",nseg);
  return nseg;
}

◆ FillCell()

void EdbPVRec::FillCell	(	float	stepx,
		float	stepy,
		float	steptx,
		float	stepty
	)

{
  int npat=Npatterns();
  for(int i=0; i<npat; i++ ) GetPattern(i)->FillCell(stepx,stepy,steptx,stepty);
}

◆ FillTracksCell()

void EdbPVRec::FillTracksCell ( )

TODO: speed-up this algorithm

fill tracks cell "vid1:vid2" second segment is considered as leading one

{
 
 
  Log(2,"\nEdbPVRec::FillTracksCell","...");
 
  Long_t vid1,vid2;
 
  if(!eTracksCell) eTracksCell = new TIndexCell();
  TIndexCell *tracksCell = eTracksCell;  // "vid1:vid2"
  TIndexCell *cc=0;
 
  if(tracksCell) tracksCell->Drop();
 
  EdbPatCouple *pc = 0;
  EdbSegCouple *sc = 0;
 
  int ncp = Ncouples();
  int ncpp;
  for(int iv=0; iv<ncp; iv++ ) {
    pc = GetCouple(iv);
    ncpp = pc->Ncouples();
    for(int ip=0; ip<ncpp; ip++) {
      sc = pc->GetSegCouple(ip);
 
      vid1 = Vid( pc->ID1(),sc->ID1() );
      vid2 = Vid( pc->ID2(),sc->ID2() );
 
      cc=tracksCell->FindAdd(vid1);
      if(!cc->N(1)) cc->Add(vid1);
      cc->Add(vid2);
      cc->SetValue(vid2);
    }
  }
  tracksCell->Sort();
  if(gEDBDEBUGLEVEL>1) tracksCell->PrintPopulation(1);
}

◆ FillTracksCell1()

void EdbPVRec::FillTracksCell1 ( )

TODO: speed-up this algorithm

fill tracks cell "vid1:vid2" second segment is considered as leading one

TIndexCell *cross = new TIndexCell();

{
 
  Long_t vid1,vid2;
 
  TIndexCell *tracks = eTracksCell;  // "vid1:vid2"
  TIndexCell *cc=0;
  TIndexCell *cv1=0;
  TIndexCell *cv2=0;
 
  THashList  *cross = new THashList();
 
  if(tracks) tracks->Drop();
 
  EdbPatCouple *pc = 0;
  EdbSegCouple *sc = 0;
 
  int ncp = Ncouples();
  int ncpp;
  for(int iv=0; iv<ncp; iv++ ) {
    pc = GetCouple(iv);
    ncpp = pc->Ncouples();
    Log(2,"EdbPVRec::FillTracksCell1","cross: %d %d\n",iv,ncpp);
    for(int ip=0; ip<ncpp; ip++) {
      sc = pc->GetSegCouple(ip);
 
      vid1 = Vid( pc->ID1(),sc->ID1() );
      vid2 = Vid( pc->ID2(),sc->ID2() );
      cv1 = new TIndexCell(vid1);
      cv2 = new TIndexCell(vid2);
      if( !(cc=(TIndexCell*)cross->FindObject(cv1)) )  { cross->Add(cv1); cc=cv1; }
      cc->FindAdd(vid2);
      if( !(cc=(TIndexCell*)cross->FindObject(cv2)) )  { cross->Add(cv2); cc=cv2; }
      cc->FindAdd(vid1);
    }
  }
 
  TIndexCell *ct=0;
  int ncross = cross->GetSize();
  Log(2,"EdbPVRec::FillTracksCell1","ncross = %d",ncross);
  int ncc=0;
 
  for(int i=0; i<ncross; i++) {
    cc = (TIndexCell*)(cross->At(i));
    ncc = cc->N(1);
    if(!ncc)     continue;
 
    ct = tracks->FindAdd(cc->Value());
    ct->FindAdd(cc->Value());
 
    CollectSegment1(ct,cross);
  }
 
  tracks->Sort();
  tracks->PrintPopulation(1);
}

◆ FillTracksCell2()

void EdbPVRec::FillTracksCell2 ( )

TODO: speed-up this algorithm

fill tracks cell "vid1:vid2" second segment is considered as leading one

{
 
  Long_t vid1,vid2;
 
  TIndexCell *tracks = eTracksCell;  // "vid1:vid2"
  TIndexCell *cc=0;
  TIndexCell *cross = new TIndexCell();
 
  if(tracks) tracks->Drop();
 
  EdbPatCouple *pc = 0;
  EdbSegCouple *sc = 0;
 
  int ncp = Ncouples();
  int ncpp;
  for(int iv=0; iv<ncp; iv++ ) {
    pc = GetCouple(iv);
    ncpp = pc->Ncouples();
    Log(2,"EdbPVRec::FillTracksCell2","cross: %d %d\n",iv,ncpp);
    for(int ip=0; ip<ncpp; ip++) {
      sc = pc->GetSegCouple(ip);
 
      vid1 = Vid( pc->ID1(),sc->ID1() );
      vid2 = Vid( pc->ID2(),sc->ID2() );
 
      cc=cross->FindAdd(vid1);
      //      cc->FindAdd(vid1);
      cc->FindAdd(vid2);
 
      cc=cross->FindAdd(vid2);
      cc->FindAdd(vid1);
      //      cc->FindAdd(vid2);
 
    }
  }
  cross->Sort();
  if(gEDBDEBUGLEVEL>1) cross->PrintPopulation(1);
 
  TIndexCell *ct=0;
  int ncross = cross->N(1);
  Log(2,"EdbPVRec::FillTracksCell2","ncross = %d",ncross);
  int ncc=0;
 
  for(int i=0; i<ncross; i++) {
    cc = cross->At(i);
    ncc = cc->N(1); 
    if(!ncc)     continue;
 
    ct = tracks->FindAdd(cc->Value());
    ct->FindAdd(cc->Value());
 
    CollectSegment(ct,cross);
  }
 
  tracks->Sort();
  if(gEDBDEBUGLEVEL>1) tracks->PrintPopulation(1);
}

◆ FillTracksCellFast()

void EdbPVRec::FillTracksCellFast ( )

fill tracks cell "vid1:vid2" second segment is considered as leading one

{
 
  int ncp = Ncouples();
  Log(2,"EdbPVRec::FillTracksCellFast","build tracks from couples for ncp=%d ...", ncp);
  if(ncp<1)     return;
 
  SafeDelete(eTracks);
  eTracks  = new TObjArray();
 
  EdbPatCouple *pc = 0;
  TIndex2 itracks(0);
 
  for( int iv=0; iv<ncp; iv++ ) {
    pc = GetCouple(iv);
    AddCouplesToTracksM( pc , itracks );
  }
 
 
  //TODO: split&analyse tracks
 
  int nsegmax=100, nfound=0;
  TArrayI segtab(nsegmax);
  segtab.Reset();
  int nseg=0;
  int ntr = eTracks->GetEntries();
  for( int i=0; i<ntr; i++ ) {
    nseg=((EdbTrackP*)(eTracks->At(i)))->N();
    if(nseg>nsegmax-1) nseg=nsegmax;
    if(nseg>nfound) nfound=nseg;
    segtab[nseg] =  segtab[nseg]+1;
  }
 
  for(int i=0; i<nfound+1; i++) 
    Log(2,"EdbPVRec::FillTracksCellFast","%d \t tracks with  %d segments",segtab[i],i);
 
  Log(2,"EdbPVRec::FillTracksCellFast","%d tracks are found", ntr);
}

◆ FindSegment()

EdbSegP * EdbPVRec::FindSegment	(	int	PlateID,
		int	SegmentID
	)		const

{
 
  for(int i=0; i<Npatterns(); ++i) {
        EdbPattern* pat = GetPattern(i);
        if (pat->PID() != PlateID) continue;
        for(int j=0; j<pat->N(); ++j) {
            EdbSegP* seg = pat->GetSegment(j);
            if (seg->ID() == SegmentID) return seg;
        }
    }
  return 0;
}

◆ FindTrack()

EdbTrackP * EdbPVRec::FindTrack ( int id ) const

{
  for(int i=0; i<Ntracks(); i++) 
    if(GetTrack(i)->ID()==id) return GetTrack(i);
  return 0;
}

◆ FineCorrF()

int EdbPVRec::FineCorrF	(	int	ipat,
		EdbAffine2D &	aff,
		EdbAffine2D &	afft
	)

{
  if(!eTracks) return 0;
 
  float probMax=.01; // TODO
 
  int   ntr = eTracks->GetEntriesFast();
  TArrayF x(ntr) , y(ntr), x1(ntr), y1(ntr);
  TArrayF tx(ntr),ty(ntr),tx1(ntr),ty1(ntr);
 
  int itr=0;
  int nseg=0;
  EdbTrackP *track=0;
  EdbSegP   *s=0, *sf=0;
 
  for(int i=0; i<ntr; i++) {
 
    track = (EdbTrackP*)eTracks->At(i);
 
    Log(2,"EdbPVRec::FineCorrF","track->CHI2() = %f %f   prob = %f",
       track->CHI2(),track->CHI2F(),track->Prob() );
    if(track->Prob()<probMax) continue;
 
    sf=0;
    nseg = track->N();
    for(int j=0; j<nseg; j++) {
      s = track->GetSegment(j);
      if( s->PID()==ipat ) {
    sf = track->GetSegmentF(j);
    break;
      }
    }
 
    if(!sf)  continue;
 
    x1[itr]  = s->X();
    y1[itr]  = s->Y();
    tx1[itr] = s->TX();
    ty1[itr] = s->TY();
    x[itr]   = sf->X();
    y[itr]   = sf->Y();
    tx[itr]  = sf->TX();
    ty[itr]  = sf->TY();
    itr++;
  }
 
  aff.CalculateTurn( itr, x1.GetArray(),y1.GetArray(),x.GetArray(),y.GetArray() );
  GetPattern(ipat)->Transform(&aff);
 
  afft.CalculateTurn( itr,tx1.GetArray(),ty1.GetArray(),tx.GetArray(),ty.GetArray() );
  GetPattern(ipat)->TransformA(&afft);
  return itr;
}

◆ FineCorrShr()

int EdbPVRec::FineCorrShr	(	int	ipat,
		float &	shr
	)

{
  if(!eTracks) return 0;
  int   ntr = eTracks->GetEntriesFast();
  double t1;
  double t;
  double dzz=0;
  int   itr=0;
  EdbTrackP *track=0;
  EdbSegP   *seg=0;
  for(int i=0; i<ntr; i++) {
    track = (EdbTrackP*)eTracks->At(i);
    if(track->CHI2()>1.2) continue;
    t  = TMath::Sqrt( track->TX()*track->TX() + track->TY()*track->TY() );
    if(t<.1)             continue;
    if(t>.45)             continue;
    seg = track->GetSegment(ipat);
    t1 = TMath::Sqrt( seg->TX()* seg->TX() +  seg->TY()* seg->TY() );
    dzz += t1/t;
    itr++;
  }
  dzz /= itr;    // dzz is the ratio of "segment angle"/"track angle"
  shr = dzz;
 
  return itr;
}

◆ FineCorrTXTY()

int EdbPVRec::FineCorrTXTY	(	int	ipat,
		EdbAffine2D &	aff
	)

{
  if(!eTracks) return 0;
  int   ntr = eTracks->GetEntriesFast();
  float *tx  = new float[ntr];
  float *ty  = new float[ntr];
  float *tx1 = new float[ntr];
  float *ty1 = new float[ntr];
  int   itr=0;
  EdbTrackP *track=0;
  EdbSegP   *seg=0;
  for(int i=0; i<ntr; i++) {
    track = (EdbTrackP*)eTracks->At(i);
    if(track->CHI2()>1.) continue;
    seg = track->GetSegment(ipat);
    tx1[itr] = seg->TX();
    ty1[itr] = seg->TY();
    tx[itr]  = track->TX();
    ty[itr]  = track->TY();
    itr++;
  }
  aff.CalculateTurn( itr,tx1,ty1,tx,ty );
  GetPattern(ipat)->TransformA(&aff);
  delete[] tx;
  delete[] ty;
  delete[] tx1;
  delete[] ty1;
  return itr;
}

◆ FineCorrXY()

int EdbPVRec::FineCorrXY	(	int	ipat,
		EdbAffine2D &	aff,
		int	flag
	)

{
  if(!eTracks) return 0;
  int   ntr = eTracks->GetEntriesFast();
  float *x = new float[ntr];
  float *y = new float[ntr];
  float *x1 = new float[ntr];
  float *y1 = new float[ntr];
  int   itr=0;
  EdbTrackP *track=0;
  EdbSegP   *seg=0;
  for(int i=0; i<ntr; i++) {
    track = (EdbTrackP*)eTracks->At(i);
    if(track->CHI2()>1.) continue;
    seg = track->GetSegment(ipat);
    x1[itr] = seg->X();
    y1[itr] = seg->Y();
    x[itr]  = track->X() + track->TX()*(seg->Z() - track->Z());
    y[itr]  = track->Y() + track->TY()*(seg->Z() - track->Z());
    itr++;
  }
  aff.Calculate( itr,x1,y1,x,y,flag );
  GetPattern(ipat)->Transform(&aff);
  delete[] x;
  delete[] y;
  delete[] x1;
  delete[] y1;
  return itr;
}

◆ FineCorrZ()

int EdbPVRec::FineCorrZ	(	int	ipat,
		float &	dz
	)

{
  if(!eTracks) return 0;
  int   ntr = eTracks->GetEntriesFast();
  float  tx1,ty1;
  double t1;
  double t;
  double dzz=0;
  int   itr=0;
  EdbTrackP *track=0;
  EdbSegP   *seg1=0;
  EdbSegP   *seg2=0;
  for(int i=0; i<ntr; i++) {
    track = (EdbTrackP*)eTracks->At(i);
    if(track->CHI2()>1.2) continue;
    t  = TMath::Sqrt( track->TX()*track->TX() + track->TY()*track->TY() );
    if(t<.1)             continue;
    if(t>.5)             continue;
    seg1 = track->GetSegment(ipat);
    seg2 = track->GetSegment(ipat+1);
    tx1 = (seg2->X()-seg1->X())/(seg2->Z()-seg1->Z());
    ty1 = (seg2->Y()-seg1->Y())/(seg2->Z()-seg1->Z());
    t1 = TMath::Sqrt(tx1*tx1+ty1*ty1);
    dzz += t1/t;
    itr++;
  }
  dzz /= itr;    // dzz is the ratio of "position angle"/"track angle"
  dz = (GetPattern(ipat+1)->Z()-GetPattern(ipat)->Z())*dzz;
 
  return itr;
}

◆ FineCorrZnew()

int EdbPVRec::FineCorrZnew ( )

calculate z-correction for all patterns based on linked tracks of any length gaps to be ignored...

{
 
  int  nMin = 5; // minimal statistics for doing correction
  if(!eTracks) return 0;
  int   ntr  = eTracks->GetEntriesFast();
 
  if(ntr < nMin) { Log(1,"EdbPVRec::FineCorrZnew"," ntr<%d : nothing to do!", nMin ); return 0; }
 
  int   npat = Npatterns();
  float  tx1,ty1;
  double t1;
  double t;
  TArrayD dzz(npat);
  TArrayI itr(npat);
  TArrayF znew(npat);
 
  EdbTrackP *track=0;
  EdbSegP   *seg1=0;
  EdbSegP   *seg2=0;
  for(int i=0; i<ntr; i++) {
    track = (EdbTrackP*)eTracks->At(i);
    if(track->CHI2()>1.2) continue;
    t  = TMath::Sqrt( track->TX()*track->TX() + track->TY()*track->TY() );
    if(t<.1)              continue;
    if(t>.5)              continue;
 
    int nseg = track->N();
    for(int j=0; j<nseg-1; j++ )      {
      seg1 = track->GetSegment(j);
      seg2 = track->GetSegment(j+1);
      if(TMath::Abs(seg1->PID()-seg2->PID()) != 1)       continue;     // gap skipped
      int ipat = TMath::Min( seg1->PID(), seg2->PID() );
      tx1 = (seg2->X()-seg1->X())/(seg2->Z()-seg1->Z());
      ty1 = (seg2->Y()-seg1->Y())/(seg2->Z()-seg1->Z());
      t1 = TMath::Sqrt(tx1*tx1+ty1*ty1);
      dzz[ipat] = dzz[ipat] + t1/t;
      itr[ipat] = itr[ipat]+1;
    }
  }
 
  znew[npat-1] = GetPattern(npat-1)->Z();
  for(int i=npat-2; i>=0; i-- )  {
    if(itr[i]<nMin) dzz[i] = 1;        // 
    else  dzz[i] = dzz[i]/itr[i];      // dzz is the ratio of "position angle"/"track angle"
    float dz = (GetPattern(i)->Z()-GetPattern(i+1)->Z())*dzz[i];
    znew[i] = znew[i+1] + dz;
    Log(2,"EdbPVRec::FineCorrZnew","Ajust Z of pat: %3d  by %4d tracks: dz =%7.3f  Zold, Znew: %12.3f %12.3f   diff = %7.3f", 
       i, itr[i], dz, GetPattern(i)->Z(), znew[i], znew[i]-GetPattern(i)->Z() );
  }
 
  for(int i=0; i<npat-1; i++ )  {
    GetPattern(i)->SetZ(znew[i]);
    GetPattern(i)->SetSegmentsZ();
  }
 
  return 0;
}

◆ FitTracks()

void EdbPVRec::FitTracks	(	float	p = `10.`,
		float	mass = `0.139`,
		TObjArray *	gener = `0`,
		int	design = `0`
	)

measurement errors: TODO TODO: move gener logic out from EdbPVRec; i voobshe polnyi bardak v etoi funkzii

{
 
  float X0 =  GetScanCond()->RadX0();
  float pms = 0.;
  int nsegmatch = 0;
 
  int ntr = eTracks->GetEntries();
 
  if (p > 0. && mass > 0.)
    printf("fit %d tracks assuming p = %f, mass = %f and X0 = %f ...\n",
     ntr,p,mass,X0);
  else if ( p <  0. && mass > 0.)
    printf("fit %d tracks assuming MC momentum, mass = %f and X0 = %f ...\n",
     ntr,mass,X0);
  else if ( p == 0. && mass > 0.)
    printf("fit %d tracks with MS momentum, mass = %f and X0 = %f ...\n",
     ntr,mass,X0);
  else if ( p > 0. && mass < 0.)
    printf("fit %d tracks assuming p = %f, MC mass and X0 = %f ...\n",
     ntr,p,X0);
  else if ( p <  0. && mass < 0.)
    printf("fit %d tracks assuming MC momentum, MC mass and X0 = %f ...\n",
     ntr,X0);
  else if ( p == 0. && mass < 0.)
    printf("fit %d tracks with MS momentum, MC mass and X0 = %f ...\n",
     ntr,X0);
  else if ( p > 0. && mass == 0.)
    printf("fit %d tracks assuming p = %f, pre-defined mass and X0 = %f ...\n",
     ntr,p,X0);
  else if ( p <  0. && mass == 0.)
    printf("fit %d tracks assuming MC momentum, pre-defined mass and X0 = %f ...\n",
     ntr,X0);
  else if ( p == 0. && mass == 0.)
    printf("fit %d tracks with MS momentum, pre-defined mass and X0 = %f ...\n",
     ntr,X0);
 
 
  EdbMomentumEstimator tf;
  tf.eX0 = X0;
  tf.eM  = mass;
  EdbTrackP *tr = 0, *trg = 0;
  int nseg, itrg;
 
  for(int itr=0; itr<ntr; itr++) {
    tr = (EdbTrackP*)(eTracks->At(itr));
 
    tr->ClearF();
 
    nseg = tr->N();
 
    if(p>0)    tr->SetP(p);
    else if(p<0 && gener)
    {
    if ((itrg = tr->GetSegmentsMCTrack(nsegmatch)) >= 0)
    {
        trg = (EdbTrackP*)(gener->At(itrg));
        if (trg)
        {
            tr->SetP(trg->P());
        }
    }
    }
    else if (p == 0.)
    {
    if (tr->P() == 0.) 
    {
        pms = tf.P_MS(*tr);
        if      (pms < 0.05) pms = 0.05;
        else if (pms > 30.0) pms = 30.;
        tr->SetP(pms);
    }
    }
    else tr->SetP(4.);
 
    if(mass>0) tr->SetM(mass);
    else if(mass<0 && gener)
    {
    if ((itrg = tr->GetSegmentsMCTrack(nsegmatch)) >= 0)
    {
        trg = (EdbTrackP*)(gener->At(itrg));
        if (trg)
        {
            tr->SetM(trg->M());
        }
    }
    }
    else if (tr->M() == 0.) tr->SetM(0.139);
    tr->FitTrackKFS(false,X0,design);
  }
 
}

◆ GetCouple()

EdbPatCouple * EdbPVRec::GetCouple ( int i ) const

inline

                                        { if(ePatCouples) 
                               return (EdbPatCouple  *)(ePatCouples->At(i));
                               else return 0; }

◆ GetPatternByPID()

EdbPattern * EdbPVRec::GetPatternByPID ( int pid )

{
  EdbPattern *p=0;
  for(int i=0; i<Npatterns(); i++) {
    p = GetPattern(i);
    if(p) if(p->PID()==pid) return p;
  }
  return 0;
}

◆ GetScanCond()

EdbScanCond const * EdbPVRec::GetScanCond ( )

inline

172{ return eScanCond; }

◆ GetTrack()

EdbTrackP * EdbPVRec::GetTrack ( int i ) const

inline

241{return eTracks ? (EdbTrackP*)(eTracks->At(i)) : 0;}

◆ GetTracks()

TObjArray * EdbPVRec::GetTracks ( )

inline

258{return eTracks;}

◆ GetTracksCell()

TIndexCell * EdbPVRec::GetTracksCell ( ) const

inline

194{ return eTracksCell; }

◆ GetVertex()

EdbVertex * EdbPVRec::GetVertex ( Int_t & i )

inline

256{return eVTX ? (EdbVertex*)eVTX->At(i) : 0;}

EdbVertex

Definition: EdbVertex.h:69

◆ GetVertices()

TObjArray * EdbPVRec::GetVertices ( )

inline

259{return eVTX;}

◆ InsertHole()

int EdbPVRec::InsertHole	(	const EdbSegP *	s1,
		const EdbSegP *	s2,
		int	pid
	)

{
  EdbSegP s;
  EdbSegP::LinkMT(s1,s2,&s);
  s.SetFlag(-1);
  s.SetW( (s1->W()+s2->W())/2 );
  EdbPattern *pat = GetPattern(pid);
  //s.SetProbability( pat->Cond()->ProbSeg( s.TX(),s.TY(),s.W() );
  s.PropagateTo(pat->Z());
  s.SetDZ(s1->DZ());
  pat->AddSegment(s);
  return pat->N()-1;
}

◆ InsertTrack()

void EdbPVRec::InsertTrack ( const EdbTrackP & t )

{
  EdbTrackP *tr = new EdbTrackP( (EdbSegP*)(&t), t.M() );
  tr->SetTrack(t.Track());
  
  int nseg = t.N();
  for(int i=0; i<nseg; i++)
  {
    EdbSegP *s  = t.GetSegment(i);
    EdbSegP *sf = t.GetSegmentF(i);
    if(s) 
    {
      EdbPattern *pat = GetPattern( s->PID() );
      if(!pat) { 
        Log(1,"EdbPVRec::InsertTrack","no pattern with pid %d: creating new one!",s->PID()); 
        pat = new EdbPattern( 0., 0., s->Z() );
        pat->SetID(s->PID());
        pat->SetScanID(s->ScanID());
        AddPatternAt(pat,s->PID());
      }
      tr->AddSegment( pat->AddSegment(*s ) );
      tr->AddSegmentF( new EdbSegP(*sf) );
    }
  }
  tr->SetSegmentsTrack(tr->ID());
  tr->SetCounters();
    //tr1->FitTrackKFS(true);
  AddTrack(tr);
}

◆ Link()

int EdbPVRec::Link ( )

link tracks in aligned volume

{
  
  int npat=0;
  SetCouples();
 
  EdbPatCouple *pc = 0;
 
  int ncp=Ncouples();
  for(int i=0; i<ncp; i++ ) {
    DummyCycle();
    pc = GetCouple(i);
    pc->LinkFast();
    pc->CutCHI2P(eChi2Max);
    pc->SortByCHI2P();
    npat += pc->Ncouples();
  }
  Log(3,"EdbPVRec::Link","total number of linked segments = %d",npat);
  return npat;
}

◆ LinkSlow()

int EdbPVRec::LinkSlow ( )

link tracks in aligned volume

{
  int npat=0;
  SetCouples();
 
  EdbPatCouple *pc = 0;
 
  int ncp=Ncouples();
  for(int i=0; i<ncp; i++ ) {
    pc = GetCouple(i);
    pc->LinkSlow( Chi2Max() );
    npat = pc->SortByCHI2P();
  }
  Log(2,"EdbPVRec::LinkSlow"," npat= %d",npat);
  return npat;
}

◆ MakeHoles()

int EdbPVRec::MakeHoles ( int ort )

holes attached only from the one side corresponding to ort only tracks with nseg>= abs(ort) are extrapolated

{
 
  TIndexCell *ct;
  Long_t     vn=0,v0=0,v1=0,v2=0;
  int        nholes=0;
 
  int id=0,pid=0;
  EdbSegP   *s1=0, *s2=0;
  int n=0;
 
  int ntc=eTracksCell->N(1);
  for(int it=0; it<ntc; it++) {
 
    ct = eTracksCell->At(it);
    n = ct->N(1);
    if( n >= Npatterns() )       continue;  // too many   segments
    if( n < TMath::Abs(ort) )    continue;  // not enough segments
    vn = ct->At(n-1)->Value();
    v0 = ct->At(0)->Value();
    if( Pid(vn)-Pid(v0) < n-1 )  continue;  // track is not isolated
 
    if(ort<0)    {              // attach at the beginnning of the track
      if( Pid(v0) < 1 )                continue;
      v2=v0;
      v1 = ct->At(1)->Value();
      pid =  Pid(v0)-1;
    } else if(ort>0) {          // attach at the end of the track
      if( Pid(vn) > Npatterns()-2 )    continue;
      v2=vn;
      v1 = ct->At(n-2)->Value();
      pid =  Pid(vn)+1;
    }
 
    s1 = GetPattern( Pid(v1) )->GetSegment( Sid(v1) );
    s2 = GetPattern( Pid(v2) )->GetSegment( Sid(v2) );
 
    id = InsertHole( s1,s2, pid); 
    ct->Add( Vid( pid, id) );
    nholes++;
  }
  return nholes;
}

◆ MakeSummaryTracks()

int EdbPVRec::MakeSummaryTracks ( )

{
  if(!eTracks) return 0;
  int ntr = eTracks->GetEntriesFast();
  EdbTrackP *track=0;
  for(int i=0; i<ntr; i++) {
    track = (EdbTrackP*)eTracks->At(i);
    track->FitTrack();
  }
  return ntr;
}

◆ MakeTracks()

int EdbPVRec::MakeTracks	(	int	nsegments = `2`,
		int	flag = `0`
	)

extract from index_table tracks longer then nsegments and form tracks array assign the flag to the newly created tracks return the number of created tracks

{
 
  int ntr0 = 0;
  if( eTracks ) ntr0 = eTracks->GetEntries();
  else   eTracks  = new TObjArray();
 
  Log(2,"\nEdbPVRec::MakeTracks","ntr0=%d...",ntr0);
 
  int         nseg, ntr=0;
  Long_t      vid=0;
  EdbSegP    *seg=0;
  EdbTrackP  *track = 0;
  TIndexCell *ct=0;
 
  int ntc=eTracksCell->GetEntries();
  for(int it=0; it<ntc; it++) {
 
    ct = eTracksCell->At(it);
    nseg = ct->GetEntries();
    if( nseg < nsegments )             continue;
    track = new EdbTrackP(nseg);
 
    track->SetNpl( Pid(ct->At(nseg-1)->Value()) - Pid(ct->At(0)->Value()) +1 );
 
    for(int is=0; is<nseg; is++) {
      vid = ct->At(is)->Value();
      seg = GetSegment(vid);
      track->AddSegment(seg);
    }
    eTracks->Add(track);
    ntr++;
  }
 
  for(int i=ntr0; i<ntr0+ntr; i++) {
    track = GetTrack(i);
    track->SetID(i);
    track->SetFlag(flag);
    track->SetCounters();
  }
 
  Log(2,"EdbPVRec::MakeTracks","%d tracks with >= %d segments are selected",ntr, nsegments);
  return ntr;
}

◆ MergeTracks()

int EdbPVRec::MergeTracks ( int maxgap = 2 )

{
  int merged=0,m1=0;
 
  for(int i=0; i<10; i++) {
    m1 = MergeTracks1(maxgap);
    Log(2,"EdbPVRec::MergeTracks","%d tracks are merged!",  m1);
    if(m1==0)  break;
    merged += m1;
  }
 
  Log(2,"EdbPVRec::MergeTracks","Total: %d tracks are merged!",  merged);
 
  return merged;
}

◆ MergeTracks1()

int EdbPVRec::MergeTracks1 ( int maxgap )

{
  int imerged=0;
 
  /*
  float X0 = GetScanCond()->RadX0();
 
  int npat = Npatterns();
 
  TIndexCell starts,ends;              // "ist:entry"   "iend:entry"
  FillTracksStartEnd( starts, ends, 1, npat-2 );
 
  TIndexCell *ce=0, *cs=0;
  int         itre,itrs, iend;
  EdbTrackP  *tre, *trs;
  EdbSegP    *s1, *s2;
 
  float tx,ty,dz,dx,dy;
  float stx=0.015, sty=0.015, sx=6., sy=6.;
 
  for(int ie=0; ie<ends.GetEntries(); ie++)   {
    ce = ends.At(ie);
    iend = ce->Value();
 
    for(int igap=0; igap<maxgap+1; igap++) {
      cs = starts.Find(iend+igap);
      if(!cs) continue;
 
      for(int iee=0; iee<ce->GetEntries(); iee++) {
        itre = ce->At(iee)->Value();
        tre  = (EdbTrackP*)((*eTracks)[itre]);
        if(!tre)             continue;
        if(tre->Flag()==-10) continue;
        s1 = tre->GetSegmentF(tre->N()-1);
 
        for(int iss=0; iss<cs->GetEntries(); iss++) {
          itrs = cs->At(iss)->Value();
          trs  = (EdbTrackP*)((*eTracks)[itrs]);
          if(!trs)             continue;
          if(trs->Flag()==-10) continue;
          s2 = trs->GetSegmentF(0);
 
          if( TMath::Abs(s2->TX()-s1->TX()) > stx )                 continue;
          if( TMath::Abs(s2->TY()-s1->TY()) > sty )                 continue;
          dz = s2->Z()-s1->Z();
          tx = (s2->TX() + s1->TX())/2.;
          dx =  (s2->X() - tx*dz/2.) - (s1->X() + tx*dz/2.);
          if(TMath::Abs(dx) > sx+stx*TMath::Abs(dz)/2. )            continue;
          ty = (s2->TY() + s1->TY())/2.;
          dy =  (s2->Y() - ty*dz/2.) - (s1->Y() + ty*dz/2.);
          if( TMath::Abs(dy)> sy+sty*TMath::Abs(dz)/2. )            continue;
 
          //if(tre->N()+trs->N()>npat)
          printf("%f \t%f %f \t%f %f %d  %d \n",
                 dz , dx,dy,
                 s2->TX()-s1->TX(), s2->TY()-s1->TY(),
                 tre->N(),trs->N() );
 
          printf( "prob = %15.13f\n", EdbVertexRec::ProbeSeg(s1,s2, 5810., tre->M()) );
 
          tre->AddTrack(*trs);
          tre->FitTrackKFS(true,X0);
          tre->SetFlag(-10);
          tre->SetN0( tre->N0() + trs->N0() + igap-1 );
          tre->SetNpl( tre->Npl() + trs->Npl() + igap-1 );
 
          (*eTracks)[itrs]=0;    delete trs; trs = 0;
 
          imerged++;
          break;
 
        }
      }
    }
  }
 
  eTracks->Compress();
 
  */
  return imerged;
}

◆ Ncouples()

Int_t EdbPVRec::Ncouples ( ) const

inline

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

◆ NSeg()

Int_t EdbPVRec::NSeg ( )

{
  EdbPattern *p=0;
    Int_t nseg=0;
  for(int i=0; i<Npatterns(); i++) {
    p = GetPattern(i);
    nseg+=p->N();
  }
  return nseg;
}

◆ Ntracks()

Int_t EdbPVRec::Ntracks ( ) const

inline

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

◆ Nvtx()

Int_t EdbPVRec::Nvtx ( ) const

inline

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

◆ PrintSummary()

void EdbPVRec::PrintSummary ( )

Print Summary Information of relevant data of this object. Useful for debugging purposes.

{
  cout <<"EdbPVRec::PrintSummary()   Print Summary Information of relevant data of this object." << endl;
  cout <<"EdbPVRec::PrintSummary()   Useful for debugging purposes:" << endl;
  printf("%d patterns\n",Npatterns());
  printf("%d tracks\n",Ntracks());
  printf("%d vertex\n",Nvtx());
  PrintStat();
  return;
}

◆ ProbeSeg() [1/3]

double EdbPVRec::ProbeSeg	(	const EdbSegP *	s1,
		EdbSegP *	s2,
		const float	X0 = `5810.`,
		const float	mass = `0.1396`
	)

static

Return value: Prob: is Chi2 probability (area of the tail of Chi2-distribution) If we accept couples with Prob >= ProbMin then ProbMin is the probability to reject the good couple

The mass and momentum of the tr are used for multiple scattering estimation

{
 
  float  ds;        // distance in the media for MS estimation
  double teta0sq;
  double dz;
 
  VtVector par( (double)(tr->X()), 
        (double)(tr->Y()),  
        (double)(tr->TX()), 
        (double)(tr->TY()) );
 
  VtSymMatrix cov(4);             // covariance matrix for seg0 (measurements errors)
  for(int k=0; k<4; k++) 
    for(int l=0; l<4; l++) cov(k,l) = (tr->COV())(k,l);
 
  Double_t chi2=0.; 
 
 
  VtSymMatrix dms(4);   // multiple scattering matrix (depends on P,m)
  dms.clear();
 
  dz = s->Z()-tr->Z();
  ds = dz*TMath::Sqrt(1.+par(2)*par(2)+par(3)*par(3)); // thickness of media in microns
  teta0sq = EdbPhysics::ThetaMS2( tr->P(), ma, ds, 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*dz/2.;
  dms(3,1) = dms(2,0);
  dms(0,2) = dms(2,0);
  dms(1,3) = dms(2,0);
 
  VtSqMatrix pred(4);        //propagation matrix for track parameters (x,y,tx,ty)
  pred.clear();
 
  pred(0,0) = 1.;
  pred(1,1) = 1.;
  pred(2,2) = 1.;
  pred(3,3) = 1.;
  pred(0,2) = dz;
  pred(1,3) = dz;
 
  VtVector parpred(4);            // prediction from seg0 to seg
  parpred = pred*par;
  
  VtSymMatrix covpred(4);         // covariance matrix for prediction
  covpred = pred*(cov*pred.T())+dms;
 
  VtSymMatrix dmeas(4);           // original covariance  matrix for seg2
  for(int k=0; k<4; k++) 
    for(int l=0; l<4; l++) dmeas(k,l) = (s->COV())(k,l);
  
  covpred = covpred.dsinv();
  dmeas   = dmeas.dsinv();
  cov = covpred + dmeas;
  cov = cov.dsinv();
  
  VtVector meas( (double)(s->X()), 
         (double)(s->Y()),  
         (double)(s->TX()), 
         (double)(s->TY()) );
 
  par = cov*(covpred*parpred + dmeas*meas);   // new parameters for seg
 
  chi2 = (par-parpred)*(covpred*(par-parpred)) + (par-meas)*(dmeas*(par-meas));
 
  return TMath::Prob(chi2,4);
}

◆ ProbeSeg() [2/3]

double EdbPVRec::ProbeSeg	(	const EdbTrackP *	s1,
		EdbSegP *	s2,
		const float	X0 = `5810.`
	)

static

{
  return ProbeSeg( (EdbSegP*)tr, s, X0, tr->M() );
}

◆ ProbeSeg() [3/3]

double EdbPVRec::ProbeSeg	(	const EdbTrackP *	s1,
		EdbTrackP *	s2,
		const float	X0 = `5810.`
	)

static

{
  return ProbeSeg( (EdbSegP*)tr1, (EdbSegP*)tr2, X0, tr1->M() );
}

◆ PropagateTrack()

int EdbPVRec::PropagateTrack	(	EdbTrackP &	tr,
		bool	followZ,
		float	probMin = `0.05`,
		int	ngapMax = `3`,
		int	design = `0`
	)

{
  float binx=10, bint=10;
  float X0 = GetScanCond()->RadX0();
 
  EdbSegP ss; // the "selector" segment
  int step = tr.MakeSelector(ss,followZ);     // step in pid
 
  int pstart = ss.PID(), pend=0;
  if     (step>0) pend = Npatterns()-1;
  else if(step<0) pend = 0;
  else return 0;
 
  TObjArray arr;
  EdbSegP *seg=0;
  EdbSegP *segmax=0;
 
  EdbPattern *pat  = 0;
  int   nseg =0, nsegTot=0;
  int   ntr = eTracks->GetEntriesFast();
  int   ngap =0, trind=0;
  float probmax=0, prob=0;
  EdbTrackP *ttt = 0;
 
  for(int i=pstart+step; i!=pend+step; i+=step ) {
    pat = GetPattern(i);
    if(!pat)                     goto GAP;
    ss.PropagateTo(pat->Z());
    
    arr.Clear();
    nseg = pat->FindCompliments(ss,arr,binx,bint);
    if(!nseg)                   goto GAP;
 
    probmax=prob=0;
    segmax=0;
    for(int is=0; is<nseg; is++ ) {
      seg = (EdbSegP*)(arr.At(is));
      prob = ProbeSeg( &tr, seg, X0 );
      if( prob>probmax ) { probmax=prob; segmax=seg; }
    }
    if(!segmax)                  goto GAP;
    if(probmax<probMin)          goto GAP;
 
    trind= segmax->Track();
    if(trind==tr.ID()) {
      Log(1,"EdbPVRec::PropagateTrack","TRACK LOOP: %d %d",trind, tr.ID());
      goto GAP;
    }
    ttt=0;
    if( trind >= 0 && trind<ntr )    {
      ttt = ((EdbTrackP*)eTracks->At(trind));
      if(!ttt)  { Log(1,"EdbPVRec::PropagateTrack","BAD TRACK POINTER: %d\n", trind); goto GAP;};
      
      if(ttt->VertexS() || ttt->VertexE()) goto GAP;
 
      if(!(tr.VertexS()) && !(tr.VertexE()))
      {
        if(ttt->Flag()>=0) {
        if( ttt->N() > tr.N() )                                goto GAP;
        else if( segmax->Z() > (ttt->TrackZmin()->Z()+300.) && 
             segmax->Z() < (ttt->TrackZmax()->Z()-300.) )  goto GAP; // do not attach in-middle segments
        }
      }
    }
 
    if( !AttachSeg( tr, segmax , X0, probMin, probmax ))          goto GAP;
 
    if(ttt) ttt->SetFlag(-10);
 
    segmax->SetTrack(tr.ID());
    tr.MakeSelector(ss,followZ);
    nsegTot++;
    ngap =0;
    //    tr.SetFlag(tr.Flag()+1);            // to check side effects!
 
  GAP:
    if(++ngap>ngapMax) break;
  }
 
  tr.SetNpl();
  tr.SetN0();
  tr.FitTrackKFS(followZ,X0,design);
  tr.SetSegmentsTrack();
 
  return nsegTot;
}

◆ PropagateTracks()

int EdbPVRec::PropagateTracks	(	int	nplmax,
		int	nplmin,
		float	probMin = `0.05`,
		int	ngapMax = `3`,
		int	design = `0`
	)

extrapolate incomplete tracks and update them with new segments

input: nplmax - the maximal length of the track to be continued input: nplmin - the minimal length of the track to be continued

{
 
//   if (eVTX)
//   {
//     eVTX->Delete();
//     eVTX->Clear();
//   }
 
  //ClearPropagation(design);
 
  int ntr = CombTracks(nplmin, ngapMax);  // clean-up from all tracking defects TODO remove this call from here? 
 
  Log(2,"EdbPVRec::PropagateTracks"," %d tracks, selecting in range [%d : %d] plates, ngaps <= %d ..."
     ,ntr,nplmin,nplmax, ngapMax );
 
  if(ntr<1) return 0;
 
  TIndexCell cn;  //"npl:prob:entry"
  Long_t v[3];
  int nseg=0;
  EdbTrackP *tr=0;
  for(int i=0; i<ntr; i++) {
    tr = GetTrack(i);
    v[0]= -(tr->Npl());
    v[1]= (Long_t)((1.-tr->Prob())*100);
    v[2]= i;
    cn.Add(3,v);
  }
  cn.Sort();
 
  int nsegTot=0;
 
  TIndexCell *cp=0, *c=0;
  int nn=cn.GetEntries();
 
  for(int i=0; i<nn; i++) {
    cp = cn.At(i);                              // tracks with fixed npl
    if( -(cp->Value()) > nplmax )    continue;
    if( -(cp->Value()) < nplmin )    continue;
 
    int np = cp->GetEntries();
    for(int ip=0; ip<np; ip++) {
      c = cp->At(ip);                           // tracks with fixed Npl & Prob
 
      int nt = c->GetEntries();
      for(int it=0; it<nt; it++) {
    
    tr = (EdbTrackP*)(eTracks->At( c->At(it)->Value() ) );
 
    if(!tr) { 
      Log(1,"EdbPVRec::PropagateTracks","ERROR: bad track(%d) pointer!!",i);
      continue;
    }
 
    if(tr->Flag()==-10) continue;
 
    nseg = PropagateTrack(*tr, true, probMin, ngapMax, design);
    nsegTot += nseg;
 
    if(tr->Npl()>nplmax)   continue;
    if(tr->Flag()==-10)    continue;
 
    nseg = PropagateTrack(*tr, false, probMin, ngapMax, design);
    nsegTot += nseg;
 
      }
    }
  }
 
  ntr = CombTracks(nplmin, ngapMax);  // clean-up all tracking defects
 
  Log(2,"EdbPVRec::PropagateTracks","%d segments are attached after propagation",nsegTot);
  return nsegTot;
}

◆ ResetCouples()

void EdbPVRec::ResetCouples ( )

{
  EdbPatCouple *pc = 0;
  int ncp=Ncouples();
  for(int i=0; i<ncp; i++ ) {
    pc = GetCouple(i);
    pc->ClearSegCouples();
    pc->SetPat1( GetPattern(pc->ID1()) );
    pc->SetPat2( GetPattern(pc->ID2()) );
  }
}

◆ ResetTracks()

void EdbPVRec::ResetTracks ( )

{
  for(int i=0; i<Npatterns(); i++ ) {
    EdbPattern *p =  GetPattern(i);
    if(!p) continue;
    for(int j=0; j<p->N(); j++ ) p->GetSegment(j)->SetTrack(-1);
  }
  SafeDelete(eTracks);
  SafeDelete(eTracksCell);
}

◆ SelectLongTracks()

int EdbPVRec::SelectLongTracks ( int nsegments )

{
  int ntr=0;
  if(!eTracksCell) return ntr;
  if(nsegments<2) return ntr;
  SafeDelete(eTracks);
  eTracks = new TObjArray();
 
  EdbTrackP  *track=0;
  EdbSegP    *seg=0;
 
  ResetCouples();
  EdbPatCouple *pc=0;
  TIndexCell   *ct=0;
  Long_t vid1=0,vid2=0;
  
  int ntc, nct; 
 
  ntc = eTracksCell->GetEntries();
  for(int it=0; it<ntc; it++) {
 
    ct = eTracksCell->At(it);
    if( ct->N() < nsegments )     continue;
    track = new EdbTrackP();
    track->SetID( ct->Value() );
 
    nct = ct->GetEntries();
    int is;
    for(is=0; is<nct-1; is++) {
      vid1 = ct->At(is)->Value();
      vid2 = ct->At(is+1)->Value();
      pc = GetCouple(Pid(vid1));              //TODO: depends on cp sequence
      pc->AddSegCouple( Sid(vid1), Sid(vid2) );
    }
 
    for(is=0; is<nct; is++) {
      vid1 = ct->At(is)->Value();
      seg = GetPattern(Pid(vid1))->GetSegment(Sid(vid1));
      //seg->SetPID(Pid(vid1));
      track->AddSegment(seg);
    }
 
    ntr++;
    eTracks->Add(track);
  }
 
  Log(2,"EdbPVRec::SelectLongTracks","%d tracks with >= %d segments are selected\n",ntr, nsegments);
  return ntr; 
}

◆ SetBinsCheck()

void EdbPVRec::SetBinsCheck	(	int	nx,
		int	ny,
		int	ntx,
		int	nty
	)

inline

175 { eVdiff[0]=nx; eVdiff[1]=ny; eVdiff[2]=ntx; eVdiff[3]=nty; }

◆ SetChi2Max()

void EdbPVRec::SetChi2Max ( float chi )

inline

186{ eChi2Max=chi; }

◆ SetCouples()

void EdbPVRec::SetCouples ( )

using already setted ID's of couples attach the patterns

{
 
  EdbPatCouple *pc = 0;
  int ncp=Ncouples();
  for(int i=0; i<ncp; i++ ) {
    pc = GetCouple(i);
    pc->SetPat1( GetPattern(pc->ID1()) );
    pc->SetPat2( GetPattern(pc->ID2()) );
 
    pc->SetCHI2mode(GetScanCond()->Chi2Mode());
  }
}

◆ SetCouplesAll()

void EdbPVRec::SetCouplesAll ( )

form couples array for all available patterns ID's

{
  SetCouplesPeriodic(0,1);
}

◆ SetCouplesExclude()

void EdbPVRec::SetCouplesExclude ( TArrayI & exclude )

by Alessandra Pastore

TArray exclude[npat]={0,1,1,0,...,0} where

      0 = plate to be excluded from the volume pattern;

      1 = plate to be included into the volume pattern

{
 
  DeleteCouples();
  EdbPatCouple *pc = 0;
  int npat = Npatterns();
 
  for(int i=0; i<npat; i++ ) GetPattern(i)->SetSegmentsPID();
  for(int i=0; i<npat-1; i++) {
    if(exclude[i]==0)    continue;
    for(int j=i+1; j<npat; j++) {
      if(exclude[j]==0) continue;
 
      pc = new EdbPatCouple();
      pc->SetID(i,j);
      pc->SetCond(eScanCond);
      pc->SetOffset(0,0,0,0);
      pc->SetSigma(1,1,.003,.003);
      AddCouple(pc);
      break;
    }
  }
 
  SetCouples();
}

◆ SetCouplesPeriodic()

void EdbPVRec::SetCouplesPeriodic	(	int	istart,
		int	iperiod
	)

istart: start from pattern iperiod: distance between patterns

{
 
  DeleteCouples();
  EdbPatCouple *pc = 0;
  int npat=Npatterns();
 
  if( istart<0 || istart>=npat-iperiod ) return;
 
  int ifirst=0; 
  for(int i=0; i<npat; i++ ) {if(GetPattern(i)) ifirst=i; break;}
  for(int i=ifirst; i<npat; i++ ) 
    if(GetPattern(i)) GetPattern(i)->SetSegmentsPID();
  if(ifirst<istart) istart=ifirst;
  for(int i=istart; i<npat-iperiod; i+=iperiod ) {
    pc = new EdbPatCouple();
    pc->SetID(i,i+iperiod);
    pc->SetCond(eScanCond);
    pc->SetOffset(0,0,0,0);
    pc->SetSigma(1,1,.003,.003);       //TODO: organise this sigmas
    AddCouple(pc);
  }
  SetCouples();
}

◆ SetOffsetsMax()

void EdbPVRec::SetOffsetsMax	(	float	ox,
		float	oy
	)

{
  int ncp=Ncouples();
  for(int i=0; i<ncp; i++ ) {
    GetCouple(i)->SetOffsetsMax(ox,oy);
  }
}

◆ SetScanCond()

void EdbPVRec::SetScanCond ( EdbScanCond * scan )

inline

171{ eScanCond=scan; }

scan

EdbScanCond * scan

Definition: RecDispNU.C:117

◆ SetScanIDPatSeg()

void EdbPVRec::SetScanIDPatSeg ( EdbID id )

set eBrick,eMajor and eMinor for all segments of all volume patterns leave ePlate as is

{
  for(int i=0; i<Npatterns(); i++) {
    EdbPattern *p = GetPattern(i);
    for(int j=0; j<p->N(); j++) {
      EdbSegP *s = p->GetSegment(j);
      id.ePlate = s->Plate();
      s->SetScanID(id);
    }
  }
}

◆ SetScanIDTrackSeg()

void EdbPVRec::SetScanIDTrackSeg ( EdbID id )

set eBrick,eMajor and eMinor for all segments of all volume patterns leave ePlate as is

{
  for(int i=0; i<Ntracks(); i++) {
    EdbTrackP *t = GetTrack(i);
    for(int j=0; j<t->N(); j++) {
      EdbSegP *s = t->GetSegment(j);
      id.ePlate = s->Plate();
      s->SetScanID(id);
    }
  }
}

◆ SetSegmentErrors()

void EdbPVRec::SetSegmentErrors ( EdbSegP & seg )

segment errors are depends on the scanning conditions and segment parameters (angles). Puls height is represents segments probability (not accuracy) and should be taken into account separately

{
 
  float sx  = GetScanCond()->SigmaX( seg.TX() );
  float sy  = GetScanCond()->SigmaY( seg.TY() );
  float sz  = GetScanCond()->SigmaZ( seg.TX(), seg.TY() );
  float stx = GetScanCond()->SigmaTX( seg.TX() );
  float sty = GetScanCond()->SigmaTY( seg.TY() );
 
  seg.SetErrors(sx*sx,sy*sy,sz*sz,stx*stx,sty*sty);
}

◆ SetSegmentProbability()

void EdbPVRec::SetSegmentProbability ( EdbSegP & seg )

segment probability is depends on: puls height signal puls distribution noise puls distribution angles

{
 
  seg.SetProbability( GetScanCond()->ProbSeg(seg.TX(), seg.TY(), seg.W()) );
 
}

◆ SetSegmentsErrors()

void EdbPVRec::SetSegmentsErrors ( )

{
  if(!GetScanCond()) {
    Log(1,"EdbPVRec::SetSegmentsErrors","ERROR: ScanCond didn't set!!!");
    return;
  }
  EdbPattern *pat;
  EdbSegP    *seg;
  int npat =Npatterns();
  int nseg=0;
  for(int i=0; i<npat; i++ ) {
    pat = GetPattern(i);
    if(!pat) continue;
    nseg = pat->N();
    for(int j=0; j<nseg; j++ ) {
      seg = pat->GetSegment(j);      
      SetSegmentErrors( *seg );
      SetSegmentProbability( *seg );
    }
  }
}

◆ SetSegmentsTracks()

void EdbPVRec::SetSegmentsTracks ( )

{
  EdbTrackP *tr=0;
  int ntr = Ntracks();
  for(int i=0; i<ntr; i++) {
    tr = GetTrack(i);
    tr->SetID(i);
    if(tr->Flag()<0) continue;
    tr->SetSegmentsTrack();
  }
}

◆ Xmax()

float EdbPVRec::Xmax ( )

{
  int npat=Npatterns();    if(npat<1) return 0;
  float xmax=GetPattern(0)->Xmax();
  for(int i=1; i<npat; i++ ) {
    float max = GetPattern(i)->Xmax();
    if(max>xmax) xmax=max;
  }
  return xmax;
}

◆ Xmin()

float EdbPVRec::Xmin ( )

{
  int npat=Npatterns();    if(npat<1) return 0;
  float xmin=GetPattern(0)->Xmin();
  for(int i=1; i<npat; i++ ) {
    float min = GetPattern(i)->Xmin();
    if(min<xmin) xmin=min;
  }
  return xmin;
}

◆ Ymax()

float EdbPVRec::Ymax ( )

{
  int npat=Npatterns();    if(npat<1) return 0;
  float ymax=GetPattern(0)->Ymax();
  for(int i=1; i<npat; i++ ) {
    float max = GetPattern(i)->Ymax();
    if(max>ymax) ymax=max;
  }
  return ymax;
}

◆ Ymin()

float EdbPVRec::Ymin ( )

{
  int npat=Npatterns();    if(npat<1) return 0;
  float ymin=GetPattern(0)->Ymin();
  for(int i=1; i<npat; i++ ) {
    float min = GetPattern(i)->Ymin();
    if(min<ymin) ymin=min;
  }
  return ymin;
}

Member Data Documentation

◆ eChi2Max

float EdbPVRec::eChi2Max

private

◆ ePatCouples

TObjArray* EdbPVRec::ePatCouples

private

patterns couples

◆ eScanCond

EdbScanCond* EdbPVRec::eScanCond

private

scanning conditions (sigma, puls, etc)

◆ eTracks

TObjArray* EdbPVRec::eTracks

◆ eTracksCell

TIndexCell* EdbPVRec::eTracksCell

private

◆ eVdiff

Long_t EdbPVRec::eVdiff[4]

private

how many ajenced bins should be taken into account

◆ eVTX

TObjArray* EdbPVRec::eVTX

array of vertex

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

/home/antonio/fedra_doxygen/src/libEdr/EdbPVRec.h
/home/antonio/fedra_doxygen/src/libEdr/EdbPVRec.cxx

Public Member Functions

Static Public Member Functions

Public Attributes

Private Attributes

Constructor & Destructor Documentation

◆ EdbPVRec()

◆ ~EdbPVRec()

Member Function Documentation

◆ AddCouple() [1/2]

◆ AddCouple() [2/2]

◆ AddCouplesToTracks()

◆ AddCouplesToTracksM()

◆ AddSegment()

◆ AddSegments() [1/2]

◆ AddSegments() [2/2]

◆ AddTrack()

◆ AddVertex()

◆ Align()

◆ AlignOld()

◆ AlignPlates()

◆ AttachSeg()

◆ Chi2Fast()

◆ Chi2Max()

◆ CollectSegment()

◆ CollectSegment1()

◆ CombTracks()

◆ DeleteCouples()

◆ DummyCycle()

◆ ExtractDataVolumeSeg()

◆ ExtractDataVolumeSegAll()

◆ FillCell()

◆ FillTracksCell()

◆ FillTracksCell1()

◆ FillTracksCell2()

◆ FillTracksCellFast()

◆ FindSegment()

◆ FindTrack()

◆ FineCorrF()

◆ FineCorrShr()

◆ FineCorrTXTY()

◆ FineCorrXY()

◆ FineCorrZ()

◆ FineCorrZnew()

◆ FitTracks()

◆ GetCouple()

◆ GetPatternByPID()

◆ GetScanCond()

◆ GetTrack()

◆ GetTracks()

◆ GetTracksCell()

◆ GetVertex()

◆ GetVertices()

◆ InsertHole()

◆ InsertTrack()

◆ Link()

◆ LinkSlow()

◆ MakeHoles()

◆ MakeSummaryTracks()

◆ MakeTracks()

◆ MergeTracks()

◆ MergeTracks1()

◆ Ncouples()

◆ NSeg()

◆ Ntracks()

◆ Nvtx()

◆ PrintSummary()

◆ ProbeSeg() [1/3]

◆ ProbeSeg() [2/3]

◆ ProbeSeg() [3/3]

◆ PropagateTrack()

◆ PropagateTracks()

◆ ResetCouples()

◆ ResetTracks()

◆ SelectLongTracks()

◆ SetBinsCheck()

◆ SetChi2Max()

◆ SetCouples()

◆ SetCouplesAll()

◆ SetCouplesExclude()

◆ SetCouplesPeriodic()