PndTrkCluster Class Reference

#include <PndTrkCluster.h>

Inheritance diagram for PndTrkCluster:

Public Member Functions
	PndTrkCluster ()
	PndTrkCluster (const PndTrkCluster &cluster)
	~PndTrkCluster ()
PndTrkCluster &	operator= (const PndTrkCluster &cluster)
Bool_t	operator== (const PndTrkCluster cluster) const
void	AddHit (PndTrkHit *hit)
void	AddHit (PndTrkHit hit)
void	DeleteHit (PndTrkHit *hit)
void	DeleteHitAndCompress (PndTrkHit *hit)
void	DeleteHit (Int_t index)
void	DeleteHitAndCompress (Int_t index)
void	DeleteHits (std::vector< int > todelete)
void	DeleteAllHits ()
void	SetIRegion (int iregion)
PndTrkHit *	GetHit (int index)
PndTrkHit *	GetPreviousHit (int index)
PndTrkHit *	GetNextHit (int index)
Int_t	GetNofHits ()
Int_t	GetIRegion ()
Double_t	GetMinimumXYDistanceFromHit (PndTrkHit *hit)
PndTrkHit *	SearchHit (PndTrkHit *hit)
void	Print ()
void	PrintList ()
void	Draw (Color_t color=kBlack)
void	LightUp ()
Bool_t	DoesContain (PndTrkHit *hit)
Bool_t	IsSimilarTo (PndTrkCluster *cluster2)
Int_t	NofSharedHits (PndTrkCluster *cluster2)
Bool_t	SharedAt (PndTrkCluster *cluster2, double limit)
int	MergeTo (PndTrkCluster *cluster2)
PndTrkCluster	GetMvdStripHitList ()
PndTrkCluster	GetMvdPixelHitList ()
PndTrkCluster	GetMvdHitList ()
PndTrkCluster	GetSttParallelHitList ()
PndTrkCluster	GetSttSkewHitList ()
PndTrkCluster	GetSttHitList ()
Bool_t	FindExtremitiesFrom (TVector3 frompoint, PndTrkHit &firstextremity, PndTrkHit &secondextremity)
Bool_t	CheckClusterAgainsV (TVector3 frompoint, PndTrkHit *firstextremity, PndTrkHit *secondextremity)
Bool_t	ComputeCircle (TVector3 v1, TVector3 v2, TVector3 v3, double &x0, double &y0, double &R)
PndTrkHit *	GetPocaTo (TVector3 frompoint)
Bool_t	SplitAtHit (PndTrkHit *athit, PndTrkCluster &cluster1, PndTrkCluster &cluster2)
Bool_t	SplitV (PndTrkHit *athit, PndTrkHit *firstextremity, PndTrkHit *secondextremity, PndTrkCluster &cluster1, PndTrkCluster &cluster2)
void	SortFromHit (PndTrkHit *firstextremity, TString criterion)
void	Sort ()
void	ReverseSort ()
Bool_t	IsSorted ()
void	AddCluster (PndTrkCluster *cluster)
void	AddClusterAndSortFrom (PndTrkCluster *cluster, TVector3 frompoint, TString criterion)
void	Replace (PndTrkHit *hit)
void	Clear (Option_t *="")

Protected Member Functions
	ClassDef (PndTrkCluster, 1)

Protected Attributes
TVector3	fFromPoint
Int_t	fIRegion
TClonesArray	fHitList

Friends
Bool_t	SorterFunction (PndTrkHit *hit1, PndTrkHit *hit2)

Detailed Description

Definition at line 20 of file PndTrkCluster.h.

Constructor & Destructor Documentation

PndTrkCluster::PndTrkCluster

(

)

Definition at line 32 of file PndTrkCluster.cxx.

                             : fFromPoint(0., 0., 0.), fIRegion(-1), fHitList(TClonesArray("PndTrkHit", 10000)) {
} 

PndTrkCluster::PndTrkCluster

(

const PndTrkCluster &

cluster

)

Definition at line 40 of file PndTrkCluster.cxx.

                                                         : TObject(cluster), fFromPoint(0., 0., 0.), fIRegion(-1), fHitList(TClonesArray("PndTrkHit", 10000)) {
  *this = cluster;
}

PndTrkCluster::~PndTrkCluster

(

)

Definition at line 44 of file PndTrkCluster.cxx.

References fHitList.

                              {
  //  fHitList.Clear();
  fHitList.Delete();
}

Member Function Documentation

void PndTrkCluster::AddCluster

(

PndTrkCluster *

cluster

)

Definition at line 544 of file PndTrkCluster.cxx.

References AddHit(), fIRegion, GetHit(), GetIRegion(), GetNofHits(), hit(), and TString.

                                                     {
  for(int ihit = 0; ihit < cluster->GetNofHits(); ihit++) {
    PndTrkHit *hit = cluster->GetHit(ihit);
    AddHit(hit);
  }
  
  TString iregion1;
  iregion1 += fIRegion;
  TString iregion2;
  iregion2 += cluster->GetIRegion();
}

void PndTrkCluster::AddClusterAndSortFrom	(	PndTrkCluster *	cluster,
		TVector3	frompoint,
		TString	criterion
	)

Definition at line 556 of file PndTrkCluster.cxx.

References AddHit(), fFromPoint, fHitList, PndTrkHit::GetDistance(), GetHit(), GetNofHits(), hit(), PndTrkHit::SetSortVariable(), and Sort().

                                                                                                        {

  fFromPoint = frompoint;
  PndTrkHit *hit;

  for(int ihit = 0; ihit < cluster->GetNofHits(); ihit++) {
    hit = cluster->GetHit(ihit);
    AddHit(hit);
  }
  
  for(int ihit = 0; ihit < GetNofHits(); ihit++) {
    hit = (PndTrkHit* ) fHitList[ihit];
    //     hit = (PndTrkHit* ) hitlist[ihit];
    if(criterion.CompareTo("xydistance") == 0) {      // CHECK 
      double distance = hit->GetDistance(fFromPoint);
      //   cout << "distance " << distance << endl;
      hit->SetSortVariable(distance);
    }
  }
  // sorting
  Sort();
  

}

void PndTrkCluster::AddHit

(

PndTrkHit *

hit

)

Definition at line 70 of file PndTrkCluster.cxx.

References fHitList, and PndTrkHit::SetUsedFlag().

