-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtrigger.cpp
More file actions
93 lines (91 loc) · 3.38 KB
/
trigger.cpp
File metadata and controls
93 lines (91 loc) · 3.38 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
#include "filedata.h"
#include <iostream>
using namespace std;
void trigger(vector <double> &x, vector <double> &y, vector <double> &baseline, double trigg, int w,
bool SNRmatter, double minSNR, stack <struct Resonance> *Stack)
{
int i=1;
struct Resonance resonance;
double size = x.size();
bool bad; //true means that this resonance/anti- is too close to another anti-/resonanse
while(i < size-1)
{
if(y[i] > baseline[i] + trigg) //check for antiresonance
{
if(y[i+1] > baseline[i] + trigg) //check for non-one-point resonance
{
if(y[i-1] > baseline[i] - trigg) //check that previous point is not a resonance
{
resonance.a = i - 1;
bad = false;
}
else
{
resonance.a = i;
bad = true;
}
while((y[i+1] > baseline[i+1] + trigg)&&(i!=size-2))//go to the end of current antiresonance
i++;
if((y[i+1] > baseline[i+1] - trigg)&&(bad == false))//check that next point is not a resonance
resonance.b = i + 1;
else
resonance.b = i;
}
else
if(y[i-1] < baseline[i] - trigg || y[i+1] < baseline[i] - trigg)//check for "bad" one-point antiresonance
resonance.a = resonance.b = i;
else
{
resonance.a = i - 1;
resonance.b = i + 1;
}
resonance.snr = SNR(y, resonance.a, resonance.b, baseline[i], trigg, w);
if(SNRmatter == true)
{
if(resonance.snr > minSNR)
Stack->push(resonance);
}
else
Stack->push(resonance);
}
if(y[i] < baseline[i] - trigg) //check for resonance
{
if(y[i+1] < baseline[i] - trigg) //check for non-one-point resonance
{
if(y[i-1] < baseline[i] + trigg) //check that previous point is not a antiresonance
{
resonance.a = i - 1;
bad = false;
}
else
{
resonance.a = i;
bad = true;
}
while((y[i+1] < baseline[i+1] - trigg)&&(i!=size-2))//go to the end of current resonance
i++;
if((y[i+1] < baseline[i+1] + trigg)&&(bad == false))//check that next point is not a antiresonance
resonance.b = i + 1;
else
resonance.b = i;
}
else
if(y[i-1] > baseline[i] + trigg || y[i+1] > baseline[i] + trigg)//check for "bad" one-point resonance
resonance.a = resonance.b = i;
else
{
resonance.a = i - 1;
resonance.b = i + 1;
}
resonance.snr = SNR(y, resonance.a, resonance.b, baseline[i], trigg, w);
if(SNRmatter == true)
{
if(resonance.snr > minSNR)
Stack->push(resonance);
}
else
Stack->push(resonance);
}
i++;
}
}