EdbPatternsVolume Class Reference

#include <EdbPattern.h>

Inheritance diagram for EdbPatternsVolume:

Collaboration diagram for EdbPatternsVolume:

Public Member Functions
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 ()

Public Attributes
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_t	eX
Float_t	eY
Float_t	eZ
	central point More...

Constructor & Destructor Documentation

EdbPatternsVolume() [1/2]

EdbPatternsVolume::EdbPatternsVolume

(

)

{
  ePatterns   = new TObjArray();
  eTracksCell = 0;
  ePatternsCell = 0;
  Set0();
}

EdbPatternsVolume() [2/2]

EdbPatternsVolume::EdbPatternsVolume

(

EdbPatternsVolume &

pvol

)

{
  ePatterns   = new TObjArray();
  eTracksCell = 0;
  ePatternsCell = 0;
  Set0();
 
  pvol.PassProperties(*this);
  int npat,nseg;
  npat = Npatterns();
  for(int j=0; j<npat; j++) {
    nseg = GetPattern(j)->N();
    for(int i=0; i<nseg; i++ ) {
      pvol.GetPattern(j)->AddSegment( *(GetPattern(j)->GetSegment(i)) );
    }
  }
}

~EdbPatternsVolume()

EdbPatternsVolume::~EdbPatternsVolume ( )

virtual

{
  if(ePatterns) {
    ePatterns->Delete();
    delete ePatterns;
    ePatterns=0;
  }
  if(eTracksCell)   { delete eTracksCell;   eTracksCell=0; }
  if(ePatternsCell) { delete ePatternsCell; ePatternsCell=0; }
}

Member Function Documentation

AddPattern()

void EdbPatternsVolume::AddPattern

(

EdbPattern *

pat

)

{
  ePatterns->Add(pat);
}

AddPatternAt()

void EdbPatternsVolume::AddPatternAt	(	EdbPattern *	pat,
		int	id
	)

{
  if(ePatterns->GetSize()<id+1) ePatterns->Expand(id+1);
  pat->SetID(id);
  ePatterns->AddAt(pat,id);
}

Centralize() [1/2]

void EdbPatternsVolume::Centralize

(

)

find geometrical center (XY) of all patterns and set it as the center of coordinates to simplify transformations To be used before any operations on patterns

{
 
  float xc=0;
  float yc=0;
  int npat = Npatterns();
  for(int i=0; i<npat; i++ ) {
    xc += GetPattern(i)->Xmax() + GetPattern(i)->Xmin();
    yc += GetPattern(i)->Ymax() + GetPattern(i)->Ymin();
  }
  xc = xc/Npatterns()/2;
  yc = yc/Npatterns()/2;
 
  Centralize(xc,yc);
}

Centralize() [2/2]

void EdbPatternsVolume::Centralize	(	float	xc,
		float	yc
	)

{
  eX = xc;  eY=yc;
  Shift(-xc,-yc);
  float npat = Npatterns();
  for(int i=0; i<npat; i++ ) 
    GetPattern(i)->SetKeep(1,0,0,1,0,0);
}

DropCell()

void EdbPatternsVolume::DropCell

(

)

{
  int npat = Npatterns();
  for(int i=0; i<npat; i++ ) GetPattern(i)->Cell()->Drop();
}

DropCouples()

int EdbPatternsVolume::DropCouples

(

)

{
  int count=0;
  int npat=Npatterns();
  for(int i=0; i<npat; i++ )
    count += GetPattern(i)->Cell()->DropCouples(4);
  if(count) printf("%d couples are dropped in volume cells\n",count);
  return count;
}

FindComplimentsVol()

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

{
  EdbPattern *pat  = 0;
  int npat = Npatterns();
  bool p_inverse_z = (GetPattern(1)->Z() - GetPattern(0)->Z()) > 0. ? false : true ;
  int ii = 0;
  int dpat = 1;
  int pid = 0;
  if (p_inverse_z) dpat = -1;
  for (int i = 0; i<npat; i++)
  {
    ii = i;
    if (p_inverse_z) ii = npat-1-i;
    pat = GetPattern(ii);  
    if (ss.Z() < pat->Z())
    {
    pid = ii - dpat;
    if ( pid >= npat )  ss.SetPID(npat-1);
    if ( pid <  0 )     ss.SetPID(0);
    else                ss.SetPID(pid);
    break;
    }
    else if (ss.Z() == pat->Z())
    {
    ss.SetPID(ii);
    break;
    }
  }
 
  int p0 = ss.PID();
  int pend   = p0 + Dpat;
  if (pend >= npat) pend = npat - 1;
  int pstart   = p0 - Dpat;
  if (pstart < 0) pstart = 0;
 
  //arr.Clear();
  int nseg = 0;
  int n = 0;
  for(int i=pstart; i <=pend; i++ ) {
    pat = GetPattern(i);
    if(!pat)                   continue;
    n = pat->FindCompliments(ss,arr,nsig,nsigt);
    nseg += n;
  }
 
  return nseg;
}

