-
Notifications
You must be signed in to change notification settings - Fork 2
/
Difference.h
52 lines (47 loc) · 1.75 KB
/
Difference.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
// (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_DIFFERENCE_H
#define SIGNALBLOCKS_DIFFERENCE_H
#include "NOperator.h"
namespace signalblocks {
// implement a(n) - b(n) - c(n) - ...
template<int N, class T>
class Difference
: public NOperator<N, T> {
public:
Difference(std::string name)
: NOperator<N, T>(std::move(name)) {
}
protected: // NOperator interface
// args[0], ... args[N] = a(n), b(n), ...
// implement args[0] - args[1] - ... args[N-1]
virtual void Compute(T* pArgs[N], const std::vector<int>& dims) {
int len = dims[0];
for (size_t i = 1; i < dims.size(); ++i) {
len *= dims[i];
}
for (int i = 0; i < len; ++i) {
T result = pArgs[0][i];
for (int j = 1; j < N; ++j) {
result -= pArgs[j][i]; // TODO handle underflow
}
pArgs[0][i] = result;
}
}
};
}
#endif // SIGNALBLOCKS_DIFFERENCE_H