16 for (uint32_t iter = 0; iter <
m_data.size(); ++iter) {
18 m_data[iter].adccountsum = 0;
19 m_data[iter].adccountsumsq = 0;
24 if (ipoint >=
m_data.size())
38 std::vector<uint8_t>
result(0);
40 result.push_back(
m_data[
ii].nentries);
45 std::vector<uint32_t>
result(0);
47 result.push_back(
m_data[
ii].adccountsum);
52 std::vector<uint32_t>
result(0);
54 result.push_back(
m_data[
ii].adccountsumsq);
void init(uint16_t row, uint16_t col, uint16_t npoints)
std::vector< uint32_t > getsum() const
std::vector< uint8_t > getnentries() const
void setrowcol(uint16_t row, uint16_t col)
std::pair< uint16_t, uint16_t > m_row_and_column
std::vector< datacontainer > m_data
std::vector< uint32_t > getsumsquares() const
void fill(uint32_t ipoint, uint32_t adcval)