}
}
catch(exception& e) {
- errorOut(e, "SharedRAbundVector", "SharedRAbundVector");
+ m->errorOut(e, "SharedRAbundVector", "SharedRAbundVector");
exit(1);
}
}
string holdLabel, nextLabel, groupN;
individual newguy;
- for (int i = 0; i < lookup.size(); i++) { delete lookup[i]; }
+ for (int i = 0; i < lookup.size(); i++) { delete lookup[i]; lookup[i] = NULL; }
lookup.clear();
+ if (globaldata->saveNextLabel == "") { f >> label; }
+ else { label = globaldata->saveNextLabel; }
+
//read in first row since you know there is at least 1 group.
- f >> label >> groupN >> num;
+ f >> groupN >> num;
+
holdLabel = label;
//add new vector to lookup
lookup[0]->push_back(inputData, groupN); //abundance, bin, group
push_back(inputData, groupN);
- numSeqs += inputData;
- numBins++;
+ //numSeqs += inputData;
+ //numBins++;
if (inputData > maxRank) { maxRank = inputData; }
-
}
- gobble(f);
-
- if (f.eof() != true) { f >> nextLabel; }
+ m->gobble(f);
+ if (!(f.eof())) { f >> nextLabel; }
+
//read the rest of the groups info in
while ((nextLabel == holdLabel) && (f.eof() != true)) {
f >> groupN >> num;
if (globaldata->gGroupmap == NULL) {
//save group in groupmap
+
groupmap->namesOfGroups.push_back(groupN);
groupmap->groupIndex[groupN] = count;
}
lookup[count]->push_back(inputData, groupN); //abundance, bin, group
}
- gobble(f);
+ m->gobble(f);
if (f.eof() != true) { f >> nextLabel; }
}
-
- //put file pointer back since you are now at a new distance label
- for (int i = 0; i < nextLabel.length(); i++) { f.unget(); }
+
+ globaldata->saveNextLabel = nextLabel;
if (globaldata->gGroupmap == NULL) { globaldata->gGroupmap = groupmap; }
}
catch(exception& e) {
- errorOut(e, "SharedRAbundVector", "SharedRAbundVector");
+ m->errorOut(e, "SharedRAbundVector", "SharedRAbundVector");
exit(1);
}
}
numSeqs += (newBinSize - oldBinSize);
}
catch(exception& e) {
- errorOut(e, "SharedRAbundVector", "set");
+ m->errorOut(e, "SharedRAbundVector", "set");
exit(1);
}
}
}
/***********************************************************************/
+void SharedRAbundVector::clear(){
+ numBins = 0;
+ maxRank = 0;
+ numSeqs = 0;
+ data.clear();
+ for (int i = 0; i < lookup.size(); i++) { delete lookup[i]; lookup[i] = NULL; }
+ lookup.clear();
+}
+/***********************************************************************/
+
void SharedRAbundVector::push_back(int binSize, string groupName){
try {
individual newGuy;
numSeqs += binSize;
}
catch(exception& e) {
- errorOut(e, "SharedRAbundVector", "push_back");
+ m->errorOut(e, "SharedRAbundVector", "push_back");
exit(1);
}
}
numSeqs += binSize;
}
catch(exception& e) {
- errorOut(e, "SharedRAbundVector", "insert");
+ m->errorOut(e, "SharedRAbundVector", "insert");
exit(1);
}
}
numSeqs += binSize;
}
catch(exception& e) {
- errorOut(e, "SharedRAbundVector", "push_front");
+ m->errorOut(e, "SharedRAbundVector", "push_front");
exit(1);
}
}
output << endl;
}
catch(exception& e) {
- errorOut(e, "SharedRAbundVector", "print");
+ m->errorOut(e, "SharedRAbundVector", "print");
exit(1);
}
}
for (int i = 0; i < lookup.size(); i++) {
//if this sharedrabund is not from a group the user wants then delete it.
if (util->isValidGroup(lookup[i]->getGroup(), globaldata->Groups) == false) {
- delete lookup[i];
+ delete lookup[i]; lookup[i] = NULL;
lookup.erase(lookup.begin()+i);
i--;
}
return lookup;
}
catch(exception& e) {
- errorOut(e, "SharedRAbundVector", "getSharedRAbundVectors");
+ m->errorOut(e, "SharedRAbundVector", "getSharedRAbundVectors");
exit(1);
}
}
return rav;
}
catch(exception& e) {
- errorOut(e, "SharedRAbundVector", "getRAbundVector");
+ m->errorOut(e, "SharedRAbundVector", "getRAbundVector");
exit(1);
}
}
return rav;
}
catch(exception& e) {
- errorOut(e, "SharedRAbundVector", "getRAbundVector2");
+ m->errorOut(e, "SharedRAbundVector", "getRAbundVector2");
exit(1);
}
}
return sav;
}
catch(exception& e) {
- errorOut(e, "SharedRAbundVector", "getSharedSAbundVector");
+ m->errorOut(e, "SharedRAbundVector", "getSharedSAbundVector");
exit(1);
}
}
return sav;
}
catch(exception& e) {
- errorOut(e, "SharedRAbundVector", "getSAbundVector");
+ m->errorOut(e, "SharedRAbundVector", "getSAbundVector");
exit(1);
}
}
return ov;
}
catch(exception& e) {
- errorOut(e, "SharedRAbundVector", "getSharedOrderVector");
+ m->errorOut(e, "SharedRAbundVector", "getSharedOrderVector");
exit(1);
}
}
OrderVector SharedRAbundVector::getOrderVector(map<string,int>* nameMap = NULL) {
try {
OrderVector ov;
-
- for(int i=0;i<data.size();i++){
+ for(int i=0;i<numBins;i++){
for(int j=0;j<data[i].abundance;j++){
ov.push_back(i);
}
}
random_shuffle(ov.begin(), ov.end());
-
+
ov.setLabel(label);
+
return ov;
}
catch(exception& e) {
- errorOut(e, "SharedRAbundVector", "getOrderVector");
+ m->errorOut(e, "SharedRAbundVector", "getOrderVector");
exit(1);
}
}