-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathRuns.cpp
More file actions
291 lines (278 loc) · 8.6 KB
/
Copy pathRuns.cpp
File metadata and controls
291 lines (278 loc) · 8.6 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
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
#include "Runs.h"
#include <iostream>
#include <fstream>
using namespace std;
RRRuns::RRRuns(std::vector<double> RR, std::vector<int> annot, bool writeLastRun) : rrIntervals(std::move(RR)), annotations(std::move(annot)), writeLastRun(writeLastRun)
{
// declaring the accumulator -- all initialized to 0
accumulator.dec.resize(rrIntervals.size());
accumulator.acc.resize(rrIntervals.size());
accumulator.neu.resize(rrIntervals.size());
}
void RRRuns::printAddresses(RunType runType, int runLength, bool referenceBeat)
{
cout << "run type: " << (runType > 0 ? "DEC" : "ACC") << " run length: " << runLength << endl;
if (!analyzed_)
{
analyzeRuns();
}
int referenceOffset = referenceBeat ? 1 : 0;
for (int j = 0; j < accumulator.runs_addresses.size(); j++)
{
if (accumulator.runs_addresses[j][2] == runType && accumulator.runs_addresses[j][1] == runLength)
{
// remembering that the runs address is the address of the last beat belonging to a run
for (int i = -(accumulator.runs_addresses[j][1] + referenceOffset); i < 0; i++) // + 1, because we want also to see the reference beat
{
cout << rrIntervals[accumulator.runs_addresses[j][0] + i] << " ";
}
cout << "\n";
}
}
}
void RRRuns::updateRunsAddresses(vector<int> new_entry)
{
this->accumulator.runs_addresses.push_back(new_entry);
}
void RRRuns::analyzeRuns()
{
bool flagDec = false;
bool flagAcc = false;
bool flagNeu = false;
int indexDec = 0;
int indexAcc = 0;
int indexNeu = 0;
int runCounter = 0;
int runningRRNumber = 0;
int currentAddress = 0; ///> holds the address in runs_addresses array, adds consecutive runs
/// rewind to the first good flag
while (annotations[runningRRNumber] != 0 && runningRRNumber < rrIntervals.size())
{
runningRRNumber++;
}
// /initializing the flags
runningRRNumber++; ///> only for stylistic reasons: so that I can use runningRRNumber - 1 below
if (rrIntervals[runningRRNumber - 1] < rrIntervals[runningRRNumber])
{
flagDec = true;
indexDec++;
}
if (rrIntervals[runningRRNumber - 1] > rrIntervals[runningRRNumber])
{
flagAcc = true;
indexAcc++;
}
if (rrIntervals[runningRRNumber - 1] == rrIntervals[runningRRNumber])
{
flagNeu = true;
indexNeu++;
}
for (int i = runningRRNumber + 1; i < rrIntervals.size(); i++) // + 2, in order to be able to use runningRRNumber - 1 later
{
// update runningRRNumber (we start from +2 above)
// what happens if annotation is not 0? We reset the flags and re-initiate the calculations
if (annotations[i - 1] != 0)
{
indexDec = 0;
indexAcc = 0;
indexNeu = 0;
// rewind to the first good rr_(n-1)
while (annotations[runningRRNumber - 1] != 0)
{
runningRRNumber++;
i++;
}
// reinitializing the flags
if (rrIntervals[runningRRNumber - 1] < rrIntervals[runningRRNumber])
{
flagDec = true;
indexDec++;
}
if (rrIntervals[runningRRNumber - 1] > rrIntervals[runningRRNumber])
{
flagAcc = true;
indexAcc++;
}
if (rrIntervals[runningRRNumber - 1] == rrIntervals[runningRRNumber])
{
flagNeu = true;
indexNeu++;
}
continue; // and leave the main loop
}
// if as a result of skipping over non sinus beats we are over the length of the rr intervals time series, break out of the loop
if (i >= rrIntervals.size())
{
break;
}
if (rrIntervals[i - 1] < rrIntervals[i])
{
indexDec++;
if (flagDec)
{
runningRRNumber++;
}
else
{
if (flagAcc)
{
accumulator.acc[indexAcc] += 1;
updateRunsAddresses({runningRRNumber, indexAcc, RunType::ACC});
currentAddress++;
runningRRNumber++;
indexAcc = 0;
flagAcc = false;
flagDec = true;
}
if (flagNeu)
{
accumulator.neu[indexNeu] += 1;
updateRunsAddresses({runningRRNumber, indexNeu, RunType::NEU});
currentAddress++;
runningRRNumber++;
indexNeu = 0;
flagNeu = false;
flagDec = true;
}
}
}
if (rrIntervals[i - 1] > rrIntervals[i])
{
{
indexAcc++;
if (flagAcc)
{
runningRRNumber++;
}
else
{
if (flagDec)
{
accumulator.dec[indexDec] += 1;
updateRunsAddresses({runningRRNumber, indexDec, RunType::DEC});
currentAddress++;
runningRRNumber++;
indexDec = 0;
flagDec = false;
flagAcc = true;
}
if (flagNeu)
{
accumulator.neu[indexNeu] += 1;
updateRunsAddresses({runningRRNumber, indexNeu, RunType::NEU});
currentAddress++;
runningRRNumber++;
indexNeu = 0;
flagNeu = false;
flagAcc = true;
}
}
}
}
if (rrIntervals[i - 1] == rrIntervals[i])
{
indexNeu++;
if (flagNeu)
{
runningRRNumber++;
}
else
{
if (flagDec)
{
accumulator.dec[indexDec] += 1;
updateRunsAddresses({runningRRNumber, indexDec, RunType::DEC});
currentAddress++;
runningRRNumber++;
indexDec = 0;
flagDec = false;
flagNeu = true;
}
if (flagAcc)
{
accumulator.acc[indexAcc] += 1;
updateRunsAddresses({runningRRNumber, indexAcc, RunType::ACC});
currentAddress++;
runningRRNumber++;
indexAcc = 0;
flagAcc = false;
flagNeu = true;
}
}
}
}
// writing the last run
if (this->writeLastRun)
{
if (indexAcc > 0)
{
accumulator.acc[indexAcc] += 1;
updateRunsAddresses({runningRRNumber, indexAcc, RunType::ACC});
}
if (indexDec > 0)
{
accumulator.dec[indexDec] += 1;
updateRunsAddresses({runningRRNumber, indexDec, RunType::DEC});
}
if (indexNeu > 0)
{
accumulator.neu[indexNeu] += 1;
updateRunsAddresses({runningRRNumber, indexNeu, RunType::NEU});
}
}
else
{
cout << "the last run not needed" << endl;
}
analyzed_ = true;
/*for (int elem : accumulator.acc) {
cout << elem << endl;
}*/
}
RunsAccumulator RRRuns::getFullRuns()
{
if (!analyzed_)
{
analyzeRuns();
}
return this->accumulator;
}
void RRRuns::printRuns()
{
if (!analyzed_)
{
analyzeRuns();
}
int decSize = getNonzeroLength(accumulator.dec);
int accSize = getNonzeroLength(accumulator.acc);
int maxLength = std::max(accSize, decSize);
cout << "i"
<< " Ar "
<< " - "
<< "DR"
<< " - "
<< "N" << "\n";
for (int i = 1; i < maxLength; i++)
{
cout << i << " "
<< (i < accSize ? accumulator.acc[i] : 0)
<< " - "
<< (i < decSize ? accumulator.dec[i] : 0)
<< " - "
<< (i < decSize ? accumulator.neu[i] : 0)
<< "\n";
}
}
int RRRuns::getNonzeroLength(vector<int> vec)
{
int counter = vec.size();
int i;
for (i = counter; i > 0; i--)
{
if (vec[i] != 0)
{
break;
}
}
return i + 1; // because we actually index from 1
}