Referenced by AddCluster(), AddClusterAndSortFrom(), PndTrkLegendreSecTask2::AddHitToClusterByDistance(), PndTrkClean::CleanSectors(), PndTrkLegendreTask::Cleanup(), PndTrkLegendreSecTask::Cleanup(), PndTrkLegendreSecTask2::Cleanup(), PndTrkLegendreTask::CleanUpSkewHitList(), PndTrkLegendreSecTask::CleanUpSkewHitList(), PndTrkLegendreSecTask2::CleanUpSkewHitList(), PndTrkTrackFinder::CleanUpSkewHitList(), PndTrkLegendreSecTask::CleanupZPhiFit(), PndTrkLegendreTask::CleanupZPhiFit(), PndTrkLegendreSecTask2::CleanupZPhiFit(), PndTrkTrackFinder::CountPossibleTracks(), PndTrkLegendreNew::CreateClusterAroundTrack(), PndTrkCombiLegendreTask::CreateClusterAroundTrack(), PndTrkTrackFinder::CreateClusterAroundTrack(), PndTrkCombiLegendreTask::CreateClusterAroundTrack2(), PndTrkCombiLegendreTask::CreateClusterAroundTrack3(), PndTrkLegendreTask::CreateClusterByConfDistance(), PndTrkLegendreSecTask::CreateClusterByConfDistance(), PndTrkLegendreSecTask2::CreateClusterByConfDistance(), PndTrkLegendreTask::CreateClusterByDistance(), PndTrkLegendreSecTask::CreateClusterByDistance(), PndTrkLegendreSecTask2::CreateClusterByDistance(), PndTrkLegendreTask::CreateClusterByMixedDistance(), PndTrkLegendreSecTask::CreateClusterByMixedDistance(), PndTrkLegendreSecTask2::CreateClusterByMixedDistance(), PndTrkLegendreTask::CreateClusterByRealDistance(), PndTrkLegendreSecTask::CreateClusterByRealDistance(), PndTrkLegendreSecTask2::CreateClusterByRealDistance(), PndTrkLegendreNew::CreateFullClusterization(), PndTrkCombiLegendreTask::CreateFullClusterization(), PndTrkTrackFinder::CreateFullClusterization(), PndTrkLegendreTask::CreateSkewHitList(), PndTrkLegendreSecTask::CreateSkewHitList(), PndTrkLegendreSecTask2::CreateSkewHitList(), PndTrkTrackFinder::CreateSkewHitList(), PndTrkLegendreTask::CreateSttCluster(), PndTrkLegendreSecTask::CreateSttCluster(), PndTrkLegendreSecTask2::CreateSttCluster(), PndTrkLegendreSecTask2::Exec(), PndTrkLegendreNew::Exec(), PndTrkLegendreTask::Exec(), PndTrkLegendreSecTask::Exec(), PndTrkCombiLegendreTask::Exec(), PndTrkTrackFinder::Exec(), GetMvdHitList(), GetMvdPixelHitList(), GetMvdStripHitList(), GetSttHitList(), GetSttParallelHitList(), GetSttSkewHitList(), MergeTo(), Replace(), PndTrkClean::SplitAtHit(), SplitAtHit(), and SplitV().

                                         {
  // hitlist.Add(hit);
  hit->SetUsedFlag(1); // CHECK
  int size = fHitList.GetEntriesFast();
  new(fHitList[size]) PndTrkHit(*hit);
}

void PndTrkCluster::AddHit

(

PndTrkHit

hit

)

Definition at line 77 of file PndTrkCluster.cxx.

References fHitList, and PndTrkHit::SetUsedFlag().

                                        {
  // hitlist.Add(hit);
  hit.SetUsedFlag(1); // CHECK
  int size = fHitList.GetEntriesFast();
  new(fHitList[size]) PndTrkHit(hit);
}

Bool_t PndTrkCluster::CheckClusterAgainsV	(	TVector3	frompoint,
		PndTrkHit *	firstextremity,
		PndTrkHit *	secondextremity
	)

Definition at line 290 of file PndTrkCluster.cxx.

References Bool_t, ComputeCircle(), counter, Double_t, fabs(), fHitList, GetNofHits(), GetPocaTo(), PndTrkHit::GetPosition(), PndTrkHit::GetXYDistance(), hit(), x0, and y0.

                                                                                                                    {

  if(fabs(firstextremity->GetPosition().Perp() - secondextremity->GetPosition().Perp()) < 2) { 
    cout << "WARNING, V detected?" << endl;

    if(firstextremity == NULL || secondextremity == NULL) {
      cout << "NULL POINTER" << endl;
      return kFALSE;
    }

    if(*firstextremity == *secondextremity) {
      cout << "COINCIDENT EXTREMITIES" << endl; // CHECK
      return kFALSE;
    }


    PndTrkHit *pca = GetPocaTo(frompoint);
    if(*pca == *firstextremity || *pca == *secondextremity) {
      cout << "POCA COINCIDENT TO ONE OF THE EXTREMITIES" << endl; // CHECK
      return kFALSE;
    }

    Double_t x0, y0, radius = -1;
    Bool_t computation = ComputeCircle(firstextremity->GetPosition(), secondextremity->GetPosition(), pca->GetPosition(), x0, y0, radius);
    if(!computation) {
      cout << "TWO POINTS ALIGNED" << endl;
      return kFALSE;
    }
    cout << "circle " << x0 << " " << y0 << " " << radius << endl;

    int counter = 0;
    for(int ihit = 0; ihit < GetNofHits(); ihit++) {
      //  PndTrkHit *hit =  (PndTrkHit*) hitlist[ihit];
      PndTrkHit *hit =  (PndTrkHit*) fHitList.At(ihit);
      if(fabs(  hit->GetXYDistance(TVector3(x0, y0, 0.)) - radius) > 2) counter++;
    }

    if(GetNofHits() - counter < 3) cout << "***************** YES ***************** " << counter << " on " << GetNofHits() << endl;
    else cout << " ********************** NO ******************* " << counter << " " << GetNofHits() << endl;
    return kTRUE;

  }
  //  else cout << " DISTANCE " << fabs(firstextremity->GetPosition().Perp() - secondextremity->GetPosition().Perp()) << endl;

  return kFALSE;
}

PndTrkCluster::ClassDef ( PndTrkCluster  , 1    )

protected

void PndTrkCluster::Clear

(

Option_t *

opt = ""

)

Definition at line 50 of file PndTrkCluster.cxx.

References fHitList.

Referenced by PndTrkTrack::Clear(), PndTrkTrackFinder::Exec(), and PndTrkTrackFinder::Reset().

                                       {
  fHitList.Clear(opt);
}

Bool_t PndTrkCluster::ComputeCircle	(	TVector3	v1,
		TVector3	v2,
		TVector3	v3,
		double &	x0,
		double &	y0,
		double &	R
	)

Definition at line 603 of file PndTrkCluster.cxx.

References Double_t, m2(), v2, X, Y, and y0.

Referenced by CheckClusterAgainsV().

                                                                                                            {

  Double_t d1 = 2 * (v1 - v2).X();
  Double_t d2 = 2 * (v1 - v3).X();

  Double_t n1 = (v1 - v2).Y();
  Double_t n2 = (v1 - v3).Y();
  
  Double_t m1 = v1.Mag2() - v2.Mag2();
  Double_t m2 = v1.Mag2() - v3.Mag2();

  if((d2 * n1 - d1 * n2) == 0) {
    cout << "allineati" << endl; 
    return kFALSE;
  }

  y0 = 0.5 * (d2 * m1 - d1 * m2) / (d2 * n1 - d1 * n2); 
  if(d1 != 0)  x0 = (m1 - 2 * n1 * y0)/d1;
  else   x0 = (m2 - 2 * n2 * y0)/d2;
  
  R = (v1 - TVector3(x0, y0, 0)).Mag();
  return kTRUE;
}

void PndTrkCluster::DeleteAllHits

(

)

Definition at line 116 of file PndTrkCluster.cxx.

References DeleteHit(), fHitList, and GetNofHits().

Referenced by PndTrkLegendreSecTask::CreateSttCluster(), PndTrkLegendreTask::CreateSttCluster(), and PndTrkLegendreSecTask2::CreateSttCluster().

                                  {
  for(int ihit = 0; ihit < GetNofHits(); ihit++) {
    DeleteHit(ihit);
  }
  fHitList.Compress();
  // hitlist.Compress();
}

