14 #ifndef PndFtsHoughSpacePeak_H 15 #define PndFtsHoughSpacePeak_H 22 #include "FairLogger.h" 34 inline void replaceBins(Int_t height, Int_t firstBin, Int_t firstHitIdx);
35 inline void addBin(Int_t binNumber, Int_t hitIdx);
42 const std::set<Int_t> &
getBins()
const {
return fBins; };
43 const std::set<Int_t> &
getHitIds()
const {
return fHitIds; };
49 std::set<Int_t> fBins;
50 std::set<Int_t> fHitIds;
59 fBins.insert(binNumber);
60 fHitIds.insert(hitIdx);
66 addBin(firstBin, firstHitIdx);
81 const std::set<Int_t> binsToSearch = toCheck.
getBins();
83 for (std::set<Int_t>::iterator it = binsToSearch.begin(); it != binsToSearch.end(); ++it) {
84 std::set<Int_t>::iterator itFind = fBins.find(*it);
85 if (itFind != fBins.end())
94 const std::set<Int_t> binsToMerge = toAdd.
getBins();
95 fBins.insert(binsToMerge.begin(), binsToMerge.end());
97 const std::set<Int_t> hitsToMerge = toAdd.
getHitIds();
98 fHitIds.insert(hitsToMerge.begin(), hitsToMerge.end());
Bool_t binsOverlapWith(const PndFtsHoughSpacePeak &toCheck)
void setFinished(Bool_t newVal)
Class for saving peaks of a Hough space.
PndFtsHoughSpacePeak(Int_t height=noVal, Int_t firstBin=noVal, Int_t firstHitIdx=noVal)
const std::set< Int_t > & getBins() const
void replaceBins(Int_t height, Int_t firstBin, Int_t firstHitIdx)
void mergeWith(const PndFtsHoughSpacePeak &toAdd)
Bool_t isFinished() const
void addBin(Int_t binNumber, Int_t hitIdx)
const std::set< Int_t > & getHitIds() const