-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDatalog.cpp
More file actions
227 lines (198 loc) · 4.21 KB
/
Datalog.cpp
File metadata and controls
227 lines (198 loc) · 4.21 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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
#include "Datalog.h"
Datalog::Datalog(int valuesCount
#ifdef DATALOG_USE_EEPROM
, int eeprom_addr
#endif
) :
_moving(false),
_avgSize(valuesCount),
_aggrInited(false)
#ifdef DATALOG_USE_EEPROM
, _rom(eeprom_addr)
#endif
{
_values = new SmartArray(_avgSize);
_outliers = new SmartArray(getOutlierSize());
#ifdef DATALOG_USE_EEPROM
if (eeprom_addr != -1)
{
_rom.read((void*)&_aggr, sizeof(_aggr));
#ifndef DATALOG_USE_TIME
_aggr.minTime = 0;
_aggr.maxTime = 0;
#endif
if (_aggr.min > _aggr.max
|| isnan(_aggr.min)
|| isnan(_aggr.max))
{
_aggrInited = false;
}
else
{
_aggrInited = true;
}
}
#endif
}
Datalog::~Datalog()
{
delete _values;
_values = NULL;
delete _outliers;
_outliers = NULL;
}
int Datalog::getOutlierSize()
{
int outlierSize = _avgSize/OUTLIER_RATIO;
if (outlierSize < 2)
{
outlierSize = 2;
}
return outlierSize;
}
void Datalog::update(double val)
{
double stdDev = _values->getStdDev();
double avg = _values->getAvg();
double deviation = abs(val - avg);
if (_values->isFull())
{
updateAggregates(avg);
}
if (deviation > stdDev * ALLOWED_DEVIATION
&& _values->isFull())
{
// questionable value
_outliers->pushValue(val);
if (_outliers->isFull())
{
if (_outliers->getStdDev() < stdDev)
{
// new normal
delete _values;
_values = new SmartArray(_avgSize, _outliers);
delete _outliers;
_outliers = new SmartArray(getOutlierSize());
_moving = true;
}
else
{
// keep us from reaching 0 stdDev
_values->pushValue(_outliers->getAvg());
}
}
}
else
{
// update value
_values->pushValue(val);
_moving = false;
}
}
Aggregate Datalog::getAggregates()
{
if (!_aggrInited)
{
double current = getValue();
Aggregate ret;
ret.min = current;
ret.max = current;
ret.avg = current;
ret.sample_count = 0;
unsigned long timeNow = getNow();
ret.minTime = timeNow;
ret.maxTime = timeNow;
return ret;
}
else
{
return _aggr;
}
}
unsigned long Datalog::getNow()
{
#ifdef DATALOG_USE_TIME
return now();
#else
return millis();
#endif
}
void Datalog::updateAggregates(double value)
{
if (!_aggrInited)
{
_aggr.max = value;
_aggr.min = value;
_aggr.sample_count = 1;
_aggr.avg = value;
long timeNow = getNow();
_aggr.minTime = timeNow;
_aggr.maxTime = timeNow;
_aggrInited = true;
#ifdef DATALOG_USE_EEPROM
if (_rom.isValid())
{
_rom.write(
(void*)&_aggr,
sizeof(_aggr));
}
#endif
}
else
{
if (value > _aggr.max)
{
_aggr.max = value;
_aggr.maxTime = getNow();
#ifdef DATALOG_USE_EEPROM
if (_rom.isValid())
{
_rom.seek(0);
_rom.write(
(void*)&_aggr,
sizeof(_aggr));
}
#endif
}
else if (value < _aggr.min)
{
_aggr.min = value;
_aggr.minTime = getNow();
#ifdef DATALOG_USE_EEPROM
if (_rom.isValid())
{
_rom.seek(0);
_rom.write(
(void*)&_aggr,
sizeof(_aggr));
}
#endif
}
if (_values->isLooping())
{
_aggr.avg
= (_aggr.avg * _aggr.sample_count + value)
/ ++_aggr.sample_count;
}
}
}
void Datalog::resetAggregates()
{
_aggrInited = false;
}
boolean Datalog::isMoving()
{
return _moving;
}
boolean Datalog::isValid()
{
return _values->isFull() && !_moving;
}
double Datalog::getValue()
{
return _values->getAvg();
}
void Datalog::reset()
{
_values->clear();
}