void PndTrkCluster::DeleteHit

(

PndTrkHit *

hit

)

Definition at line 86 of file PndTrkCluster.cxx.

References fHitList, and PndTrkHit::SetUsedFlag().

Referenced by DeleteAllHits(), DeleteHitAndCompress(), and DeleteHits().

                                            {
  hit->SetUsedFlag(0);
  //  hitlist.Remove(hit);
  fHitList.Remove(hit);
}

void PndTrkCluster::DeleteHit

(

Int_t

index

)

Definition at line 100 of file PndTrkCluster.cxx.

References fHitList.

                                         {
  //PndTrkHit* hit = (PndTrkHit*) fHitList.At(index); //[R.K. 01/2017] unused variable
//   hitlist.RemoveAt(index);
//   hitlist.Compress(); // CHECK
  fHitList.RemoveAt(index);
  fHitList.Compress(); // CHECK

}

void PndTrkCluster::DeleteHitAndCompress

(

PndTrkHit *

hit

)

Definition at line 93 of file PndTrkCluster.cxx.

References DeleteHit(), and fHitList.

Referenced by PndTrkTrackFinder::Exec(), and Replace().

                                                       {
  DeleteHit(hit);
  //  hitlist.Compress(); // CHECK
  fHitList.Compress();
}

void PndTrkCluster::DeleteHitAndCompress

(

Int_t

index

)

Definition at line 110 of file PndTrkCluster.cxx.

References DeleteHit(), and fHitList.

                                                    {
  DeleteHit(index);
  //  hitlist.Compress(); // CHECK
  fHitList.Compress(); // CHECK
}

void PndTrkCluster::DeleteHits

(

std::vector< int >

todelete

)

Definition at line 124 of file PndTrkCluster.cxx.

References DeleteHit(), and fHitList.

Referenced by PndTrkClean::Cleanup2().

                                                        {
  for(size_t ihit = 0; ihit < todelete.size(); ihit++) {
    int hitno = todelete[ihit];
    DeleteHit(hitno);
  }
  // hitlist.Compress();
  fHitList.Compress();
}

Bool_t PndTrkCluster::DoesContain

(

PndTrkHit *

hit

)

Definition at line 627 of file PndTrkCluster.cxx.

References fHitList.

Referenced by PndTrkLegendreSecTask2::AddHitToClusterByDistance(), PndTrkLegendreNew::CreateClusterAroundTrack(), PndTrkCombiLegendreTask::CreateClusterAroundTrack(), PndTrkTrackFinder::CreateClusterAroundTrack(), PndTrkLegendreNew::CreateFullClusterization(), PndTrkCombiLegendreTask::CreateFullClusterization(), PndTrkTrackFinder::CreateFullClusterization(), PndTrkLegendreTask::Exec(), PndTrkLegendreNew::Exec(), PndTrkLegendreSecTask::Exec(), PndTrkLegendreSecTask2::Exec(), PndTrkCombiLegendreTask::Exec(), PndTrkTrackFinder::Exec(), PndTrkLegendreSecTask2::FillLegendreHisto(), PndTrkLegendreNew::FillLegendreHisto(), PndTrkTrackFinder::FillLegendreHisto(), PndTrkCombiLegendreTask::FillPeakCouplesHisto(), PndTrkCombiLegendreTask::FindReferenceHit(), MergeTo(), and NofSharedHits().

                                                {
  //bool isthere = false; //[R.K. 01/2017] unused variable
  //  if(hitlist.FindObject(hit) == 0) return kFALSE;
  if(fHitList.FindObject(hit) == 0) return kFALSE;
   return kTRUE;  

}

void PndTrkCluster::Draw

(

Color_t

color = kBlack

)

Definition at line 769 of file PndTrkCluster.cxx.

References PndTrkHit::Draw(), fHitList, GetNofHits(), and hit().

Referenced by PndTrkLegendreNew::CreateClusterAroundTrack(), PndTrkCombiLegendreTask::CreateClusterAroundTrack(), PndTrkTrackFinder::CreateClusterAroundTrack(), PndTrkCombiLegendreTask::CreateClusterAroundTrack2(), PndTrkCombiLegendreTask::CreateClusterAroundTrack3(), PndTrkTrackFinder::Exec(), and LightUp().

                                      { 
  //  cout << "S: " <<  hitlist.size() << endl;
  for(int ihit = 0; ihit < GetNofHits(); ihit++) {
    // PndTrkHit *hit = (PndTrkHit*) hitlist[ihit];
    PndTrkHit *hit = (PndTrkHit*) fHitList.At(ihit);
    hit->Draw(color);
  }
}

Bool_t PndTrkCluster::FindExtremitiesFrom	(	TVector3	frompoint,
		PndTrkHit &	firstextremity,
		PndTrkHit &	secondextremity
	)

Definition at line 238 of file PndTrkCluster.cxx.

References counter, Double_t, fHitList, GetNofHits(), PndTrkHit::GetXYDistance(), hit(), MAXNOFHITSINCLUSTER, nhits, and STTPARALDISTANCE.

                                                                                                                   {
  const  int nhits = MAXNOFHITSINCLUSTER; // hitlist.size(); // CHECK
  int associations[nhits] = {0};
  for(int ihit = 0; ihit < GetNofHits(); ihit++) {
    //  PndTrkHit *hit1 =  (PndTrkHit*) hitlist[ihit];
    PndTrkHit *hit1 =  (PndTrkHit*) fHitList.At(ihit);
     for(int jhit = 0; jhit < GetNofHits(); jhit++) {
       if(ihit == jhit) continue;
       // PndTrkHit *hit2 =  (PndTrkHit*) hitlist[jhit];
       PndTrkHit *hit2 =  (PndTrkHit*) fHitList.At(jhit);

       if(hit1->GetXYDistance(hit2) < STTPARALDISTANCE) {
         associations[ihit]++;
       }
     }
 }

  int counter = 0;
  Double_t tmpdistance1 = 1000, tmpdistance2 = -1;

  for(int ihit = 0; ihit < GetNofHits(); ihit++) {
    if(associations[ihit] != 1) continue;
    counter++;
    //    PndTrkHit *hit =  (PndTrkHit*) hitlist[ihit];
    PndTrkHit *hit =  (PndTrkHit*) fHitList.At(ihit);
    double distance = hit->GetXYDistance(frompoint);
    if(distance < tmpdistance1) {
      tmpdistance1 = distance;
      firstextremity = *hit;
    }
    
    if(distance > tmpdistance2) {
      tmpdistance2 = distance;
      secondextremity = *hit;
    }
  }
  
  if(counter == 2) return kTRUE;
  
  if(counter == 0) cout << "NO EXTREMITY FOUND :-(" << endl;
  if(counter > 2) cout << "TOO MANY EXTREMITIES FOUND :-( " << counter << endl;
  return kFALSE;
}

PndTrkHit * PndTrkCluster::GetHit

(

int

index

)

Definition at line 643 of file PndTrkCluster.cxx.

References fHitList.

