#include <MuonHoughHisto2DContainer.h>
Definition at line 10 of file MuonHoughHisto2DContainer.h.
◆ MuonHoughHisto2DContainer()
| MuonHoughHisto2DContainer::MuonHoughHisto2DContainer |
( |
| ) |
|
|
default |
◆ ~MuonHoughHisto2DContainer()
| virtual MuonHoughHisto2DContainer::~MuonHoughHisto2DContainer |
( |
| ) |
|
|
virtualdefault |
◆ getHisto()
return histogram at place id
Definition at line 39 of file MuonHoughHisto2DContainer.h.
std::vector< std::unique_ptr< MuonHoughHisto2D > > m_histos
vector of MuonHoughHisto2D*
◆ getMaximumBinnumber()
| std::pair< int, int > MuonHoughHisto2DContainer::getMaximumBinnumber |
( |
| ) |
const |
return maximum of container gives first id histogram (sector) and then maximumbin
Definition at line 9 of file MuonHoughHisto2DContainer.cxx.
9 {
10
11 double maximum{0.};
12 int maxid{-1}, maxbin{-1};
13 for (
int histoid = 0; histoid <
size(); histoid++) {
14 std::pair<int, double> histomax =
16
17 if (histomax.second > maximum) {
18 maximum = histomax.second;
19 maxid = histoid;
20 maxbin = histomax.first;
21 }
22 }
23 return std::make_pair(maxid, maxbin);
24}
int size() const
returns size of container
MuonHoughHisto2D * getHisto(int id) const
return histogram at place id
std::pair< int, double > getMaximumBin(unsigned int maximum_number=0)
returns binnumber and maximum of maximum number maximum_number
◆ push_back()
| void MuonHoughHisto2DContainer::push_back |
( |
std::unique_ptr< MuonHoughHisto2D > | histo | ) |
|
|
inline |
◆ reserve()
| void MuonHoughHisto2DContainer::reserve |
( |
int | size | ) |
|
|
inline |
◆ reset()
| void MuonHoughHisto2DContainer::reset |
( |
| ) |
const |
◆ size()
| int MuonHoughHisto2DContainer::size |
( |
| ) |
const |
|
inline |
◆ m_histos
| std::vector<std::unique_ptr<MuonHoughHisto2D> > MuonHoughHisto2DContainer::m_histos {} |
|
private |
The documentation for this class was generated from the following files: