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
|
//////////////////////////////////////////////////////////////////////
// Name: sma-2d
// Purpose: Simple Moving average over N values for R rows
//////////////////////////////////////////////////////////////////////
/*
* Copyright (C) 2023 Johannes Linkels <jlinkels@linxtech.net>
*
* Licensed under the GNU General Public License Version 2
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
#include "sma_2d.h"
#include <stdio.h>
SMA_2D::SMA_2D(int numRecords, int numAverage) { Init(numRecords, numAverage); }
SMA_2D::~SMA_2D() {
index.clear();
sum.clear();
numSummed.clear();
prevValues.clear();
}
int SMA_2D::AddVal(int recordNum, double val) {
if (!(recordNum < m_NumRecords)) {
return 1;
}
// prevValues is a ring buffer, holding the last N values,
// with N the length of the average numAverage.
// A new value is added to the sum, the oldest value
// is substracted. The new value is stored in prevValues
// and remains there for N itereations.
int curIndex = index[recordNum];
sum[recordNum] -= prevValues[recordNum][curIndex];
sum[recordNum] += val;
prevValues[recordNum][curIndex] = val;
if (++curIndex == m_NumAverage) {
curIndex = 0;
}
if (++numSummed[recordNum] > m_NumAverage) {
numSummed[recordNum] = m_NumAverage;
}
index[recordNum] = curIndex;
return 0;
}
double SMA_2D::GetSMA(int recordNum) {
// Calculate the average only over the values which are
// added. If not, it would take until all values are added
// until the average shows the final value.
// If no samples have been added yet, prevent division by zero.
#ifdef _DEBUG
if (recordNum >= m_NumRecords) abort();
#endif
if (numSummed[recordNum] == 0) {
return 0.0;
}
double sma = sum[recordNum] / numSummed[recordNum];
return sma;
}
int SMA_2D::GetNumAverage() { return m_NumAverage; }
int SMA_2D::GetNumSummed(int recordNum) { return numSummed[recordNum]; }
void SMA_2D::SetNumAverage(int numAverage) {
// Alters the length of the averaging window
// without changing the number of records
// This re-initializes the vectors
Init(m_NumRecords, numAverage);
}
void SMA_2D::SetNumRecords(int numRecords) {
// Alters the number of records without changing
// the length of the averaging window
// This re-initializes the vectors
Init(numRecords, m_NumAverage);
}
void SMA_2D::Init(int numRecords, int numAverage) {
m_NumRecords = numRecords;
m_NumAverage = numAverage;
index.clear();
sum.clear();
numSummed.clear();
prevValues.clear();
index.resize(numRecords, 0);
sum.resize(numRecords, 0);
numSummed.resize(numRecords, 0);
prevValues.resize(numRecords, std::vector<double>(numAverage));
}
|
