-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathRunningAverageGozzi.cpp
More file actions
128 lines (110 loc) · 2.92 KB
/
RunningAverageGozzi.cpp
File metadata and controls
128 lines (110 loc) · 2.92 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
//
// FILE: RunningAverage.cpp
// AUTHOR: Rob Tillaart
// VERSION: 0.2.06
// DATE: 2015-mar-07
// PURPOSE: RunningAverage library for Arduino
//
// The library stores N individual values in a circular buffer,
// to calculate the running average.
//
// HISTORY:
// 0.1.00 - 2011-01-30 initial version
// 0.1.01 - 2011-02-28 fixed missing destructor in .h
// 0.2.00 - 2012-??-?? Yuval Naveh added trimValue (found on web)
// http://stromputer.googlecode.com/svn-history/r74/trunk/Arduino/Libraries/RunningAverage/RunningAverage.cpp
// 0.2.01 - 2012-11-21 refactored
// 0.2.02 - 2012-12-30 refactored trimValue -> fillValue
// 0.2.03 - 2013-11-31 getElement
// 0.2.04 - 2014-07-03 added memory protection
// 0.2.05 - 2014-12-16 changed float -> double
// 0.2.06 - 2015-03-07 all size uint8_t
// 0.2.06 - 2016-09-13 getMin(), getMax() byGozzi
//
// Released to the public domain
//
#include "RunningAverageGozzi.h"
#include <stdlib.h>
RunningAverage::RunningAverage(uint8_t size)
{
_size = size;
_ar = (double*) malloc(_size * sizeof(double));
if (_ar == NULL) _size = 0;
clear();
}
RunningAverage::~RunningAverage()
{
if (_ar != NULL) free(_ar);
}
// resets all counters
void RunningAverage::clear()
{
_cnt = 0;
_idx = 0;
_sum = 0.0;
_max = 0; // byGozzi
_min = 4294967296; // byGozzi
for (uint8_t i = 0; i< _size; i++)
{
_ar[i] = 0.0; // keeps addValue simple
}
}
// adds a new value to the data-set
void RunningAverage::addValue(double value)
{
if (_ar == NULL) return;
_sum -= _ar[_idx];
_ar[_idx] = value;
_sum += _ar[_idx];
_idx++;
if (_idx == _size) _idx = 0; // faster than %
if (_cnt < _size) _cnt++;
}
// returns the average of the data-set added sofar
double RunningAverage::getAverage()
{
if (_cnt == 0) return NAN;
return _sum / _cnt;
}
// returns the value of an element if exist, 0 otherwise
double RunningAverage::getElement(uint8_t idx)
{
if (idx >=_cnt ) return NAN;
return _ar[idx];
}
// fill the average with a value
// the param number determines how often value is added (weight)
// number should preferably be between 1 and size
void RunningAverage::fillValue(double value, uint8_t number)
{
clear(); // TODO conditional? if (clr) clear();
for (uint8_t i = 0; i < number; i++)
{
addValue(value);
}
}
// returns the max (byGozzi)
double RunningAverage::getMax()
{
// if (_cnt == 0) return NAN;
_max=0;_min=4294967296;
for (int i = 0; i< _size; i++)
{
if (_ar[i] >= _max) _max=_ar[i]; // keeps max value
if (_ar[i] <= _min) _min=_ar[i]; // keeps min value
}
return _max;
}
// returns the min (byGozzi)
double RunningAverage::getMin()
{
// if (_cnt == 0) return NAN;
_max=0;_min=4294967296;
for (int i = 0; i< _size; i++)
{
if (_ar[i] >= _max) _max=_ar[i]; // keeps max value
if (_ar[i] <= _min) _min=_ar[i]; // keeps min value
}
return _min;
}
// END OF FILE