12 int maxid{-1}, maxbin{-1};
13 for (
int histoid = 0; histoid <
size(); histoid++) {
14 std::pair<int, double> histomax =
17 if (histomax.second > maximum) {
18 maximum = histomax.second;
20 maxbin = histomax.first;
23 return std::make_pair(maxid, maxbin);
27 for (
int histoid = 0; histoid <
size(); histoid++) {
getHisto(histoid)->
reset(); }
std::pair< int, int > getMaximumBinnumber() const
return maximum of container gives first id histogram (sector) and then maximumbin
void reset() const
resets histograms
int size() const
returns size of container
MuonHoughHisto2D * getHisto(int id) const
return histogram at place id
MuonHoughHisto2DContainer()
constructor
std::pair< int, double > getMaximumBin(unsigned int maximum_number=0)
returns binnumber and maximum of maximum number maximum_number
void reset()
clears histogram and bins_above_threshold