17 for (
size_t ib = 0; ib < persObj->
type.size(); ++ib) {
18 int typ = persObj->
type[ib];
23 float((persObj->
min)[ib]),
24 float((persObj->
max)[ib]),
29 size_t subbins = size_t(0.5*((persObj->
bins)[ib]-1));
32 float((persObj->
min)[ib]),
33 float((persObj->
max)[ib]),
39 std::vector<float> cboundaries = (persObj->
boundaries)[ib];
44 std::vector< std::pair<int,float> > chbounds = ((persObj->
hbounds)[ib]);
58 persObj->
type.push_back(bd.type);
59 persObj->
option.push_back(bd.option);
60 persObj->
binvalue.push_back(bd.binvalue);
61 persObj->
bins.push_back(bd.bins);
62 persObj->
min.push_back(bd.min);
63 persObj->
max.push_back(bd.max);
64 persObj->
step.push_back(bd.step);
65 persObj->
subStep.push_back(bd.subStep);
67 persObj->
refphi.push_back(bd.refphi);
68 persObj->
hbounds.push_back(bd.hbounds);
virtual void transToPers(const Trk::BinUtility *transObj, Trk::BinUtility_p1 *persObj, MsgStream &log)
virtual void persToTrans(const Trk::BinUtility_p1 *persObj, Trk::BinUtility *transObj, MsgStream &log)
std::vector< unsigned int > bins
std::vector< int > option
std::vector< float > step
std::vector< std::vector< std::pair< int, float > > > hbounds
std::vector< float > subStep
std::vector< std::vector< float > > boundaries
std::vector< float > refphi
std::vector< int > binvalue
A generic symmetric BinUtility, for fully symmetric binning in terms of binning grid and binning type...
void clear()
Clear the data.
const std::vector< BinningData > & binningData() const
return the binning data
This class holds all the data necessary for the bin calculation.
BinningOption
enum BinValue
BinningValue
how to take the global / local position