33 void Copy(TObject&)
const override;
34 void Clear(Option_t* opt =
"all")
override;
38 void CreateAddback(
const std::vector<T*>& hits, std::vector<T*>& addbacks, std::vector<UShort_t>& nofFragments)
44 for(
auto hit : hits) {
46 for(j = 0; j < addbacks.size(); ++j) {
48 addbacks[j]->Add(hit);
52 ++(nofFragments.at(j));
57 if(j == addbacks.size()) {
60 T* tmpT =
static_cast<T*
>(hit->IsA()->New());
62 addbacks.push_back(tmpT);
63 nofFragments.push_back(1);
72 suppressedHits.clear();
73 for(
auto hit : hits) {
74 bool suppress =
false;
86 T* tmpT =
static_cast<T*
>(hit->IsA()->New());
88 suppressedHits.push_back(tmpT);
100 std::vector<bool> suppressed;
101 for(
auto hit : hits) {
103 bool suppress =
false;
113 for(j = 0; j < addbacks.size(); ++j) {
115 addbacks[j]->Add(hit);
119 ++(nofFragments.at(j));
121 suppressed[j] =
true;
127 if(j == addbacks.size()) {
130 T* tmpT =
static_cast<T*
>(hit->IsA()->New());
132 addbacks.push_back(tmpT);
133 nofFragments.push_back(1);
134 suppressed.push_back(suppress);
138 for(j = 0; j < addbacks.size(); ++j) {
141 addbacks.erase(addbacks.begin() + j);
142 nofFragments.erase(nofFragments.begin() + j);
143 suppressed.erase(suppressed.begin() + j);
virtual const std::vector< TDetectorHit * > & GetHitVector() const
void Clear(Option_t *opt="all") override
!
void Copy(TObject &) const override
!
TSuppressed(TSuppressed &&) noexcept=default
void CreateAddback(const std::vector< T * > &hits, std::vector< T * > &addbacks, std::vector< UShort_t > &nofFragments)
virtual bool AddbackCriterion(const TDetectorHit *, const TDetectorHit *)
void CreateSuppressed(const TBgo *bgo, const std::vector< T * > &hits, std::vector< T * > &suppressedHits)
void CreateSuppressedAddback(const TBgo *bgo, const std::vector< T * > &hits, std::vector< T * > &addbacks, std::vector< UShort_t > &nofFragments)
virtual bool SuppressionCriterion(const TDetectorHit *, const TDetectorHit *)
TSuppressed(const TSuppressed &)=default