Belle II Software development
|
Nested class acting as a container the per-detector weights. More...
#include <PIDDetectorWeights.h>
Public Attributes | |
bool | m_isEmpty |
Default constructor. | |
std::set< double > | m_pBinEdges |
Set of p bins edges. | |
std::set< double > | m_thetaBinEdges |
Set of theta bins edges. | |
int | m_nPBins |
Number of p bins. | |
int | m_nThetaBins |
Number of theta bins. | |
std::unordered_map< double, unsigned int > | m_linBinIdxsToRowIdxs |
Map the linearised index of the (p, theta) bin indexes to the row index in the (filtered) table. | |
std::map< std::string, std::vector< double > > | m_weightsPerDet |
Map each detector to its vector of weights. | |
Private Member Functions | |
ClassDef (WeightsTable, 1) | |
Needed for sub-class schema evolution. | |
Nested class acting as a container the per-detector weights.
Conceptually, an instance of this class is associated to one std charged hypothesis.
Definition at line 39 of file PIDDetectorWeights.h.
|
inline |
Definition at line 42 of file PIDDetectorWeights.h.
bool m_isEmpty |
Default constructor.
Definition at line 48 of file PIDDetectorWeights.h.
std::unordered_map<double, unsigned int> m_linBinIdxsToRowIdxs |
Map the linearised index of the (p, theta) bin indexes to the row index in the (filtered) table.
Used for fast lookup in the event loop.
Definition at line 60 of file PIDDetectorWeights.h.
int m_nPBins |
Number of p bins.
Definition at line 53 of file PIDDetectorWeights.h.
int m_nThetaBins |
Number of theta bins.
Definition at line 54 of file PIDDetectorWeights.h.
std::set<double> m_pBinEdges |
Set of p bins edges.
Definition at line 50 of file PIDDetectorWeights.h.
std::set<double> m_thetaBinEdges |
Set of theta bins edges.
Definition at line 51 of file PIDDetectorWeights.h.
std::map<std::string, std::vector<double> > m_weightsPerDet |
Map each detector to its vector of weights.
By construction, the size of each vector is equal to the number of rows in the (filtered) table.
Definition at line 65 of file PIDDetectorWeights.h.