forked from AliceO2Group/AliceO2
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDcsCcdbObjects.cxx
More file actions
64 lines (59 loc) · 2.03 KB
/
DcsCcdbObjects.cxx
File metadata and controls
64 lines (59 loc) · 2.03 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
// Copyright 2019-2020 CERN and copyright holders of ALICE O2.
// See https://alice-o2.web.cern.ch/copyright for details of the copyright holders.
// All rights not expressly granted are reserved.
//
// This software is distributed under the terms of the GNU General Public
// License v3 (GPL Version 3), copied verbatim in the file "COPYING".
//
// In applying this license CERN does not waive the privileges and immunities
// granted to it by virtue of its status as an Intergovernmental Organization
// or submit itself to any jurisdiction.
/// \file DcsCcdbObjects.cxx
/// \brief Objects which are created from DCS DPs and stored in the CCDB
/// \author Ole Schmidt, ole.schmidt@cern.ch
#include "DataFormatsTRD/DcsCcdbObjects.h"
#include <fairlogger/Logger.h>
#include <string>
using namespace o2::trd;
void TRDDCSMinMaxMeanInfo::print() const
{
std::time_t tStart = firstTS / 1e3;
std::string tStartStr = std::asctime(std::localtime(&tStart));
tStartStr.erase(tStartStr.length() - 1); // remove '\n', since it is added by FairLogger anyways
std::time_t tEnd = lastTS / 1e3;
std::string tEndStr = std::asctime(std::localtime(&tEnd));
tEndStr.erase(tEndStr.length() - 1);
LOG(info) << "Raw time interval from " << firstTS << " to " << lastTS << ". In local time:";
LOG(info) << tStartStr;
LOG(info) << tEndStr;
LOG(info) << "Min value: " << minValue;
LOG(info) << "Max value: " << maxValue;
LOG(info) << "Mean value: " << meanValue;
LOG(info) << "Number of points added: " << nPoints;
}
void TRDDCSMinMaxMeanInfo::addPoint(float value, uint64_t ts)
{
if (nPoints == 0) {
firstTS = ts;
lastTS = ts;
minValue = value;
maxValue = value;
meanValue = value;
} else {
if (value < minValue) {
minValue = value;
}
if (value > maxValue) {
maxValue = value;
}
// I am not sure whether the DPs arrive always ordered in time
if (ts > lastTS) {
lastTS = ts;
}
if (ts < firstTS) {
firstTS = ts;
}
meanValue += (value - meanValue) / (nPoints + 1);
}
++nPoints;
}