Referenced by AddCluster(), AddClusterAndSortFrom(), PndTrkLegendreNew::AnalyticalFit(), PndTrkTrackFinder::AnalyticalFit(), PndTrkCombiLegendreTask::AnalyticalFit(), PndTrkLegendreNew::AnalyticalFit2(), PndTrkTrackFinder::AnalyticalFit2(), PndTrkCombiLegendreTask::AnalyticalFit2(), PndTrkTrackFinder::AnalyticalParabolaFit(), PndTrkTrackFinder::Apollonius(), PndTrkClean::CheckSectorDistribution(), PndTrkClean::CleanSectors(), PndTrkCombiLegendreTask::CleanTrack(), PndTrkLegendreSecTask::Cleanup(), PndTrkLegendreTask::Cleanup(), PndTrkLegendreSecTask2::Cleanup(), PndTrkClean::Cleanup2(), PndTrkLegendreSecTask::CleanUpSkewHitList(), PndTrkLegendreTask::CleanUpSkewHitList(), PndTrkLegendreSecTask2::CleanUpSkewHitList(), PndTrkTrackFinder::CleanUpSkewHitList(), PndTrkLegendreSecTask::CleanupZPhiFit(), PndTrkLegendreTask::CleanupZPhiFit(), PndTrkLegendreSecTask2::CleanupZPhiFit(), PndTrkTrack::ComputeCharge(), PndTrkCombiLegendreTask::ComputePerpendicularChi2(), PndTrkLegendreSecTask::ComputeZRediduals(), PndTrkLegendreTask::ComputeZRediduals(), PndTrkLegendreSecTask2::ComputeZRediduals(), PndTrkTrack::ConvertToPndTrack(), PndTrkTrack::ConvertToPndTrackCand(), PndTrkLegendreSecTask::CorrectZ(), PndTrkLegendreTask::CorrectZ(), PndTrkLegendreSecTask2::CorrectZ(), PndTrkTrackFinder::CountPossibleTracks(), PndTrkLegendreNew::CountTracksInCluster(), PndTrkCombiLegendreTask::CountTracksInCluster(), PndTrkTrackFinder::CountTracksInCluster(), PndTrkLegendreNew::CreateClusterAroundTrack(), PndTrkCombiLegendreTask::CreateClusterAroundTrack(), PndTrkTrackFinder::CreateClusterAroundTrack(), PndTrkCombiLegendreTask::CreateClusterAroundTrack2(), PndTrkCombiLegendreTask::CreateClusterAroundTrack3(), PndTrkLegendreNew::CreateFullClusterization(), PndTrkCombiLegendreTask::CreateFullClusterization(), PndTrkTrackFinder::CreateFullClusterization(), PndTrkLegendreSecTask::CreateSttCluster(), PndTrkLegendreTask::CreateSttCluster(), PndTrkLegendreSecTask2::CreateSttCluster(), PndTrkTrack::Draw(), PndTrkLegendreSecTask::Exec(), PndTrkLegendreSecTask2::Exec(), PndTrkLegendreTask::Exec(), PndTrkLegendreNew::Exec(), PndTrkCombiLegendreTask::Exec(), PndTrkTrackFinder::Exec(), PndTrkLegendreSecTask2::FillConformalHitList(), PndTrkLegendreNew::FillConformalHitList(), PndTrkCombiLegendreTask::FillConformalHitList(), PndTrkTrackFinder::FillConformalHitList(), PndTrkLegendreTask::FillLegendreHisto(), PndTrkLegendreSecTask::FillLegendreHisto(), PndTrkLegendreNew::FindReferenceHit(), PndTrkCombiLegendreTask::FindReferenceHit(), PndTrkTrackFinder::FindReferenceHit(), PndTrkLegendreSecTask2::FindReferenceHit(), GetMinimumXYDistanceFromHit(), MergeTo(), PndTrkTrackFinder::MinuitFit(), PndTrkTrackFinder::MinuitFit2(), PrintList(), PndTrkClean::Split(), PndTrkClean::SplitAtHit(), SplitV(), PndTrkLegendreSecTask::ZPhiFit(), PndTrkLegendreTask::ZPhiFit(), and PndTrkLegendreSecTask2::ZPhiFit().

                                          {
  //  cout << index << " hitlist " << hitlist.GetEntriesFast() << " " << hitlist.GetEntries() << endl;
  //  cout << hitlist.At(index) << endl;

  // return (PndTrkHit*) hitlist.At(index);
  return (PndTrkHit*) fHitList.At(index);
}

Int_t PndTrkCluster::GetIRegion ( )

inline

Definition at line 53 of file PndTrkCluster.h.

References fIRegion.

Referenced by AddCluster().

{ return fIRegion; }

Double_t PndTrkCluster::GetMinimumXYDistanceFromHit

(

PndTrkHit *

hit

)

Definition at line 717 of file PndTrkCluster.cxx.

References GetHit(), GetNofHits(), and PndTrkHit::GetXYDistance().

Referenced by PndTrkLegendreSecTask2::CheckVicinity().

                                                                   {
  double distance = 1000000;
 //  cout << " from hit " << hit->GetHitID() << " " << hit->GetDetectorID() << endl;

  for(int ihit = 0; ihit < GetNofHits(); ihit++) {
    PndTrkHit *clushit = GetHit(ihit);
    double tmpdistance = hit->GetXYDistance(clushit);
    if(tmpdistance < distance) {
      distance = tmpdistance;
      //      cout << " new minimum " << clushit->GetHitID() << " " << clushit->GetDetectorID() << endl;
    }
  }
  return distance;
}

PndTrkCluster PndTrkCluster::GetMvdHitList

(

)

Definition at line 163 of file PndTrkCluster.cxx.

References AddHit(), fHitList, PndTrkHit::GetIRegion(), GetNofHits(), hit(), PndTrkHit::IsMvd(), and SetIRegion().

                                           {
  PndTrkCluster cluster;
  for(int ihit = 0; ihit < GetNofHits(); ihit++) {
    //   PndTrkHit *hit =  (PndTrkHit*) hitlist[ihit];
    PndTrkHit *hit =  (PndTrkHit*) fHitList.At(ihit);
      if(hit->IsMvd()) {
        cluster.AddHit(hit);
        cluster.SetIRegion(hit->GetIRegion()); 
        //      cout << "found one" << hit->GetHitID() << endl;
      }
  }
  return cluster;
}

PndTrkCluster PndTrkCluster::GetMvdPixelHitList

(

)

Definition at line 149 of file PndTrkCluster.cxx.

References AddHit(), fHitList, GetNofHits(), hit(), PndTrkHit::IsMvdPixel(), MVDPIXEL, and SetIRegion().

Referenced by PndTrkLegendreSecTask::Cleanup(), PndTrkLegendreTask::Cleanup(), and PndTrkLegendreSecTask2::Cleanup().

                                                {
  PndTrkCluster cluster;
  for(int ihit = 0; ihit < GetNofHits(); ihit++) {
    // PndTrkHit *hit =  (PndTrkHit*) hitlist[ihit];
    PndTrkHit *hit =  (PndTrkHit*) fHitList.At(ihit);
    if(hit->IsMvdPixel()) {
      cluster.AddHit(hit);
      cluster.SetIRegion(MVDPIXEL);
      //      cout << "found one" << hit->GetHitID() << endl;
    }
  }
  return cluster;
}

PndTrkCluster PndTrkCluster::GetMvdStripHitList

(

)

Definition at line 135 of file PndTrkCluster.cxx.

References AddHit(), fHitList, GetNofHits(), hit(), PndTrkHit::IsMvdStrip(), MVDSTRIP, and SetIRegion().

