50 LOG(debug) << GetName() <<
" Event " <<
fEventNum;
54 for (
Int_t i = 0; i < nofDigis; i++) {
72 std::sort(times.begin(), times.end());
73 for (
auto it = times.begin(); it != times.end(); ++it) {
75 LOG(warn) <<
"Digi time < 0.: "
76 <<
"address: " << address <<
" time: " << *it <<
" ns";
78 if (it != times.begin()) {
79 Double_t dt = *it - *std::prev(it);
80 fHM->H1(
"fhDigiDt")->Fill(dt);
82 fHM->H1(
"fhDigiDtEdge")->Fill(dt);
90 std::sort(digis.begin(), digis.end());
91 for (
auto it0 = digis.begin(); it0 != digis.end(); ++it0) {
94 for (
auto it1 = it0 + 1; it1 != digis.end(); ++it1) {
98 if (indX0 == indX1 && indY0 == indY1)
continue;
99 if (indY0 == indY1)
fHM->H1(
"fhDigiDistH")->Fill(indX1 - indX0);
100 if (indX0 == indX1)
fHM->H1(
"fhDigiDistV")->Fill(indY1 - indY0);
101 if (abs(indX0 - indX1) > 1 || abs(indY0 - indY1) > 1)
continue;
102 fHM->H2(
"fhDigiNeighbours")->Fill(indX1 - indX0, indY0 - indY1);