GetPattern()

EdbPattern * EdbPatternsVolume::GetPattern

(

int

id

)

const

{
  if(Npatterns()>id) return (EdbPattern*)ePatterns->At(id);
  else return 0;
}

GetPatternByPID()

EdbPattern * EdbPatternsVolume::GetPatternByPID

(

int

pid

)

const

Return pattern having PID() == pid. If there is no such pattern, return a NULL pattern.

This is important because some codings (libShower for example). rely on getting Patterns by the PIDs.

{
  
  EdbPattern *pat=0;
    for(int i=0; i<Npatterns(); i++) {
        pat = GetPattern(i);
    if (GetPattern(i)->PID() == pid ) return pat;
    }
    
  if (gEDBDEBUGLEVEL>2) 
        if (pat == 0) cout <<  "EdbPattern* EdbPatternsVolume::GetPatternNext()   WARNING: pattern is NULL ! Check your input!" << endl;
  return NULL;
}

GetPatternByPlate()

EdbPattern * EdbPatternsVolume::GetPatternByPlate	(	int	plate,
		int	side
	)

{
  EdbPattern *p=0;
  for(int i=0; i<Npatterns(); i++) {
    p = GetPattern(i);
    if(p) if( p->Plate()==plate && p->Side()==side ) return p;
  }
  return 0;
}

GetPatternByZ()

EdbPattern * EdbPatternsVolume::GetPatternByZ	(	float	z,
		float	tolerance = 5
	)		const

EdbPattern* GetPatternByZ(float z) const;.

Return pattern having Z() == z +- tolerance(microns) due to roundings. If there is no such pattern, return a NULL pattern.

This is important because some codings (libShower for example). rely on getting Patterns by the Z. Warning: If tolerance is to big, there is not a unique solution anymore

{
  
  EdbPattern *pat=0;
    for(int i=0; i<Npatterns(); i++) {
        pat = GetPattern(i);
    if ( TMath::Abs(GetPattern(i)->Z() - z)<tolerance ) return pat;
    }
    
  if (gEDBDEBUGLEVEL>2) 
        if (pat == 0) cout <<  "EdbPattern* EdbPatternsVolume::GetPatternNext()   WARNING: pattern is NULL ! Check your input!" << endl;
  return NULL;
}

GetPatternNext()

EdbPattern * EdbPatternsVolume::GetPatternNext	(	float	z,
		int	dir
	)		const

Return next pattern in either downstream (dir=+1) (i.e. Z gets bigger) or in either upstream (dir=-1) (i.e. Z gets smaller) direction. If the last/first pattern is already given and one ask therefor for a pattern that does not exists, then return a NULL pattern.

{
  
  EdbPattern *pat=0;
  float dz=dir*99999999.;
  float zpat;
  for(int i=0; i<Npatterns(); i++) {
    zpat=GetPattern(i)->Z();
    if(dir>0) if(zpat>z) if(zpat-z<dz) {dz=zpat-z; pat=GetPattern(i);}
    if(dir<0) if(zpat<z) if(zpat-z>dz) {dz=zpat-z; pat=GetPattern(i);}
  }
  if (gEDBDEBUGLEVEL>2) 
        if (pat == 0) cout <<  "EdbPattern* EdbPatternsVolume::GetPatternNext()   WARNING: pattern is NULL ! Check your input!" << endl;
  return pat;
}

GetPatternPreceding()

EdbPattern * EdbPatternsVolume::GetPatternPreceding

(

EdbPattern *

pat

)

const

{
    return GetPatternNext(pat->Z(),-1);
}

GetPatternSucceding()

EdbPattern * EdbPatternsVolume::GetPatternSucceding

(

EdbPattern *

pat

)

const

{
    return GetPatternNext(pat->Z(),1);
}

GetPatternZLowestHighest()

EdbPattern * EdbPatternsVolume::GetPatternZLowestHighest

(

Bool_t

lowestZ = kTRUE

)

const

By default it returns the pattern with the lowest Z position. This is NOT necessarily the first pattern of the patterns volume.