Referenced by PndTrkLegendreSecTask::Cleanup(), PndTrkLegendreTask::Cleanup(), and PndTrkLegendreSecTask2::Cleanup().

                                                {
  PndTrkCluster cluster;
  for(int ihit = 0; ihit < GetNofHits(); ihit++) {
    //    PndTrkHit *hit =  (PndTrkHit*) hitlist[ihit];
    PndTrkHit *hit =  (PndTrkHit*) fHitList.At(ihit);
    if(hit->IsMvdStrip()) {
        cluster.AddHit(hit);
        cluster.SetIRegion(MVDSTRIP);
        //      cout << "found one" << hit->GetHitID() << endl;
      }
  }
  return cluster;
}

PndTrkHit * PndTrkCluster::GetNextHit

(

int

index

)

Definition at line 657 of file PndTrkCluster.cxx.

References fHitList, and GetNofHits().

Referenced by PndTrkClean::Cleanup2().

                                              {
  if(index == GetNofHits() - 1) return NULL;
  // return (PndTrkHit*) hitlist[index + 1];
  return (PndTrkHit*) fHitList.At(index + 1);
}

Int_t PndTrkCluster::GetNofHits ( )

inline

Definition at line 52 of file PndTrkCluster.h.

References fHitList.

Referenced by AddCluster(), AddClusterAndSortFrom(), PndTrkLegendreNew::AnalyticalFit(), PndTrkTrackFinder::AnalyticalFit(), PndTrkCombiLegendreTask::AnalyticalFit(), PndTrkLegendreNew::AnalyticalFit2(), PndTrkTrackFinder::AnalyticalFit2(), PndTrkCombiLegendreTask::AnalyticalFit2(), PndTrkTrackFinder::AnalyticalParabolaFit(), PndTrkTrackFinder::Apollonius(), CheckClusterAgainsV(), PndTrkClean::CheckSectorDistribution(), PndTrkClean::CleanSectors(), PndTrkCombiLegendreTask::CleanTrack(), PndTrkLegendreTask::Cleanup(), PndTrkLegendreSecTask::Cleanup(), PndTrkLegendreSecTask2::Cleanup(), PndTrkClean::Cleanup2(), PndTrkLegendreTask::CleanUpSkewHitList(), PndTrkLegendreSecTask::CleanUpSkewHitList(), PndTrkLegendreSecTask2::CleanUpSkewHitList(), PndTrkTrackFinder::CleanUpSkewHitList(), PndTrkLegendreTask::CleanupZPhiFit(), PndTrkLegendreSecTask::CleanupZPhiFit(), PndTrkLegendreSecTask2::CleanupZPhiFit(), PndTrkCombiLegendreTask::ClusterToConformal(), PndTrkTrack::ComputeCharge(), PndTrkCombiLegendreTask::ComputePerpendicularChi2(), PndTrkLegendreTask::ComputeZRediduals(), PndTrkLegendreSecTask::ComputeZRediduals(), PndTrkLegendreSecTask2::ComputeZRediduals(), PndTrkTrack::ConvertToPndTrack(), PndTrkTrack::ConvertToPndTrackCand(), PndTrkLegendreSecTask::CorrectZ(), PndTrkLegendreTask::CorrectZ(), PndTrkLegendreSecTask2::CorrectZ(), PndTrkTrackFinder::CountPossibleTracks(), PndTrkLegendreNew::CountTracksInCluster(), PndTrkCombiLegendreTask::CountTracksInCluster(), PndTrkTrackFinder::CountTracksInCluster(), PndTrkLegendreNew::CreateClusterAroundTrack(), PndTrkCombiLegendreTask::CreateClusterAroundTrack(), PndTrkTrackFinder::CreateClusterAroundTrack(), PndTrkCombiLegendreTask::CreateClusterAroundTrack2(), PndTrkCombiLegendreTask::CreateClusterAroundTrack3(), PndTrkLegendreNew::CreateFullClusterization(), PndTrkCombiLegendreTask::CreateFullClusterization(), PndTrkTrackFinder::CreateFullClusterization(), PndTrkLegendreTask::CreateSttCluster(), PndTrkLegendreSecTask::CreateSttCluster(), PndTrkLegendreSecTask2::CreateSttCluster(), DeleteAllHits(), PndTrkTrack::Draw(), Draw(), PndTrkLegendreTask::Exec(), PndTrkLegendreSecTask2::Exec(), PndTrkLegendreSecTask::Exec(), PndTrkLegendreNew::Exec(), PndTrkCombiLegendreTask::Exec(), PndTrkTrackFinder::Exec(), PndTrkLegendreSecTask2::FillConformalHitList(), PndTrkLegendreNew::FillConformalHitList(), PndTrkCombiLegendreTask::FillConformalHitList(), PndTrkTrackFinder::FillConformalHitList(), PndTrkLegendreTask::FillLegendreHisto(), PndTrkLegendreSecTask::FillLegendreHisto(), FindExtremitiesFrom(), PndTrkLegendreNew::FindReferenceHit(), PndTrkCombiLegendreTask::FindReferenceHit(), PndTrkTrackFinder::FindReferenceHit(), PndTrkLegendreSecTask2::FindReferenceHit(), GetMinimumXYDistanceFromHit(), GetMvdHitList(), GetMvdPixelHitList(), GetMvdStripHitList(), GetNextHit(), GetPocaTo(), GetSttHitList(), GetSttParallelHitList(), GetSttSkewHitList(), IsSimilarTo(), PndTrkLegendreNew::LegendreFit(), PndTrkCombiLegendreTask::LegendreFit(), PndTrkClean::MergeClusters(), MergeTo(), PndTrkTrackFinder::MinuitFit(), PndTrkTrackFinder::MinuitFit2(), NofSharedHits(), operator==(), PndTrkTrack::operator==(), Print(), PrintList(), ReverseSort(), SharedAt(), SortFromHit(), PndTrkClean::Split(), PndTrkClean::SplitAtHit(), SplitAtHit(), SplitV(), PndTrkLegendreSecTask::ZPhiFit(), PndTrkLegendreTask::ZPhiFit(), and PndTrkLegendreSecTask2::ZPhiFit().

{ return fHitList.GetEntriesFast(); }

PndTrkHit * PndTrkCluster::GetPocaTo

(

TVector3

frompoint

)

Definition at line 583 of file PndTrkCluster.cxx.

References Double_t, fHitList, GetNofHits(), PndTrkHit::GetXYDistance(), and hit().

Referenced by CheckClusterAgainsV().

                                                       {
  //  cout << "getPocaTo" << endl;
  Double_t tmpdistance = 1000;
  
  //  PndTrkHit *tmphit = (PndTrkHit* ) hitlist[0];
  PndTrkHit *tmphit = (PndTrkHit* ) fHitList[0];

  for(int ihit = 0; ihit < GetNofHits(); ihit++) {
    //  PndTrkHit *hit = (PndTrkHit* ) hitlist[ihit];
    PndTrkHit *hit = (PndTrkHit* ) fHitList[ihit];

    double distance = hit->GetXYDistance(frompoint);
    if(distance < tmpdistance) {
      tmpdistance = distance;
      tmphit = hit;
    }
  }
  return tmphit;
}  

PndTrkHit * PndTrkCluster::GetPreviousHit

(

int

index

)

Definition at line 651 of file PndTrkCluster.cxx.

References fHitList.

