-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathRunningAverage.h
55 lines (47 loc) · 1.68 KB
/
RunningAverage.h
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
// (c) 2016 Neeraj Sharma <neeraj.sharma@alumni.iitg.ernet.in>.
// This file is part of SignalBlocks.
//
// SignalBlocks 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 3 of the License, or
// (at your option) any later version.
//
// SignalBlocks 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 SignalBlocks. If not, see <http://www.gnu.org/licenses/>.
//
#ifndef SIGNALBLOCKS_RUNNINGAVERAGE_H
#define SIGNALBLOCKS_RUNNINGAVERAGE_H
#include "UnaryOperator.h"
#include <stdint.h>
namespace signalblocks {
/// computes an infinite running average
///
/// @caution For very long running simulations or larger data sets
/// an overflow is bound to happen.
template<class T>
class RunningAverage
: public UnaryOperator<T> {
public:
RunningAverage(std::string name)
: UnaryOperator<T>(std::move(name)),
mNumSamples(0),
mResult(0) {
}
protected: // UnaryOperator interface
virtual T Compute(const T& arg1) {
T result = ((mResult * mNumSamples) + arg1) / (mNumSamples + 1);
++mNumSamples;
mResult = result;
return mResult;
}
private:
uint64_t mNumSamples;
T mResult;
};
}
#endif // SIGNALBLOCKS_RUNNINGAVERAGE_H