20 #ifndef PndHoughData_H_ 21 #define PndHoughData_H_ 39 delete fPndHoughSpace;
40 for (
size_t i = 0;
i < fHits.size(); ++
i)
45 void AddHits(TClonesArray *hits, TString branchName);
47 void AddHit(FairLink link);
53 void Init(
int NBins1 = 450,
int NBins2 = 450)
59 fPndHoughSpace->
Init();
70 fMapFairLinktoFairHit.clear();
71 fMapFairLinktoIsochrone.clear();
72 fMapFairLinktoIsochroneError.clear();
73 fMapFairLinktoTubeId.clear();
74 fMapTubetoHit.clear();
76 fGEMNeighbors.clear();
77 fMapNumberhittedSTTNeighbors.clear();
79 fPndHoughSpace->
clear();
82 std::vector<FairHit *>
GetHits()
const {
return fHits; }
84 std::vector<FairLink>
GetLinks()
const {
return fLinks; }
115 std::map<FairLink, FairHit *> fMapFairLinktoFairHit;
116 std::map<FairLink, Double_t> fMapFairLinktoIsochrone;
117 std::map<FairLink, Double_t> fMapFairLinktoIsochroneError;
118 std::map<FairLink, Int_t> fMapFairLinktoTubeId;
119 std::map<FairLink, std::vector<FairLink>> fGEMNeighbors;
120 std::map<FairLink, double> fMapNumberhittedSTTNeighbors;
121 std::map<int, FairHit *> fMapTubetoHit;
123 std::vector<FairHit *> fHits;
124 std::vector<FairLink> fGEMLinks;
125 std::vector<FairLink> fSTTLinks;
126 std::vector<FairLink> fLinks;
127 std::vector<int> fhittedTubes;
void AddHit(FairLink link)
Adds a sigle hit to the used data structure for faster access. Data are stored in different maps...
void AddHits(TClonesArray *hits, TString branchName)
Adds hits to the used data structure for faster access. Data are stored in different maps...
std::map< FairLink, Int_t > GetMapFairLinktoTubeId() const
Returns the map linking FairLinks to corresponding tubeId.
std::map< FairLink, Double_t > GetMapFairLinktoIsochroneError() const
Returns the map linking FairLinks to isochrone radius errors.
void CreateSTTNeighborhoodData()
For all STT hits all other STT neighbors are counted and stored in a map.
std::vector< FairHit * > GetHits() const
Returns a vector of all hits in the event.
void Init()
Initializes the Hough space.
std::map< FairLink, FairHit * > GetMapFairLinktoFairHit() const
Returns the map linking FairLinks to FairHits.
PndSttStrawMap * GetStrawMap() const
Returns the straw map for a fast access.
PndHoughData(TClonesArray *fTubeArray)
int GetNumOfGEMNeighbors(FairLink link)
Returns the number of GEM hits in a distance d < 1.5 cm.
virtual void SetNBins1(double n)
Sets the number of bins in x direction of the Hough space.
PndSttGeometryMap * GetGeometryMap() const
Returns the geometry map for a fast access.
std::map< int, FairHit * > GetMapTubetoHit() const
Returns the map linking a tube to a FairHit.
std::map< FairLink, Double_t > GetMapFairLinktoIsochrone() const
Returns the map linking FairLinks to isochrone radii.
PndHoughSpace * GetHoughSpace()
Returns the Hough space.
void Init(int NBins1=450, int NBins2=450)
Initializes the Hough space.
void clear()
Clears all data maps.
std::vector< int > GetHittedTubes()
Returns a vector of all hitted tubes.
double GetNumOfSTTNeighbors(FairLink link)
Returns the number of neighbored STT hits. The return value is a double (not a int) to avoid a necess...
virtual void SetNBins2(double n)
Sets the number of bins in y direction of the Hough space.
std::vector< FairLink > GetGEMNeighbors(FairLink link)
Returns a vector of all GEM hits in a distance d < 1.5 cm from a certain GEM hit. ...
std::vector< FairLink > GetLinks() const
Returns a vector of all FairLinks in the event.
void CreateGEMNeighborhoodData()
For all GEM hits all other GEM hits in a certain distance (hier 1.5 cm) are counted and stored as nei...
void clear()
Clears the Hough space.