{
  
  if (Npatterns()==0) {
    Log(1,"EdbPatternsVolume::GetPatternZLowestHighest","ERROR: Attempt to get Pattern, but NO patterns are in EdbPatternsVolume!");
    return 0;
  }
  if (gEDBDEBUGLEVEL>3) cout << "EdbPatternsVolume::GetPatternZLowestHighest  lowestZ = " << lowestZ << endl;
  
  EdbPattern *pat=0;
  pat=GetPattern(0);
  if (Npatterns()==1) return pat;
  float zpat0,zpat1;
  zpat0=GetPattern(0)->Z();
  zpat1=GetPattern(Npatterns()-1)->Z();
  if (gEDBDEBUGLEVEL>2) {
  cout << "EdbPatternsVolume  Pattern At Position 0    has Z = " << zpat0 << endl;
  cout << "EdbPatternsVolume  Pattern At Position last has Z = " << zpat1 << endl;
  }
  if (zpat0>zpat1) pat=GetPattern(Npatterns()-1);
  if (kTRUE==lowestZ) return pat;
  if (kFALSE==lowestZ && zpat0<zpat1) return GetPattern(Npatterns()-1);
  return GetPattern(0);
}

GetSegment()

EdbSegP * EdbPatternsVolume::GetSegment ( Long_t  vid ) const

inline

    {return GetPattern(Pid(vid))->GetSegment( Sid(vid) );}

InsertPattern()

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

---

insert new pattern using it's Z as a main criteria for the positioning

{
  EdbPattern *p  = GetPatternByPlate( pat->Plate(), pat->Side() );
  if(p)  {
    Log(1,"EdbPatternsVolume::InsertPattern",
    "ERROR: Attempt to insert new pattern for already existing plate/side z = %f znew = %f", 
    pat->Plate(), pat->Side(), p->Z(), pat->Z());
    return p;
  }
  AddPattern(pat);
  SortPatternsByZ(descendingZ);
  return pat;
}

NextPattern()

EdbPattern * EdbPatternsVolume::NextPattern	(	float	z,
		int	dir
	)		const

Return next pattern in either downstream (dir=+1) or in either upstream (dir=-1) direction.

{
  
  EdbPattern *pat=0;
  float dz=dir*99999999.;
  float zpat;
  for(int i=0; i<Npatterns(); i++) {
    zpat=GetPattern(i)->Z();
    if(dir>0) if(zpat>z) if(zpat-z<dz) {dz=zpat-z; pat=GetPattern(i);}
    if(dir<0) if(zpat<z) if(zpat-z>dz) {dz=zpat-z; pat=GetPattern(i);}
  }
  return pat;
}

Npatterns()

Int_t EdbPatternsVolume::Npatterns ( ) const

inline

                            { if(ePatterns) 
                        return ePatterns->GetEntriesFast();
                        else return 0; }

PassProperties()

void EdbPatternsVolume::PassProperties

(

EdbPatternsVolume &

pvol

)

{
  pvol.SetXYZ(eX,eY,eZ);
  EdbAffine2D a;
  EdbPattern *p=0;
 
  int npat = Npatterns();
  for(int i=0; i<npat; i++ ) {
    p = GetPattern(i);
    p->GetKeep(a);
    EdbPattern *psel = new EdbPattern( p->X(),p->Y(),p->Z() );
    psel->SetKeep( a.A11(), a.A12(), a.A21(), a.A22(), a.B1(),a.B2() );
    pvol.AddPattern(psel);
  }
  pvol.SetPatternsID();
}

Pid()

Int_t EdbPatternsVolume::Pid ( Long_t  vid ) const

inline

{ return vid/1000000; }

Print()

void EdbPatternsVolume::Print

(

)

const

{
  int npat = Npatterns();
  printf("\nEdbPatternsVolume with %d patterns\n",npat);
  EdbPattern *pat=0;
  for(int i=0; i<npat; i++ ) {
    pat = GetPattern(i);
    printf(" id=%3d pid=%3d   x:y:z =  %12.3f %12.3f %12.3f  n= %8d   ScanID = %s \tside=%d\n", 
       pat->ID(), pat->PID(), pat->X(),pat->Y(),pat->Z(),pat->N(), pat->ScanID().AsString(), pat->Side() );
  }
  printf("\n");
} 

PrintAff()

void EdbPatternsVolume::PrintAff

(

)

const

{
  EdbAffine2D a;
  int npat = Npatterns();
  for(int i=0; i<npat; i++ ) {
    GetPattern(i)->GetKeep(a);
    printf(" %3d  (%5d) Z=%13.3f ",i,GetPattern(i)->NAff(), GetPattern(i)->Z() ); a.Print();
  }
}

PrintStat() [1/2]

void EdbPatternsVolume::PrintStat

(

EdbPattern &

pat

)

const

{
} 

PrintStat() [2/2]

void EdbPatternsVolume::PrintStat

(

Option_t *

opt = ""

)

const