Referenced by PndTrkClean::Cleanup2().

                                                  {
  if(index == 0) return NULL;
  //  return (PndTrkHit*) hitlist[index - 1];
  return (PndTrkHit*) fHitList.At(index - 1);
}

PndTrkCluster PndTrkCluster::GetSttHitList

(

)

Definition at line 206 of file PndTrkCluster.cxx.

References AddHit(), fHitList, PndTrkHit::GetIRegion(), GetNofHits(), hit(), PndTrkHit::IsStt(), and SetIRegion().

 {
  PndTrkCluster cluster;
  for(int ihit = 0; ihit < GetNofHits(); ihit++) {
    //    PndTrkHit *hit =  (PndTrkHit*) hitlist[ihit];
    PndTrkHit *hit =  (PndTrkHit*) fHitList.At(ihit);
    if(hit->IsStt()) {
      cluster.AddHit(hit);
      cluster.SetIRegion(hit->GetIRegion()); 
      //      cout << "found one" << hit->GetHitID() << endl;
    }
  }
  return cluster;
}

PndTrkCluster PndTrkCluster::GetSttParallelHitList

(

)

Definition at line 177 of file PndTrkCluster.cxx.

References AddHit(), fHitList, PndTrkHit::GetIRegion(), GetNofHits(), hit(), PndTrkHit::IsSttParallel(), and SetIRegion().

Referenced by PndTrkLegendreSecTask::Cleanup(), PndTrkLegendreTask::Cleanup(), and PndTrkLegendreSecTask2::Cleanup().

                                                    {
  PndTrkCluster cluster;
  for(int ihit = 0; ihit < GetNofHits(); ihit++) {
    //  PndTrkHit *hit =  (PndTrkHit*) hitlist[ihit];
    PndTrkHit *hit =  (PndTrkHit*) fHitList.At(ihit);
      if(hit->IsSttParallel()) {
        cluster.AddHit(hit);
        cluster.SetIRegion(hit->GetIRegion()); 
        //      cout << "found one" << hit->GetHitID() << endl;
      }
  }
  return cluster;
}

PndTrkCluster PndTrkCluster::GetSttSkewHitList

(

)

Definition at line 191 of file PndTrkCluster.cxx.

References AddHit(), fHitList, PndTrkHit::GetIRegion(), GetNofHits(), hit(), PndTrkHit::IsSttSkew(), and SetIRegion().

{
  PndTrkCluster cluster;
  for(int ihit = 0; ihit < GetNofHits(); ihit++) {
    //    PndTrkHit *hit =  (PndTrkHit*) hitlist[ihit];
    PndTrkHit *hit =  (PndTrkHit*) fHitList.At(ihit);
    if(hit->IsSttSkew()) {
        cluster.AddHit(hit);
        cluster.SetIRegion(hit->GetIRegion()); 
        //      cout << "found one" << hit->GetHitID() << endl;
      }
  }
  return cluster;
}

Bool_t PndTrkCluster::IsSimilarTo

(

PndTrkCluster *

cluster2

)

Definition at line 665 of file PndTrkCluster.cxx.

References GetNofHits(), and NofSharedHits().

Referenced by PndTrkClean::MergeClusters().

                                                         {
  int similarity = NofSharedHits(cluster2);
  if(((double) similarity/GetNofHits()) > 0.5 || ((double) similarity/cluster2->GetNofHits()) > 0.5) return kTRUE;
  return kFALSE;
}

Bool_t PndTrkCluster::IsSorted ( )

inline

Definition at line 93 of file PndTrkCluster.h.

References fHitList.

{ return fHitList.IsSorted(); }

void PndTrkCluster::LightUp

(

)

Definition at line 778 of file PndTrkCluster.cxx.

References Draw().

Referenced by PndTrkCombiLegendreTask::CleanTrack(), PndTrkLegendreSecTask2::Exec(), PndTrkLegendreNew::Exec(), PndTrkCombiLegendreTask::Exec(), PndTrkTrackFinder::Exec(), PndTrkLegendreSecTask::LightCluster(), PndTrkLegendreTask::LightCluster(), PndTrkLegendreSecTask2::LightCluster(), and PndTrkTrack::LightUp().

                            { 
  Draw(kOrange); // Yellow);
}

int PndTrkCluster::MergeTo

(

PndTrkCluster *

cluster2

)

Definition at line 695 of file PndTrkCluster.cxx.

References AddHit(), DoesContain(), GetHit(), GetNofHits(), hit(), and Sort().

Referenced by PndTrkTrackFinder::Exec(), and PndTrkLegendreCluster::MergeTo().

                                                  {
  
  std::vector<int> tobeadded;
  for(int ihit = 0; ihit < cluster2->GetNofHits(); ihit++) {
    PndTrkHit *hit = cluster2->GetHit(ihit);
    if(DoesContain(hit)) continue;
    tobeadded.push_back(ihit);
  }
  
  for(size_t ihit = 0; ihit < tobeadded.size(); ihit++) {
    int hitno = tobeadded.at(ihit);
    PndTrkHit *hit = cluster2->GetHit(hitno);
    AddHit(hit);
  }

  Sort();
  return GetNofHits();
}

Int_t PndTrkCluster::NofSharedHits

(

PndTrkCluster *

cluster2

)

Definition at line 671 of file PndTrkCluster.cxx.

References DoesContain(), fHitList, GetNofHits(), and hit().

Referenced by IsSimilarTo(), and SharedAt().

                                                          {
  int similarity = 0;
//   cout << "GetNofHits " << GetNofHits() << endl;
  for(int ihit = 0; ihit < GetNofHits(); ihit++) {
    PndTrkHit *hit = (PndTrkHit*) fHitList.At(ihit);
    if(cluster2->DoesContain(hit)) {
//       cout << hit->GetDetectorID() << " " << hit->GetHitID() << " simile" << endl;
      similarity++;
    }
  }
  // cout << "similarity " << similarity << endl;       
  return similarity;
}

PndTrkCluster & PndTrkCluster::operator=

(

const PndTrkCluster &

cluster

)

Definition at line 55 of file PndTrkCluster.cxx.

References fFromPoint, fHitList, and fIRegion.

Referenced by PndTrkLegendreCluster::operator=().

                                                                    {
  fFromPoint = cluster.fFromPoint;
  fIRegion = cluster.fIRegion;
  fHitList = cluster.fHitList;
  return *this;
}

Bool_t PndTrkCluster::operator==

(

const PndTrkCluster

cluster

)

const

Definition at line 63 of file PndTrkCluster.cxx.

References fHitList, and GetNofHits().

                                                            {
  //  return hitlist.GetEntriesFast() == cluster.GetNofHits(); // CHECK
 return fHitList.GetEntriesFast() == cluster.GetNofHits(); // CHECK

}

void PndTrkCluster::Print

(

)

Definition at line 749 of file PndTrkCluster.cxx.

References fHitList, fIRegion, PndTrkHit::GetDetectorID(), PndTrkHit::GetHitID(), GetNofHits(), PndTrkHit::GetSortVariable(), and hit().

Referenced by PndTrkClean::MergeClusters().

                          {
  cout << "###############################" << endl;
  cout << "iregion " << fIRegion << " with nhits " << GetNofHits() << endl;
  for(int ihit = 0; ihit < GetNofHits(); ihit++) {
    //    PndTrkHit *hit = (PndTrkHit*) hitlist[ihit];
    PndTrkHit *hit = (PndTrkHit*) fHitList.At(ihit);
   cout << " " <<  hit->GetHitID() << " " << hit->GetDetectorID() << " " << hit->GetSortVariable() << endl;
  }
}

