}
}
catch(exception& e) {
- errorOut(e, "SAbundVector", "SAbundVector");
+ m->errorOut(e, "SAbundVector", "SAbundVector");
exit(1);
}
}
numSeqs = ns;
}
catch(exception& e) {
- errorOut(e, "SAbundVector", "SAbundVector");
+ m->errorOut(e, "SAbundVector", "SAbundVector");
exit(1);
}
}
for(int i=1;i<=hold;i++){
f >> inputData;
+
set(i, inputData);
}
+
}
catch(exception& e) {
- errorOut(e, "SAbundVector", "SAbundVector");
+ m->errorOut(e, "SAbundVector", "SAbundVector");
exit(1);
}
}
if(sabund > maxRank) { maxRank = sabund; }
}
catch(exception& e) {
- errorOut(e, "SAbundVector", "set");
+ m->errorOut(e, "SAbundVector", "set");
exit(1);
}
}
numSeqs += (maxRank * abundance);
}
catch(exception& e) {
- errorOut(e, "SAbundVector", "push_back");
+ m->errorOut(e, "SAbundVector", "push_back");
exit(1);
}
}
}
output << endl;
}
-
+/***********************************************************************/
+void SAbundVector::clear(){
+ numBins = 0;
+ maxRank = 0;
+ numSeqs = 0;
+ data.clear();
+}
/***********************************************************************/
void SAbundVector::print(ostream& output){
try {
output << endl;
}
catch(exception& e) {
- errorOut(e, "SAbundVector", "print");
+ m->errorOut(e, "SAbundVector", "print");
exit(1);
}
}
try {
RAbundVector rav;
- for(int i=1;i<=data.size();i++){
+ for(int i=1;i < data.size();i++){
for(int j=0;j<data[i];j++){
rav.push_back(i);
}
}
sort(rav.rbegin(), rav.rend());
-
+
rav.setLabel(label);
return rav;
}
catch(exception& e) {
- errorOut(e, "SAbundVector", "getRAbundVector");
+ m->errorOut(e, "SAbundVector", "getRAbundVector");
exit(1);
}
}
return ov;
}
catch(exception& e) {
- errorOut(e, "SAbundVector", "getOrderVector");
+ m->errorOut(e, "SAbundVector", "getOrderVector");
exit(1);
}
}