{
  int npat = Npatterns();
  printf("\nVolume statistics for %d patterns\n",npat);
 
  float dx,dy;
  EdbPattern *pat=0;
  printf("pat# \t segments \t dX \t\tdY \t meanDist \n");
  for(int i=0; i<npat; i++ ) {
    pat = GetPattern(i);
    if(pat) {
    dx = pat->Xmax() - pat->Xmin();
    dy = pat->Ymax()- pat->Ymin();
    printf(" %d\t %d\t %10.2f \t %10.2f \t %10.4f \n", 
       i, pat->GetN(),dx,dy, TMath::Sqrt(dx*dy/pat->GetN()) );
    }
  }
 
  npat=Npatterns();
  for(int i=0; i<npat; i++ ) {
    pat = GetPattern(i);
    if(pat) if(pat->Cell()) pat->Cell()->PrintStat();
  }
}

Set0()

void EdbPatternsVolume::Set0

(

)

{
  eX=0; eY=0; eZ=0;
  eDescendingZ=0;
}

SetPatternsID()

void EdbPatternsVolume::SetPatternsID

(

)

{
  int npat = Npatterns();
  for(int i=0; i<npat; i++ )
    GetPattern(i)->SetID(i);
}

SetXYZ()

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

inline

{ eX=x; eY=y; eZ=z; }

Shift()

void EdbPatternsVolume::Shift	(	float	x,
		float	y
	)

{
  EdbAffine2D aff;
  aff.ShiftX(x);
  aff.ShiftY(y);
 
  int npat = Npatterns();
  for(int i=0; i<npat; i++)
    GetPattern(i)->Transform(&aff);
}

Sid()

Int_t EdbPatternsVolume::Sid ( Long_t  vid ) const

inline

{ return vid%1000000; }

SortPatternsByZ()

void EdbPatternsVolume::SortPatternsByZ

(

Bool_t

descendingZ = 0

)

{
  int n = Npatterns();
  int   *ind = new int[n];
  float *z   = new float[n];
  for(int i=0; i<Npatterns(); i++) {
    ind[i] = i; 
    z[i] = GetPattern(i)->Z();
  }
  TMath::Sort(n,z,ind,descendingZ);
  TObjArray *pnew = new TObjArray(ePatterns->GetSize());
  for(int i=0; i<n; i++)     pnew->Add(GetPattern(ind[i]));
  ePatterns->Clear();
  delete ePatterns;
  ePatterns = pnew;
  delete ind;
  delete z;
}

Transform()

void EdbPatternsVolume::Transform

(

const EdbAffine2D *

aff

)

{
  int npat = Npatterns();
  for(int i=0; i<npat; i++ )  {
    GetPattern(i)->Transform(aff);
    GetPattern(i)->TransformARot(aff);
  }
}

Vid()

Long_t EdbPatternsVolume::Vid ( int  pid, int  sid  ) const

inline

{ return pid*1000000+sid; }

X()

Float_t EdbPatternsVolume::X ( ) const

inline

{return eX;}

Xmean()

Float_t EdbPatternsVolume::Xmean

(

)

{
    if (Npatterns()==0) return 0;
    EdbPattern* pat = GetPattern(0);
    Double_t s=0;
  int n=pat->N(); if(n<1) return 0;
  for(int i=0; i<n; i++) s += pat->GetSegment(i)->eX;
  s /= n;
  return (float)s;
}

Y()

Float_t EdbPatternsVolume::Y ( ) const

inline

{return eY;}

Ymean()

Float_t EdbPatternsVolume::Ymean

(

)

{
    if (Npatterns()==0) return 0;
    EdbPattern* pat = GetPattern(0);
    Double_t s=0;
  int n=pat->N(); if(n<1) return 0;
  for(int i=0; i<n; i++) s += pat->GetSegment(i)->eY;
  s /= n;
  return (float)s;
}

Z()

Float_t EdbPatternsVolume::Z ( ) const

inline

{return eZ;}

Member Data Documentation

eDescendingZ

Bool_t EdbPatternsVolume::eDescendingZ

if =0 - z increase in the pattrens array; if =1 - decrease

ePatterns

TObjArray* EdbPatternsVolume::ePatterns

collection of patterns

ePatternsCell

TIndexCell* EdbPatternsVolume::ePatternsCell

"pid:id1:chi2:id2" - all found couples

eTracksCell

TIndexCell* EdbPatternsVolume::eTracksCell

"vidt:vids" - connected segments cell

eX

Float_t EdbPatternsVolume::eX

private

eY

Float_t EdbPatternsVolume::eY

private

eZ

Float_t EdbPatternsVolume::eZ

private

central point

---

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

• /home/antonio/fedra_doxygen/src/libEdr/EdbPattern.h
• /home/antonio/fedra_doxygen/src/libEdr/EdbPattern.cxx