-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathCDataSet.cpp
175 lines (149 loc) · 3.12 KB
/
CDataSet.cpp
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
/*
Copyright 2016, Michael R. Hoopmann, Institute for Systems Biology
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
#include "CDataSet.h"
CDataSet::CDataSet(){
data = new vector<sDataPoint>;
type = grBar;
minX=0;
maxX=0;
minY=0;
maxY=0;
tolUnit=0;
tol=0.01;
}
CDataSet::CDataSet(const CDataSet& d){
type = d.type;
maxX=d.maxX;
maxY=d.maxY;
minX=d.minX;
minY=d.minY;
data = new vector<sDataPoint>;
for(size_t i=0;i<d.data->size();i++) data->push_back(d.data->at(i));
}
CDataSet::~CDataSet(){
delete data;
}
CDataSet& CDataSet::operator=(const CDataSet& d){
if(this!=&d){
type = d.type;
maxX=d.maxX;
maxY=d.maxY;
minX=d.minX;
minY=d.minY;
delete data;
data = new vector<sDataPoint>;
for(size_t i=0;i<d.data->size();i++) data->push_back(d.data->at(i));
}
return *this;
}
sDataPoint& CDataSet::operator [](size_t index){
return data->at(index);
}
void CDataSet::add(sDataPoint p){
data->push_back(p);
if(p.y>maxY) maxY=p.y;
if(p.y<minY) minY=p.y;
if(p.x>maxX) maxX=p.x;
if(p.x<minX) minX=p.x;
}
void CDataSet::add(double x, double y){
sDataPoint p;
p.x=x;
p.y=y;
data->push_back(p);
if(y>maxY) maxY=y;
if(y<minY) minY=y;
if(x>maxX) maxX=x;
if(x<minX) minX=x;
}
void CDataSet::clear(){
data->clear();
minX=0;
maxX=0;
minY=0;
maxY=0;
}
int CDataSet::findMass(double mass){
int sz=(int)data->size();
int lower=0;
int upper=sz;
int mid=upper/2;
if(sz==0) return -1;
double lb;
double ub;
if(tolUnit==0){
lb=mass-tol;
ub=mass+tol;
} else {
double d=mass*tol/1e6;
lb=mass-d;
ub=mass+d;
}
//binary search to first mass within boundaries
while(data->at(mid).x<lb || data->at(mid).x>ub){
if(lower>=upper) return -1;
if(mass<data->at(mid).x){
upper=mid-1;
mid=(lower+upper)/2;
} else {
lower=mid+1;
mid=(lower+upper)/2;
}
if(mid==sz) return -1;
}
//refine to tallest peak
double dMax=data->at(mid).y;
int iMax=mid;
int i=mid-1;
while(i>0){
if(data->at(i).x<lb) break;
if(data->at(i).y>dMax){
dMax=data->at(i).y;
iMax=i;
}
i--;
}
i=mid+1;
while(i<sz){
if(data->at(i).x>ub) break;
if(data->at(i).y>dMax){
dMax=data->at(i).y;
iMax=i;
}
i++;
}
return iMax;
}
double CDataSet::getMaxX(){
return maxX;
}
double CDataSet::getMaxY(){
return maxY;
}
double CDataSet::getMinX(){
return minX;
}
double CDataSet::getMinY(){
return minY;
}
void CDataSet::getTolerance(double& val, char& unit){
val=tol;
unit=tolUnit;
}
void CDataSet::setTolerance(double value, char unit){
tol=value;
tolUnit=unit;
}
size_t CDataSet::size(){
return data->size();
}