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
|
//
// sharedclrvector.cpp
// Mothur
//
// Created by Sarah Westcott on 1/21/20.
// Copyright © 2020 Schloss Lab. All rights reserved.
//
#include "sharedclrvector.hpp"
/***********************************************************************/
SharedCLRVector::SharedCLRVector() : DataVector(), maxRank(0), numBins(0), numSeqs(0), group("") {}
/***********************************************************************/
SharedCLRVector::SharedCLRVector(int n) : DataVector(), data(n,0) , maxRank(0), numBins(n), numSeqs(0), group("") {}
/***********************************************************************/
SharedCLRVector::SharedCLRVector(vector<float> rav) : DataVector(), maxRank(0), numBins(rav.size()), numSeqs(0), group("") {
try {
data.assign(numBins, 0);
for(int i=0;i<rav.size();i++){ set(i, rav[i]); }
}
catch(exception& e) {
m->errorOut(e, "SharedCLRVector", "SharedCLRVector");
exit(1);
}
}
/***********************************************************************/
SharedCLRVector::SharedCLRVector(vector<float> rav, float mr, int nb, float ns) : DataVector(), group(""){
try {
numBins = nb;
maxRank = mr;
numSeqs = ns;
data = rav;
}
catch(exception& e) {
m->errorOut(e, "SharedCLRVector", "SharedCLRVector");
exit(1);
}
}
/***********************************************************************/
SharedCLRVector::SharedCLRVector(ifstream& f) : DataVector(), maxRank(0), numBins(0), numSeqs(0) {
try {
f >> label >> group >> numBins;
data.assign(numBins, 0);
float inputData;
for(int i=0;i<numBins;i++){
f >> inputData;
set(i, inputData);
}
}
catch(exception& e) {
m->errorOut(e, "SharedCLRVector", "SharedCLRVector");
exit(1);
}
}
/***********************************************************************/
SharedCLRVector::SharedCLRVector(ifstream& f, string l, string g, int n) : DataVector(), maxRank(0), numBins(n), numSeqs(0) {
try {
label = l;
group = g;
data.assign(numBins, 0);
float inputData;
for(int i=0;i<numBins;i++){
f >> inputData;
set(i, inputData);
}
}
catch(exception& e) {
m->errorOut(e, "SharedCLRVector", "SharedCLRVector");
exit(1);
}
}
/***********************************************************************/
void SharedCLRVector::set(int binNumber, float newBinSize){
try {
int oldBinSize = data[binNumber];
data[binNumber] = newBinSize;
if(newBinSize > maxRank) { maxRank = newBinSize; }
numSeqs += (newBinSize - oldBinSize);
}
catch(exception& e) {
m->errorOut(e, "SharedCLRVector", "set");
exit(1);
}
}
/***********************************************************************/
float SharedCLRVector::get(int index){ return data[index]; }
/***********************************************************************/
void SharedCLRVector::clear(){
numBins = 0;
maxRank = 0;
numSeqs = 0;
group = "";
data.clear();
}
/***********************************************************************/
void SharedCLRVector::push_back(float binSize){
try {
data.push_back(binSize);
numBins++;
if(binSize > maxRank){ maxRank = binSize; }
numSeqs += binSize;
}
catch(exception& e) {
m->errorOut(e, "SharedCLRVector", "push_back");
exit(1);
}
}
/***********************************************************************/
float SharedCLRVector::remove(int bin){
try {
float abund = data[bin];
data.erase(data.begin()+bin);
numBins--;
if(abund == maxRank){ maxRank = util.max(data); }
numSeqs -= abund;
return abund;
}
catch(exception& e) {
m->errorOut(e, "SharedCLRVector", "remove");
exit(1);
}
}
/***********************************************************************/
float SharedCLRVector::remove(vector<int> bins){
try {
if (bins.size() == 0) { return 0; }
int numRemoved = 0;
vector<float> newData; int binIndex = 0;
for (int i = 0; i < data.size(); i++) {
if (m->getControl_pressed()) { break; }
if (i != bins[binIndex]) {
newData.push_back(data[i]);
}else if (i == bins[binIndex]) {
binIndex++;
numRemoved += data[i];
if (binIndex > bins.size()) { //removed all bins
newData.insert(newData.end(), data.begin()+i, data.end()); //add rest of good bins
break;
}
}
}
data = newData;
numBins = data.size();
vector<float>::iterator it = max_element(data.begin(), data.end());
maxRank = *it;
numSeqs -= numRemoved;
return numRemoved;
}
catch(exception& e) {
m->errorOut(e, "SharedCLRVector", "remove");
exit(1);
}
}
/***********************************************************************/
void SharedCLRVector::resize(int size){
data.resize(size);
vector<float>::iterator it = max_element(data.begin(), data.end());
maxRank = *it;
numSeqs = util.sum(data);
numBins = size;
}
/***********************************************************************/
int SharedCLRVector::size(){ return data.size(); }
/***********************************************************************/
void SharedCLRVector::print(ostream& output){
try {
output << label;
output << '\t' << group << '\t' << numBins;
for(int i=0;i<numBins;i++){ output << '\t' << data[i]; }
output << endl;
}
catch(exception& e) {
m->errorOut(e, "SharedCLRVector", "nonSortedPrint");
exit(1);
}
}
/***********************************************************************/
|
