15 #ifndef PndFtsHoughSpacePeak_H
16 #define PndFtsHoughSpacePeak_H
23 #include "FairLogger.h"
39 inline void replaceBins( Int_t height, Int_t firstBin, Int_t firstHitIdx );
40 inline void addBin(Int_t binNumber, Int_t hitIdx);
65 fBins.insert(binNumber);
71 addBin(firstBin, firstHitIdx);
85 const std::set< Int_t > binsToSearch = toCheck.
getBins();
87 for (std::set< Int_t >::iterator it = binsToSearch.begin(); it != binsToSearch.end(); ++it){
88 std::set< Int_t >::iterator itFind =
fBins.find( *it );
89 if ( itFind !=
fBins.end() )
return kTRUE;
96 const std::set< Int_t > binsToMerge = toAdd.
getBins();
97 fBins.insert( binsToMerge.begin(), binsToMerge.end() );
99 const std::set< Int_t > hitsToMerge = toAdd.
getHitIds();
100 fHitIds.insert( hitsToMerge.begin(), hitsToMerge.end() );
Bool_t isFinished() const
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)
void replaceBins(Int_t height, Int_t firstBin, Int_t firstHitIdx)
void mergeWith(const PndFtsHoughSpacePeak &toAdd)
const std::set< Int_t > & getHitIds() const
std::set< Int_t > fHitIds
void addBin(Int_t binNumber, Int_t hitIdx)
ClassDef(PndFtsHoughSpacePeak, 1)
const std::set< Int_t > & getBins() const