void PndTrkCluster::PrintList

(

)

Definition at line 759 of file PndTrkCluster.cxx.

References GetHit(), PndTrkHit::GetHitID(), GetNofHits(), and hit().

                             {
  for(int ihit = 0; ihit < GetNofHits(); ihit++) {
    PndTrkHit *hit = GetHit(ihit);
    cout << " " <<  hit->GetHitID();
  }
  cout << endl;
}

void PndTrkCluster::Replace

(

PndTrkHit *

hit

)

Definition at line 636 of file PndTrkCluster.cxx.

References AddHit(), DeleteHitAndCompress(), and SearchHit().

Referenced by PndTrkLegendreSecTask::Exec(), PndTrkLegendreTask::Exec(), and PndTrkLegendreSecTask2::Exec().

                                          {
   PndTrkHit *oldhit = (PndTrkHit*) SearchHit(hit);
   //   cout << "oldhit " << oldhit << " " << hit << endl;
   DeleteHitAndCompress(oldhit);
   AddHit(hit);
}

void PndTrkCluster::ReverseSort

(

)

Definition at line 519 of file PndTrkCluster.cxx.

References fHitList, GetNofHits(), PndTrkHit::GetSortVariable(), hit(), and PndTrkHit::SetSortVariable().

Referenced by PndTrkTrackFinder::Exec().

{
  // CHECK each TObject must return IsSortable = kTRUE
  PndTrkHit *hit;
  for(int ihit = 0; ihit < GetNofHits(); ihit++) {
    //    hit = (PndTrkHit* ) hitlist[ihit];
    hit = (PndTrkHit* ) fHitList[ihit];
    
    int srt = hit->GetSortVariable();
    hit->SetSortVariable(-srt);
  }
  // hitlist.Sort(); 
  fHitList.Sort();

  // reput the sort variable as they were before
  for(int ihit = 0; ihit < GetNofHits(); ihit++) {
    hit = (PndTrkHit* ) fHitList[ihit];
    int srt = hit->GetSortVariable();
    hit->SetSortVariable(-srt);
  }

}

PndTrkHit * PndTrkCluster::SearchHit

(

PndTrkHit *

hit

)

Definition at line 224 of file PndTrkCluster.cxx.

References fHitList.

Referenced by Replace(), and SplitV().

                                                  {
  // return (PndTrkHit*) hitlist.FindObject(hit);
  return (PndTrkHit*) fHitList.FindObject(hit);
}

void PndTrkCluster::SetIRegion ( int  iregion )

inline

Definition at line 46 of file PndTrkCluster.h.

References fIRegion.

Referenced by PndTrkLegendreSecTask::CreateSttCluster(), PndTrkLegendreTask::CreateSttCluster(), PndTrkLegendreSecTask2::CreateSttCluster(), GetMvdHitList(), GetMvdPixelHitList(), GetMvdStripHitList(), GetSttHitList(), GetSttParallelHitList(), GetSttSkewHitList(), and SplitV().

{ fIRegion = iregion; }

Bool_t PndTrkCluster::SharedAt	(	PndTrkCluster *	cluster2,
		double	limit
	)

Definition at line 685 of file PndTrkCluster.cxx.

References GetNofHits(), and NofSharedHits().

Referenced by PndTrkTrackFinder::Exec().

                                                                    {
  int similarity = NofSharedHits(cluster2);
//   cout  << "similarity " << similarity << " on " << GetNofHits() << " and " << cluster2->GetNofHits() << endl;

  if(((double) similarity/GetNofHits()) > limit || ((double) similarity/cluster2->GetNofHits()) > limit) return kTRUE;
  return kFALSE;
}

void PndTrkCluster::Sort

(

)

Definition at line 508 of file PndTrkCluster.cxx.

References fHitList.

Referenced by AddClusterAndSortFrom(), PndTrkLegendreSecTask::Cleanup(), PndTrkLegendreTask::Cleanup(), PndTrkLegendreSecTask2::Cleanup(), PndTrkClean::Cleanup2(), PndTrkLegendreSecTask::CleanUpSkewHitList(), PndTrkLegendreTask::CleanUpSkewHitList(), PndTrkLegendreSecTask2::CleanUpSkewHitList(), PndTrkTrackFinder::CleanUpSkewHitList(), PndTrkTrackFinder::CountPossibleTracks(), PndTrkLegendreNew::CountTracksInCluster(), PndTrkCombiLegendreTask::CountTracksInCluster(), PndTrkTrackFinder::CountTracksInCluster(), PndTrkLegendreTask::Exec(), PndTrkLegendreSecTask2::Exec(), PndTrkLegendreSecTask::Exec(), PndTrkTrackFinder::Exec(), MergeTo(), and SortFromHit().

{
  // CHECK each TObject must return IsSortable = kTRUE
 
  fHitList.UnSort();
  //  hitlist.Sort(); 
  fHitList.Sort();
 

}

void PndTrkCluster::SortFromHit	(	PndTrkHit *	firstextremity,
		TString	criterion
	)

Definition at line 488 of file PndTrkCluster.cxx.

References fFromPoint, fHitList, PndTrkHit::GetDistance(), GetNofHits(), PndTrkHit::GetPosition(), hit(), PndTrkHit::SetSortVariable(), and Sort().

                                                                            {

  //  cout << "------------------------------------ sorting" << endl;
  fFromPoint = firstextremity->GetPosition();
  PndTrkHit *hit;
  for(int ihit = 0; ihit < GetNofHits(); ihit++) {
   //  hit = (PndTrkHit*) hitlist[ihit];
    hit = (PndTrkHit*) fHitList[ihit];
 
    if(criterion.CompareTo("xydistance") == 0) {      // CHECK 
      double distance = hit->GetDistance(fFromPoint);
      //   cout << "distance " << distance << endl;
      hit->SetSortVariable(distance);
    }

  }
  // sorting 
  Sort() ; 
}

Bool_t PndTrkCluster::SplitAtHit	(	PndTrkHit *	athit,
		PndTrkCluster &	cluster1,
		PndTrkCluster &	cluster2
	)

Definition at line 338 of file PndTrkCluster.cxx.

References AddHit(), fHitList, PndTrkHit::GetHitID(), GetNofHits(), PndTrkHit::GetPosition(), PndTrkHit::GetXYDistance(), hit(), and STTPARALDISTANCE.

                                                                                                   {

  //  PndTrkHit *tmphit =  (PndTrkHit*) hitlist[0];
  PndTrkHit *tmphit =  (PndTrkHit*) fHitList.At(0);

  cluster1.AddHit(athit);
  cluster2.AddHit(athit);
  TVector3 tmpposition = athit->GetPosition();
  PndTrkHit *secondhit = NULL;
 
  cout << "CLUS1: " << tmphit->GetHitID() << endl;
  for(int ihit = 0; ihit < GetNofHits(); ihit++) {
    //    PndTrkHit *hit =  (PndTrkHit*) hitlist[ihit];
    PndTrkHit *hit =  (PndTrkHit*) fHitList.At(ihit);
    if(*hit == *athit) {
      cout << "hit == ahit " << endl;
      continue;
    }
    cout << "*** " << hit->GetHitID() << " " << hit->GetXYDistance(tmpposition) << " " << STTPARALDISTANCE << endl; 
    if(hit->GetXYDistance(tmpposition) < STTPARALDISTANCE) { // CHECK
      cluster1.AddHit(hit);
      tmpposition = hit->GetPosition();
      if(secondhit == NULL) {
        cout << "secondhit " << endl;
        secondhit = hit;
      }
      else cout << "sechit " << secondhit << endl;
      cout << "CLUS1: " << hit->GetHitID() << endl;

    }
  }
  
  cout << "CLUS2: " << tmphit->GetHitID() << endl;

  tmpposition = athit->GetPosition();
  for(int ihit = 0; ihit < GetNofHits(); ihit++) {
    // PndTrkHit *hit =  (PndTrkHit*) hitlist[ihit];
    PndTrkHit *hit =  (PndTrkHit*) fHitList.At(ihit);
    cout << "athit " << athit << endl;
    cout << "hit " << hit << endl;
    cout << "secondhit " << secondhit <<  endl;
    if(*hit == *athit) continue;
    if(*hit == *secondhit) continue;

    if(hit->GetXYDistance(tmpposition) < STTPARALDISTANCE) { // CHECK
      cluster2.AddHit(hit);
      tmpposition = hit->GetPosition();
      cout << "CLUS2: " << hit->GetHitID() << endl;
    }
  }
  
  return kTRUE;
}

Bool_t PndTrkCluster::SplitV	(	PndTrkHit *	athit,
		PndTrkHit *	firstextremity,
		PndTrkHit *	secondextremity,
		PndTrkCluster &	cluster1,
		PndTrkCluster &	cluster2
	)

Definition at line 396 of file PndTrkCluster.cxx.

References AddHit(), fHitList, fIRegion, GetHit(), GetNofHits(), PndTrkHit::GetPosition(), hit(), SearchHit(), SetIRegion(), PndTrkHit::SetUsedFlag(), and STTPARALDISTANCE.

                                                                                                                                                      {
  //  cout << "splitV" << endl;
  

  cluster1.AddHit(firstextremity);
  cluster2.AddHit(secondextremity);
  cluster1.SetIRegion(fIRegion);
  cluster2.SetIRegion(fIRegion);

  TVector3 tmpposition = firstextremity->GetPosition();

  PndTrkHit *hit = NULL, *tmphit = firstextremity;


  //  cout << "first " << firstextremity->GetHitID() << endl;
  //   cout << "lat " << secondextremity->GetHitID() << endl;
  //   cout << "athit " << athit->GetHitID() << endl;
  //   cout << endl;

  //   cluster1.Print();
  //   cluster2.Print();
  for(int iclus = 0; iclus < 2; iclus++) {
    //     cout << "iclus " << iclus << endl;
    //  cluster2.Print();
    // set all unused
    for(int ihit = 0; ihit < GetNofHits(); ihit++) {
      // hit =  (PndTrkHit*) hitlist[ihit];
      hit =  (PndTrkHit*) fHitList.At(ihit);
      hit->SetUsedFlag(kFALSE);
    }


    hit = NULL;
 
    if(iclus == 1) {
      tmpposition = secondextremity->GetPosition();
      tmphit = secondextremity;
    }

    double tmpdistance2 = 1000;
    while(!hit || (hit && (hit->GetPosition() - athit->GetPosition()).Perp() > STTPARALDISTANCE)) {
      //     if(!hit) cout << "here!" << endl;
      //       if(hit) cout << "here " << (hit->GetPosition() - athit->GetPosition()).Perp() << endl;
      for(int ihit = 0; ihit < GetNofHits(); ihit++) {
        //      hit =  (PndTrkHit*) hitlist[ihit];
        hit =  (PndTrkHit*) fHitList.At(ihit);

        //      if(hit->IsUsed()) continue;
        //      cout << "test " << hit->GetHitID() << " " << hit->GetDistance(tmpposition) << endl;
        cout << (*hit == *firstextremity) << " " << (*hit == *secondextremity) << " " << (*hit == *tmphit) << endl;

        // CHECK SearchHit
        if((iclus == 0 && cluster1.SearchHit(hit) != 0) || (iclus == 1 && cluster2.SearchHit(hit) != 0)) {
          cout << hit->GetHitID() << " is already there .................." << endl;
          continue;
        }
        if(*hit == *firstextremity || *hit == *secondextremity || *hit == *tmphit) continue;

        if(hit->GetXYDistance(tmpposition) < STTPARALDISTANCE && (hit->GetPosition() - athit->GetPosition()).Perp() < tmpdistance2) { // CHECK
        //   cout << "add " << hit->GetHitID() << " to  cluster " << iclus + 1 << endl;
          if(iclus == 0) cluster1.AddHit(hit);
          else cluster2.AddHit(hit);
          hit->SetUsedFlag(kTRUE);
          tmpposition = hit->GetPosition();
          tmphit = hit;
          tmpdistance2 = (hit->GetPosition() - athit->GetPosition()).Perp();
          break;
        }
      }
    }
    cout << endl;
  }
  cout << "here2" << endl;

  // add the common hit
  cluster1.AddHit(athit);
  cluster2.AddHit(athit);

  if(cluster1.GetNofHits() == 0 || cluster2.GetNofHits() == 0) return kFALSE;  // CHECK!!!!!!!!!!!!!!!!!



  // set the fUsed flags to true for all used hits
  for(int ihit = 0; ihit < cluster1.GetNofHits(); ihit++) (cluster1.GetHit(ihit))->SetUsedFlag(kTRUE);
  for(int ihit = 0; ihit < cluster2.GetNofHits(); ihit++) (cluster2.GetHit(ihit))->SetUsedFlag(kTRUE);

  return kTRUE;
}

Friends And Related Function Documentation

Bool_t SorterFunction ( PndTrkHit *  hit1, PndTrkHit *  hit2  )

friend

Definition at line 28 of file PndTrkCluster.cxx.

                                                        {
  return *hit1 < *hit2;
}

Member Data Documentation

TVector3 PndTrkCluster::fFromPoint

protected

Definition at line 101 of file PndTrkCluster.h.

Referenced by AddClusterAndSortFrom(), operator=(), and SortFromHit().

TClonesArray PndTrkCluster::fHitList

protected

Definition at line 105 of file PndTrkCluster.h.

Referenced by AddClusterAndSortFrom(), AddHit(), CheckClusterAgainsV(), Clear(), DeleteAllHits(), DeleteHit(), DeleteHitAndCompress(), DeleteHits(), DoesContain(), Draw(), FindExtremitiesFrom(), GetHit(), GetMvdHitList(), GetMvdPixelHitList(), GetMvdStripHitList(), GetNextHit(), GetNofHits(), GetPocaTo(), GetPreviousHit(), GetSttHitList(), GetSttParallelHitList(), GetSttSkewHitList(), IsSorted(), NofSharedHits(), operator=(), operator==(), Print(), ReverseSort(), SearchHit(), Sort(), SortFromHit(), SplitAtHit(), SplitV(), and ~PndTrkCluster().

Int_t PndTrkCluster::fIRegion

protected

Definition at line 102 of file PndTrkCluster.h.

Referenced by AddCluster(), GetIRegion(), operator=(), Print(), SetIRegion(), and SplitV().

---

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

• PndTrkCluster.h
• PndTrkCluster.cxx